arXiv subjects

Li Tang

Publications and source records attributed to Li Tang.

72 records · Page 4Linked to original sources

arXiv2018

Erasure coding for distributed matrix multiplication for matrices with bounded entries

Distributed matrix multiplication is widely used in several scientific domains. It is well recognized that computation times on distributed clusters are often dominated by the slowest workers (called stragglers). Recent work has demonstrated that straggler mitigation can be viewed as a problem of designing erasure codes. For matrices $\mathbf A$ and $\mathbf B$, the technique essentially maps the computation of $\mathbf A^T \mathbf B$ into the multiplication of smaller (coded) submatrices. The stragglers are treated as erasures in this process. The computation can be completed as long as a certain number of workers (called the recovery threshold) complete their assigned tasks. We present a novel coding strategy for this problem when the absolute values of the matrix entries are sufficiently small. We demonstrate a tradeoff between the assumed absolute value bounds on the matrix entries and the recovery threshold. At one extreme, we are optimal with respect to the recovery threshold and on the other extreme, we match the threshold of prior work. Experimental results on cloud-based clusters validate the benefits of our method.

cs.DC↗

arXiv2018

$C^{3}LES$: Codes for Coded Computation that Leverage Stragglers

In distributed computing systems, it is well recognized that worker nodes that are slow (called stragglers) tend to dominate the overall job execution time. Coded computation utilizes concepts from erasure coding to mitigate the effect of stragglers by running "coded" copies of tasks comprising a job. Stragglers are typically treated as erasures in this process. While this is useful, there are issues with applying, e.g., MDS codes in a straightforward manner. Specifically, several applications such as matrix-vector products deal with sparse matrices. MDS codes typically require dense linear combinations of submatrices of the original matrix which destroy their inherent sparsity. This is problematic as it results in significantly higher processing times for computing the submatrix-vector products in coded computation. Furthermore, it also ignores partial computations at stragglers. In this work, we propose a fine-grained model that quantifies the level of non-trivial coding needed to obtain the benefits of coding in matrix-vector computation. Simultaneously, it allows us to leverage partial computations performed by the straggler nodes. For this model, we propose and evaluate several code designs and discuss their properties.

cs.IT↗

arXiv2018

Testing the variation of the fine structure constant with strongly lensed gravitational waves

The possible variation of the electromagnetic fine structure constant $α_e$ on cosmological scales arouses great interests in recent years. The strongly lensed gravitational waves and the electromagnetic counterparts could be used to test this variation. Under the assumption that the speed of photon could be modified, while the speed of GW is the same as GR predicated, and they both propagate in a flat Friedman-Robertson-Walker universe, we investigate the difference of time delays of the images and derive the upper bound of the variation of $α_e$. For a typical lensing system in the standard cosmological models, we obtain $B\cosθ\leq 1.85\times10^{-5}$, where $B$ is the dipolar amplitude and $θ$ is the angle between observation and the preferred direction. Our result is consistent with the most up-to-date observations on $α_e$. In addition, the observations of strongly lensed gravitational waves and the electromagnetic counterparts could be used to test which types of alternative theories of gravity can account for the variation of $α_e$.

gr-qc↗

arXiv2018

Long live the scientists: Tracking the scientific fame of great minds in physics

This study utilizes global digitalized books and articles to examine the scientific fame of the most influential physicists. Our research reveals that the greatest minds are gone but not forgotten. Their scientific impacts on human history have persisted for centuries. We also find evidence in support of own-group fame preference, i.e., that the scientists have greater reputations in their home countries or among scholars sharing the same languages. We argue that, when applied appropriately, Google Books and Ngram Viewer can serve as promising tools for altmetrics, providing a more comprehensive picture of the impacts scholars and their achievements have made beyond academia.

cs.DL↗

arXiv2018

Missing author address information in Web of Science-An explorative study

