arXiv subjects

Qian Zhang

Publications and source records attributed to Qian Zhang.

At least 433 records · Page 24Linked to original sources

arXiv2018

An $H^2$(curl)-conforming finite element in 2D and its applications to the quad-curl problem

In this paper, we first construct the $H^2$(curl)-conforming finite elements both on a rectangle and a triangle. They possess some fascinating properties which have been proven by a rigorous theoretical analysis. Then we apply the elements to construct a finite element space for discretizing quad-curl problems. Convergence orders $O(h^k)$ in the $H$(curl) norm and $O(h^{k-1})$ in the $H^2$(curl) norm are established. Numerical experiments are provided to confirm our theoretical results.

math.NA↗

arXiv2018

Impacts of Opinion Leaders on Social Contagions

Opinion leaders are ubiquitous in both online and offline social networks, but the impacts of opinion leaders on social behavior contagions are still not fully understood, especially by using a mathematical model. Here we generalize the classical Watts threshold model and address the influences of the opinion leaders, where an individual adopts a new behavior if one of his/her opinion leaders adopts the behavior. First, we choose the opinion leaders randomly from all individuals in the network and find the impacts of opinion leaders make other individuals adopt the behavior more easily. Specifically, the existence of opinion leaders reduces the lowest mean degree of the network required for the global behavior adoption, and increases the highest mean degree of the network that the global behavior adoption can occur. Besides, the introduction of opinion leaders accelerates the behavior adoption, but does not change the adoption order of individuals. The developed theoretical predictions agree with the simulation results. Second, we randomly choose the opinion leaders from the top h% of the highest degree individuals, and find an optimal h% for the network with the lowest mean degree that the global behavior adoption can occur. Meanwhile, the influences of opinion leaders on accelerating the adoption of behaviors become less significant and can even be ignored when reducing the value of h%.

physics.soc-ph↗

arXiv2018

Configurations and Diagnosis for Ultra-Dense Heterogeneous Networks: From Empirical Measurements to Technical Solutions

The intense demands for higher data rates and ubiquitous network coverage have raised the stakes on developing new network topology and architecture to meet these ever-increasing demands in a cost-effective manner. The telecommunication industry and international standardization bodies have placed considerable attention to the deployment of ultra-dense heterogeneous small-scale cells over existing cellular systems. Those small-scale cells, although provide higher data rates and better indoor coverage by reducing the distance between base stations (BSs) and end users, have raised severe configuration concerns. As the deployments are becoming irregular and flexible, inappropriate configurations occur frequently and undermine the network reliability and service quality. We envision that the fine-grained characterization of user traffic is a key pillar to diagnosing inappropriate configurations. In this article, we investigate the fine-grained traffic patterns of mobile users by analyzing the network data containing millions of subscribers and covering thousands of cells in a large metropolitan area. We characterize traffic patterns and mobility behaviors of users and geospatial properties of cells, and discuss how the heterogeneity of these characteristics affects network configurations and diagnosis in future ultra-dense small cells. Based on these observations from our measurements, we investigate possible models and corresponding challenges, and propose a heterogeneity-aware scheme that takes into account the disparity of user mobility behaviors and geospatial properties among small cells.

cs.NI↗

arXiv2018

Resonance-based Secure Pairing for Wearables

Securely pairing wearables with another device is the key to many promising applications. This paper presents \textit{Touch-And-Guard (TAG)}, a system that uses hand touch as an intuitive manner to establish a secure connection between a wristband wearable and the touched device. It generates secret bits from hand resonant properties, which are obtained using accelerometers and vibration motors. The extracted secret bits are used by both sides to authenticate each other and then communicate confidentially. The ubiquity of accelerometers and motors presents an immediate market for our system. We demonstrate the feasibility of our system using an experimental prototype and conduct experiments involving 12 participants with 1440 trials. The results indicate that we can generate secret bits at a rate of 7.15 bit/s, which is 44% faster than conventional text input PIN authentication.

cs.CR↗

arXiv2018

