Feng Zhou

ORCID: 0000-0003-0842-306X
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Point processes and geometric inequalities
  • Diffusion and Search Dynamics
  • Bayesian Methods and Mixture Models
  • Gaussian Processes and Bayesian Inference
  • Mathematical Dynamics and Fractals
  • Neural dynamics and brain function
  • Statistical Methods and Inference
  • Quantum chaos and dynamical systems
  • Transportation Planning and Optimization
  • Drilling and Well Engineering
  • Air Quality Monitoring and Forecasting
  • advanced mathematical theories
  • Image Processing Techniques and Applications
  • Spectroscopy and Chemometric Analyses
  • Privacy-Preserving Technologies in Data
  • Morphological variations and asymmetry
  • Markov Chains and Monte Carlo Methods
  • Advanced Computational Techniques and Applications
  • Rough Sets and Fuzzy Logic
  • Cellular Automata and Applications
  • Big Data Technologies and Applications
  • Spectral Theory in Mathematical Physics
  • Domain Adaptation and Few-Shot Learning
  • Radiation Effects in Electronics
  • Computational and Text Analysis Methods

Renmin University of China
2023-2025

Chinese University of Hong Kong
2022-2024

State Grid Corporation of China (China)
2024

Beijing Advanced Sciences and Innovation Center
2024

Tsinghua University
2005-2021

UNSW Sydney
2018-2021

China Electric Power Research Institute
2021

Taiyuan University of Technology
2021

University of Technology Sydney
2020

Abstract Intermediate dimensions were recently introduced by Falconer et al. (Math Z 296:813–830, 2020) to interpolate between the Hausdorff and box-counting dimensions. In this paper, we show that for every subset E of symbolic space, intermediate projections under typical self-affine coding maps are constant given formulas in terms capacities. Moreover, extend results generalized Banaji (Monatsh Math 202: 465–506, 2023) several settings, including orthogonal Euclidean spaces images...

10.1007/s00209-024-03490-z article EN cc-by Mathematische Zeitschrift 2024-04-26

Social networks represent complex ecosystems where the interactions between users or groups play a pivotal role in information dissemination, opinion formation, and social interactions. Effectively harnessing event sequence data within to unearth among has persistently posed challenging frontier realm of point processes. Current deep process models face inherent limitations context networks, constraining both their interpretability expressive power. These encounter challenges capturing often...

10.1145/3637528.3671720 article EN Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining 2024-08-24

Abstract We present a bee foraging behavior-driven mutational salp swarm algorithm (BMSSA) based on an improved strategy and unscented mutation strategy. The is leveraged in the follower location update phase to break fixed range search of algorithm, while optimal solution employed enhance quality solution. Extensive experimental results public CEC 2014 benchmark functions validate that proposed BMSSA performs better than nine well-known metaheuristic methods seven state-of-the-art...

10.1093/jcde/qwad092 article EN cc-by-nc Journal of Computational Design and Engineering 2023-10-19

In classical Hawkes process, the baseline intensity and triggering kernel are assumed to be a constant parametric function respectively, which limits model flexibility. To generalize it, we present fully Bayesian nonparametric model, namely Gaussian process modulated propose an EM-variational inference scheme. this transformation of is used as prior on kernel. By introducing latent branching structure, decoupled variational scheme embedded into EM framework naturally. We also provide series...

10.48550/arxiv.1905.12251 preprint EN other-oa arXiv (Cornell University) 2019-01-01

In this paper, we provide an algorithm to estimate from below the dimension of self-similar measures with overlaps. As application, show that for any β ∈ ( 1 , 2 ) $ \beta \in (1,2)$ Bernoulli convolution μ \mu _{\beta }$ satisfies dim ⩾ 0.98040856 \begin{equation*}\hskip7pc \dim (\mu })\geqslant 0.98040856,\hskip-7pc\vspace*{-6pt} \end{equation*} which improves a previous uniform lower bound 0.82 obtained by Hare and Sidorov (Exp. Math. 27 (2018), no. 4, 414–418). This new is very close...