Bibliometric analysis is increasingly used to evaluate and compare research performance across geographical regions. However, the problem of missing information from author addresses has not attracted sufficient attention from scholars and practitioners. This study probes the missing data problem in the three core journal citation databases of Web of Science (WoS). Our findings reveal that from 1900 to 2015 over one-fifth of the publications indexed in WoS have completely missing information from the address field. The magnitude of the problem varies greatly among time periods, citation databases, document types, and publishing languages. The problem is especially serious for research in the sciences and social sciences published before the early 1970s and remains significant for recent publications in the arts and humanities. Further examinations suggest that many records with completely missing address information do not represent scholarly research. Full-text scanning of a random sample reveals that about 40% of the articles have some address information that is not indexed in WoS. This study also finds that the problem of partially missing address information for U.S. research has diminished dramatically since 1998. The paper ends by providing some discussion and tentative remedies.

cs.DL↗

arXiv2018

Multi-session Map Construction in Outdoor Dynamic Environment

Map construction in large scale outdoor environment is of importance for robots to robustly fulfill their tasks. Massive sessions of data should be merged to distinguish low dynamics in the map, which otherwise might debase the performance of localization and navigation algorithms. In this paper we propose a method for multi-session map construction in large scale outdoor environment using 3D LiDAR. To efficiently align the maps from different sessions, a laser-based loop closure detection method is integrated and the sequential information within the submaps is utilized for higher robustness. Furthermore, a dynamic detection method is proposed to detect dynamics in the overlapping areas among sessions of maps. We test the method in the real-world environment with a VLP-16 Velodyne LiDAR and the experimental results prove the validity and robustness of the proposed method.

cs.RO↗

arXiv2018

LocNet: Global localization in 3D point clouds for mobile vehicles

Global localization in 3D point clouds is a challenging problem of estimating the pose of vehicles without any prior knowledge. In this paper, a solution to this problem is presented by achieving place recognition and metric pose estimation in the global prior map. Specifically, we present a semi-handcrafted representation learning method for LiDAR point clouds using siamese LocNets, which states the place recognition problem to a similarity modeling problem. With the final learned representations by LocNet, a global localization framework with range-only observations is proposed. To demonstrate the performance and effectiveness of our global localization system, KITTI dataset is employed for comparison with other algorithms, and also on our long-time multi-session datasets for evaluation. The result shows that our system can achieve high accuracy.

cs.RO↗

arXiv2018

Use Cases of Computational Reproducibility for Scientific Workflows at Exascale

We propose an approach for improved reproducibility that includes capturing and relating provenance characteristics and performance metrics, in a hybrid queriable system, the ProvEn server. The system capabilities are illustrated on two use cases: scientific reproducibility of results in the ACME climate simulations and performance reproducibility in molecular dynamics workflows on HPC computing platforms.

cs.DC↗

arXiv2018

Laser map aided visual inertial localization in changing environment

Long-term visual localization in outdoor environment is a challenging problem, especially faced with the cross-seasonal, bi-directional tasks and changing environment. In this paper we propose a novel visual inertial localization framework that localizes against the LiDAR-built map. Based on the geometry information of the laser map, a hybrid bundle adjustment framework is proposed, which estimates the poses of the cameras with respect to the prior laser map as well as optimizes the state variables of the online visual inertial odometry system simultaneously. For more accurate cross-modal data association, the laser map is optimized using multi-session laser and visual data to extract the salient and stable subset for localization. To validate the efficiency of the proposed method, we collect data in south part of our campus in different seasons, along the same and opposite-direction route. In all sessions of localization data, our proposed method gives satisfactory results, and shows the superiority of the hybrid bundle adjustment and map optimization.

cs.RO↗

arXiv2018

3D-SSD: Learning Hierarchical Features from RGB-D Images for Amodal 3D Object Detection

