Some new concepts of effective incidence matrix,ascending order adjacency matrix andend-result vertex are introduced,and some improvements of the maximum weight matchingalgorithm are made.With this method a computer p...Some new concepts of effective incidence matrix,ascending order adjacency matrix andend-result vertex are introduced,and some improvements of the maximum weight matchingalgorithm are made.With this method a computer program in FORTRAN language is realized onthe computers FELIX C-512 and IBM-PC.Good results are obtained in practical operations.展开更多
We investigate the online scheduling problem on identical parallel-batch machines to minimize the maximum weighted completion time.In this problem,jobs arrive over time and the processing times(of the jobs)are identic...We investigate the online scheduling problem on identical parallel-batch machines to minimize the maximum weighted completion time.In this problem,jobs arrive over time and the processing times(of the jobs)are identical,and the batch capacity is bounded.For this problem,we provide a best possible online algorithm with a competitive ratio of(√5+1)/2.Moreover,when restricted to dense-algorithms,we present a best possible dense-algorithm with a competitive ratio of 2.展开更多
In this paper, a weighted maximum likelihood technique (WMLT) for the logistic regression model is presented. This method depended on a weight function that is continuously adaptable using Mahalanobis distances for pr...In this paper, a weighted maximum likelihood technique (WMLT) for the logistic regression model is presented. This method depended on a weight function that is continuously adaptable using Mahalanobis distances for predictor variables. Under the model, the asymptotic consistency of the suggested estimator is demonstrated and properties of finite-sample are also investigated via simulation. In simulation studies and real data sets, it is observed that the newly proposed technique demonstrated the greatest performance among all estimators compared.展开更多
In this paper,the maximum-principle-preserving(MPP)and positivitypreserving(PP)flux limiting technique will be generalized to a class of high-order weighted compact nonlinear schemes(WCNSs)for scalar conservation laws...In this paper,the maximum-principle-preserving(MPP)and positivitypreserving(PP)flux limiting technique will be generalized to a class of high-order weighted compact nonlinear schemes(WCNSs)for scalar conservation laws and the compressible Euler systems in both one and two dimensions.The main idea of the present method is to rewrite the scheme in a conservative form,and then define the local limiting parameters via case-by-case discussion.Smooth test problems are presented to demonstrate that the proposed MPP/PP WCNSs incorporating a third-order Runge-Kutta method can attain the desired order of accuracy.Other test problems with strong shocks and high pressure and density ratios are also conducted to testify the performance of the schemes.展开更多
In this paper, we first reformulate the max-min dispersion problem as a saddle-point problem. Specifically, we introduce an auxiliary problem whose optimum value gives an upper bound on that of the original problem. T...In this paper, we first reformulate the max-min dispersion problem as a saddle-point problem. Specifically, we introduce an auxiliary problem whose optimum value gives an upper bound on that of the original problem. Then we propose the saddle-point problem to be solved by an adaptive custom proximal point algorithm. Numerical results show that the proposed algorithm is efficient.展开更多
文摘Some new concepts of effective incidence matrix,ascending order adjacency matrix andend-result vertex are introduced,and some improvements of the maximum weight matchingalgorithm are made.With this method a computer program in FORTRAN language is realized onthe computers FELIX C-512 and IBM-PC.Good results are obtained in practical operations.
基金This research was supported by the National Natural Science Foundation of China(Nos.11571321 and 11401065)the Natural Science Foundation of Henan Province(No.15IRTSTHN006).
文摘We investigate the online scheduling problem on identical parallel-batch machines to minimize the maximum weighted completion time.In this problem,jobs arrive over time and the processing times(of the jobs)are identical,and the batch capacity is bounded.For this problem,we provide a best possible online algorithm with a competitive ratio of(√5+1)/2.Moreover,when restricted to dense-algorithms,we present a best possible dense-algorithm with a competitive ratio of 2.
文摘In this paper, a weighted maximum likelihood technique (WMLT) for the logistic regression model is presented. This method depended on a weight function that is continuously adaptable using Mahalanobis distances for predictor variables. Under the model, the asymptotic consistency of the suggested estimator is demonstrated and properties of finite-sample are also investigated via simulation. In simulation studies and real data sets, it is observed that the newly proposed technique demonstrated the greatest performance among all estimators compared.
基金Project supported by the National Natural Science Foundation of China(No.11571366)the Basic Research Foundation of National Numerical Wind Tunnel Project(No.NNW2018-ZT4A08)
文摘In this paper,the maximum-principle-preserving(MPP)and positivitypreserving(PP)flux limiting technique will be generalized to a class of high-order weighted compact nonlinear schemes(WCNSs)for scalar conservation laws and the compressible Euler systems in both one and two dimensions.The main idea of the present method is to rewrite the scheme in a conservative form,and then define the local limiting parameters via case-by-case discussion.Smooth test problems are presented to demonstrate that the proposed MPP/PP WCNSs incorporating a third-order Runge-Kutta method can attain the desired order of accuracy.Other test problems with strong shocks and high pressure and density ratios are also conducted to testify the performance of the schemes.
文摘In this paper, we first reformulate the max-min dispersion problem as a saddle-point problem. Specifically, we introduce an auxiliary problem whose optimum value gives an upper bound on that of the original problem. Then we propose the saddle-point problem to be solved by an adaptive custom proximal point algorithm. Numerical results show that the proposed algorithm is efficient.
