arXiv subjects

Hao Yan

Publications and source records attributed to Hao Yan.

At least 145 records · Page 8Linked to original sources

arXiv2020

Automatic Storage Structure Selection for hybrid Workload

In the use of database systems, the design of the storage engine and data model directly affects the performance of the database when performing queries. Therefore, the users of the database need to select the storage engine and design data model according to the workload encountered. However, in a hybrid workload, the query set of the database is dynamically changing, and the design of its optimal storage structure is also changing. Motivated by this, we propose an automatic storage structure selection system based on learning cost, which is used to dynamically select the optimal storage structure of the database under hybrid workloads. In the system, we introduce a machine learning method to build a cost model for the storage engine, and a column-oriented data layout generation algorithm. Experimental results show that the proposed system can choose the optimal combination of storage engine and data model according to the current workload, which greatly improves the performance of the default storage structure. And the system is designed to be compatible with different storage engines for easy use in practical applications.

cs.DB↗

arXiv2020

Rapid Detection of Hot-spots via Tensor Decomposition with applications to Crime Rate Data

We propose an efficient statistical method (denoted as SSR-Tensor) to robustly and quickly detect hot-spots that are sparse and temporal-consistent in a spatial-temporal dataset through the tensor decomposition. Our main idea is first to build an SSR model to decompose the tensor data into a Smooth global trend mean, Sparse local hot-spots, and Residuals. Next, tensor decomposition is utilized as follows: bases are introduced to describe within-dimension correlation, and tensor products are used for between-dimension interaction. Then, a combination of LASSO and fused LASSO is used to estimate the model parameters, where an efficient recursive estimation procedure is developed based on the large-scale convex optimization, where we first transform the general LASSO optimization into regular LASSO optimization and apply FISTA to solve it with the fastest convergence rate. Finally, a CUSUM procedure is applied to detect when and where the hot-spot event occurs. We compare the performance of the proposed method in a numerical simulation study and a real-world case study, which contains a dataset including a collection of three types of crime rates for U.S. mainland states during the year 1965-2014. In both cases, the proposed SSR-Tensor is able to achieve the fast detection and accurate localization of the hot-spots.

stat.AP↗

arXiv2020

Real-time Detection of Clustered Events in Video-imaging data with Applications to Additive Manufacturing

The use of video-imaging data for in-line process monitoring applications has become more and more popular in the industry. In this framework, spatio-temporal statistical process monitoring methods are needed to capture the relevant information content and signal possible out-of-control states. Video-imaging data are characterized by a spatio-temporal variability structure that depends on the underlying phenomenon, and typical out-of-control patterns are related to the events that are localized both in time and space. In this paper, we propose an integrated spatio-temporal decomposition and regression approach for anomaly detection in video-imaging data. Out-of-control events are typically sparse spatially clustered and temporally consistent. Therefore, the goal is to not only detect the anomaly as quickly as possible ("when") but also locate it ("where"). The proposed approach works by decomposing the original spatio-temporal data into random natural events, sparse spatially clustered and temporally consistent anomalous events, and random noise. Recursive estimation procedures for spatio-temporal regression are presented to enable the real-time implementation of the proposed methodology. Finally, a likelihood ratio test procedure is proposed to detect when and where the hotspot happens. The proposed approach was applied to the analysis of video-imaging data to detect and locate local over-heating phenomena ("hotspots") during the layer-wise process in a metal additive manufacturing process.

stat.AP↗

arXiv2020

Long-Short Term Spatiotemporal Tensor Prediction for Passenger Flow Profile

Spatiotemporal data is very common in many applications, such as manufacturing systems and transportation systems. It is typically difficult to be accurately predicted given intrinsic complex spatial and temporal correlations. Most of the existing methods based on various statistical models and regularization terms, fail to preserve innate features in data alongside their complex correlations. In this paper, we focus on a tensor-based prediction and propose several practical techniques to improve prediction. For long-term prediction specifically, we propose the "Tensor Decomposition + 2-Dimensional Auto-Regressive Moving Average (2D-ARMA)" model, and an effective way to update prediction real-time; For short-term prediction, we propose to conduct tensor completion based on tensor clustering to avoid oversimplifying and ensure accuracy. A case study based on the metro passenger flow data is conducted to demonstrate the improved performance.

cs.LG↗

arXiv2020

Rapid Detection of Hot-spot by Tensor Decomposition with Application to Weekly Gonorrhea Data