This paper aims at developing a faster and a more accurate solution to the amodal 3D object detection problem for indoor scenes. It is achieved through a novel neural network that takes a pair of RGB-D images as the input and delivers oriented 3D bounding boxes as the output. The network, named 3D-SSD, composed of two parts: hierarchical feature fusion and multi-layer prediction. The hierarchical feature fusion combines appearance and geometric features from RGB-D images while the multi-layer prediction utilizes multi-scale features for object detection. As a result, the network can exploit 2.5D representations in a synergetic way to improve the accuracy and efficiency. The issue of object sizes is addressed by attaching a set of 3D anchor boxes with varying sizes to every location of the prediction layers. At the end stage, the category scores for 3D anchor boxes are generated with adjusted positions, sizes and orientations respectively, leading to the final detections using non-maximum suppression. In the training phase, the positive samples are identified with the aid of 2D ground truth to avoid the noisy estimation of depth from raw data, which guide to a better converged model. Experiments performed on the challenging SUN RGB-D dataset show that our algorithm outperforms the state-of-the-art Deep Sliding Shape by 10.2% mAP and 88x faster. Further, experiments also suggest our approach achieves comparable accuracy and is 386x faster than the state-of-art method on the NYUv2 dataset even with a smaller input image size.

cs.CV↗

arXiv2018

Coded Caching Schemes with Reduced Subpacketization from Linear Block Codes

Coded caching is a technique that generalizes conventional caching and promises significant reductions in traffic over caching networks. However, the basic coded caching scheme requires that each file hosted in the server be partitioned into a large number (i.e., the subpacketization level) of non-overlapping subfiles. From a practical perspective, this is problematic as it means that prior schemes are only applicable when the size of the files is extremely large. In this work, we propose coded caching schemes based on combinatorial structures called resolvable designs. These structures can be obtained in a natural manner from linear block codes whose generator matrices possess certain rank properties. We obtain several schemes with subpacketization levels substantially lower than the basic scheme at the cost of an increased rate. Depending on the system parameters, our approach allows us to operate at various points on the subpacketization level vs. rate tradeoff.

cs.IT↗

arXiv2017

Comparing the dark matter models, modified Newtonian dynamics and modified gravity in accounting for the galaxy rotation curves

We compare six models (including the baryonic model, two dark matter models, two modified Newtonian dynamics models and one modified gravity model) in accounting for the galaxy rotation curves. For the dark matter models, we assume NFW profile and core-modified profile for the dark halo, respectively. For the modified Newtonian dynamics models, we discuss Milgrom's MOND theory with two different interpolation functions, i.e. the standard and the simple interpolation functions. As for the modified gravity, we focus on Moffat's MSTG theory. We fit these models to the observed rotation curves of 9 high-surface brightness and 9 low-surface brightness galaxies. We apply the Bayesian Information Criterion and the Akaike Information Criterion to test the goodness-of-fit of each model. It is found that non of the six models can well fit all the galaxy rotation curves. Two galaxies can be best fitted by the baryonic model without involving the nonluminous dark matter. MOND can fit the largest number of galaxies, and only one galaxy can be best fitted by MSTG model. Core-modified model can well fit about one half LSB galaxies but no HSB galaxy, while NFW model can fit only a small fraction of HSB galaxies but no LSB galaxy. This may imply that the oversimplified NFW and Core-modified profiles couldn't well mimic the postulated dark matter halo.

gr-qc↗

arXiv2016

Coded Caching with Low Subpacketization Levels

Caching is popular technique in content delivery networks that allows for reductions in transmission rates from the content-hosting server to the end users. Coded caching is a generalization of conventional caching that considers the possibility of coding in the caches and transmitting coded signals from the server. Prior results in this area demonstrate that huge reductions in transmission rates are possible and this makes coded caching an attractive option for the next generation of content-delivery networks. However, these results require that each file hosted in the server be partitioned into a large number (i.e., the subpacketization level) of non-overlapping subfiles. From a practical perspective, this is problematic as it means that prior schemes are only applicable when the size of the files is extremely large. In this work, we propose a novel coded caching scheme that enjoys a significantly lower subpacketization level than prior schemes, while only suffering a marginal increase in the transmission rate. In particular, for a fixed cache size, the scaling with the number of users is such that the increase in transmission rate is negligible, but the decrease in subpacketization level is exponential.

cs.IT↗

arXiv2016

Coded Caching for Networks with the Resolvability Property