Boundary regularity for Monge-Ampère equations with unbounded right hand side

We consider Monge-Ampère equations with right hand side $f$ that degenerate to $\infty$ near the boundary of a convex domain $Ω$, which are of the type $$\mathrm{det}\;D^2 u=f\quad\mathrm{in}\;Ω,\quad\quad f\sim d^{-α}_{\partialΩ}\quad\mathrm{near}\;\partialΩ,$$ where $d_{\partialΩ}$ represents the distance to $\partial Ω$ and $-α$ is a negative power with $α\in(0,2)$. We study the boundary regularity of the solutions and establish a localization theorem for boundary sections.

math.AP↗

arXiv2018

Link transmission centrality in large-scale social networks

Understanding the importance of links in transmitting information in a network can provide ways to hinder or postpone ongoing dynamical phenomena like the spreading of epidemic or the diffusion of information. In this work, we propose a new measure based on stochastic diffusion processes, the \textit{transmission centrality}, that captures the importance of links by estimating the average number of nodes to whom they transfer information during a global spreading diffusion process. We propose a simple algorithmic solution to compute transmission centrality and to approximate it in very large networks at low computational cost. Finally we apply transmission centrality in the identification of weak ties in three large empirical social networks, showing that this metric outperforms other centrality measures in identifying links that drive spreading processes in a social network.

cs.SI↗

arXiv2018

Securing On-Body IoT Devices By Exploiting Creeping Wave Propagation

On-body devices are an intrinsic part of the Internet-of-Things (IoT) vision to provide human-centric services. These on-body IoT devices are largely embedded devices that lack a sophisticated user interface to facilitate traditional Pre-Shared Key based security protocols. Motivated by this real-world security vulnerability, this paper proposes SecureTag, a system designed to add defense in depth against active attacks by integrating physical layer (PHY) information with upper-layer protocols. The underpinning of SecureTag is a signal processing technique that extracts the peculiar propagation characteristics of creeping waves to discern on-body devices. Upon overhearing a suspicious transmission, SecureTag initiates a PHY-based challenge-response protocol to mitigate attacks. We implement our system on different commercial off-the-shelf (COTS) wearables and a smartphone. Extensive experiments are conducted in a lab, apartments, malls, and outdoor areas, involving 12 volunteer subjects of different age groups, to demonstrate the robustness of our system. Results show that our system can mitigate 96.13% of active attack attempts while triggering false alarms on merely 5.64% of legitimate traffic.

cs.NI↗

arXiv2018

Toward Cross-Layer Design for Non-Orthogonal Multiple Access: A Quality-of-Experience Perspective

Recent years have seen proliferation in versatile mobile devices and an upsurge in the growth of data-consuming application services. Orthogonal multiple access (OMA) technologies in today's mobile systems fall inefficient in the presence of such massive connectivity and traffic demands. In this regards, non-orthogonal multiple access (NOMA) has been advocated by the research community to embrace unprecedented requirements. Current NOMA designs have been demonstrated to largely improve conventional system performance in terms of throughput and latency, while their impact on the end users' perceived experience has not yet been comprehensively understood. We envision that quality-of-experience (QoE) awareness is a key pillar for NOMA designs to fulfill versatile user demands in the 5th generation (5G) wireless communication systems. This article systematically investigates QoE-aware NOMA designs that translate the physical-layer benefits of NOMA to the improvement of users' perceived experience in upper layers. We shed light on design principles and key challenges in realizing QoE-aware NOMA designs. With these principles and challenges in mind, we develop a general architecture with a dynamic network scheduling scheme. We provide some implications for future QoE-aware NOMA designs by conducting a case study in video streaming applications.

cs.NI↗

arXiv2018

Quality Classified Image Analysis with Application to Face Detection and Recognition

