DenseImage Network: Video Spatial-Temporal Evolution Encoding and Understanding

Many of the leading approaches for video understanding are data-hungry and time-consuming, failing to capture the gist of spatial-temporal evolution in an efficient manner. The latest research shows that CNN network can reason about static relation of entities in images. To further exploit its capacity in dynamic evolution reasoning, we introduce a novel network module called DenseImage Network(DIN) with two main contributions. 1) A novel compact representation of video which distills its significant spatial-temporal evolution into a matrix called DenseImage, primed for efficient video encoding. 2) A simple yet powerful learning strategy based on DenseImage and a temporal-order-preserving CNN network is proposed for video understanding, which contains a local temporal correlation constraint capturing temporal evolution at multiple time scales with different filter widths. Extensive experiments on two recent challenging benchmarks demonstrate that our DenseImage Network can accurately capture the common spatial-temporal evolution between similar actions, even with enormous visual variations or different time scales. Moreover, we obtain the state-of-the-art results in action and gesture recognition with much less time-and-memory cost, indicating its immense potential in video representing and understanding.Comment: 7 page

Complex Balancing Reconstructed to the Asymptotic Stability of Mass-action Chemical Reaction Networks with Conservation Laws

Motivated by the fact that the pseudo-Helmholtz function is a valid Lyapunov function for characterizing asymptotic stability of complex balanced mass action systems (MASs), this paper develops the generalized pseudo-Helmholtz function for stability analysis for more general MASs assisted with conservation laws. The key technique is to transform the original network into two different MASs, defined by reconstruction and reverse reconstruction, with an important aspect that the dynamics of the original network for free species is equivalent to that of the reverse reconstruction. Stability analysis of the original network is then conducted based on an analysis of how stability properties are retained from the original network to the reverse reconstruction. We prove that the reverse reconstruction possesses only an equilibrium in each positive stoichiometric compatibility class if the corresponding reconstruction is complex balanced. Under this complex balanced reconstruction strategy, the asymptotic stability of the reverse reconstruction, which also applies to the original network, is thus reached by taking the generalized pseudo-Helmholtz function as the Lyapunov function. To facilitate applications, we further provide a systematic method for computing complex balanced reconstructions assisted with conservation laws. Some representative examples are presented to exhibit the validity of the complex balanced reconstruction strategy

A novel weighting scheme for random kk-SAT

Consider a random $k$-CNF formula $F_{k}(n, rn)$ with $n$ variables and $rn$ clauses. For every truth assignment $\sigma\in \{0, 1\}^{n}$ and every clause $c=\ell_{1}\vee\cdots\vee\ell_{k}$, let $d=d(\sigma, c)$ be the number of satisfied literal occurrences in $c$ under $\sigma$. For fixed $\beta>-1$ and $\lambda>0$, we take $\omega(\sigma, c)=0$, if $d=0$; $\omega(\sigma, c)=\lambda(1+\beta)$, if $d=1$ and $\omega(\sigma, c)=\lambda^{d}$, if $d>1$. Applying the above weighting scheme, we get that if $F_{k}(n, rn)$ is unsatisfiable with probability tending to one as $n\rightarrow\infty$, then $r\geq2.83, 8.09, 18.91, 40.81, 84.87$ for $k=3, 4, 5, 6$ and $7,$ respectively.Comment: 8 pages. arXiv admin note: text overlap with arXiv:cs/0305009 by other author

Semi-Riemannian Manifold Optimization

We introduce in this paper a manifold optimization framework that utilizes semi-Riemannian structures on the underlying smooth manifolds. Unlike in Riemannian geometry, where each tangent space is equipped with a positive definite inner product, a semi-Riemannian manifold allows the metric tensor to be indefinite on each tangent space, i.e., possessing both positive and negative definite subspaces; differential geometric objects such as geodesics and parallel-transport can be defined on non-degenerate semi-Riemannian manifolds as well, and can be carefully leveraged to adapt Riemannian optimization algorithms to the semi-Riemannian setting. In particular, we discuss the metric independence of manifold optimization algorithms, and illustrate that the weaker but more general semi-Riemannian geometry often suffices for the purpose of optimizing smooth functions on smooth manifolds in practice.Comment: 36 pages, 3 figures, 9 pages of supplemental material

Mathematics Content Understanding for Cyberlearning via Formula Evolution Map

Although the scientific digital library is growing at a rapid pace, scholars/students often find reading Science, Technology, Engineering, and Mathematics (STEM) literature daunting, especially for the math-content/formula. In this paper, we propose a novel problem, ``mathematics content understanding'', for cyberlearning and cyberreading. To address this problem, we create a Formula Evolution Map (FEM) offline and implement a novel online learning/reading environment, PDF Reader with Math-Assistant (PRMA), which incorporates innovative math-scaffolding methods. The proposed algorithm/system can auto-characterize student emerging math-information need while reading a paper and enable students to readily explore the formula evolution trajectory in FEM. Based on a math-information need, PRMA utilizes innovative joint embedding, formula evolution mining, and heterogeneous graph mining algorithms to recommend high quality Open Educational Resources (OERs), e.g., video, Wikipedia page, or slides, to help students better understand the math-content in the paper. Evaluation and exit surveys show that the PRMA system and the proposed formula understanding algorithm can effectively assist master and PhD students better understand the complex math-content in the class readings.Comment: The 27th ACM International Conference on Information and Knowledge Management (CIKM2018) 37--4

