Zhe Chen

Zhe Chen
Are you Zhe Chen?

Claim your profile, edit publications, add additional information:

Contact Details

Name
Zhe Chen
Affiliation
Location

Pubs By Year

Pub Categories

 
Computer Science - Networking and Internet Architecture (5)
 
Mathematics - Probability (3)
 
Computer Science - Software Engineering (3)
 
Computer Science - Logic in Computer Science (2)
 
Mathematics - Algebraic Geometry (2)
 
Statistics - Machine Learning (2)
 
Mathematics - Representation Theory (2)
 
Computer Science - Information Theory (2)
 
Mathematics - Information Theory (2)
 
Computer Science - Artificial Intelligence (2)
 
Physics - Computational Physics (1)
 
Astrophysics (1)
 
Physics - Chemical Physics (1)
 
Computer Science - Human-Computer Interaction (1)
 
Computer Science - Symbolic Computation (1)
 
Computer Science - Computer Science and Game Theory (1)
 
Statistics - Theory (1)
 
Mathematics - Statistics (1)
 
Computer Science - Computer Vision and Pattern Recognition (1)
 
Computer Science - Computers and Society (1)
 
Statistics - Methodology (1)
 
Computer Science - Distributed; Parallel; and Cluster Computing (1)
 
Physics - Disordered Systems and Neural Networks (1)
 
Physics - Biological Physics (1)
 
Quantitative Biology - Neurons and Cognition (1)
 
Physics - Mesoscopic Systems and Quantum Hall Effect (1)

Publications Authored By Zhe Chen

In the era of big data and Internet of things, massive sensor data are gathered with Internet of things. Quantity of data captured by sensor networks are considered to contain highly useful and valuable information. However, for a variety of reasons, received sensor data often appear abnormal. Read More

Cognitive radio technology enables improving the utilization efficiency of the precious and scarce radio spectrum. How to maximize the overall spectrum efficiency while minimizing the conflicts with primary users is vital to cognitive radio. The key is to make the right decisions of accessing the spectrum. Read More

In this article we study the existence of pathwise Stieltjes integrals of the form $\int f(X_t)\, dY_t$ for nonrandom, possibly discontinuous, evaluation functions $f$ and H\"older continuous random processes $X$ and $Y$. We discuss a notion of sufficient variability for the process $X$ which ensures that the paths of the composite process $t \mapsto f(X_t)$ are almost surely regular enough to be integrable. We show that the pathwise integral can be defined as a limit of Riemann-Stieltjes sums for a large class of discontinuous evaluation functions of locally finite variation, and provide new estimates on the accuracy of numerical approximations of such integrals, together with a change of variables formula for integrals of the form $\int f(X_t) \, dX_t$. Read More

Visible light communication (VLC) could provide short-range optical wireless communication together with illumination using LED lighting. However, conventional forward error correction (FEC) codes for reliable communication do not have the features for dimming support and flicker mitigation which are required in VLC for the main functionality of lighting. Therefore, auxiliary coding techniques are usually needed, which eventually reduce the coding efficiency and increase the complexity. Read More

Here we consider a construction of generic character sheaves on reductive groups over a finite ring at even levels, as well as the relevant induction and restriction functors, and a variant of Frobenius reciprocity. This is motivated by an algebraisation theorem in higher Deligne--Lusztig theory. Read More

In this paper we study higher Deligne--Lusztig representations of reductive groups over finite quotients of discrete valuation rings. At even levels, we show that these geometrically constructed representations coincide with certain induced representations in the generic case; this gives a solution to a problem raised by Lusztig. In particular, we determine the dimensions of these representations. Read More

Emerging technologies, such as big data, Internet of things, cloud computing, mobile Internet, and robotics, breed and expedite new applications and fields. In the mean while, the long-term prosperity and happiness of human race demands advanced technologies. In this paper, the aforementioned emerging technologies are applied to management and governance for the long-term prosperity and happiness of human race. Read More

Over these years, Correlation Filter-based Trackers (CFTs) have aroused increasing interests in the field of visual object tracking, and have achieved extremely compelling results in different competitions and benchmarks. In this paper, our goal is to review the developments of CFTs with extensive experimental results. 11 trackers are surveyed in our work, based on which a general framework is summarized. Read More

In this paper, a nonparametric maximum likelihood (ML) estimator for band-limited (BL) probability density functions (pdfs) is proposed. The BLML estimator is consistent and computationally efficient. To compute the BLML estimator, three approximate algorithms are presented: a binary quadratic programming (BQP) algorithm for medium scale problems, a Trivial algorithm for large-scale problems that yields a consistent estimate if the underlying pdf is strictly positive and BL, and a fast implementation of the Trivial algorithm that exploits the band-limited assumption and the Nyquist sampling theorem ("BLMLQuick"). Read More