In many bio-surveillance and healthcare applications, data sources are measured from many spatial locations repeatedly over time, say, daily/weekly/monthly. In these applications, we are typically interested in detecting hot-spots, which are defined as some structured outliers that are sparse over the spatial domain but persistent over time. In this paper, we propose a tensor decomposition method to detect when and where the hot-spots occur. Our proposed methods represent the observed raw data as a three-dimensional tensor including a circular time dimension for daily/weekly/monthly patterns, and then decompose the tensor into three components: smooth global trend, local hot-spots, and residuals. A combination of LASSO and fused LASSO is used to estimate the model parameters, and a CUSUM procedure is applied to detect when and where the hot-spots might occur. The usefulness of our proposed methodology is validated through numerical simulation and a real-world dataset in the weekly number of gonorrhea cases from $2006$ to $2018$ for $50$ states in the United States.

stat.AP↗

arXiv2019

Tensor Completion for Weakly-dependent Data on Graph for Metro Passenger Flow Prediction

Low-rank tensor decomposition and completion have attracted significant interest from academia given the ubiquity of tensor data. However, the low-rank structure is a global property, which will not be fulfilled when the data presents complex and weak dependencies given specific graph structures. One particular application that motivates this study is the spatiotemporal data analysis. As shown in the preliminary study, weakly dependencies can worsen the low-rank tensor completion performance. In this paper, we propose a novel low-rank CANDECOMP / PARAFAC (CP) tensor decomposition and completion framework by introducing the $L_{1}$-norm penalty and Graph Laplacian penalty to model the weakly dependency on graph. We further propose an efficient optimization algorithm based on the Block Coordinate Descent for efficient estimation. A case study based on the metro passenger flow data in Hong Kong is conducted to demonstrate improved performance over the regular tensor completion methods.

cs.LG↗

arXiv2019

AKM$^2$D : An Adaptive Framework for Online Sensing and Anomaly Quantification

In point-based sensing systems such as coordinate measuring machines (CMM) and laser ultrasonics where complete sensing is impractical due to the high sensing time and cost, adaptive sensing through a systematic exploration is vital for online inspection and anomaly quantification. Most of the existing sequential sampling methodologies focus on reducing the overall fitting error for the entire sampling space. However, in many anomaly quantification applications, the main goal is to estimate sparse anomalous regions in the pixel-level accurately. In this paper, we develop a novel framework named Adaptive Kernelized Maximum-Minimum Distance AKM$^2$D to speed up the inspection and anomaly detection process through an intelligent sequential sampling scheme integrated with fast estimation and detection. The proposed method balances the sampling efforts between the space-filling sampling (exploration) and focused sampling near the anomalous region (exploitation). The proposed methodology is validated by conducting simulations and a case study of anomaly detection in composite sheets using a guided wave test.

stat.ML↗

arXiv2019

Dynamic Network Embedding via Incremental Skip-gram with Negative Sampling

Network representation learning, as an approach to learn low dimensional representations of vertices, has attracted considerable research attention recently. It has been proven extremely useful in many machine learning tasks over large graph. Most existing methods focus on learning the structural representations of vertices in a static network, but cannot guarantee an accurate and efficient embedding in a dynamic network scenario. To address this issue, we present an efficient incremental skip-gram algorithm with negative sampling for dynamic network embedding, and provide a set of theoretical analyses to characterize the performance guarantee. Specifically, we first partition a dynamic network into the updated, including addition/deletion of links and vertices, and the retained networks over time. Then we factorize the objective function of network embedding into the added, vanished and retained parts of the network. Next we provide a new stochastic gradient-based method, guided by the partitions of the network, to update the nodes and the parameter vectors. The proposed algorithm is proven to yield an objective function value with a bounded difference to that of the original objective function. Experimental results show that our proposal can significantly reduce the training time while preserving the comparable performance. We also demonstrate the correctness of the theoretical analysis and the practical usefulness of the dynamic network embedding. We perform extensive experiments on multiple real-world large network datasets over multi-label classification and link prediction tasks to evaluate the effectiveness and efficiency of the proposed framework, and up to 22 times speedup has been achieved.

cs.LG↗

arXiv2018

Structured Point Cloud Data Analysis via Regularized Tensor Regression for Process Modeling and Optimization

Advanced 3D metrology technologies such as Coordinate Measuring Machine (CMM) and laser 3D scanners have facilitated the collection of massive point cloud data, beneficial for process monitoring, control and optimization. However, due to their high dimensionality and structure complexity, modeling and analysis of point clouds are still a challenge. In this paper, we utilize multilinear algebra techniques and propose a set of tensor regression approaches to model the variational patterns of point clouds and to link them to process variables. The performance of the proposed methods is evaluated through simulations and a real case study of turning process optimization.

cs.CV↗

arXiv2018

A novel approach for fusion of heterogeneous sources of data

