Searcharxiv⌕ Search

arXiv subjects

Xu Zhang

Publications and source records attributed to Xu Zhang.

At least 433 records · Page 24Linked to original sources

Design of a Simplified Wireless Sensor Network Node based on MQTT Protocol

MQTT protocol is a publish/subscribe message protocol based on TCP/IP protocol. It has the characteristics of low power consumption, scalability, openness and simplicity. HTTP protocol is an open and low-cost request/reply message protocol based on TCP/IP protocol. It is the main protocol of Internet communication, but it is not suitable for the environment of computing, processing and bandwidth limited. In this paper, a simplified wireless sensor network node was designed based on MQTT protocol. The node was designed to use the Arduino development environment and use the WiFi for networking. It has the characteristics of simple structure, low power consumption and so on. The design can be widely used in smart home, environmental monitoring and medical applications, and is the main contents of the Internet of things (IoT).

cs.NI↗

Real-time Attention Based Look-alike Model for Recommender System

Recently, deep learning models play more and more important roles in contents recommender systems. However, although the performance of recommendations is greatly improved, the "Matthew effect" becomes increasingly evident. While the head contents get more and more popular, many competitive long-tail contents are difficult to achieve timely exposure because of lacking behavior features. This issue has badly impacted the quality and diversity of recommendations. To solve this problem, look-alike algorithm is a good choice to extend audience for high quality long-tail contents. But the traditional look-alike models which widely used in online advertising are not suitable for recommender systems because of the strict requirement of both real-time and effectiveness. This paper introduces a real-time attention based look-alike model (RALM) for recommender systems, which tackles the challenge of conflict between real-time and effectiveness. RALM realizes real-time look-alike audience extension benefiting from seeds-to-user similarity prediction and improves the effectiveness through optimizing user representation learning and look-alike learning modeling. For user representation learning, we propose a novel neural network structure named attention merge layer to replace the concatenation layer, which significantly improves the expressive ability of multi-fields feature learning. On the other hand, considering the various members of seeds, we design global attention unit and local attention unit to learn robust and adaptive seeds representation with respect to a certain target user. At last, we introduce seeds clustering mechanism which not only reduces the time complexity of attention units prediction but also minimizes the loss of seeds information at the same time. According to our experiments, RALM shows superior effectiveness and performance than popular look-alike models.

cs.IR↗

Super Interaction Neural Network

Recent studies have demonstrated that the convolutional networks heavily rely on the quality and quantity of generated features. However, in lightweight networks, there are limited available feature information because these networks tend to be shallower and thinner due to the efficiency consideration. For farther improving the performance and accuracy of lightweight networks, we develop Super Interaction Neural Networks (SINet) model from a novel point of view: enhancing the information interaction in neural networks. In order to achieve information interaction along the width of the deep network, we propose Exchange Shortcut Connection, which can integrate the information from different convolution groups without any extra computation cost. And then, in order to achieve information interaction along the depth of the network, we proposed Dense Funnel Layer and Attention based Hierarchical Joint Decision, which are able to make full use of middle layer features. Our experiments show that the superior performance of SINet over other state-of-the-art lightweight models in ImageNet dataset. Furthermore, we also exhibit the effectiveness and universality of our proposed components by ablation studies.

cs.CV↗

Label Mapping Neural Networks with Response Consolidation for Class Incremental Learning

Class incremental learning refers to a special multi-class classification task, in which the number of classes is not fixed but is increasing with the continual arrival of new data. Existing researches mainly focused on solving catastrophic forgetting problem in class incremental learning. To this end, however, these models still require the old classes cached in the auxiliary data structure or models, which is inefficient in space or time. In this paper, it is the first time to discuss the difficulty without support of old classes in class incremental learning, which is called as softmax suppression problem. To address these challenges, we develop a new model named Label Mapping with Response Consolidation (LMRC), which need not access the old classes anymore. We propose the Label Mapping algorithm combined with the multi-head neural network for mitigating the softmax suppression problem, and propose the Response Consolidation method to overcome the catastrophic forgetting problem. Experimental results on the benchmark datasets show that our proposed method achieves much better performance compared to the related methods in different scenarios.