Pyramidal RoR for Image Classification

The Residual Networks of Residual Networks (RoR) exhibits excellent performance in the image classification task, but sharply increasing the number of feature map channels makes the characteristic information transmission incoherent, which losses a certain of information related to classification prediction, limiting the classification performance. In this paper, a Pyramidal RoR network model is proposed by analysing the performance characteristics of RoR and combining with the PyramidNet. Firstly, based on RoR, the Pyramidal RoR network model with channels gradually increasing is designed. Secondly, we analysed the effect of different residual block structures on performance, and chosen the residual block structure which best favoured the classification performance. Finally, we add an important principle to further optimize Pyramidal RoR networks, drop-path is used to avoid over-fitting and save training time. In this paper, image classification experiments were performed on CIFAR-10/100 and SVHN datasets, and we achieved the current lowest classification error rates were 2.96%, 16.40% and 1.59%, respectively. Experiments show that the Pyramidal RoR network optimization method can improve the network performance for different data sets and effectively suppress the gradient disappearance problem in DCNN training.Comment: submit to Cluster Computin

Compressive Massive Random Access for Massive Machine-Type Communications (mMTC)

In future wireless networks, one fundamental challenge for massive machine-type communications (mMTC) lies in the reliable support of massive connectivity with low latency. Against this background, this paper proposes a compressive sensing (CS)-based massive random access scheme for mMTC by leveraging the inherent sporadic traffic, where both the active devices and their channels can be jointly estimated with low overhead. Specifically, we consider devices in the uplink massive random access adopt pseudo random pilots, which are designed under the framework of CS theory. Meanwhile, the massive random access at the base stations (BS) can be formulated as the sparse signal recovery problem by leveraging the sparse nature of active devices. Moreover, by exploiting the structured sparsity among different receiver antennas and subcarriers, we develop a distributed multiple measurement vector approximate message passing (DMMV-AMP) algorithm for further improved performance. Additionally, the state evolution (SE) of the proposed DMMV-AMP algorithm is derived to predict the performance. Simulation results demonstrate the superiority of the proposed scheme, which exhibits a good tightness with the theoretical SE.Comment: This paper has been accepted by 2018 IEEE GlobalSI

FPGA-based Acceleration System for Visual Tracking

Visual tracking is one of the most important application areas of computer vision. At present, most algorithms are mainly implemented on PCs, and it is difficult to ensure real-time performance when applied in the real scenario. In order to improve the tracking speed and reduce the overall power consumption of visual tracking, this paper proposes a real-time visual tracking algorithm based on DSST(Discriminative Scale Space Tracking) approach. We implement a hardware system on Xilinx XC7K325T FPGA platform based on our proposed visual tracking algorithm. Our hardware system can run at more than 153 frames per second. In order to reduce the resource occupation, our system adopts the batch processing method in the feature extraction module. In the filter processing module, the FFT IP core is time-division multiplexed. Therefore, our hardware system utilizes LUTs and storage blocks of 33% and 40%, respectively. Test results show that the proposed visual tracking hardware system has excellent performance.Comment: Accepted by IEEE 14th International Conference on Solid-State and Integrated Circuit Technology (ICSICT

APE-GAN: Adversarial Perturbation Elimination with GAN

Although neural networks could achieve state-of-the-art performance while recongnizing images, they often suffer a tremendous defeat from adversarial examples--inputs generated by utilizing imperceptible but intentional perturbation to clean samples from the datasets. How to defense against adversarial examples is an important problem which is well worth researching. So far, very few methods have provided a significant defense to adversarial examples. In this paper, a novel idea is proposed and an effective framework based Generative Adversarial Nets named APE-GAN is implemented to defense against the adversarial examples. The experimental results on three benchmark datasets including MNIST, CIFAR10 and ImageNet indicate that APE-GAN is effective to resist adversarial examples generated from five attacks.Comment: 14 page

Shared control schematic for brain controlled vehicle based on fuzzy logic

Brain controlled vehicle refers to the vehicle that obtains control commands by analyzing the driver's EEG through Brain-Computer Interface (BCI). The research of brain controlled vehicles can not only promote the integration of brain machines, but also expand the range of activities and living ability of the disabled or some people with limited physical activity, so the research of brain controlled vehicles is of great significance and has broad application prospects. At present, BCI has some problems such as limited recognition accuracy, long recognition time and limited number of recognition commands in the process of analyzing EEG signals to obtain control commands. If only use the driver's EEG signals to control the vehicle, the control performance is not ideal. Based on the concept of Shared control, this paper uses the fuzzy control (FC) to design an auxiliary controller to realize the cooperative control of automatic control and brain control. Designing a Shared controller which evaluates the current vehicle status and decides the switching mechanism between automatic control and brain control to improve the system control performance. Finally, based on the joint simulation platform of Carsim and MATLAB, with the simulated brain control signals, the designed experiment verifies that the control performance of the brain control vehicle can be improved by adding the auxiliary controller