With advancements in sensor technology, a heterogeneous set of data, containing samples of scalar, waveform signal, image, or even structured point cloud are becoming increasingly popular. Developing a statistical model, representing the behavior of the underlying system based upon such a heterogeneous set of data can be used in monitoring, control, and optimization of the system. Unfortunately, available methods only focus on the scalar and curve data and do not provide a general framework that can integrate different sources of data to construct a model. This paper poses the problem of estimating a process output, measured by a scalar, curve, an image, or a point cloud by a set of heterogeneous process variables such as scalar process setting, sensor readings, and images. We introduce a general approach in which each set of input data (predictor) as well as the output measurements are represented by tensors. We formulate a linear regression model between the input and output tensors and estimate the parameters by minimizing a least square loss function. In order to avoid overfitting and to reduce the number of parameters to be estimated, we decompose the model parameters using several bases, spanning the input and output spaces. Next, we learn both the bases and their spanning coefficients when minimizing the loss function using an alternating least square (ALS) algorithm. We show that such a minimization has a closed-form solution in each iteration and can be computed very efficiently. Through several simulation and case studies, we evaluate the performance of the proposed method. The results reveal the advantage of the proposed method over some benchmarks in the literature in terms of the mean square prediction error.

stat.ME↗

arXiv2018

Dynamic Multivariate Functional Data Modeling via Sparse Subspace Learning

Multivariate functional data from a complex system are naturally high-dimensional and have complex cross-correlation structure. The complexity of data structure can be observed as that (1) some functions are strongly correlated with similar features, while some others may have almost no cross-correlations with quite diverse features; and (2) the cross-correlation structure may also change over time due to the system evolution. With this regard, this paper presents a dynamic subspace learning method for multivariate functional data modeling. In particular, we consider different functions come from different subspaces, and only functions of the same subspace have cross-correlations with each other. The subspaces can be automatically formulated and learned by reformatting the problem as a sparse regression. By allowing but regularizing the regression change over time, we can describe the cross-correlation dynamics. The model can be efficiently estimated by the fast iterative shrinkage-thresholding algorithm (FISTA), and the features of every subspace can be extracted using the smooth multi-channel functional PCA. Numerical studies together with case studies demonstrate the efficiency and applicability of the proposed methodology.

stat.ML↗

arXiv2017

Realization of Quantum Spin Hall State in Monolayer 1T'-WTe2

A quantum spin Hall (QSH) insulator is a novel two-dimensional quantum state of matter that features quantized Hall conductance in the absence of magnetic field, resulting from topologically protected dissipationless edge states that bridge the energy gap opened by band inversion and strong spin-orbit coupling. By investigating electronic structure of epitaxially grown monolayer 1T'-WTe2 using angle-resolved photoemission (ARPES) and first principle calculations, we observe clear signatures of the topological band inversion and the band gap opening, which are the hallmarks of a QSH state. Scanning tunneling microscopy measurements further confirm the correct crystal structure and the existence of a bulk band gap, and provide evidence for a modified electronic structure near the edge that is consistent with the expectations for a QSH insulator. Our results establish monolayer 1T'-WTe2 as a new class of QSH insulator with large band gap in a robust two-dimensional materials family of transition metal dichalcogenides (TMDCs).

cond-mat.mtrl-sci↗

arXiv2016

Estimating fiber orientation distribution from diffusion MRI with spherical needlets

We present a novel method for estimation of the fiber orientation distribution (FOD) function based on diffusion-weighted Magnetic Resonance Imaging (D-MRI) data. We formulate the problem of FOD estimation as a regression problem through spherical deconvolution and a sparse representation of the FOD by a spherical needlets basis that form a multi-resolution tight frame for spherical functions. This sparse representation allows us to estimate FOD by an $l_1$-penalized regression under a non-negativity constraint. The resulting convex optimization problem is solved by an alternating direction method of multipliers (ADMM) algorithm. The proposed method leads to a reconstruction of the FODs that is accurate, has low variability and preserves sharp features. Through extensive experiments, we demonstrate the effectiveness and favorable performance of the proposed method compared with two existing methods. Particularly, we show the ability of the proposed method in successfully resolving fiber crossing at small angles and in automatically identifying isotropic diffusion. We also apply the proposed method to real 3T D-MRI data sets of healthy elderly individuals. The results show realistic descriptions of crossing fibers that are more accurate and less noisy than competing methods even with a relatively small number of gradient directions.

stat.AP↗

arXiv2016

Ubiquitous strong electron phonon coupling at the interface of FeSe/SrTiO3