Motion blur, out of focus, insufficient spatial resolution, lossy compression and many other factors can all cause an image to have poor quality. However, image quality is a largely ignored issue in traditional pattern recognition literature. In this paper, we use face detection and recognition as case studies to show that image quality is an essential factor which will affect the performances of traditional algorithms. We demonstrated that it is not the image quality itself that is the most important, but rather the quality of the images in the training set should have similar quality as those in the testing set. To handle real-world application scenarios where images with different kinds and severities of degradation can be presented to the system, we have developed a quality classified image analysis framework to deal with images of mixed qualities adaptively. We use deep neural networks first to classify images based on their quality classes and then design a separate face detector and recognizer for images in each quality class. We will present experimental results to show that our quality classified framework can accurately classify images based on the type and severity of image degradations and can significantly boost the performances of state-of-the-art face detector and recognizer in dealing with image datasets containing mixed quality images.

cs.CV↗

arXiv2018

Wi-Fi Teeter-Totter: Overclocking OFDM for Internet of Things

The conventional high-speed Wi-Fi has recently become a contender for low-power Internet-of-Things (IoT) communications. OFDM continues its adoption in the new IoT Wi-Fi standard due to its spectrum efficiency that can support the demand of massive IoT connectivity. While the IoT Wi-Fi standard offers many new features to improve power and spectrum efficiency, the basic physical layer (PHY) structure of transceiver design still conforms to its conventional design rationale where access points (AP) and clients employ the same OFDM PHY. In this paper, we argue that current Wi-Fi PHY design does not take full advantage of the inherent asymmetry between AP and IoT. To fill the gap, we propose an asymmetric design where IoT devices transmit uplink packets using the lowest power while pushing all the decoding burdens to the AP side. Such a design utilizes the sufficient power and computational resources at AP to trade for the transmission (TX) power of IoT devices. The core technique enabling this asymmetric design is that the AP takes full power of its high clock rate to boost the decoding ability. We provide an implementation of our design and show that it can reduce the IoT's TX power by boosting the decoding capability at the receivers.

cs.NI↗

arXiv2017

UTD-CRSS Submission for MGB-3 Arabic Dialect Identification: Front-end and Back-end Advancements on Broadcast Speech

This study presents systems submitted by the University of Texas at Dallas, Center for Robust Speech Systems (UTD-CRSS) to the MGB-3 Arabic Dialect Identification (ADI) subtask. This task is defined to discriminate between five dialects of Arabic, including Egyptian, Gulf, Levantine, North African, and Modern Standard Arabic. We develop multiple single systems with different front-end representations and back-end classifiers. At the front-end level, feature extraction methods such as Mel-frequency cepstral coefficients (MFCCs) and two types of bottleneck features (BNF) are studied for an i-Vector framework. As for the back-end level, Gaussian back-end (GB), and Generative Adversarial Networks (GANs) classifiers are applied alternately. The best submission (contrastive) is achieved for the ADI subtask with an accuracy of 76.94% by augmenting the randomly chosen part of the development dataset. Further, with a post evaluation correction in the submitted system, final accuracy is increased to 79.76%, which represents the best performance achieved so far for the challenge on the test dataset.

eess.AS↗

arXiv2016

Automatic Visual Theme Discovery from Joint Image and Text Corpora

A popular approach to semantic image understanding is to manually tag images with keywords and then learn a mapping from vi- sual features to keywords. Manually tagging images is a subjective pro- cess and the same or very similar visual contents are often tagged with different keywords. Furthermore, not all tags have the same descriptive power for visual contents and large vocabulary available from natural language could result in a very diverse set of keywords. In this paper, we propose an unsupervised visual theme discovery framework as a better (more compact, efficient and effective) alternative to semantic represen- tation of visual contents. We first show that tag based annotation lacks consistency and compactness for describing visually similar contents. We then learn the visual similarity between tags based on the visual features of the images containing the tags. At the same time, we use a natural language processing technique (word embedding) to measure the seman- tic similarity between tags. Finally, we cluster tags into visual themes based on their visual similarity and semantic similarity measures using a spectral clustering algorithm. We conduct user studies to evaluate the effectiveness and rationality of the visual themes discovered by our unsu- pervised algorithm and obtains promising result. We then design three common computer vision tasks, example based image search, keyword based image search and image labelling to explore potential applica- tion of our visual themes discovery framework. In experiments, visual themes significantly outperforms tags on semantic image understand- ing and achieve state-of-art performance in all three tasks. This again demonstrate the effectiveness and versatility of proposed framework.