cs.LG↗

Planning coordinated motions for tethered planar mobile robots

This paper considers the motion planning problem for multiple tethered planar mobile robots. Each robot is attached to a fixed base by a flexible cable. Since the robots share a common workspace, the interactions amongst the robots, cables, and obstacles pose significant difficulties for planning. Previous works have studied the problem of detecting whether a target cable configuration is intersecting (or entangled). Here, we are interested in the motion planning problem: how to plan and coordinate the robot motions to realize a given non-intersecting target cable configuration. We identify four possible modes of motion, depending on whether (i) the robots move in straight lines or following their cable lines; (ii) the robots move sequentially or concurrently. We present an in-depth analysis of Straight & Concurrent, which is the most practically-interesting mode of motion. In particular, we propose algorithms that (a) detect whether a given target cable configuration is realizable by a Straight & Concurrent motion, and (b) return a valid coordinated motion plan. The algorithms are analyzed in detail and validated in simulations and in a hardware experiment.

cs.RO↗

Bound states for logarithmic Schrodinger equations with potentials unbounded below

We study the existence and concentration behavior of the bound states for the following logarithmic Schrödinger equation \begin{equation*} \begin{cases} -\varepsilon^2Δv+V(x)v=v\log v^2 \ \ &\text {in}\ \ \mathbb R^N,\\ v(x)\to 0 \ \ &\text {as}\ \ |x|\to\infty, \end{cases} \end{equation*} where $N\geq 1$, $\varepsilon>0$ is a small parameter, and $V$ may be unbounded below at infinity with a speed of at most quadratic strength. We show that around various types of local topological critical points of the potential function, positive bound state solutions exist and concentrate as $\varepsilon\to0$.

math.AP↗

Carleman Estimates for Parabolic Operators with Discontinuous and Anisotropic Diffusion Coefficients, an Elementary Approach

By using some deep tools from microlocal analysis, J. Le Rousseau and L. Robbiano (Invent. Math., 183 (2011), 245--336) established several Carleman estimates for parabolic operators with isotropic diffusion coefficients which have jumps at interfaces. In this paper, we revisit the same problem but for the general case of anisotropic diffusion coefficients. Our main tools are a pointwise estimate for parabolic operators and a suitable chosen weight function.

math.OC↗

Infinite dimensional Cauchy-Kowalevski and Holmgren type theorems

The aim of this paper is to show Cauchy-Kowalevski and Holmgren type theorems with infinite number of variables. We adopt von Koch and Hilbert's definition of analyticity of functions as monomial expansions. Our Cauchy-Kowalevski type theorem is derived by modifying the classical method of majorants. Based on this result, by employing some tools from abstract Wiener spaces, we establish our Holmgren type theorem.

math.FA↗

Observation of multi-component atomic Schrödinger cat states of up to 20 qubits

We report on deterministic generation of 18-qubit genuinely entangled Greenberger-Horne-Zeilinger (GHZ) state and multi-component atomic Schrödinger cat states of up to 20 qubits on a quantum processor, which features 20 superconducting qubits interconnected by a bus resonator. By engineering a one-axis twisting Hamiltonian enabled by the resonator-mediated interactions, the system of qubits initialized coherently evolves to an over-squeezed, non-Gaussian regime, where atomic Schrödinger cat states, i.e., superpositions of atomic coherent states including GHZ state, appear at specific time intervals in excellent agreement with theory. With high controllability, we are able to take snapshots of the dynamics by plotting quasidistribution $Q$-functions of the 20-qubit atomic cat states, and globally characterize the 18-qubit GHZ state which yields a fidelity of $0.525\pm0.005$ confirming genuine eighteen-partite entanglement. Our results demonstrate the largest entanglement controllably created so far in solid state architectures, and the process of generating and detecting multipartite entanglement may promise applications in practical quantum metrology, quantum information processing and quantum computation.

quant-ph↗

Compressive Multidimensional Harmonic Retrieval with Prior Knowledge

