Some common fixed point results for mappings satisfying a quasi-contractive condition which involves altering distance functions are obtained in partially ordered complete cone metric spaces. A sufficient condition fo...Some common fixed point results for mappings satisfying a quasi-contractive condition which involves altering distance functions are obtained in partially ordered complete cone metric spaces. A sufficient condition for the uniqueness of common fixed point is proved. Also, an example is given to support our results.展开更多
This paper contributes to the literatures about Chinese commercial banks technical efficiency. In order to eliminate the deviation of efficiency scores caused by an undesirable output that is represented by banks’ no...This paper contributes to the literatures about Chinese commercial banks technical efficiency. In order to eliminate the deviation of efficiency scores caused by an undesirable output that is represented by banks’ non-performing loans, the estimation is based on an enhanced parametric hyperbolic distance function which considers not only desirable outputs but also undesirable outputs. Furthermore, we extend the model to divide the factors that affecting technical efficiency into direct factors and indirect factors and exclude the influence of the latter when analyzing the determiners of banks technical efficiency. The validity of this model is examined by a panel of bank data from 2004-2010.展开更多
Some basic problems on the level set methods were discussed, such as the method used to preserve the distance junction , the existence and uniqueness of solution for the level set equations. The main contribution is t...Some basic problems on the level set methods were discussed, such as the method used to preserve the distance junction , the existence and uniqueness of solution for the level set equations. The main contribution is to prove that in a neighborhood of the initial zero level set, the level set equations with the restriction of the distance function have a unique solution, which must be the signed distance function with respect to the evolving surface. Some skillful approaches were used: Noticing that any solution for the original equation was a distance function, the original level set equations were transformed into a simpler alternative form. Moreover, since the new system was not a classical one, the system was transformed into an ordinary one, for which the implicit function method was adopted.展开更多
In the present paper, we prove two theorems. In first theorem, we prove fixed point result for self-maps in the metric space under contractive condition of integral type by altering distance. In second result, we prov...In the present paper, we prove two theorems. In first theorem, we prove fixed point result for self-maps in the metric space under contractive condition of integral type by altering distance. In second result, we prove a unique common fixed point theorem by considering four sub compatible maps under a contractive condition of integral type.展开更多
Most clustering algorithms need to describe the similarity of objects by a predefined distance function. Three distance functions which are widely used in two traditional clustering algorithms k-means and hierarchical...Most clustering algorithms need to describe the similarity of objects by a predefined distance function. Three distance functions which are widely used in two traditional clustering algorithms k-means and hierarchical clustering were investigated. Both theoretical analysis and detailed experimental results were given. It is shown that a distance function greatly affects clustering results and can be used to detect the outlier of a cluster by the comparison of such different results and give the shape information of clusters. In practice situation, it is suggested to use different distance function separately, compare the clustering results and pick out the 搒wing points? And such points may leak out more information for data analysts.展开更多
Magnitude and distance of major potential source are needed in order to determine duration time of artificial ground motion and to determine the type of response spectrum (near field or far field) when using the seism...Magnitude and distance of major potential source are needed in order to determine duration time of artificial ground motion and to determine the type of response spectrum (near field or far field) when using the seismic intensity zonation map. The magnitude probabilistic distribution function of seismic belt and the magnitude and space joint distribution function for given intensity of the site in a potential Source are provided. Then the basicformula of calculating expected magnitude and expected distance are developed. Several examples for calculating expected magnitude and expected distance in northern China are discussed. These results show that expected magnitude and expected distance are related not only to geometry of potential source and magnitude but also to the intensity of the site with certain exceeding probability.展开更多
Radial basis function neural network(RBFNN) is an effective algorithm in nonlinear system identification. How to properly adjust the structure and parameters of RBFNN is quite challenging. To solve this problem, a dis...Radial basis function neural network(RBFNN) is an effective algorithm in nonlinear system identification. How to properly adjust the structure and parameters of RBFNN is quite challenging. To solve this problem, a distance concentration immune algorithm(DCIA) is proposed to self-organize the structure and parameters of the RBFNN in this paper. First, the distance concentration algorithm, which increases the diversity of antibodies, is used to find the global optimal solution. Secondly,the information processing strength(IPS) algorithm is used to avoid the instability that is caused by the hidden layer with neurons split or deleted randomly. However, to improve the forecasting accuracy and reduce the computation time, a sample with the most frequent occurrence of maximum error is proposed to regulate the parameters of the new neuron. In addition, the convergence proof of a self-organizing RBF neural network based on distance concentration immune algorithm(DCIA-SORBFNN) is applied to guarantee the feasibility of algorithm. Finally, several nonlinear functions are used to validate the effectiveness of the algorithm. Experimental results show that the proposed DCIASORBFNN has achieved better nonlinear approximation ability than that of the art relevant competitors.展开更多
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.展开更多
How to efficiently measure the distance between two basic probability assignments(BPAs) is an open issue. In this paper, a new method to measure the distance between two BPAs is proposed, based on two existing measu...How to efficiently measure the distance between two basic probability assignments(BPAs) is an open issue. In this paper, a new method to measure the distance between two BPAs is proposed, based on two existing measures of evidence distance. The new proposed method is comprehensive and generalized. Numerical examples are used to illustrate the effectiveness of the proposed method.展开更多
By using the properties of w-distances and Gerstewitz's functions, we first give a vectorial Takahashi's nonconvex minimization theorem with a w-distance. From this, we deduce a general vectorial Ekeland's variatio...By using the properties of w-distances and Gerstewitz's functions, we first give a vectorial Takahashi's nonconvex minimization theorem with a w-distance. From this, we deduce a general vectorial Ekeland's variational principle, where the objective function is from a complete metric space into a pre-ordered topological vector space and the perturbation contains a w-distance and a non-decreasing function of the objective function value. From the general vectorial variational principle, we deduce a vectorial Caristfs fixed point theorem with a w-distance. Finally we show that the above three theorems are equivalent to each other. The related known results are generalized and improved. In particular, some conditions in the theorems of [Y. Araya, Ekeland's variational principle and its equivalent theorems in vector optimization, J. Math. Anal. Appl. 346(2008), 9-16] are weakened or even completely relieved.展开更多
The study of the entrance and wall dynamics of a high-flux gas-solid riser was conducted using trajectory distances of the reconstructed attractors from solid concentration signals collected from a 76 mm internal diam...The study of the entrance and wall dynamics of a high-flux gas-solid riser was conducted using trajectory distances of the reconstructed attractors from solid concentration signals collected from a 76 mm internal diameters and 10 m high riser of a circulating fluidized bed (CFB) system. The riser was operated at 4.0 to 10.0 m/s gas velocity and 50 to 550 kg/m2s solids flux. Spent fluid catalytic cracking (FCC) catalyst particles with 67 μm mean diameter and density of 1500 kg/m3 together with 70% to 80% humid air was used. Solid concentration data were analyzed using codes prepared in FORTRAN 2008 to get trajectories of the reconstructed attractors and their distances apart. Trajectory distances were found to increase from the centre towards the wall indicating the expansion of the attractor. The probability density function (PDF) of the trajectory distances changes from single peak at the centre to multiple peaked profiles in the wall region. Multiple peaked profiles indicate multifractal flow behaviours. Cumulative distribution functions (CDF) of the trajectory distances changes from single S-shaped at the centre to multiple S-shaped profiles in some locations of the wall region indicating multifractal flow behaviours. The PDF distribution of these distances at the entrance section and in the wall region forms different types of statistical distributions showing differences in gas-solid flow structures in various spatial locations of the wall region and the entrance sections. Most of the distributions at the centre fall under the Gumbel max distribution for all flow development sections of the riser, especially at air velocities of 5.5 m/s and 8 m/s showing uniform flow structures. Further, it was found that increase of the number of the phase space reconstruction embedding dimension increases the trajectory distances between the state vectors leading to the expansion of the attractor.展开更多
快速扩展随机树算法(rapidly-exploring random trees,RRT)规划移动机器人路径时,存在搜索盲目性强、搜索时间长、收敛速度慢、路径冗余点多且不平滑等问题。鉴于此,提出一种改进的RRT路径规划算法。首先,针对传统RRT算法盲目搜索以及...快速扩展随机树算法(rapidly-exploring random trees,RRT)规划移动机器人路径时,存在搜索盲目性强、搜索时间长、收敛速度慢、路径冗余点多且不平滑等问题。鉴于此,提出一种改进的RRT路径规划算法。首先,针对传统RRT算法盲目搜索以及局部极值的问题,提出概率目标偏置与人工势场结合的采样策略,引导随机树的扩展;其次,针对随机树扩展的避障能力差的问题,提出基于安全距离的碰撞检测以及动态变步长扩展策略;最后,针对路径上冗余点多以及曲率不连续的问题,提出考虑安全距离的剪枝优化和三次B样条曲线对初始路径进行拟合优化。仿真结果表明,在不同地图的路径规划中,相比于传统RRT算法,增强了通过狭窄通道能力,优化了路径的平滑性,搜索时间、迭代次数、路径长度分别减少约70%、40%、15%;相比于RRT衍生算法RRT-Connect,搜索时间、路径长度分别减少约25%、10%。展开更多
近年来随着3D打印技术的飞速发展,材料挤出成型工艺制备功能梯度材料成为研究热点。材料之间的过渡是影响最终成型质量的关键因素。目前,国内外学者只研究了两种独立材料之间相互转变的过渡距离,对不同组分材料之间的转变研究较少。采...近年来随着3D打印技术的飞速发展,材料挤出成型工艺制备功能梯度材料成为研究热点。材料之间的过渡是影响最终成型质量的关键因素。目前,国内外学者只研究了两种独立材料之间相互转变的过渡距离,对不同组分材料之间的转变研究较少。采用双料筒打印机研究了不同组分材料之间的过渡距离,并通过实验探究不同进给量对过渡距离的影响,在保证打印质量的前提下得到了过渡距离最小的进给量。以Visual Studio 2019为开发平台提出一种新的进料策略缩短过渡距离,在路径规划中对切片得到点的材料信息进行判断,对组分增大的材料根据变化值计算其进给量并输出生成新型G代码。最终,采用新型G代码进行打印实验,缩短了材料过渡距离得到了理想的材料过渡曲线。展开更多
基金Supported by the National Natural Science Foundation of China(11271293)
文摘Some common fixed point results for mappings satisfying a quasi-contractive condition which involves altering distance functions are obtained in partially ordered complete cone metric spaces. A sufficient condition for the uniqueness of common fixed point is proved. Also, an example is given to support our results.
文摘This paper contributes to the literatures about Chinese commercial banks technical efficiency. In order to eliminate the deviation of efficiency scores caused by an undesirable output that is represented by banks’ non-performing loans, the estimation is based on an enhanced parametric hyperbolic distance function which considers not only desirable outputs but also undesirable outputs. Furthermore, we extend the model to divide the factors that affecting technical efficiency into direct factors and indirect factors and exclude the influence of the latter when analyzing the determiners of banks technical efficiency. The validity of this model is examined by a panel of bank data from 2004-2010.
基金the National Natural Science Foundation of China (6001161942, 60203003)
文摘Some basic problems on the level set methods were discussed, such as the method used to preserve the distance junction , the existence and uniqueness of solution for the level set equations. The main contribution is to prove that in a neighborhood of the initial zero level set, the level set equations with the restriction of the distance function have a unique solution, which must be the signed distance function with respect to the evolving surface. Some skillful approaches were used: Noticing that any solution for the original equation was a distance function, the original level set equations were transformed into a simpler alternative form. Moreover, since the new system was not a classical one, the system was transformed into an ordinary one, for which the implicit function method was adopted.
文摘In the present paper, we prove two theorems. In first theorem, we prove fixed point result for self-maps in the metric space under contractive condition of integral type by altering distance. In second result, we prove a unique common fixed point theorem by considering four sub compatible maps under a contractive condition of integral type.
文摘Most clustering algorithms need to describe the similarity of objects by a predefined distance function. Three distance functions which are widely used in two traditional clustering algorithms k-means and hierarchical clustering were investigated. Both theoretical analysis and detailed experimental results were given. It is shown that a distance function greatly affects clustering results and can be used to detect the outlier of a cluster by the comparison of such different results and give the shape information of clusters. In practice situation, it is suggested to use different distance function separately, compare the clustering results and pick out the 搒wing points? And such points may leak out more information for data analysts.
文摘Magnitude and distance of major potential source are needed in order to determine duration time of artificial ground motion and to determine the type of response spectrum (near field or far field) when using the seismic intensity zonation map. The magnitude probabilistic distribution function of seismic belt and the magnitude and space joint distribution function for given intensity of the site in a potential Source are provided. Then the basicformula of calculating expected magnitude and expected distance are developed. Several examples for calculating expected magnitude and expected distance in northern China are discussed. These results show that expected magnitude and expected distance are related not only to geometry of potential source and magnitude but also to the intensity of the site with certain exceeding probability.
基金supported by the National Natural Science Foundation of China(61890930-5,61533002,61603012)the Major Science and Technology Program for Water Pollution Control and Treatment of China(2018ZX07111005)+1 种基金the National Key Research and Development Project(2018YFC1900800-5)Beijing Municipal Education Commission Foundation(KM201710005025)
文摘Radial basis function neural network(RBFNN) is an effective algorithm in nonlinear system identification. How to properly adjust the structure and parameters of RBFNN is quite challenging. To solve this problem, a distance concentration immune algorithm(DCIA) is proposed to self-organize the structure and parameters of the RBFNN in this paper. First, the distance concentration algorithm, which increases the diversity of antibodies, is used to find the global optimal solution. Secondly,the information processing strength(IPS) algorithm is used to avoid the instability that is caused by the hidden layer with neurons split or deleted randomly. However, to improve the forecasting accuracy and reduce the computation time, a sample with the most frequent occurrence of maximum error is proposed to regulate the parameters of the new neuron. In addition, the convergence proof of a self-organizing RBF neural network based on distance concentration immune algorithm(DCIA-SORBFNN) is applied to guarantee the feasibility of algorithm. Finally, several nonlinear functions are used to validate the effectiveness of the algorithm. Experimental results show that the proposed DCIASORBFNN has achieved better nonlinear approximation ability than that of the art relevant competitors.
文摘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 High Technology Research and Development Program of China(863 Program)(2013AA013801)the National Natural Science Foundation of China(61174022+4 种基金61573290)the open funding project of State Key Laboratory of Virtual Reality Technology and Systemsthe Beihang University(BUAA-VR-14KF-02)the General Research Program of Natural Science of Sichuan Provincial Department of Education(14ZB0322)the Self-financing Program of State Ethnic Affairs Commission of China(14SCZ014)
文摘How to efficiently measure the distance between two basic probability assignments(BPAs) is an open issue. In this paper, a new method to measure the distance between two BPAs is proposed, based on two existing measures of evidence distance. The new proposed method is comprehensive and generalized. Numerical examples are used to illustrate the effectiveness of the proposed method.
基金Supported by the National Natural Science Foundation of China(10871141)
文摘By using the properties of w-distances and Gerstewitz's functions, we first give a vectorial Takahashi's nonconvex minimization theorem with a w-distance. From this, we deduce a general vectorial Ekeland's variational principle, where the objective function is from a complete metric space into a pre-ordered topological vector space and the perturbation contains a w-distance and a non-decreasing function of the objective function value. From the general vectorial variational principle, we deduce a vectorial Caristfs fixed point theorem with a w-distance. Finally we show that the above three theorems are equivalent to each other. The related known results are generalized and improved. In particular, some conditions in the theorems of [Y. Araya, Ekeland's variational principle and its equivalent theorems in vector optimization, J. Math. Anal. Appl. 346(2008), 9-16] are weakened or even completely relieved.
文摘The study of the entrance and wall dynamics of a high-flux gas-solid riser was conducted using trajectory distances of the reconstructed attractors from solid concentration signals collected from a 76 mm internal diameters and 10 m high riser of a circulating fluidized bed (CFB) system. The riser was operated at 4.0 to 10.0 m/s gas velocity and 50 to 550 kg/m2s solids flux. Spent fluid catalytic cracking (FCC) catalyst particles with 67 μm mean diameter and density of 1500 kg/m3 together with 70% to 80% humid air was used. Solid concentration data were analyzed using codes prepared in FORTRAN 2008 to get trajectories of the reconstructed attractors and their distances apart. Trajectory distances were found to increase from the centre towards the wall indicating the expansion of the attractor. The probability density function (PDF) of the trajectory distances changes from single peak at the centre to multiple peaked profiles in the wall region. Multiple peaked profiles indicate multifractal flow behaviours. Cumulative distribution functions (CDF) of the trajectory distances changes from single S-shaped at the centre to multiple S-shaped profiles in some locations of the wall region indicating multifractal flow behaviours. The PDF distribution of these distances at the entrance section and in the wall region forms different types of statistical distributions showing differences in gas-solid flow structures in various spatial locations of the wall region and the entrance sections. Most of the distributions at the centre fall under the Gumbel max distribution for all flow development sections of the riser, especially at air velocities of 5.5 m/s and 8 m/s showing uniform flow structures. Further, it was found that increase of the number of the phase space reconstruction embedding dimension increases the trajectory distances between the state vectors leading to the expansion of the attractor.
文摘快速扩展随机树算法(rapidly-exploring random trees,RRT)规划移动机器人路径时,存在搜索盲目性强、搜索时间长、收敛速度慢、路径冗余点多且不平滑等问题。鉴于此,提出一种改进的RRT路径规划算法。首先,针对传统RRT算法盲目搜索以及局部极值的问题,提出概率目标偏置与人工势场结合的采样策略,引导随机树的扩展;其次,针对随机树扩展的避障能力差的问题,提出基于安全距离的碰撞检测以及动态变步长扩展策略;最后,针对路径上冗余点多以及曲率不连续的问题,提出考虑安全距离的剪枝优化和三次B样条曲线对初始路径进行拟合优化。仿真结果表明,在不同地图的路径规划中,相比于传统RRT算法,增强了通过狭窄通道能力,优化了路径的平滑性,搜索时间、迭代次数、路径长度分别减少约70%、40%、15%;相比于RRT衍生算法RRT-Connect,搜索时间、路径长度分别减少约25%、10%。
文摘近年来随着3D打印技术的飞速发展,材料挤出成型工艺制备功能梯度材料成为研究热点。材料之间的过渡是影响最终成型质量的关键因素。目前,国内外学者只研究了两种独立材料之间相互转变的过渡距离,对不同组分材料之间的转变研究较少。采用双料筒打印机研究了不同组分材料之间的过渡距离,并通过实验探究不同进给量对过渡距离的影响,在保证打印质量的前提下得到了过渡距离最小的进给量。以Visual Studio 2019为开发平台提出一种新的进料策略缩短过渡距离,在路径规划中对切片得到点的材料信息进行判断,对组分增大的材料根据变化值计算其进给量并输出生成新型G代码。最终,采用新型G代码进行打印实验,缩短了材料过渡距离得到了理想的材料过渡曲线。