arXiv subjects

Wei Shi

Publications and source records attributed to Wei Shi.

At least 127 records · Page 7Linked to original sources

arXiv2019

A Push-Pull Gradient Method for Distributed Optimization in Networks

In this paper, we focus on solving a distributed convex optimization problem in a network, where each agent has its own convex cost function and the goal is to minimize the sum of the agents' cost functions while obeying the network connectivity structure. In order to minimize the sum of the cost functions, we consider a new distributed gradient-based method where each node maintains two estimates, namely, an estimate of the optimal decision variable and an estimate of the gradient for the average of the agents' objective functions. From the viewpoint of an agent, the information about the decision variable is pushed to the neighbors, while the information about the gradients is pulled from the neighbors (hence giving the name "push-pull gradient method"). The method unifies the algorithms with different types of distributed architecture, including decentralized (peer-to-peer), centralized (master-slave), and semi-centralized (leader-follower) architecture. We show that the algorithm converges linearly for strongly convex and smooth objective functions over a directed static network. In our numerical test, the algorithm performs well even for time-varying directed networks.

math.OC↗

arXiv2019

Bayesian Nonparametric Nonhomogeneous Poisson Process with Applications to USGS Earthquake Data

Intensity estimation is a common problem in statistical analysis of spatial point pattern data. This paper proposes a nonparametric Bayesian method for estimating the spatial point process intensity based on mixture of finite mixture (MFM) model. MFM approach leads to a consistent estimate of the intensity of spatial point patterns in different areas while considering heterogeneity. An efficient Markov chain Monte Carlo (MCMC) algorithm is proposed for our method. Extensive simulation studies are carried out to examine empirical performance of the proposed method. The usage of our proposed method is further illustrated with the analysis of the Earthquake Hazards Program of United States Geological Survey (USGS) earthquake data.

stat.ME↗

arXiv2019

X-ray differential phase contrast imaging on asymmetric dual-phase grating interferometer with source grating: theory and experiment

Recently, the dual-phase grating based X-ray differential phase contrast imaging technique has shown better radiation dose efficiency performance than the Talbot-Lau system. In this paper, we provide a theoretical analyses framework derived from wave optics to ease the design of such interferometer systems, including the inter-grating distances, the diffraction fringe period, the phase grating periods, and especially the source grating period if a medical grade X-ray tube with large focal spot is utilized. In addition, a geometrical explanation of the dual-phase grating system similar to the standard thin lens imaging theory is derived with an optical symmetry assumption for the first time. Finally, both numerical and experimental studies have been performed to validate the theory.

physics.optics↗

arXiv2019

A decentralized proximal-gradient method with network independent step-sizes and separated convergence rates

This paper proposes a novel proximal-gradient algorithm for a decentralized optimization problem with a composite objective containing smooth and non-smooth terms. Specifically, the smooth and nonsmooth terms are dealt with by gradient and proximal updates, respectively. The proposed algorithm is closely related to a previous algorithm, PG-EXTRA \cite{shi2015proximal}, but has a few advantages. First of all, agents use uncoordinated step-sizes, and the stable upper bounds on step-sizes are independent of network topologies. The step-sizes depend on local objective functions, and they can be as large as those of the gradient descent. Secondly, for the special case without non-smooth terms, linear convergence can be achieved under the strong convexity assumption. The dependence of the convergence rate on the objective functions and the network are separated, and the convergence rate of the new algorithm is as good as one of the two convergence rates that match the typical rates for the general gradient descent and the consensus averaging. We provide numerical experiments to demonstrate the efficacy of the introduced algorithm and validate our theoretical discoveries.

math.OC↗

arXiv2019

Acquiring Annotated Data with Cross-lingual Explicitation for Implicit Discourse Relation Classification

Implicit discourse relation classification is one of the most challenging and important tasks in discourse parsing, due to the lack of connective as strong linguistic cues. A principle bottleneck to further improvement is the shortage of training data (ca.~16k instances in the PDTB). Shi et al. (2017) proposed to acquire additional data by exploiting connectives in translation: human translators mark discourse relations which are implicit in the source language explicitly in the translation. Using back-translations of such explicitated connectives improves discourse relation parsing performance. This paper addresses the open question of whether the choice of the translation language matters, and whether multiple translations into different languages can be effectively used to improve the quality of the additional data.

