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 modified generality degree distance, is defined as: ,?which is a modification of the generality degree distance. In this paper, we give some computing formulas of the modified generality degree distance of some gr...The modified generality degree distance, is defined as: ,?which is a modification of the generality degree distance. In this paper, we give some computing formulas of the modified generality degree distance of some graph operations, such as, composition, join, etc.展开更多
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.展开更多
A coloring of G is d-distance if any two vertices at distance at most d from each other get different colors. The minimum number of colors in d-distance colorings of G is its d-distance chromatic number, denoted by χ...A coloring of G is d-distance if any two vertices at distance at most d from each other get different colors. The minimum number of colors in d-distance colorings of G is its d-distance chromatic number, denoted by χd(G). In this paper, we give the exact value of χd(G) (d = 1, 2), for some types of generalized Petersen graphs P(n, k) where k = 1, 2, 3 and arbitrary n.展开更多
In [1], Hamzeh, Iranmanesh and Hossein-Zadeh and M. V. Diudea recently introduced the generalized degree distance of graphs. In this paper, we present explicit formulas for this new graph invariant of the Cartesian pr...In [1], Hamzeh, Iranmanesh and Hossein-Zadeh and M. V. Diudea recently introduced the generalized degree distance of graphs. In this paper, we present explicit formulas for this new graph invariant of the Cartesian product, composition, join, disjunction and symmetric difference of graphs and introduce generalized and modified generalized degree distance polynomials of graphs, such that their first derivatives at x = 1 are respectively, equal to the generalized degree distance and the modified generalized degree distance. These polynomials are related to Wiener-type invariant polynomial of graphs.展开更多
Considering the range anxiety issue caused by the limited driving range and the scarcity of battery charging stations,the conventional multinomial logit(MNL)model with the overlapping path issue was used in route choi...Considering the range anxiety issue caused by the limited driving range and the scarcity of battery charging stations,the conventional multinomial logit(MNL)model with the overlapping path issue was used in route choice modeling to describe the route choice behavior of travelers effectively.Furthermore,the generalized nested logit-based stochastic user equilibrium(GNL-SUE)model with the constraints of multiple user classes and distance limits was proposed.A mathematical model was developed and solved by the method of successive averages.The mathematical model was proven to be analytically equivalent to the modified GNL-SUE model,and the uniqueness of the solution was also confirmed.The proposed mathematical model was tested and compared with the GNL-SUE model without a distance limit and the MNL-SUE model with a distance limit.Results show that the proposed mathematical model can effectively handle the range anxiety and overlapping path challenges.展开更多
This paper focus on the accuracy enhancement of parallel kinematics machine through kinematics calibration. In the calibration processing, well-structured identification Jacobian matrix construction and end-effector p...This paper focus on the accuracy enhancement of parallel kinematics machine through kinematics calibration. In the calibration processing, well-structured identification Jacobian matrix construction and end-effector position and orientation measurement are two main difficulties. In this paper, the identification Jacobian matrix is constructed easily by numerical calculation utilizing the unit virtual velocity method. The generalized distance errors model is presented for avoiding measuring the position and orientation directly which is difficult to be measured. At last, a measurement tool is given for acquiring the data points in the calibration processing. Experimental studies confirmed the effectiveness of method. It is also shown in the paper that the proposed approach can be applied to other typed parallel manipulators.展开更多
Gray mapping is a well-known way to improve the performance of regular constellation modulation,but it is challenging to be applied directly for irregular alternative.To address this issue,in this paper,a unified bit-...Gray mapping is a well-known way to improve the performance of regular constellation modulation,but it is challenging to be applied directly for irregular alternative.To address this issue,in this paper,a unified bit-to-symbol mapping method is designed for generalized constellation modulation(i.e.,regular and irregular shaping).The objective of the proposed approach is to minimize the average bit error probability by reducing the hamming distance(HD)of symbols with larger values of pairwise error probability.Simulation results show that the conventional constellation modulation(i.e.,phase shift keying and quadrature amplitude modulation(QAM)with the proposed mapping rule yield the same performance as that of classical gray mapping.Moreover,the recently developed golden angle modulation(GAM)with the proposed mapping method is capable of providing around1 d B gain over the conventional mapping counterpart and offers comparable performance to QAM with Gray mapping.展开更多
为保障医院信息网络的安全管理,避免医疗信息泄露,提出了基于深度生成模型的医院网络异常信息入侵检测算法。采用二进制小波变换方法,多尺度分解医院网络运行数据,结合自适应软门限去噪系数提取有效数据。运用最优运输理论中的Wasserst...为保障医院信息网络的安全管理,避免医疗信息泄露,提出了基于深度生成模型的医院网络异常信息入侵检测算法。采用二进制小波变换方法,多尺度分解医院网络运行数据,结合自适应软门限去噪系数提取有效数据。运用最优运输理论中的Wasserstein距离算法与MMD(Maximun Mean Discrepancy)距离算法,在深度生成模型中,对医院网络数据展开降维处理。向异常检测模型中输入降维后网络正常运行数据样本,并提取样本特征。利用深度学习策略中的Adam算法,生成异常信息判别函数,通过待测网络运行数据与正常网络运行数据的特征对比,实现医院网络异常信息入侵检测。实验结果表明,算法能实现对医院网络异常信息入侵的高效检测,精准检测多类型网络入侵行为,为医疗机构网络运行提供安全保障。展开更多
文摘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 modified generality degree distance, is defined as: ,?which is a modification of the generality degree distance. In this paper, we give some computing formulas of the modified generality degree distance of some graph operations, such as, composition, join, etc.
文摘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.
文摘A coloring of G is d-distance if any two vertices at distance at most d from each other get different colors. The minimum number of colors in d-distance colorings of G is its d-distance chromatic number, denoted by χd(G). In this paper, we give the exact value of χd(G) (d = 1, 2), for some types of generalized Petersen graphs P(n, k) where k = 1, 2, 3 and arbitrary n.
文摘In [1], Hamzeh, Iranmanesh and Hossein-Zadeh and M. V. Diudea recently introduced the generalized degree distance of graphs. In this paper, we present explicit formulas for this new graph invariant of the Cartesian product, composition, join, disjunction and symmetric difference of graphs and introduce generalized and modified generalized degree distance polynomials of graphs, such that their first derivatives at x = 1 are respectively, equal to the generalized degree distance and the modified generalized degree distance. These polynomials are related to Wiener-type invariant polynomial of graphs.
基金The Postgraduate Research&Practice Innovation Program of Jiangsu Province(No.KYLX16_0271).
文摘Considering the range anxiety issue caused by the limited driving range and the scarcity of battery charging stations,the conventional multinomial logit(MNL)model with the overlapping path issue was used in route choice modeling to describe the route choice behavior of travelers effectively.Furthermore,the generalized nested logit-based stochastic user equilibrium(GNL-SUE)model with the constraints of multiple user classes and distance limits was proposed.A mathematical model was developed and solved by the method of successive averages.The mathematical model was proven to be analytically equivalent to the modified GNL-SUE model,and the uniqueness of the solution was also confirmed.The proposed mathematical model was tested and compared with the GNL-SUE model without a distance limit and the MNL-SUE model with a distance limit.Results show that the proposed mathematical model can effectively handle the range anxiety and overlapping path challenges.
文摘This paper focus on the accuracy enhancement of parallel kinematics machine through kinematics calibration. In the calibration processing, well-structured identification Jacobian matrix construction and end-effector position and orientation measurement are two main difficulties. In this paper, the identification Jacobian matrix is constructed easily by numerical calculation utilizing the unit virtual velocity method. The generalized distance errors model is presented for avoiding measuring the position and orientation directly which is difficult to be measured. At last, a measurement tool is given for acquiring the data points in the calibration processing. Experimental studies confirmed the effectiveness of method. It is also shown in the paper that the proposed approach can be applied to other typed parallel manipulators.
基金supported in part by the National Key Research and Development Program of China under Grant 2021YFB2900502in part by the National Science Foundation of China under Grant 62001179in part by the Fundamental Research Funds for the Central Universities under Grant 2020kfy XJJS111。
文摘Gray mapping is a well-known way to improve the performance of regular constellation modulation,but it is challenging to be applied directly for irregular alternative.To address this issue,in this paper,a unified bit-to-symbol mapping method is designed for generalized constellation modulation(i.e.,regular and irregular shaping).The objective of the proposed approach is to minimize the average bit error probability by reducing the hamming distance(HD)of symbols with larger values of pairwise error probability.Simulation results show that the conventional constellation modulation(i.e.,phase shift keying and quadrature amplitude modulation(QAM)with the proposed mapping rule yield the same performance as that of classical gray mapping.Moreover,the recently developed golden angle modulation(GAM)with the proposed mapping method is capable of providing around1 d B gain over the conventional mapping counterpart and offers comparable performance to QAM with Gray mapping.
文摘为保障医院信息网络的安全管理,避免医疗信息泄露,提出了基于深度生成模型的医院网络异常信息入侵检测算法。采用二进制小波变换方法,多尺度分解医院网络运行数据,结合自适应软门限去噪系数提取有效数据。运用最优运输理论中的Wasserstein距离算法与MMD(Maximun Mean Discrepancy)距离算法,在深度生成模型中,对医院网络数据展开降维处理。向异常检测模型中输入降维后网络正常运行数据样本,并提取样本特征。利用深度学习策略中的Adam算法,生成异常信息判别函数,通过待测网络运行数据与正常网络运行数据的特征对比,实现医院网络异常信息入侵检测。实验结果表明,算法能实现对医院网络异常信息入侵的高效检测,精准检测多类型网络入侵行为,为医疗机构网络运行提供安全保障。