The high temperature superconductivity in single-unit-cell (1UC) FeSe on SrTiO3 (STO)(001) and the observation of replica bands by angle-resolved photoemission spectroscopy (ARPES) have led to the conjecture that the coupling between FeSe electron and the STO phonon is responsible for the enhancement of Tc over other FeSe-based superconductors1,2. However the recent observation of a similar superconducting gap in FeSe grown on the (110) surface of STO raises the question of whether a similar mechanism applies3,4. Here we report the ARPES study of the electronic structure of FeSe grown on STO(110). Similar to the results in FeSe/STO(001), clear replica bands are observed. We also present a comparative study of STO (001) and STO(110) bare surfaces, where photo doping generates metallic surface states. Similar replica bands separating from the main band by approximately the same energy are observed, indicating this coupling is a generic feature of the STO surfaces and interfaces. Our findings suggest that the large superconducting gaps observed in FeSe films grown on two different STO surface terminations are likely enhanced by a common coupling between FeSe electrons and STO phonons.

cond-mat.supr-con↗

arXiv2014

Peacock: Learning Long-Tail Topic Features for Industrial Applications

Latent Dirichlet allocation (LDA) is a popular topic modeling technique in academia but less so in industry, especially in large-scale applications involving search engine and online advertising systems. A main underlying reason is that the topic models used have been too small in scale to be useful; for example, some of the largest LDA models reported in literature have up to $10^3$ topics, which cover difficultly the long-tail semantic word sets. In this paper, we show that the number of topics is a key factor that can significantly boost the utility of topic-modeling systems. In particular, we show that a "big" LDA model with at least $10^5$ topics inferred from $10^9$ search queries can achieve a significant improvement on industrial search engine and online advertising systems, both of which serving hundreds of millions of users. We develop a novel distributed system called Peacock to learn big LDA models from big data. The main features of Peacock include hierarchical distributed architecture, real-time prediction and topic de-duplication. We empirically demonstrate that the Peacock system is capable of providing significant benefits via highly scalable LDA topic models for several industrial applications.

cs.IR↗

arXiv2014

Improved Scatter Correction in X-Ray Cone Beam CT with Moving Beam Stop Array Using Johns' Equation

In this paper, an improved scatter correction with moving beam stop array (BSA) for x-ray cone beam (CB) CT is proposed. Firstly, correlation between neighboring CB views is deduced based on John's Equation. Then, correlation-based algorithm is presented to complement the incomplete views by using the redundancy (over-determined information) in CB projections. Finally, combining the algorithm with scatter correction method using moving BSA, where part of primary radiation is blocked and incomplete projections are acquired, an improved correction method is proposed. Effectiveness and robustness is validated by Monte Carlo (MC) simulation with EGSnrc on humanoid phantom.

physics.med-ph↗

arXiv2014

Single-scan scatter correction in CBCT by using projection correlation based view interpolation (PC-VI) and a stationary ring-shaped beam stop array (BSA)

In the scatter correction for x-ray Cone Beam (CB) CT, the single-scan scheme with moving Beam Stop Array (BSA) offers reliable scatter measurement with low dose, and by using Projection Correlation based View Interpolation (PC-VI), the primary fluence shaded by the moving BSA (during scatter measurement) could be recovered with high accuracy. However, the moving BSA may increase the mechanical burden in real applications. For better practicability, in this paper we proposed a PC-VI based single-scan scheme with a ring-shaped stationary BSA, which serves as a virtual moving BSA during CB scan, so the shaded primary fluence by this stationary BSA can be also well recovered by PC-VI. The principle in designing the whole system is deduced and evaluated. The proposed scheme greatly enhances the practicability of the single-scan scatter correction scheme.

physics.med-ph↗

arXiv2014

A globally attractive cycle driven by sequential bifurcations containing ghost effects in a 3-node yeast cell cycle model

Yeast cells produce daughter cells through a DNA replication and mitosis cycle associated with checkpoints and governed by the cell cycle regulatory network. To ensure genome stability and genetic information inheritance, this regulatory network must be dynamically robust against various fluctuations. Here we construct a simplified cell cycle model for a budding yeast to investigate the underlying mechanism that ensures robustness in this process containing sequential tasks (DNA replication and mitosis). We first establish a three-variable model and select a parameter set that qualitatively describes the yeast cell cycle process. Then, through nonlinear dynamic analysis, we demonstrate that the yeast cell cycle process is an excitable system driven by a sequence of saddle-node bifurcations with ghost effects. We further show that the yeast cell cycle trajectory is globally attractive with modularity in both state and parameter space, while the convergent manifold provides a suitable control state for cell cycle checkpoints. These results not only highlight a regulatory mechanism for executing successive cell cycle processes, but also provide a possible strategy for the synthetic network design of sequential-task processes.

q-bio.MN↗