In this paper,we study the asymptotic relation between the first crossing point and the last exit time for Gaussian order statistics which are generated by stationary weakly and strongly dependent Gaussian sequences.I...In this paper,we study the asymptotic relation between the first crossing point and the last exit time for Gaussian order statistics which are generated by stationary weakly and strongly dependent Gaussian sequences.It is shown that the first crossing point and the last exit time are asymptotically independent and dependent for weakly and strongly dependent cases,respectively.The asymptotic relations between the first crossing point and the last exit time for stationary weakly and strongly dependent Gaussian sequences are also obtained.展开更多
In this paper, the crossing point property of the i-v hysteresis curve in a memristor-capacitor （MC） circuit is analyzed. First, the ideal passive memristor on the crossing point property of i-v hysteresis curve is ...In this paper, the crossing point property of the i-v hysteresis curve in a memristor-capacitor （MC） circuit is analyzed. First, the ideal passive memristor on the crossing point property of i-v hysteresis curve is studied. Based on the analysis, the analytical derivation with respect to the crossing point location of MC circuit is given. Then the example of MC with linear memristance-versus-charge state map is demonstrated to discuss the drift property of cross-point location, caused by the frequency and capacitance value.展开更多
We consider in this paper the boundary value problems of nonlinear systems the form εY″=F(t,Y,Y′,ε), -1<t<1, Y(-1,ε)=A(ε), Y(1,ε)=B(ε). Supoosing some or all of the components of F , that is, ...We consider in this paper the boundary value problems of nonlinear systems the form εY″=F(t,Y,Y′,ε), -1<t<1, Y(-1,ε)=A(ε), Y(1,ε)=B(ε). Supoosing some or all of the components of F , that is, f i satisfy 2 f y′ 2 i t =0 =0, we say that F possesses a generalized turning point at t =0. Our goal is to give sufficient conditions for the existence of solution of the problems and to study the asymptotic behavior of the solution when F possesses a generalized turning point at t =0. We mainly discuss regular singular crossings.展开更多
We apply a Cross-Correlation （CC） method developed previously for detecting gamma-ray point sources to the WMAP first year data by using the Point-Spread Function of WMAP and obtain a full sky CC coefficient map. We...We apply a Cross-Correlation （CC） method developed previously for detecting gamma-ray point sources to the WMAP first year data by using the Point-Spread Function of WMAP and obtain a full sky CC coefficient map. We find that the CC method is a powerful tool to examine the WMAP foreground residuals which can be further cleaned accord- ingly. Evident foreground signals are found in the WMAP foreground cleaned maps and the Tegmark cleaned map. In this process 101 point sources are detected, and 26 of them are new sources additional to the originally listed WMAP 208 sources. We estimate the flux of these new sources and verify them by another method. As a result, a revised mask file based on the WMAP first year data is produced by including these new sources.展开更多
为解决传统A^(*)寻路算法在搜索过程中会产生大量冗余节点,导致算法整体搜索效率低,运算内存消耗大等问题,从A^(*)算法的两个重要决策点出发,改进算法的代价评估函数与邻节点搜索策略,提出一种改进融合算法。首先,采用向量叉积与尺度平...为解决传统A^(*)寻路算法在搜索过程中会产生大量冗余节点,导致算法整体搜索效率低,运算内存消耗大等问题,从A^(*)算法的两个重要决策点出发,改进算法的代价评估函数与邻节点搜索策略,提出一种改进融合算法。首先,采用向量叉积与尺度平衡因子相结合的方法优化传统A^(*)算法的启发函数,减少A^(*)算法寻路过程中在最优路径周围产生的具有相同代价值的冗余节点,减少了对称路径的搜索;其次,融合跳点搜索(Jump point search, JPS)策略,通过逻辑判断实现路径的变步长跳跃搜索,避免了A^(*)算法逐层搜索效率低的弊端。在不同尺寸的栅格地图中进行仿真分析,发现改进融合算法相比于传统A^(*)算法,在路径长度基本相等的情况下,节点搜索数量约减少95%,且与传统JPS寻路算法相比,有效过滤了路径周围复杂形状障碍物产生的大量冗余跳点。最后,将改进融合算法应用于ROS移动机器人并进行对比实验以验证算法的可行性。实验结果表明:改进融合算法在获得高效安全的路径基础上,搜索效率相比于A^(*)算法可提高约94%。展开更多
基金Supported by the National Natural Science Foundation of China(11501250)Zhejiang Provincial Natural Science Foundation of China(LY18A010020)Innovation of Jiaxing City:a program to support the talented persons。
文摘In this paper,we study the asymptotic relation between the first crossing point and the last exit time for Gaussian order statistics which are generated by stationary weakly and strongly dependent Gaussian sequences.It is shown that the first crossing point and the last exit time are asymptotically independent and dependent for weakly and strongly dependent cases,respectively.The asymptotic relations between the first crossing point and the last exit time for stationary weakly and strongly dependent Gaussian sequences are also obtained.
基金financial supports provided by the National Natural Science Foundation of China(Nos. 50927403 and 50674088)the Natural Science Foundation of Jiangsu Province(No.BK2009004)the Research Foundation of State Key Laboratory of Coal Resources and Safe Mining(No. SKLCRSM08X06)
文摘进一步的理解煤自我加热被调查煤的不同等级的交叉的点温度(CPT ) 获得。测试为煤用一个自我设计的试验性的系统被执行自我加热。50 g (???
基金Project supported by the National Natural Science Foundation of China(Grant No.61171017)
文摘In this paper, the crossing point property of the i-v hysteresis curve in a memristor-capacitor （MC） circuit is analyzed. First, the ideal passive memristor on the crossing point property of i-v hysteresis curve is studied. Based on the analysis, the analytical derivation with respect to the crossing point location of MC circuit is given. Then the example of MC with linear memristance-versus-charge state map is demonstrated to discuss the drift property of cross-point location, caused by the frequency and capacitance value.
文摘We consider in this paper the boundary value problems of nonlinear systems the form εY″=F(t,Y,Y′,ε), -1<t<1, Y(-1,ε)=A(ε), Y(1,ε)=B(ε). Supoosing some or all of the components of F , that is, f i satisfy 2 f y′ 2 i t =0 =0, we say that F possesses a generalized turning point at t =0. Our goal is to give sufficient conditions for the existence of solution of the problems and to study the asymptotic behavior of the solution when F possesses a generalized turning point at t =0. We mainly discuss regular singular crossings.
基金Supported by the National Natural Science Foundation of China.
文摘We apply a Cross-Correlation （CC） method developed previously for detecting gamma-ray point sources to the WMAP first year data by using the Point-Spread Function of WMAP and obtain a full sky CC coefficient map. We find that the CC method is a powerful tool to examine the WMAP foreground residuals which can be further cleaned accord- ingly. Evident foreground signals are found in the WMAP foreground cleaned maps and the Tegmark cleaned map. In this process 101 point sources are detected, and 26 of them are new sources additional to the originally listed WMAP 208 sources. We estimate the flux of these new sources and verify them by another method. As a result, a revised mask file based on the WMAP first year data is produced by including these new sources.
文摘为解决传统A^(*)寻路算法在搜索过程中会产生大量冗余节点,导致算法整体搜索效率低,运算内存消耗大等问题,从A^(*)算法的两个重要决策点出发,改进算法的代价评估函数与邻节点搜索策略,提出一种改进融合算法。首先,采用向量叉积与尺度平衡因子相结合的方法优化传统A^(*)算法的启发函数,减少A^(*)算法寻路过程中在最优路径周围产生的具有相同代价值的冗余节点,减少了对称路径的搜索;其次,融合跳点搜索(Jump point search, JPS)策略,通过逻辑判断实现路径的变步长跳跃搜索,避免了A^(*)算法逐层搜索效率低的弊端。在不同尺寸的栅格地图中进行仿真分析,发现改进融合算法相比于传统A^(*)算法,在路径长度基本相等的情况下,节点搜索数量约减少95%,且与传统JPS寻路算法相比,有效过滤了路径周围复杂形状障碍物产生的大量冗余跳点。最后,将改进融合算法应用于ROS移动机器人并进行对比实验以验证算法的可行性。实验结果表明:改进融合算法在获得高效安全的路径基础上,搜索效率相比于A^(*)算法可提高约94%。