Rodent hippocampal population codes represent important spatial information about the environment during navigation. Several computational methods have been developed to uncover the neural representation of spatial topology embedded in rodent hippocampal ensemble spike activity. Here we extend our previous work and propose a nonparametric Bayesian approach to infer rat hippocampal population codes during spatial navigation. Read More

This paper deals with stochastic integrals of form $\int_0^T f(X_u)d Y_u$ in a case where the function $f$ has discontinuities, and hence the process $f(X)$ is usually of unbounded $p$-variation for every $p\geq 1$. Consequently, integration theory introduced by Young or rough path theory introduced by Lyons cannot be applied directly. In this paper we prove the existence of such integrals in a pathwise sense provided that $X$ and $Y$ have suitably regular paths together with some minor additional assumptions. Read More

Following fast growth of cellular networks, more users have drawn attention to the contradiction between dynamic user data traffic and static data plans. To address this important but largely unexplored issue, in this paper, we design a new data plan sharing system named Prometheus, which is based on the scenario that some smartphone users have surplus data traffic and are willing to help others download data. To realize this system, we first propose a mechanism that incorporates LT codes into UDP. Read More

In this article we study existence of pathwise stochastic integrals with respect to a general class of $n$-dimensional Gaussian processes and a wide class of adapted integrands. More precisely, we study integrands which are functions that are of locally bounded variation with respect to all variables. Moreover, multidimensional It\^o formula is derived. Read More

We present a multi-scale simulation of early stage of DNA damages by the indirect action of hydroxyl ($^\bullet$OH) free radicals generated by electrons and protons. The computational method comprises of interfacing the Geant4-DNA Monte Carlo with the ReaxFF molecular dynamics software. A clustering method was employed to map the coordinates of $^\bullet$OH-radicals extracted from the ionization track-structures onto nano-meter simulation voxels filled with DNA and water molecules. Read More

An \omega-grammar is a formal grammar used to generate \omega-words (i.e. infinite length words), while an \omega-automaton is an automaton used to recognize \omega-words. Read More

This paper surveys how formal verification can be used to prove the correctness of ad hoc routing protocols, which are fundamental infrastructure of wireless sensor networks. The existing techniques fall into two classes: verification on small-scale networks and verification on unbounded networks. The former one is always fully automatic and easy to use, thanks to the limited state space generated in verification. Read More

There is a trend of applying machine learning algorithms to cognitive radio. One fundamental open problem is to determine how and where these algorithms are useful in a cognitive radio network. In radar and sensing signal processing, the control of degrees of freedom (DOF)---or dimensionality---is the first step, called pre-processing. Read More

Most recent software related accidents have been system accidents. To validate the absence of system hazards concerning dysfunctional interactions, industrials call for approaches of modeling system safety requirements and interaction constraints among components and with environments (e.g. Read More

Safety is an important element of dependability. It is defined as the absence of accidents. Most accidents involving software-intensive systems have been system accidents, which are caused by unsafe inter-system or inter-component interactions. Read More

Guidelines and consistency rules of UML are used to control the degrees of freedom provided by the language to prevent faults. Guidelines are used in specific domains (e.g. Read More

The Sudoku puzzle has achieved worldwide popularity recently, and attracted great attention of the computational intelligence community. Sudoku is always considered as Satisfiability Problem or Constraint Satisfaction Problem. In this paper, we propose to focus on the essential graph structure underlying the Sudoku puzzle. Read More

With the development of Natural Language Processing (NLP), more and more systems want to adopt NLP in User Interface Module to process user input, in order to communicate with user in a natural way. However, this raises a speed problem. That is, if NLP module can not process sentences in durable time delay, users will never use the system. Read More

The supernova yields of r-process elements are obtained as a function of the mass of their progenitor stars from the abundance patterns of extremely metal-poor stars on the left-side [Ba/Mg]-[Mg/H] boundary with a procedure proposed by Tsujimoto and Shigeyama. The ejected masses of r-process elements associated with stars of progenitor mass $M_{ms}\leq18M_{\odot}$ are infertile sources and the SNe II with 20$M_{\odot}\leq M_{ms}\leq 40M_{\odot}$are the dominant source of r-process nucleosynthesis in the Galaxy. The ratio of these stars 20$M_{\odot}\leq M_{ms}\leq40M_{\odot}$ with compared to the all massive stars is about $\sim$18%. Read More