cs.CV↗

arXiv2016

$μ$SR evidence for the U(1) quantum spin liquid ground state in the triangular antiferromagnet YbMgGaO$_4$

Muon spin relaxation and rotation ($μ$SR) experiments on single crystals of the structurally perfect triangular antiferromagnet YbMgGaO$_4$ indicate the absence of both static long-range magnetic order and spin freezing down to 0.048 K in zero field. Below 0.4 K, the $μ^{+}$ spin relaxation rates, which are proportional to the dynamic correlation function of the Yb$^{3+}$ spins,exhibit temperature-independent plateaus. Same behavior is revealed by temperature-independent local susceptibilities extracted from the Knight shifts of the $μ^{+}$ spin rotation frequencies under a transverse field of 20 Oe. All these $μ$SR results unequivocally support the formation of a gapless U(1) quantum spin liquid ground state in the triangular antiferromagnet YbMgGaO$_4$.

cond-mat.str-el↗

arXiv2016

Modelling and Analysis of Network Security - an Algebraic Approach

Game theory has been applied to investigate network security. But different security scenarios were often modeled via different types of games and analyzed in an ad-hoc manner. In this paper, we propose an algebraic approach for modeling and analyzing uniformly several types of network security games. This approach is based on a probabilistic extension of the value-passing Calculus of Communicating Systems (CCS) which is regarded as a Generative model for Probabilistic Value-passing CCS (PVCCSG for short). Our approach gives a uniform framework, called PVCCSG based security model, for the security scenarios modeled via perfect and complete or incomplete information games. We present then a uniform algorithm for computing the Nash equilibria strategies of a network security game on its PVCCSG based security model. The algorithm first generates a transition system for each of the PVCCSG based security models, then simplifies this transition system through graph-theoretic abstraction and bisimulation minimization. Then, a backward induction method, which is only applicable to finite tree models, can be used to compute all the Nash equilibria strategies of the (possibly infinite) security games. This algorithm is implemented and can also be tuned smoothly for computing its social optimal strategies. The effectiveness and efficiency of this approach are further demonstrated with four detailed case studies from the field of network security.

cs.CR↗

arXiv2016

3D Keypoint Detection Based on Deep Neural Network with Sparse Autoencoder

Researchers have proposed various methods to extract 3D keypoints from the surface of 3D mesh models over the last decades, but most of them are based on geometric methods, which lack enough flexibility to meet the requirements for various applications. In this paper, we propose a new method on the basis of deep learning by formulating the 3D keypoint detection as a regression problem using deep neural network (DNN) with sparse autoencoder (SAE) as our regression model. Both local information and global information of a 3D mesh model in multi-scale space are fully utilized to detect whether a vertex is a keypoint or not. SAE can effectively extract the internal structure of these two kinds of information and formulate high-level features for them, which is beneficial to the regression model. Three SAEs are used to formulate the hidden layers of the DNN and then a logistic regression layer is trained to process the high-level features produced in the third SAE. Numerical experiments show that the proposed DNN based 3D keypoint detection algorithm outperforms current five state-of-the-art methods for various 3D mesh models.

cs.CV↗

arXiv2015

Topical differences between Chinese language Twitter and Sina Weibo