cs.CL↗

arXiv2019

Learning to Explicitate Connectives with Seq2Seq Network for Implicit Discourse Relation Classification

Implicit discourse relation classification is one of the most difficult steps in discourse parsing. The difficulty stems from the fact that the coherence relation must be inferred based on the content of the discourse relational arguments. Therefore, an effective encoding of the relational arguments is of crucial importance. We here propose a new model for implicit discourse relation classification, which consists of a classifier, and a sequence-to-sequence model which is trained to generate a representation of the discourse relational arguments by trying to predict the relational arguments including a suitable implicit connective. Training is possible because such implicit connectives have been annotated as part of the PDTB corpus. Along with a memory network, our model could generate more refined representations for the task. And on the now standard 11-way classification, our method outperforms previous state of the art systems on the PDTB benchmark on multiple settings including cross validation.

cs.CL↗

arXiv2019

Van der Waals heteroepitaxial growth of monolayer Sb in puckered honeycomb structure

Atomically thin two-dimensional (2D) crystals have gained tremendous attentions owing to their potential impacts to the future electronics technologies, as well as the exotic phenomena emerging in these materials. Monolayer of α phase Sb (α-antimonene) that shares the same puckered structure as black phosphorous, has been predicted to be stable with precious properties. However, the experimental realization still remains challenging. Here, we successfully grow high-quality monolayer α-antimonene, with the thickness finely controlled. The α-antimonene exhibits great stability upon exposure to air. Combining scanning tunneling microscope, density functional theory calculations and transport measurement, it is found that the electron band crossing the Fermi level exhibits a linear dispersion with a fairly small effective mass, and thus a good electrical conductivity. All of these properties make the α-antimonene promising in the future electronic applications.

cond-mat.mtrl-sci↗

arXiv2019

Turning ZrTe5 into semiconductor through atomic intercalation

In this work, we use the liquid ammonia method to successfully intercalate potassium atoms into ZrTe5 single crystal, and find a transition from semimetal to semiconductor at low temperature in the intercalated ZrTe5. The resistance anomalous peak is gradually suppressed and finally disappears with increasing potassium concentration. Whilst, the according sign reversal is always observed in the Hall resistance measurement. We tentatively attribute the semimetal-semiconductor transition to the lattice expansion induced by atomic intercalation and thereby a larger energy band gap.

cond-mat.mtrl-sci↗

arXiv2019

Real Time Lateral Movement Detection based on Evidence Reasoning Network for Edge Computing Environment

Edge computing is providing higher class intelligent service and computing capabilities at the edge of the network. The aim is to ease the backhaul impacts and offer an improved user experience, however, the edge artificial intelligence exacerbates the security of the cloud computing environment due to the dissociation of data, access control and service stages. In order to prevent users from using the edge-cloud computing environment to carry out lateral movement attacks, we proposed a method named CloudSEC meaning real time lateral movement detection based on evidence reasoning network for the edge-cloud environment. The concept of vulnerability correlation is introduced. Based on the vulnerability knowledge and environmental information of the network system, the evidence reasoning network is constructed, and the lateral movement reasoning ability provided by the evidence reasoning network is used. CloudSEC realizes the reconfiguration of the efficient real-time attack process. The experiment shows that the results are complete and credible.

cs.CR↗

arXiv2019

Distributed Nash Equilibrium Seeking under Partial-Decision Information via the Alternating Direction Method of Multipliers

In this paper, we consider the problem of finding a Nash equilibrium in a multi-player game over generally connected networks. This model differs from a conventional setting in that players have partial information on the actions of their opponents and the communication graph is not necessarily the same as the players' cost dependency graph. We develop a relatively fast algorithm within the framework of inexact-ADMM, based on local information exchange between the players. We prove its convergence to Nash equilibrium for fixed step-sizes and analyze its convergence rate. Numerical simulations illustrate its benefits when compared to a consensus-based gradient type algorithm with diminishing step-sizes.

