To efficiently compute arbitrary propellant grain evolution of the burning surface with uniform and non-uniform burning rate for solid rocket motor,a unified framework of burning surface regression simulation has been...To efficiently compute arbitrary propellant grain evolution of the burning surface with uniform and non-uniform burning rate for solid rocket motor,a unified framework of burning surface regression simulation has been developed based on minimum distance function.In order to speed up the computation of the mini-mum distance between grid nodes of grain and the triangular mesh of burning surface,a fast distance querying method based on the equal size cube voxel structure was employed.An improved marching tetrahedron method based on piecewise linear approximation was carried out on second-order tetrahedral elements,achieved high-efficiency and adequate accuracy of burning surface extraction simultaneously.The cases of star grain,finocyl grain,and non-uniform tube grain were studied to verify the proposed method.The observed result indicates that the grain burnback computation method could realize the accurate simulation on unstructured tetrahedral mesh with a desirable performance on computational time.展开更多
In this paper, only narrow-sense primitive BCH codes over GF(q) are considered. A formula, that can be used in many cases, is first presented for computing the dimension of BCH codes. It improves the result given by M...In this paper, only narrow-sense primitive BCH codes over GF(q) are considered. A formula, that can be used in many cases, is first presented for computing the dimension of BCH codes. It improves the result given by MacWilliams and Sloane in 1977. A new method for finding the dimension of all types of BCH codes is proposed. In second part, it is proved that the BCH bound is the leader of some cyclotomic coset, and we guess that the minimum distance for any BCH code is also the leader of some cyclotomic coset.展开更多
The minimum squared Euclidean distance(MSED) of binary multi-h phase codes is presented. The signal segregation degree(SSD) has been put forward to determine MSED of multi-h phase codes. In order to maximize MSED, SSD...The minimum squared Euclidean distance(MSED) of binary multi-h phase codes is presented. The signal segregation degree(SSD) has been put forward to determine MSED of multi-h phase codes. In order to maximize MSED, SSD should be as large as possible. The necessary and sufficient conditions of maximizing SSD are derived. Finally, SSD and the exact formulae for MSED of binary 2-h phase codes are also presented.展开更多
In case of heteroscedasticity, a Generalized Minimum Perpendicular Distance Square (GMPDS) method has been suggested instead of traditionally used Generalized Least Square (GLS) method to fit a regression line, with a...In case of heteroscedasticity, a Generalized Minimum Perpendicular Distance Square (GMPDS) method has been suggested instead of traditionally used Generalized Least Square (GLS) method to fit a regression line, with an aim to get a better fitted regression line, so that the estimated line will be closest one to the observed points. Mathematical form of the estimator for the parameters has been presented. A logical argument behind the relationship between the slopes of the lines and has been placed.展开更多
MDM (minimum distance method) is a very popular algorithm in staterecognition. But it has a presupposition, that is, the distance within one class must be shorterenough than the distance between classes. When this pre...MDM (minimum distance method) is a very popular algorithm in staterecognition. But it has a presupposition, that is, the distance within one class must be shorterenough than the distance between classes. When this presupposition is not satisfied, the method isno longer valid. In order to overcome the shortcomings of MDM, an improved minimum distance method(IMDM) based on ANN (artificial neural networks) is presented. The simulation results demonstratethat IMDM has two advantages, that is, the rate of recognition is faster and the accuracy ofrecognition is higher compared with MDM.展开更多
By extending the notion of the minimum distance for linear network error correction code(LNEC), this paper introduces the concept of generalized minimum rank distance(GMRD) of variable-rate linear network error correc...By extending the notion of the minimum distance for linear network error correction code(LNEC), this paper introduces the concept of generalized minimum rank distance(GMRD) of variable-rate linear network error correction codes. The basic properties of GMRD are investigated. It is proved that GMRD can characterize the error correction/detection capability of variable-rate linear network error correction codes when the source transmits the messages at several different rates.展开更多
The evaluation of the minimum distance of linear block codes remains an open problem in coding theory, and it is not easy to determine its true value by classical methods, for this reason the problem has been solved i...The evaluation of the minimum distance of linear block codes remains an open problem in coding theory, and it is not easy to determine its true value by classical methods, for this reason the problem has been solved in the literature with heuristic techniques such as genetic algorithms and local search algorithms. In this paper we propose two approaches to attack the hardness of this problem. The first approach is based on genetic algorithms and it yield to good results comparing to another work based also on genetic algorithms. The second approach is based on a new randomized algorithm which we call 'Multiple Impulse Method (MIM)', where the principle is to search codewords locally around the all-zero codeword perturbed by a minimum level of noise, anticipating that the resultant nearest nonzero codewords will most likely contain the minimum Hamming-weight codeword whose Hamming weight is equal to the minimum distance of the linear code.展开更多
Musical rhythms are represented as sequences of symbols. The sequences may be composed of binary symbols denoting either silent or monophonic sounded pulses, or ternary symbols denoting silent pulses and two types of ...Musical rhythms are represented as sequences of symbols. The sequences may be composed of binary symbols denoting either silent or monophonic sounded pulses, or ternary symbols denoting silent pulses and two types of sounded pulses made up of low-pitched (dum) and high-pitched (tak) sounds. Experiments are described that compare the effectiveness of the many-to-many minimum-weight matching between two sequences to serve as a measure of similarity that correlates well with human judgements of rhythm similarity. This measure is also compared to the often used edit distance and to the one-to-one minimum-weight matching. New results are reported from experiments performed with three widely different datasets of real- world and artificially generated musical rhythms (including Afro-Cuban rhythms), and compared with results previously reported with a dataset of Middle Eastern dum-tak rhythms.展开更多
Maximum likelihood (ML) estimation for the generalized asymmetric Laplace (GAL) distribution also known as Variance gamma using simplex direct search algorithms is investigated. In this paper, we use numerical direct ...Maximum likelihood (ML) estimation for the generalized asymmetric Laplace (GAL) distribution also known as Variance gamma using simplex direct search algorithms is investigated. In this paper, we use numerical direct search techniques for maximizing the log-likelihood to obtain ML estimators instead of using the traditional EM algorithm. The density function of the GAL is only continuous but not differentiable with respect to the parameters and the appearance of the Bessel function in the density make it difficult to obtain the asymptotic covariance matrix for the entire GAL family. Using M-estimation theory, the properties of the ML estimators are investigated in this paper. The ML estimators are shown to be consistent for the GAL family and their asymptotic normality can only be guaranteed for the asymmetric Laplace (AL) family. The asymptotic covariance matrix is obtained for the AL family and it completes the results obtained previously in the literature. For the general GAL model, alternative methods of inferences based on quadratic distances (QD) are proposed. The QD methods appear to be overall more efficient than likelihood methods infinite samples using sample sizes n ≤5000 and the range of parameters often encountered for financial data. The proposed methods only require that the moment generating function of the parametric model exists and has a closed form expression and can be used for other models.展开更多
The resistance status of a vertex of a connected graph is the sum of the resistance distance between this vertex and any other vertices of the graph. The minimum(maximum,resp.) resistance status of a connected graph i...The resistance status of a vertex of a connected graph is the sum of the resistance distance between this vertex and any other vertices of the graph. The minimum(maximum,resp.) resistance status of a connected graph is the minimum(maximum, resp.) resistance status of all vertices of the graph. In this paper, we determine the extremal values and corresponding extremal graphs for the minimum(maximum, resp.) resistance status over all unicyclic graphs of fixed order, and we also discuss the dependence of the minimum(maximum, resp.) resistance status on the girth of unicyclic graphs.展开更多
基金the National Natural Science Foundation of China(No.11202224)。
文摘To efficiently compute arbitrary propellant grain evolution of the burning surface with uniform and non-uniform burning rate for solid rocket motor,a unified framework of burning surface regression simulation has been developed based on minimum distance function.In order to speed up the computation of the mini-mum distance between grid nodes of grain and the triangular mesh of burning surface,a fast distance querying method based on the equal size cube voxel structure was employed.An improved marching tetrahedron method based on piecewise linear approximation was carried out on second-order tetrahedral elements,achieved high-efficiency and adequate accuracy of burning surface extraction simultaneously.The cases of star grain,finocyl grain,and non-uniform tube grain were studied to verify the proposed method.The observed result indicates that the grain burnback computation method could realize the accurate simulation on unstructured tetrahedral mesh with a desirable performance on computational time.
文摘In this paper, only narrow-sense primitive BCH codes over GF(q) are considered. A formula, that can be used in many cases, is first presented for computing the dimension of BCH codes. It improves the result given by MacWilliams and Sloane in 1977. A new method for finding the dimension of all types of BCH codes is proposed. In second part, it is proved that the BCH bound is the leader of some cyclotomic coset, and we guess that the minimum distance for any BCH code is also the leader of some cyclotomic coset.
文摘The minimum squared Euclidean distance(MSED) of binary multi-h phase codes is presented. The signal segregation degree(SSD) has been put forward to determine MSED of multi-h phase codes. In order to maximize MSED, SSD should be as large as possible. The necessary and sufficient conditions of maximizing SSD are derived. Finally, SSD and the exact formulae for MSED of binary 2-h phase codes are also presented.
文摘In case of heteroscedasticity, a Generalized Minimum Perpendicular Distance Square (GMPDS) method has been suggested instead of traditionally used Generalized Least Square (GLS) method to fit a regression line, with an aim to get a better fitted regression line, so that the estimated line will be closest one to the observed points. Mathematical form of the estimator for the parameters has been presented. A logical argument behind the relationship between the slopes of the lines and has been placed.
基金This work was financially supported by the National Natural Science Foundation of China under the contract No.69372031.]
文摘MDM (minimum distance method) is a very popular algorithm in staterecognition. But it has a presupposition, that is, the distance within one class must be shorterenough than the distance between classes. When this presupposition is not satisfied, the method isno longer valid. In order to overcome the shortcomings of MDM, an improved minimum distance method(IMDM) based on ANN (artificial neural networks) is presented. The simulation results demonstratethat IMDM has two advantages, that is, the rate of recognition is faster and the accuracy ofrecognition is higher compared with MDM.
文摘By extending the notion of the minimum distance for linear network error correction code(LNEC), this paper introduces the concept of generalized minimum rank distance(GMRD) of variable-rate linear network error correction codes. The basic properties of GMRD are investigated. It is proved that GMRD can characterize the error correction/detection capability of variable-rate linear network error correction codes when the source transmits the messages at several different rates.
文摘The evaluation of the minimum distance of linear block codes remains an open problem in coding theory, and it is not easy to determine its true value by classical methods, for this reason the problem has been solved in the literature with heuristic techniques such as genetic algorithms and local search algorithms. In this paper we propose two approaches to attack the hardness of this problem. The first approach is based on genetic algorithms and it yield to good results comparing to another work based also on genetic algorithms. The second approach is based on a new randomized algorithm which we call 'Multiple Impulse Method (MIM)', where the principle is to search codewords locally around the all-zero codeword perturbed by a minimum level of noise, anticipating that the resultant nearest nonzero codewords will most likely contain the minimum Hamming-weight codeword whose Hamming weight is equal to the minimum distance of the linear code.
文摘Musical rhythms are represented as sequences of symbols. The sequences may be composed of binary symbols denoting either silent or monophonic sounded pulses, or ternary symbols denoting silent pulses and two types of sounded pulses made up of low-pitched (dum) and high-pitched (tak) sounds. Experiments are described that compare the effectiveness of the many-to-many minimum-weight matching between two sequences to serve as a measure of similarity that correlates well with human judgements of rhythm similarity. This measure is also compared to the often used edit distance and to the one-to-one minimum-weight matching. New results are reported from experiments performed with three widely different datasets of real- world and artificially generated musical rhythms (including Afro-Cuban rhythms), and compared with results previously reported with a dataset of Middle Eastern dum-tak rhythms.
文摘Maximum likelihood (ML) estimation for the generalized asymmetric Laplace (GAL) distribution also known as Variance gamma using simplex direct search algorithms is investigated. In this paper, we use numerical direct search techniques for maximizing the log-likelihood to obtain ML estimators instead of using the traditional EM algorithm. The density function of the GAL is only continuous but not differentiable with respect to the parameters and the appearance of the Bessel function in the density make it difficult to obtain the asymptotic covariance matrix for the entire GAL family. Using M-estimation theory, the properties of the ML estimators are investigated in this paper. The ML estimators are shown to be consistent for the GAL family and their asymptotic normality can only be guaranteed for the asymmetric Laplace (AL) family. The asymptotic covariance matrix is obtained for the AL family and it completes the results obtained previously in the literature. For the general GAL model, alternative methods of inferences based on quadratic distances (QD) are proposed. The QD methods appear to be overall more efficient than likelihood methods infinite samples using sample sizes n ≤5000 and the range of parameters often encountered for financial data. The proposed methods only require that the moment generating function of the parametric model exists and has a closed form expression and can be used for other models.
基金Supported by the National Natural Science Foundation of China(Grant No.12071158)。
文摘The resistance status of a vertex of a connected graph is the sum of the resistance distance between this vertex and any other vertices of the graph. The minimum(maximum,resp.) resistance status of a connected graph is the minimum(maximum, resp.) resistance status of all vertices of the graph. In this paper, we determine the extremal values and corresponding extremal graphs for the minimum(maximum, resp.) resistance status over all unicyclic graphs of fixed order, and we also discuss the dependence of the minimum(maximum, resp.) resistance status on the girth of unicyclic graphs.
