Chen Xu

ORCID: 0009-0007-2737-882X
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Algebraic Geometry and Number Theory
  • Meromorphic and Entire Functions
  • Probability and Risk Models
  • Advanced Harmonic Analysis Research
  • Advanced Banach Space Theory
  • Statistical Distribution Estimation and Applications
  • Flow Measurement and Analysis
  • Algebraic structures and combinatorial models
  • Advanced Algebra and Geometry
  • Graph Labeling and Dimension Problems
  • Geometry and complex manifolds
  • Scientific Measurement and Uncertainty Evaluation
  • Financial Risk and Volatility Modeling
  • Graph theory and applications
  • Target Tracking and Data Fusion in Sensor Networks
  • Synthesis and Properties of Aromatic Compounds

Hefei University of Technology
2023

IIT@MIT
2020

Beijing Computing Center
2017

Anhui University
2014-2015

Guangzhou University
2014

10.1007/s10114-017-7048-8 article EN Acta Mathematica Sinica English Series 2017-07-10

10.1007/s10114-020-9300-x article EN Acta Mathematica Sinica English Series 2020-06-01

Uncertainty evaluation for unknown distribution data is a key problem to be solved in uncertainty theory. To evaluate the measurement of with distributions, novel method based on particle filter (PF) and beta proposed this paper. A wide adaptability was adopted as type results, parameters were taken estimated, state-space model established. The PF method, suitable non-Gaussian data, utilized obtain estimates according results. Finally, best results their calculated using parameters....

10.1063/5.0164859 article EN Review of Scientific Instruments 2023-09-01

Suppose that $G$ is a connected simple graph with the vertex set $V( G ) = \{ v_1,v_2,\cdots ,v_n \} $. Let $d( v_i,v_j $ be distance between $v_i$ and $v_j$. Then matrix of $D( =( d_{ij} )_{n\times n}$, where $d_{ij}=d( Since )$ non-negative real symmetric matrix, its eigenvalues can arranged $λ_1(G)\ge λ_2(G)\ge \cdots \ge λ_n(G)$, $λ_1(G)$ $λ_n(G)$ are called spectral radius least eigenvalue $G$, respectively. The {\it diameter} farthest all pairs vertices. In this paper, we determine...

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