math.OC↗

arXiv2019

Automatic image-domain Moire artifact reduction method in grating-based x-ray interferometry imaging

The aim of this study is to demonstrate the feasibility of removing the image Moire artifacts caused by system inaccuracies in grating-based x-ray interferometry imaging system via convolutional neural network (CNN) technique. Instead of minimizing these inconsistencies between the acquired phase stepping data via certain optimized signal retrieval algorithms, our newly proposed CNN-based method reduces the Moire artifacts in the image-domain via a learned image post-processing procedure. To ease the training data preparations, we propose to synthesize them with numerical natural images and experimentally obtained Moire artifact-only-images. Moreover, a fast signal processing method has also been developed to generate the needed large number of high quality Moire artifact-only images from finite number of acquired experimental phase stepping data. Experimental results show that the CNN method is able to remove Moire artifacts effectively, while maintaining the signal accuracy and image resolution.

physics.med-ph↗

arXiv2019

Coverage Protocols for Wireless Sensor Networks: Review and Future Directions

The coverage problem in wireless sensor networks (WSNs) can be generally defined as a measure of how effectively a network field is monitored by its sensor nodes. This problem has attracted a lot of interest over the years and as a result, many coverage protocols were proposed. In this survey, we first propose a taxonomy for classifying coverage protocols in WSNs. Then, we classify the coverage protocols into three categories (i.e. coverage aware deployment protocols, sleep scheduling protocols for flat networks, and cluster-based sleep scheduling protocols) based on the network stage where the coverage is optimized. For each category, relevant protocols are thoroughly reviewed and classified based on the adopted coverage techniques. Finally, we discuss open issues (and recommend future directions to resolve them) associated with the design of realistic coverage protocols. Issues such as realistic sensing models, realistic energy consumption models, realistic connectivity models and sensor localization are covered.

cs.NI↗

arXiv2018

Improved Convergence Rates for Distributed Resource Allocation

In this paper, we develop a class of decentralized algorithms for solving a convex resource allocation problem in a network of $n$ agents, where the agent objectives are decoupled while the resource constraints are coupled. The agents communicate over a connected undirected graph, and they want to collaboratively determine a solution to the overall network problem, while each agent only communicates with its neighbors. We first study the connection between the decentralized resource allocation problem and the decentralized consensus optimization problem. Then, using a class of algorithms for solving consensus optimization problems, we propose a novel class of decentralized schemes for solving resource allocation problems in a distributed manner. Specifically, we first propose an algorithm for solving the resource allocation problem with an $o(1/k)$ convergence rate guarantee when the agents' objective functions are generally convex (could be nondifferentiable) and per agent local convex constraints are allowed; We then propose a gradient-based algorithm for solving the resource allocation problem when per agent local constraints are absent and show that such scheme can achieve geometric rate when the objective functions are strongly convex and have Lipschitz continuous gradients. We have also provided scalability/network dependency analysis. Based on these two algorithms, we have further proposed a gradient projection-based algorithm which can handle smooth objective and simple constraints more efficiently. Numerical experiments demonstrates the viability and performance of all the proposed algorithms.

math.OC↗

arXiv2018

$ψ(2S)$ photoproduction in high energy nuclear collisions

We study coherent photoproduction of $ψ'$ and the subsequent suppression in high energy nuclear collisions. The hot medium effect on charmonium photoproduction is controlled by the competition between the fireball size and nuclear size. When the former is smaller than the later, the photoproduction is only slightly affected by the hot medium. We calculate the yield ratio of $ψ'$ to $J/ψ$ in semi-central Pb-Pb collisions at LHC energy, while the high $p_T$ limit is characterized by the fireball, its value in low $p_T$ limit can still reach the significant enhancement by photoproduction.

hep-ph↗

arXiv2018

A Chip-scale, Full-Stokes Polarimeter

