Most papers are machine-translated to English; some are originally in English.
Showing 19 of 19 papers in Mathematics
Based on the general principles of "Zong Yi Ning Qi" (宗漪凝契)—specifically the core framework of "topology as the root, wave as the soul, and the three identities across three realms"—this paper focuses on black holes as extreme spacetime celestial bodies to construct a unified mathematical model of "…
Consciousness is considered the most challenging problem in the science of the mind, especially Chalmers' hard problem. From the standpoint of systems science philosophy, many consciousness theories overlook the structure-function correlation principle, thereby reducing their explanatory power regar…
Systematically excavating strategies with long-term evolutionary advantages in multi-agent systems constitutes a pivotal challenge in evolutionary game theory, complex systems science, and artificial intelligence research. This paper proposes and implements a unified strategy search framework—AI4Gam…
The image noise level indicates the degree to which an image is contaminated by noise, serving as a crucial parameter in image processing. For the third-order tensor corresponding to a color image, traditional methods for estimating the noise level disrupt the data structure of the tensor. To addres…
Based on the tensor-based large margin distribution and the nonparallel support tensor machine, we establish a novel classifier for binary classification problem in this paper, termed the Large Margin Distribution based NonParallel Support Tensor Machine (LDM-NPSTM). The proposed classifier has the …
In 1975, P. Erd\"{o}s proposed the problem of determining themaximum number $f(n)$ of edges in a graph of $n$ vertices inwhich any two cycles are of different lengths. In this paper, it is proved that $$f(n)\geq n+36t$$ for $t=1260r+169 \,\ (r\geq 1)$ and $n \geq 540t^{2}+\frac{175811}{2}t+\frac{798…
We present a new method for structural sequence analysis grounded in Algorithmic Information Theory (AIT). At its core is the Ladderpath approach, which extracts nested and hierarchical relationships among repeated substructures in linguistic sequences---an instantiation of AIT’s principle of descri…
A fractional-order proportional-derivative controller is designed to address bifurcation issues in a dual-time-delay fractional-order predator-prey model. By selecting different delays as bifurcation parameters, the stability and Hopf bifurcation conditions of the controlled system are derived. The …
Natural language is considered closely intertwined with human cognition, with linguistic structures posited to offer profound insights into the cognitive system. However, as a coding system, natural language encodes diverse objects into unified forms; its prominent formal features capture people’s a…
Keyboard-based interaction may not accommodate various needs, especially for individuals with disabilities. While inertial sensor-based writing recognition is promising due to the sensors’ small size, wearability, and low cost, accurate recognition in the Chinese context is hampered by the difficult…
OpenPFEM is a parallel finite element computing platform developed in C, designed for large-scale parallel finite element computations on high-performance computers. This paper introduces the fundamental architecture of OpenPFEM, with particular emphasis on our parallel data communication scheme bas…
In 1975, P. Erd {o}s proposed the problem of determining the maximum number $f(n)$ of edges in a graph of $n$ vertices in which any two cycles are of different lengths. In this paper, it is proved that $$f(n) geq n+32t-1$$ for $t=27720r+169 , (r geq 1)$ and $n geq frac{6911}{16}t^{2}+ frac{514441}{8…
In 1975, P. Erd {o}s proposed the problem of determining the maximum number $f(n)$ of edges in a graph with $n$ vertices in which any two cycles are of different lengths. In this paper, it is proved that $$f(n) geq n+ frac{107}{3}t+ frac{7}{3}$$ for $t=1260r+169 , (r geq 1)$ and $n geq frac{2119}{4}…
Let f(n) denote the maximum possible number of edges in an n-vertex graph containing no cycles of equal length. The problem of determining f(n) was posed by Erdos in 1975. This paper provides a lower bound for f(n).
This paper studies the regularity of weak solutions to non-degenerate divergence form subelliptic equations on the Heisenberg group. Based on more general assumptions on the coefficient matrix, this paper establishes, for both homogeneous and inhomogeneous cases, horizontal Calderón-Zygmund estimate…
Let $Z_n$ be a supercritical branching process in an i.i.d. environment. In this paper, we obtain two non-uniform Berry-Esseen bounds for $Z_n$. This result extends the Berry-Esseen bound of Grama et al. [Stochastic,Process.,Appl.,127(4),1255-1281,2017] to the non-uniform case. Finally, we discuss a…
In this paper, we propose and study a novel continuous-time model, based on the well-known constant elasticity of variance (CEV) model, to describe the asset price process. The basic idea is that the volatility elasticity of the CEV model cannot be treated as a constant from the perspective of stoch…
The 0.618 method is the most widely used approach in one-dimensional line search for unimodal functions. While it exhibits good convergence properties, its convergence rate is excessively slow. Therefore, based on the function values at the endpoints of the search interval and at any point within th…
Pascal's triangle is the triangular arrangement of binomial coefficients, from which one can obtain the Fibonacci sequence and the golden ratio (approximately 1.618). A question arises: Can the silver ratio (approximately 2.414) be obtained from Pascal's triangle? This paper first establishes a Maxi…
