Reduced Q-matrix （Qr matrix） plays an important role in the rule space model （RSM） and the attribute hierarchy method （AHM）. Based on the attribute hierarchy, a valid/invalid item is defined. The judgment method...Reduced Q-matrix （Qr matrix） plays an important role in the rule space model （RSM） and the attribute hierarchy method （AHM）. Based on the attribute hierarchy, a valid/invalid item is defined. The judgment method of the valid/invalid item is developed on the relation between reachability matrix and valid items. And valid items are explained from the perspective of graph theory. An incremental augment algorithm for constructing Qr matrix is proposed based on the idea of incremental forward regression, and its validity is theoretically considered. Results of empirical tests are given in order to compare the performance of the incremental augment algo-rithm and the Tatsuoka algorithm upon the running time. Empirical evidence shows that the algorithm outper-forms the Tatsuoka algorithm, and the analysis of the two algorithms also show linear growth with respect to the number of valid items. Mathematical models with 10 attributes are built for the two algorithms by the linear regression analysis.展开更多
This paper presents a matrix permuting approach to the construction of Low-Density Parity-Check (LDPC) code. It investigates the structure of the sparse parity-check matrix defined by Gallager. It is discovered that t...This paper presents a matrix permuting approach to the construction of Low-Density Parity-Check (LDPC) code. It investigates the structure of the sparse parity-check matrix defined by Gallager. It is discovered that the problem of constructing the sparse parity-check matrix requires an algorithm that is efficient in search environments and also is able to work with constraint satisfaction problem. The definition of Q-matrix is given, and it is found that the queen algorithm enables to search the Q-matrix. With properly permuting Q-matrix as sub-matrix, the sparse parity-check matrix which satisfied constraint condition is created, and the good regular-LDPC code that is called the Q-matrix LDPC code is generated. The result of this paper is significant not only for designing low complexity encoder, improving performance and reducing complexity of iterative decoding arithmetic, but also for building practical system of encodable and decodable LDPC code.展开更多
As it is well known,it is difficult to identify a nonlinear time varying system using traditional identification approaches,especially under unknown nonlinear function.Neural networks have recently emerged as a succes...As it is well known,it is difficult to identify a nonlinear time varying system using traditional identification approaches,especially under unknown nonlinear function.Neural networks have recently emerged as a successful tool in the area of identification and control of time invariant nonlinear systems.However,it is still difficult to apply them to complicated time varying system identification.In this paper we present a learning algorithm for identification of the nonlinear time varying system using feedforward neural networks.The main idea of this approach is that we regard the weights of the network as a state of a time varying system,then use a Kalman filter to estimate the state.Thus the network implements nonlinear and time varying mapping.We derived both the global and local learning algorithms.Simulation results demonstrate the effectiveness of this approach.展开更多
Considering the level distribution of soil layers, the soils surrounding pile are simulated with level finite layer elements. Supposing that the vertical deformation of the soil elements surrounding pile varies in the...Considering the level distribution of soil layers, the soils surrounding pile are simulated with level finite layer elements. Supposing that the vertical deformation of the soil elements surrounding pile varies in the form of exponent function with radial distance, and considering the nonlinear constitutive relation of stress and strain, the stiffness matrix is established. The mechanics behavior of the pile—soil interface is simulated with a nonlinear interface element. This method can truly express the behavior of the pile-soil system. The load-settlement relation Q-S curves of two big diameter prototype piles on bearing test are analyzed, and satisfying results are obtained. This method is reasonable in theory and feasible in engineering.展开更多
We consider decay properties including the decay parameter, invariant measures, invariant vectors, and quasistationary distributions for n-type Markov branching processes on the basis of the 1-type Markov branching pr...We consider decay properties including the decay parameter, invariant measures, invariant vectors, and quasistationary distributions for n-type Markov branching processes on the basis of the 1-type Markov branching processes and 2-type Markov branching processes. Investigating such behavior is crucial in realizing life period of branching models. In this paper, some important properties of the generating functions for n-type Markov branching q-matrix are firstly investigated in detail. The exact value of the decay parameter λC of such model is given for the communicating class C = Zn+ \ 0. It is shown that this λC can be directly obtained from the generating functions of the corresponding q-matrix. Moreover, the λC -invariant measures/vectors and quasi-distributions of such processes are deeply considered. λC -invariant measures and quasi-stationary distributions for the process on C are presented.展开更多
基金Supported by the National Natural Science Foundation of China (30860084,60673014,60263005)the Backbone Young Teachers Foundation of Fujian Normal University(2008100244)the Department of Education Foundation of Fujian Province (ZA09047)~~
文摘Reduced Q-matrix （Qr matrix） plays an important role in the rule space model （RSM） and the attribute hierarchy method （AHM）. Based on the attribute hierarchy, a valid/invalid item is defined. The judgment method of the valid/invalid item is developed on the relation between reachability matrix and valid items. And valid items are explained from the perspective of graph theory. An incremental augment algorithm for constructing Qr matrix is proposed based on the idea of incremental forward regression, and its validity is theoretically considered. Results of empirical tests are given in order to compare the performance of the incremental augment algo-rithm and the Tatsuoka algorithm upon the running time. Empirical evidence shows that the algorithm outper-forms the Tatsuoka algorithm, and the analysis of the two algorithms also show linear growth with respect to the number of valid items. Mathematical models with 10 attributes are built for the two algorithms by the linear regression analysis.
基金Supported by the National Natural Science Foundation of China (No.60572050)by the National Science Foundation of Hubei Province (No.2004ABA049)
文摘This paper presents a matrix permuting approach to the construction of Low-Density Parity-Check (LDPC) code. It investigates the structure of the sparse parity-check matrix defined by Gallager. It is discovered that the problem of constructing the sparse parity-check matrix requires an algorithm that is efficient in search environments and also is able to work with constraint satisfaction problem. The definition of Q-matrix is given, and it is found that the queen algorithm enables to search the Q-matrix. With properly permuting Q-matrix as sub-matrix, the sparse parity-check matrix which satisfied constraint condition is created, and the good regular-LDPC code that is called the Q-matrix LDPC code is generated. The result of this paper is significant not only for designing low complexity encoder, improving performance and reducing complexity of iterative decoding arithmetic, but also for building practical system of encodable and decodable LDPC code.
基金National Natural Science Foundation of China!(No.6 97740 33)
文摘As it is well known,it is difficult to identify a nonlinear time varying system using traditional identification approaches,especially under unknown nonlinear function.Neural networks have recently emerged as a successful tool in the area of identification and control of time invariant nonlinear systems.However,it is still difficult to apply them to complicated time varying system identification.In this paper we present a learning algorithm for identification of the nonlinear time varying system using feedforward neural networks.The main idea of this approach is that we regard the weights of the network as a state of a time varying system,then use a Kalman filter to estimate the state.Thus the network implements nonlinear and time varying mapping.We derived both the global and local learning algorithms.Simulation results demonstrate the effectiveness of this approach.
文摘Considering the level distribution of soil layers, the soils surrounding pile are simulated with level finite layer elements. Supposing that the vertical deformation of the soil elements surrounding pile varies in the form of exponent function with radial distance, and considering the nonlinear constitutive relation of stress and strain, the stiffness matrix is established. The mechanics behavior of the pile—soil interface is simulated with a nonlinear interface element. This method can truly express the behavior of the pile-soil system. The load-settlement relation Q-S curves of two big diameter prototype piles on bearing test are analyzed, and satisfying results are obtained. This method is reasonable in theory and feasible in engineering.
基金supported by National Natural Sciences Foundation of China (Grant No.11071259)Research Fund for the Doctoral Program of Higher Education of China (Grant No. 20110162110060)+1 种基金the Fundamental Research Funds for the Central Universities (Grant No. 2010QYZD001)the Graduate Degree Thesis Innovation Foundation of Hunan Province (Grant No. CX2011B077)
文摘We consider decay properties including the decay parameter, invariant measures, invariant vectors, and quasistationary distributions for n-type Markov branching processes on the basis of the 1-type Markov branching processes and 2-type Markov branching processes. Investigating such behavior is crucial in realizing life period of branching models. In this paper, some important properties of the generating functions for n-type Markov branching q-matrix are firstly investigated in detail. The exact value of the decay parameter λC of such model is given for the communicating class C = Zn+ \ 0. It is shown that this λC can be directly obtained from the generating functions of the corresponding q-matrix. Moreover, the λC -invariant measures/vectors and quasi-distributions of such processes are deeply considered. λC -invariant measures and quasi-stationary distributions for the process on C are presented.
