A5103117284- Mathematical Dynamics and Fractals
- semigroups and automata theory
- Complex Network Analysis Techniques
- Cellular Automata and Applications
- Advanced Topology and Set Theory
- Complex Systems and Time Series Analysis
- Advanced Materials and Mechanics
- Statistical Mechanics and Entropy
- Topological and Geometric Data Analysis
- Theoretical and Computational Physics
- Computational Physics and Python Applications
- Modular Robots and Swarm Intelligence
- Fuzzy and Soft Set Theory
- Functional Equations Stability Results
- Advanced Banach Space Theory
- Forecasting Techniques and Applications
- Nonlinear Differential Equations Analysis
- Computability, Logic, AI Algorithms
- Tribology and Lubrication Engineering
- Micro and Nano Robotics
- Adhesion, Friction, and Surface Interactions
- Data Visualization and Analytics
- Interconnection Networks and Systems
- Opinion Dynamics and Social Influence
- Graph theory and applications
China University of Petroleum, East China
2024
Hubei Polytechnic University
2021-2023
Wuhan Textile University
2021
Central China Normal University
2015-2017
Institut Supérieur des Matériaux du Mans
2015
Université Nantes Angers Le Mans
2015
Le Mans Université
2015
Centre National de la Recherche Scientifique
2015
Generative data augmentation (GDA) has emerged as a promising technique to alleviate scarcity in machine learning applications. This thesis presents comprehensive survey and unified framework of the GDA landscape. We first provide an overview GDA, discussing its motivation, taxonomy, key distinctions from synthetic generation. then systematically analyze critical aspects - selection generative models, techniques utilize them, methodologies, validation approaches, diverse Our proposed...
We discuss cluster growing method and box-covering as well their connection to fractal geometry. Our measurements show that for small network systems, gives a better scaling relation. then measure both unweighted weighted metro networks with optimal method.
We obtain Hanson-Wright inequalities for the quadratic form of a random vector with independent sparse variables. Specifically, we consider cases where components are $\alpha$-sub-exponential variables $\alpha>0$. Our proof relies on novel combinatorial approach to estimate moments form.
The study of Lipschitz equivalence fractals is a very active topic in recent years. Most the studies literature concern totally disconnected fractals. In this paper, using finite state automata, we construct bi-Lipschitz map between two fractal squares which are not disconnected. This first non-trivial type. We also show that measure-preserving.
Complex networks have been extensively studied across many fields, especially in interdisciplinary areas. It has since long recognized that topological structures and dynamics are important aspects for capturing the essence of complex networks. The recent years also witnessed emergence several new elements which play roles network study. By combining results different research orientations our group, we provide here a review advances regards to spectral graph theory, opinion dynamics,...
The fractal square $F$ is defined by $F=\frac{1}{n}(F+\mathcal{D})$, where $\mathcal{D}=\{d_{1},d_{2},\ldots,d_{m}\}\subseteq\{0,1,\ldots,n-1\}^{2},~$ $n\geq~2$. In this paper, we study the structure of two non-totally disconnected squares in case $m=6$, $n=3$ and construct a map between them. Using finite state automaton, prove that bi-Lipschitz map.
In this paper, we aim at investigating how the energy of a graph depends upon its underlying topological structure for regular and sparse scale free networks. Firstly, spectra energies some simple graphs are calculated exactly an exact expression is derived eigenvalues adjacency matrix with degree k being given by = 2a (a 1, 2, 3,...). It also found that about 0.8N owns largest same size generating method used in paper. Furthermore, investigate scale-free networks different average < >...
The principle of least effort (PLE) is believed to be a universal rule for living systems. Its application the derivation power law probability distributions systems has long been challenging. Recently, measure efficiency was proposed as tool deriving Zipf’s and Pareto’s laws directly from PLE. This work further investigation this mathematical point view. aim get insight into its properties usefulness metric performance. We address some key such sign, uniqueness robustness. also look at...
The study of Lipschitz equivalence fractals is a very active topic in recent years. Most the studies literature concern totally disconnected fractals. In this paper, using neighbor automata self-similar sets and transducer, we construct bi-Lipschitz map between two fractal squares which are not disconnected. This first nontrivial construction type. We also show that measure-preserving.
Abstract The topological and metrical classifications of fractal sets are important topics in analysis. goal the present paper is to carry out such studies by using a finite state automaton. Firstly, we introduce Σ-automaton for self-similar sets, define topology automaton gaskets. Next, show that gasket always bi-Hölder equivalent pseudo-metric space induced its Thirdly, investigate when spaces different automata can be bi-Lipschitz equivalent. As an application, obtain rather general...
The topological and metrical equivalence of fractals is an important topic in analysis. In this paper, we use a class finite state automata, called $\Sigma$-automaton, to construct psuedo-metric spaces, then apply them the study classification self-similar sets. We first introduce notion topology automaton fractal gasket, which simplified version neighbor automaton; show that gasket homeomorphic space induced by automaton. Then universal map spaces different automata can be bi-Lipschitz...