|
Fast efficient estimation and application of partially linear single index model with fixed effects
DING Fei-peng, CHEN Jian-bao
Applied Mathematics A Journal of Chinese Universities, 2019, 34(2): 127-.
By combination of least square vector machine (LSSVM) with quadratic inference func- tions (QIF), this paper construct a new estimation method for partially linear single index panel model with fixed effects when responses from the same cluster are correlated. Under some regular condition, asymptotic normality of parametric estimators and convergence rate of non-parametric estimator are derived. The ˉnite sample performances of the proposed method are investigated by Monte Carlo simu- lation under di?erent correlation structures, and compared with penalized quadratic inference functions method (PQIF). The proposed estimation techniques are applied to analyse the relationship between population structure and residents’consumption rate. Our research results show that the e±ciency of estimators are improved by the proposed method, application e?ects are good, program operation has high speed, it is particularly suitable for analysis of linear, nonlinear relationship among economic variables and big data.
|
|
Shape-based BS algorithm for multiple change-points detection
ZHUANG Dan, LIU You-bo, MA Tie-feng
Applied Mathematics A Journal of Chinese Universities, 2019, 34(2): 151-.
BS algorithm is one of the classical algorithms for multiple change-points detection, it may bring about too many misjudgments and a high time complexity due to the procedure of global CUSUM statistic. On one hand, the BS algorithm is an o?-line sequential method, therefore the data timing information is not fully utilized. On the other hand, the principle of the BS algorithm to detect the change-points is to maximize the CUSUM statistic, which does not consider the morphological characteristics of the statistical constituent sequence. In view of these, the paper proposes an improved BS algorithm, named Shape-based BS algorithm, which is based on local shape recognition. Basing on the local pattern recognition of statistic sequence not only decreases the computational complexity, but also avoids mutual interference among change-points, and it could also promote the robustness in discerning change points. At last, this paper uses Shape-based BS algorithm to reduce the scenarios of electric power, and achieves satisfactory practical results.
|
|
Uniform topological spaces base on normal fuzzy ideals in negative non-involutive residuated lattices
LIU Chun-hui
Applied Mathematics A Journal of Chinese Universities, 2019, 34(2): 227-.
Topological structure is one of important research contents in the field of logical algebra. In order to describe the topological structure of negative non-involutive residuated lattices, based on the congruences induced by normal fuzzy ideals, uniform topological spaces are established and some of their properties are discussed. The following conclusions are proved: (1) every uniform topological space is ˉrst-countable, zero-dimensional, disconnected, locally compact and completely regular. (2) a uniform topological space is a T1 space i? it is a T2 space. (3) the lattice and adjoint operations in a negative non-involutive residuated lattice are continuous under the uniform topology, which make the negative non-involutive residuated lattice to be topological negative non-involutive residuated lattice. Meanwhile, some necessary and sufficient conditions for the uniform topological spaces to be compact and discrete are obtained. Finally, the relationships between algebraic isomorphism and topological homeomorphism in topological negative non-involutive residuated lattice are discussed. The results of this paper have a positive role to reveal internal features of negative non-involutive residuated lattices on a topological level.
|
|
Oriented graphs of the bipartite graph under degree
ZHANG Xue-fei, ZHENG Su-wen, XIA Jing, CAO Yi-peng, XU Fei
Applied Mathematics A Journal of Chinese Universities, 2019, 34(2): 239-.
A graph is bipartite if its vertex set can be partitioned into two subsets X and Y such that every edge has one end in X and one end in Y ; such a partition (X; Y ) is called a bipartition of the graph. A simple bipartite graph with bipartition (X; Y ) is called a complete bipartite graph if every vertex in X is adjacent to every vertex in Y . Furthermore, the complete bipartite graph is denoted by K_{m;n} if |X| = m and |Y| = n. It has known that if the in-degree of each vertex in an oriented graph of Kn;n is a or b, where a and b are two non-negative integers, then there exist two non-negative integers s and t satisfying the equations s + t = 2n and as + bt = n^2. This paper investigates oriented graphs of Kn;n, and proves the following results. Let s and t be two arbitrary non-negative integers. For two non-negative integers a and b satisfying the equations s+t = 2n and as+bt = n^2, there exists an oriented graph of Kn;n such that the in-degree of each vertex is a or b. This paper shows that the necessary condition is also su±cient for a complete bipartite graph K_{n;n}.
|
11 articles
|