arXiv subjects

Mingming Zhang

Publications and source records attributed to Mingming Zhang.

63 records · Page 4Linked to original sources

arXiv2020

New coded caching schemes from placement delivery arrays

Coded caching schemes with low subpacketization and small transmission rate are desirable in practice due to the requirement of low implementation complexity and efficiency of the transmission. Placement delivery arrays (PDA in short) can be used to generate coded caching schemes. However, many known coded caching schemes have large memory ratios. In this paper, we realize that some schemes with low subpacketization generated by PDAs do not fully use the users' caching content to create multicasting opportunities and thus propose to overcome this drawback. As an application, we obtain two new schemes with low subpacketizations, which have significantly advantages on the memory ratio and transmission rate compared with the original scheme.

cs.IT↗

arXiv2020

Lifelong Property Price Prediction: A Case Study for the Toronto Real Estate Market

We present Luce, the first life-long predictive model for automated property valuation. Luce addresses two critical issues of property valuation: the lack of recent sold prices and the sparsity of house data. It is designed to operate on a limited volume of recent house transaction data. As a departure from prior work, Luce organizes the house data in a heterogeneous information network (HIN) where graph nodes are house entities and attributes that are important for house price valuation. We employ a Graph Convolutional Network (GCN) to extract the spatial information from the HIN for house-related data like geographical locations, and then use a Long Short Term Memory (LSTM) network to model the temporal dependencies for house transaction data over time. Unlike prior work, Luce can make effective use of the limited house transactions data in the past few months to update valuation information for all house entities within the HIN. By providing a complete and up-to-date house valuation dataset, Luce thus massively simplifies the downstream valuation task for the targeting properties. We demonstrate the benefit of Luce by applying it to large, real-life datasets obtained from the Toronto real estate market. Extensive experimental results show that Luce not only significantly outperforms prior property valuation methods but also often reaches and sometimes exceeds the valuation accuracy given by independent experts when using the actual realization price as the ground truth.

cs.LG↗

arXiv2020

An adaptive finite element DtN method for the three-dimensional acoustic scattering problem

This paper is concerned with a numerical solution of the acoustic scattering by a bounded impenetrable obstacle in three dimensions. The obstacle scattering problem is formulated as a boundary value problem in a bounded domain by using a Dirichlet-to-Neumann (DtN) operator. An a posteriori error estimate is derived for the finite element method with the truncated DtN operator. The a posteriori error estimate consists of the finite element approximation error and the truncation error of the DtN operator, where the latter is shown to decay exponentially with respect to the truncation parameter. Based on the a posteriori error estimate, an adaptive finite element method is developed for the obstacle scattering problem. The truncation parameter is determined by the truncation error of the DtN operator and the mesh elements for local refinement are marked through the finite element approximation error. Numerical experiments are presented to demonstrate the effectiveness of the proposed method.

math.NA↗

arXiv2019

On the behavior of Mahler's measure under iteration

For an algebraic number $α$ we denote by $M(α)$ the Mahler measure of $α$. As $M(α)$ is again an algebraic number (indeed, an algebraic integer), $M(\cdot)$ is a self-map on $\overline{\mathbb{Q}}$, and therefore defines a dynamical system. The \emph{orbit size} of $α$, denoted $\# \mathcal{O}_M(α)$, is the cardinality of the forward orbit of $α$ under $M$. We prove that for every degree at least 3 and every non-unit norm, there exist algebraic numbers of every orbit size. We then prove that for algebraic units of degree 4, the orbit size must be 1, 2, or infinity. We also show that there exist algebraic units of larger degree with arbitrarily large but finite orbit size.

math.NT↗

arXiv2019

Visual-Inertial Localization for Skid-Steering Robots with Kinematic Constraints