Sina Weibo, China's most popular microblogging platform, is currently used by over $500M$ users and is considered to be a proxy of Chinese social life. In this study, we contrast the discussions occurring on Sina Weibo and on Chinese language Twitter in order to observe two different strands of Chinese culture: people within China who use Sina Weibo with its government imposed restrictions and those outside that are free to speak completely anonymously. We first propose a simple ad-hoc algorithm to identify topics of Tweets and Weibo. Different from previous works on micro-message topic detection, our algorithm considers topics of the same contents but with different \#tags. Our algorithm can also detect topics for Tweets and Weibos without any \#tags. Using a large corpus of Weibo and Chinese language tweets, covering the period from January $1$ to December $31$, $2012$, we obtain a list of topics using clustered \#tags that we can then use to compare the two platforms. Surprisingly, we find that there are no common entries among the Top $100$ most popular topics. Furthermore, only $9.2\%$ of tweets correspond to the Top $1000$ topics on Sina Weibo platform, and conversely only $4.4\%$ of weibos were found to discuss the most popular Twitter topics. Our results reveal significant differences in social attention on the two platforms, with most popular topics on Sina Weibo relating to entertainment while most tweets corresponded to cultural or political contents that is practically non existent in Sina Weibo.

cs.SI↗

arXiv2015

Prediction of the Yield of Enzymatic Synthesis of Betulinic Acid Ester Using Artificial Neural Networks and Support Vector Machine

3\b{eta}-O-phthalic ester of betulinic acid is of great importance in anticancer studies. However, the optimization of its reaction conditions requires a large number of experimental works. To simplify the number of times of optimization in experimental works, here, we use artificial neural network (ANN) and support vector machine (SVM) models for the prediction of yields of 3\b{eta}-O-phthalic ester of betulinic acid synthesized by betulinic acid and phthalic anhydride using lipase as biocatalyst. General regression neural network (GRNN), multilayer feed-forward neural network (MLFN) and the SVM models were trained based on experimental data. Four indicators were set as independent variables, including time (h), temperature (C), amount of enzyme (mg) and molar ratio, while the yield of the 3\b{eta}-O-phthalic ester of betulinic acid was set as the dependent variable. Results show that the GRNN and SVM models have the best prediction results during the testing process, with comparatively low RMS errors (4.01 and 4.23respectively) and short training times (both 1s). The prediction accuracy of the GRNN and SVM are both 100% in testing process, under the tolerance of 30%.

cs.LG↗

arXiv2015

Fast evaluation of the Caputo fractional derivative and its applications to fractional diffusion equations

We present an efficient algorithm for the evaluation of the Caputo fractional derivative $_0^C\!D_t^αf(t)$ of order $α\in (0,1)$, which can be expressed as a convolution of $f'(t)$ with the kernel $t^{-α}$. The algorithm is based on an efficient sum-of-exponentials approximation for the kernel $t^{-1-α}$ on the interval $[Δt, T]$ with a uniform absolute error $\varepsilon$, where the number of exponentials $N_{\text{exp}}$ needed is of the order $O\left(\log\frac{1}{\varepsilon}\left( \log\log\frac{1}{\varepsilon}+\log\frac{T}{Δt}\right) +\log\frac{1}{Δt}\left( \log\log\frac{1}{\varepsilon}+\log\frac{1}{Δt}\right) \right)$. As compared with the direct method, the resulting algorithm reduces the storage requirement from $O(N_T)$ to $O(N_{\text{exp}})$ and the overall computational cost from $O(N_T^2)$ to $O(N_TN_{\text{exp}})$ with $N_T$ the total number of time steps. Furthermore, when the fast evaluation scheme of the Caputo derivative is applied to solve the fractional diffusion equations, the resulting algorithm requires only $O(N_SN_{\text{exp}})$ storage and $O(N_SN_TN_{\text{exp}})$ work with $N_S$ the total number of points in space; whereas the direct methods require $O(N_SN_T$) storage and $O(N_SN_T^2)$ work. The complexity of both algorithms is nearly optimal since $N_{\text{exp}}$ is of the order $O(\log N_T)$ for $T\gg 1$ or $O(\log^2N_T)$ for $T\approx 1$ for fixed accuracy $\varepsilon$. We also present a detailed stability and error analysis of the new scheme for solving linear fractional diffusion equations. The performance of the new algorithm is illustrated via several numerical examples. Finally, the algorithm can be parallelized in a straightforward manner.

math.NA↗