10.1112/jlms.12555 article EN Journal of the London Mathematical Society 2022-02-16

Let $ \mu be the self-similar measure associated with a homogeneous iterated function system \Phi = \{ \lambda x + t_j \}_{j=1}^m on ${\Bbb R}$ and probability vector (p_{j})_{j=1}^m$, where $0\neq \lambda\in (-1,1)$ $t_j\in {\Bbb R}$. Recently by modifying arguments of Varj\'u (2019), Rapaport (2024) showed that if $t_1,\ldots, t_m$ are rational numbers $0<\lambda<1$, then $$ \dim =\min\Big 1, \; \frac{\sum_{j=1}^m p_{j}\log p_{j}}{ \log |\lambda| }\Big\}$$ unless has exact overlaps. In...

10.48550/arxiv.2405.03124 preprint EN arXiv (Cornell University) 2024-05-05

10.1109/ceepe62022.2024.10586403 article EN 2022 5th International Conference on Energy, Electrical and Power Engineering (CEEPE) 2024-04-26

10.1109/cvpr52733.2024.02251 article EN 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) 2024-06-16

Imaging logging is an important technical means in evaluation of complex reservoirs. Through imaging logging, a two-dimensional image the resistivity distribution around well can be obtained, which used to evaluate development wall fractures and caves formation sedimentary structure. However, due characteristics instruments, blank strips will appear on image, increases difficulty computer processing electrical data. The current repair method existing neural network are not effective enough...

10.59782/sidr.v5i1.158 article EN cc-by-nc-nd Scientific insights and discoveries review 2024-10-14

Existing permanental processes often impose constraints on kernel types or stationarity, limiting the model's expressiveness. To overcome these limitations, we propose a novel approach utilizing sparse spectral representation of nonstationary kernels. This technique relaxes and allowing for more flexible modeling while reducing computational complexity to linear level. Additionally, introduce deep variant by hierarchically stacking multiple feature mappings, further enhancing expressiveness...

10.48550/arxiv.2410.03581 preprint EN arXiv (Cornell University) 2024-10-04

10.4310/ajm.2023.v27.n5.a1 article EN Asian Journal of Mathematics 2023-01-01

In this paper, we provide an algorithm to estimate from below the dimension of self-similar measures with overlaps. As application, show that for any $ β\in(1,2) $, Bernoulli convolution μ_β$ satisfies \[ \dim (μ_β) \geq 0.9804085,\] which improves a previous uniform lower bound $0.82$ obtained by Hare and Sidorov \cite{HareSidorov2018}. This new is very close known numerical approximation 0.98040931953\pm 10^{-11}$ $\dim μ_{β_3}$, where β_{3} \approx 1.839286755214161$ largest root...

10.48550/arxiv.2103.01700 preprint EN other-oa arXiv (Cornell University) 2021-01-01

In this paper, we consider the sigmoid Gaussian Hawkes process model: baseline intensity and triggering kernel of are both modeled as transformation random trajectories drawn from processes (GP). By introducing auxiliary latent variables (branching structure, Pólya-Gamma marked Poisson processes), likelihood is converted to two decoupled components with a form which allows for an efficient conjugate analytical inference. Using augmented likelihood, derive expectation-maximization (EM)...

10.48550/arxiv.1910.13052 preprint EN other-oa arXiv (Cornell University) 2019-01-01

Hawkes process provides an effective statistical framework for analyzing the time-dependent interaction of neuronal spiking activities. Although utilized in many real applications, classic is incapable modelling inhibitory interactions among neurons. Instead, nonlinear allows a more flexible influence pattern with excitatory or interactions. In this paper, three sets auxiliary latent variables (P\'{o}lya-Gamma variables, marked Poisson processes and sparsity variables) are augmented to make...

10.48550/arxiv.2006.12845 preprint EN other-oa arXiv (Cornell University) 2020-01-01
Coming Soon ...