Coded caching is a recently proposed technique for dealing with large scale content distribution over the Internet. As in conventional caching, it leverages the presence of local caches at the end users. However, it considers coding in the caches and/or coded transmission from the central server and demonstrates that huge savings in transmission rate are possible when the server and the end users are connected via a single shared link. In this work, we consider a more general topology where there is a layer of relay nodes between the server and the users, e.g., combination networks studied in network coding are an instance of these networks. We propose novel schemes for a class of such networks that satisfy a so-called resolvability property and demonstrate that the performance of our scheme is strictly better than previously proposed schemes.

cs.IT↗

arXiv2016

Funding acknowledgment analysis:Queries and Caveats

Thomson Reuters' Web of Science (WoS) began systematically collecting acknowledgment information in August 2008. Since then, bibliometric analysis of funding acknowledgment (FA) has been growing and has aroused intense interest and attention from both academia and policy makers. Examining the distribution of FA by citation index database, by language, and by acknowledgment type, we noted coverage limitations and potential biases in each analysis. We argue that in spite of its great value, bibliometric analysis of FA should be used with caution.

cs.DL↗

arXiv2013

A Low-Complexity Encoding of Quasi-Cyclic Codes Based on Galois Fourier Transform

The encoding complexity of a general (en,ek) quasi-cyclic code is O[(e^2)(n-k)k]. This paper presents a novel low-complexity encoding algorithm for quasi-cyclic (QC) codes based on matrix transformation. First, a message vector is encoded into a transformed codeword in the transform domain. Then, the transmitted codeword is obtained from the transformed codeword by the inverse Galois Fourier transform. For binary QC codes, a simple and fast mapping is required to post-process the transformed codeword such that the transmitted codeword is binary as well. The complexity of our proposed encoding algorithm is O[e(n-k)k] symbol operations for non-binary codes and O[ek(n-k)(log_2 e)] bit operations for binary codes. These complexities are much lower than their traditional counterpart O[(e^2)(n-k)k]. For example, our complexity of encoding a 64-ary (4095,2160) QC code is only 1.59% of that of traditional encoding, and our complexities of encoding the binary (4095, 2160) and (8176, 7154) QC codes are respectively 9.52% and 1.77% of those of traditional encoding. We also study the application of our low-complexity encoding algorithm to one of the most important subclasses of QC codes, namely QC-LDPC codes, especially when their parity-check matrices are rank deficient.

cs.IT↗

arXiv2008

General Greenberger-Horne-Zeilinger theorem of cluster states

In this paper, we show that there are eight distinct forms of the Greenberger-Horne-Zeilinger (GHZ) argument for the four-qubit cluster state $|ϕ_4>$ and forty eight distinct forms for the five-qubit cluster state $|ϕ_5>$ in the case of the one-dimensional lattice. The proof is obtained by regarding the pair qubits as a single object and constructing the new Pauli-like operators. The method can be easily extended to the case of the N-qubit system and the associated Bell inequalities are also discussed. Consequently, we present a complete construction of the GHZ theorem for the cluster states of N-qubit in the case of the one-dimensional lattice.

quant-ph↗

arXiv2005

Comprehensive proof of the Greenberger-Horne-Zeilinger Theorem for the four-qubit system

Greenberger-Horne-Zeilinger (GHZ) theorem asserts that there is a set of mutually commuting nonlocal observables with a common eigenstate on which those observables assume values that refute the attempt to assign values only required to have them by the local realism of Einstein, Podolsky, and Rosen (EPR). It is known that for a three-qubit system there is only one form of the GHZ-Mermin-like argument with equivalence up to a local unitary transformation, which is exactly Mermin's version of the GHZ theorem. In this paper, however, for a four-qubit system which was originally studied by GHZ, we show that there are nine distinct forms of the GHZ-Mermin-like argument. The proof is obtained by using some geometric invariants to characterize the sets of mutually commuting nonlocal spin observables on the four-qubit system. It is proved that there are at most nine elements (except for a different sign) in a set of mutually commuting nonlocal spin observables in the four-qubit system, and each GHZ-Mermin-like argument involves a set of at least five mutually commuting four-qubit nonlocal spin observables with a GHZ state as a common eigenstate in GHZ's theorem. Therefore, we present a complete construction of the GHZ theorem for the four-qubit system.

quant-ph↗