The polarization of light conveys unique information that can be exploited by crucial applications. The bulky and costly discrete optical components used in conventional polarimeters limit their broad adoption. A compact, low-cost polarimeter would bring this functionality into a myriad of new scenarios and revolutionize its exploitation. Here we present a high-performance, full-Stokes polarimeter on a silicon chip. A surface polarization splitter and on-chip optical interferometer circuit produce the analysis matrix of an optimally conditioned polarimeter. This solid-state polarimeter is a system-on-a-chip with exceptional compactness, stability, and speed that could be used singly or in integrated arrays. Large arrays can increase the speed and resolution of full-Stokes imaging; therefore, our design provides a scalable polarimeter solution.

physics.app-ph↗

arXiv2018

Geometric Convergence of Gradient Play Algorithms for Distributed Nash Equilibrium Seeking

We study distributed algorithms for seeking a Nash equilibrium in a class of non-cooperative convex games with strongly monotone mappings. Each player has access to her own smooth local cost function and can communicate to her neighbors in some undirected graph. To deal with fast distributed learning of Nash equilibria under such settings, we introduce a so called augmented game mapping and provide conditions under which this mapping is strongly monotone. We consider a distributed gradient play algorithm for determining a Nash equilibrium (GRANE). The algorithm involves every player performing a gradient step to minimize her own cost function while sharing and retrieving information locally among her neighbors in the network. Using the reformulation of the Nash equilibrium problem based on the strong monotone augmented game mapping, we prove the convergence of this algorithm to a Nash equilibrium with a geometric rate. Further, we introduce the Nesterov type acceleration for the gradient play algorithm. We demonstrate that, similarly to the accelerated algorithms in centralized optimization and variational inequality problems, our accelerated algorithm outperforms GRANE in the convergence rate. Moreover, to relax assumptions required to guarantee the strongly monotone augmented mapping, we analyze the restricted strongly monotone property of this mapping and prove geometric convergence of the distributed gradient play under milder assumptions.

math.OC↗

arXiv2018

Deconvolution-Based Backproject-Filter (BPF) Computed Tomography Image Reconstruction Method Using Deep Learning Technique

For conventional computed tomography (CT) image reconstruction tasks, the most popular method is the so-called filtered-back-projection (FBP) algorithm. In it, the acquired Radon projections are usually filtered first by a ramp kernel before back-projected to generate CT images. In this work, as a contrary, we realized the idea of image-domain backproject-filter (BPF) CT image reconstruction using the deep learning techniques for the first time. With a properly designed convolutional neural network (CNN), preliminary results demonstrate that it is feasible to reconstruct CT images with maintained high spatial resolution and accurate pixel values from the highly blurred back-projection image, i.e., laminogram. In addition, experimental results also show that this deconvolution-based CT image reconstruction network has the potential to reduce CT image noise (up to 20%), indicating that patient radiation dose may be reduced. Due to these advantages, this proposed CNN-based image-domain BPF type CT image reconstruction scheme provides promising prospects in generating high spatial resolution, low-noise CT images for future clinical applications.

physics.med-ph↗

arXiv2018

Two novel immunization strategies for epidemic control in directed scale-free networks with nonlinear infectivity

In this paper, we propose two novel immunization strategies, i.e., combined immunization and duplex immunization, for SIS model in directed scale-free networks, and obtain the epidemic thresholds for them with linear and nonlinear infectivities. With the suggested two new strategies, the epidemic thresholds after immunization are greatly increased. For duplex immunization, we demonstrate that its performance is the best among all usual immunization schemes with respect to degree distribution. And for combined immunization scheme, we show that it is more effective than active immunization. Besides, we give a comprehensive theoretical analysis on applying targeted immunization to directed networks. For targeted immunization strategy, we prove that immunizing nodes with large out-degrees are more effective than immunizing nodes with large in-degrees, and nodes with both large out-degrees and large in-degrees are more worthy to be immunized than nodes with only large out-degrees or large in-degrees. Finally, some numerical analysis are performed to verify and complement our theoretical results. This work is the first to divide the whole population into different types and embed appropriate immunization scheme according to the characteristics of the population, and it will benefit the study of immunization and control of infectious diseases on complex networks.

physics.soc-ph↗