This paper concerns the problem of estimating multidimensional (MD) frequencies using prior knowledge of the signal spectral sparsity from partial time samples. In many applications, such as radar, wireless communications, and super-resolution imaging, some structural information about the signal spectrum might be known beforehand. Suppose that the frequencies lie in given intervals, the goal is to improve the frequency estimation performance by using the prior information. We study the MD Vandermonde decomposition of block Toeplitz matrices in which the frequencies are restricted to given intervals. We then propose to solve the frequency-selective atomic norm minimization by converting them into semidefinite program based on the MD Vandermonde decomposition. Numerical simulation results are presented to illustrate the good performance of the proposed method.

cs.IT↗

SCMA based resource management of D2D communications for maximum sum-revenue

The device-to-device (D2D) communication is one of the promising technologies of the future Internet of Things (IoT), but its security-related issues remain challenging. The block-chain is considered to be a secure and reliable distributed ledger, so we can treat the device user equipment (D-UE) request for the reusing resources of cellular user equipment (C-UE) as a transaction and put it into a transaction pool, then package the record into the block-chain. In this paper, we study the D2D communication resource allocation scheme based on sparse code multiple access (SCMA). Firstly, the system's interference model and block-chain-based transaction flow are analyzed. Then we propose the optimization problem so that C-UE can get the maximum revenue by sharing its resources to D-UE. This problem is NP-hard, so we propose a heuristic algorithm based on semi-definite relaxation (SDR) programming to solve it. Finally, the performance of the proposed algorithm is verified by simulation of different system parameters.

eess.SP↗

Relationship among several types of sensitivity in general semi-flows

In this paper, we show that there exists a monoid, on which neither the syndetic property nor the dual syndetic property holds, and there exists a strongly mixing semi-flow with this monoid action which does not have thick sensitivity, syndetic sensitivity, thickly syndetic sensitivity, or thickly periodical sensitivity. Meanwhile, we show that there exists a thickly sensitive cascade which is not multi-sensitive. The first result answers positively Question 2, and the first and the second results answer negatively Question 3 in [A. Miller, A note about various types of sensitivity in general semiflows, Appl. Gen. Topol., 2018].

math.DS↗

Unsupervised Embedding Learning via Invariant and Spreading Instance Feature