While visual localization or SLAM has witnessed great progress in past decades, when deploying it on a mobile robot in practice, few works have explicitly considered the kinematic (or dynamic) constraints of the real robotic system when designing state estimators. To promote the practical deployment of current state-of-the-art visual-inertial localization algorithms, in this work we propose a low-cost kinematics-constrained localization system particularly for a skid-steering mobile robot. In particular, we derive in a principle way the robot's kinematic constraints based on the instantaneous centers of rotation (ICR) model and integrate them in a tightly-coupled manner into the sliding-window bundle adjustment (BA)-based visual-inertial estimator. Because the ICR model parameters are time-varying due to, for example, track-to-terrain interaction and terrain roughness, we estimate these kinematic parameters online along with the navigation state. To this end, we perform in-depth the observability analysis and identify motion conditions under which the state/parameter estimation is viable. The proposed kinematics-constrained visual-inertial localization system has been validated extensively in different terrain scenarios.

cs.RO↗

arXiv2019

A lossless data hiding scheme in JPEG images with segment coding

In this paper, we propose a lossless data hiding scheme in JPEG images. After quantified DCT transform, coefficients have characteristics that distribution in high frequencies is relatively sparse and absolute values are small. To improve encoding efficiency, we put forward an encoding algorithm that searches for a high frequency as terminate point and recode the coefficients above, so spare space is reserved to embed secret data and appended data with no file expansion. Receiver can obtain terminate point through data analysis, extract additional data and recover original JPEG images lossless. Experimental results show that the proposed method has a larger capacity than state-of-the-art works.

cs.CV↗

arXiv2018

Multi-view Laplacian Eigenmaps Based on Bag-of-Neighbors For RGBD Human Emotion Recognition

Human emotion recognition is an important direction in the field of biometric and information forensics. However, most existing human emotion research are based on the single RGB view. In this paper, we introduce a RGBD video-emotion dataset and a RGBD face-emotion dataset for research. To our best knowledge, this may be the first RGBD video-emotion dataset. We propose a new supervised nonlinear multi-view laplacian eigenmaps (MvLE) approach and a multihidden-layer out-of-sample network (MHON) for RGB-D humanemotion recognition. To get better representations of RGB view and depth view, MvLE is used to map the training set of both views from original space into the common subspace. As RGB view and depth view lie in different spaces, a new distance metric bag of neighbors (BON) used in MvLE can get the similar distributions of the two views. Finally, MHON is used to get the low-dimensional representations of test data and predict their labels. MvLE can deal with the cases that RGB view and depth view have different size of features, even different number of samples and classes. And our methods can be easily extended to more than two views. The experiment results indicate the effectiveness of our methods over some state-of-art methods.

cs.CV↗

arXiv2017

CE Screen: an energy-based structure selection method

We have developed a method to improve the doping computation efficiency, this method is based on first principles calculations and cluster expansion. First principles codes produce highly accurate total energies and optimized geometries for any given structure. Cluster expansion method constructs a cluster expansion using partial first principles results and computes the energies for other structures derived from a parent lattice. Using this method, energies for multiple doping structures can be predicted quickly without series of first principles calculations. This method has been packaged into a tool named as CE Screen and integrated into MatCloud (A high-throughput first principles calculation platform). This makes the tool simple and easy for all the users.

cond-mat.mtrl-sci↗

arXiv2012

Explosion prediction of oil gas using SVM and Logistic Regression

The prevention of dangerous chemical accidents is a primary problem of industrial manufacturing. In the accidents of dangerous chemicals, the oil gas explosion plays an important role. The essential task of the explosion prevention is to estimate the better explosion limit of a given oil gas. In this paper, Support Vector Machines (SVM) and Logistic Regression (LR) are used to predict the explosion of oil gas. LR can get the explicit probability formula of explosion, and the explosive range of the concentrations of oil gas according to the concentration of oxygen. Meanwhile, SVM gives higher accuracy of prediction. Furthermore, considering the practical requirements, the effects of penalty parameter on the distribution of two types of errors are discussed.

cs.CE↗