This paper studies the unsupervised embedding learning problem, which requires an effective similarity measurement between samples in low-dimensional embedding space. Motivated by the positive concentrated and negative separated properties observed from category-wise supervised learning, we propose to utilize the instance-wise supervision to approximate these properties, which aims at learning data augmentation invariant and instance spread-out features. To achieve this goal, we propose a novel instance based softmax embedding method, which directly optimizes the `real' instance features on top of the softmax function. It achieves significantly faster learning speed and higher accuracy than all existing methods. The proposed method performs well for both seen and unseen testing categories with cosine similarity. It also achieves competitive performance even without pre-trained network over samples from fine-grained categories.

cs.CV↗

Covariance Matrix Estimation from Linearly-Correlated Gaussian Samples

Covariance matrix estimation concerns the problem of estimating the covariance matrix from a collection of samples, which is of extreme importance in many applications. Classical results have shown that $O(n)$ samples are sufficient to accurately estimate the covariance matrix from $n$-dimensional independent Gaussian samples. However, in many practical applications, the received signal samples might be correlated, which makes the classical analysis inapplicable. In this paper, we develop a non-asymptotic analysis for the covariance matrix estimation from correlated Gaussian samples. Our theoretical results show that the error bounds are determined by the signal dimension $n$, the sample size $m$, and the shape parameter of the distribution of the correlated sample covariance matrix. Particularly, when the shape parameter is a class of Toeplitz matrices (which is of great practical interest), $O(n)$ samples are also sufficient to faithfully estimate the covariance matrix from correlated samples. Simulations are provided to verify the correctness of the theoretical results.

cs.IT↗

Secure Users Oriented Downlink MISO NOMA

This paper proposes a secure users oriented multiple-input and single-output (MISO) non-orthogonal multiple access (NOMA) downlink transmission scheme, where multiple legitimate users are categorized as quality of service (QoS)-required users (QU) and the security-required users (SU) overheard by a passive eavesdropper. The basic idea is to exploit zero-forcing beamforming (ZFBF) to cancel interference among SUs, and then several QUs are efficiently scheduled based on the obtained beamforming vectors to divide the legitimate users into several user clusters, in such a way that the QUs could share the concurrent transmissions and help to interfere with the eavesdropper to enhance SU secrecy. The goal is to maximize the achievable minimum secrecy rate (MSR) and sum secrecy rate (SSR) of all SUs, respectively, subject to the secrecy outage probability (SOP) constraint of each SU and the QoS constraint of each QU. To provide a comprehensive investigation we consider two extreme cases that the eavesdropper has perfect multiuser detection ability (lower bound of secrecy) or does not have multiuser detection ability (upper bound of secrecy). In the lower bound case, the Dinkelbach algorithm and the monotonic optimization (MO)-based outer polyblock approximation algorithm are proposed to solve the max-min secrecy rate (MMSR) and max-sum secrecy rate (MSSR) problems, respectively. As for the upper bound case, an alternative optimization (AO)-based algorithm is proposed to solve the two non-convex problems. Finally, the superiority of the proposed cases to the conventional orthogonal multiple access (OMA) one is verified by numerical results.

cs.IT↗

Exact Controllability for a Refined Stochastic Wave Equation

A widely used stochastic wave equation is the classical wave equation perturbed by a term of Itô's integral. We show that this equation is not exactly controllable even if the controls are effective everywhere in both the drift and the diffusion terms and also on the boundary. In some sense this means that some key feature has been ignored in this model. Then, based on a stochastic Newton's law, we propose a refined stochastic wave equation. By means of a new global Carleman estimate, we establish the exact controllability of our stochastic wave equation with three controls. Moreover, we give a result about the lack of exact controllability, which shows that the action of three controls is necessary. Our analysis indicates that, at least from the point of view of control theory, the new stochastic wave equation introduced in this paper is a more reasonable model than that in the existing literatures.

math.OC↗

FARSA: Fully Automated Roadway Safety Assessment

This paper addresses the task of road safety assessment. An emerging approach for conducting such assessments in the United States is through the US Road Assessment Program (usRAP), which rates roads from highest risk (1 star) to lowest (5 stars). Obtaining these ratings requires manual, fine-grained labeling of roadway features in street-level panoramas, a slow and costly process. We propose to automate this process using a deep convolutional neural network that directly estimates the star rating from a street-level panorama, requiring milliseconds per image at test time. Our network also estimates many other road-level attributes, including curvature, roadside hazards, and the type of median. To support this, we incorporate task-specific attention layers so the network can focus on the panorama regions that are most useful for a particular task. We evaluated our approach on a large dataset of real-world images from two US states. We found that incorporating additional tasks, and using a semi-supervised training approach, significantly reduced overfitting problems, allowed us to optimize more layers of the network, and resulted in higher accuracy.

cs.CV↗

Assessment of central serous chorioretinopathy (CSC) depicted on color fundus photographs using deep Learning

To investigate whether and to what extent central serous chorioretinopathy (CSC) depicted on color fundus photographs can be assessed using deep learning technology. We collected a total of 2,504 fundus images acquired on different subjects. We verified the CSC status of these images using their corresponding optical coherence tomography (OCT) images. A total of 1,329 images depicted CSC. These images were preprocessed and normalized. This resulting dataset was randomly split into three parts in the ratio of 8:1:1 respectively for training, validation, and testing purposes. We used the deep learning architecture termed InceptionV3 to train the classifier. We performed nonparametric receiver operating characteristic (ROC) analyses to assess the capability of the developed algorithm to identify CSC. The Kappa coefficient between the two raters was 0.48 (p < 0.001), while the Kappa coefficients between the computer and the two raters were 0.59 (p < 0.001) and 0.33 (p < 0.05).Our experiments showed that the computer algorithm based on deep learning can assess CSC depicted on color fundus photographs in a relatively reliable and consistent way.

cs.CV↗