本文在介绍用户程控交换机故障诊断基本原理的基础上,采用功能测试的方法,对不同的印刷电路板使用不同的等效黑盒进行测试。在完全不改变整机结构的情况下,仅增加一块诊断板,便可通过软件对各种印刷电路板及其单元电路进行测试和故障诊...本文在介绍用户程控交换机故障诊断基本原理的基础上,采用功能测试的方法,对不同的印刷电路板使用不同的等效黑盒进行测试。在完全不改变整机结构的情况下,仅增加一块诊断板,便可通过软件对各种印刷电路板及其单元电路进行测试和故障诊断。故障定位的准确度对单块印刷电路板,单元电路以及单个 IC 芯片分别为100%,80%以及和70%左右。展开更多
It is difficult to solve complete coverage path planning directly in the obstructed area. Therefore, in this paper, we propose a method of complete coverage path planning with improved area division. Firstly, the bous...It is difficult to solve complete coverage path planning directly in the obstructed area. Therefore, in this paper, we propose a method of complete coverage path planning with improved area division. Firstly, the boustrophedon cell decomposition method is used to partition the map into sub-regions. The complete coverage paths within each sub-region are obtained by the Boustrophedon back-and-forth motions, and the order of traversal of the sub-regions is then described as a generalised traveling salesman problem with pickup and delivery based on the relative positions of the vertices of each sub-region. An adaptive large neighbourhood algorithm is proposed to quickly obtain solution results in traversal order. The effectiveness of the improved algorithm on traversal cost reduction is verified in this paper through multiple sets of experiments. .展开更多
设Hill算子L=-α~2+u(x)具有周期有限带位势u(x)。众所周知,与谱带左端点E_(2j)相应的特征函数ψ_j(x)满足著名的McKean-Trubowitz迹恒等式:sum from j=0 to N ψ_j^2(x)=1. 本文证明,谱带右端点E_(2j-1)相应的特征函数φ_j(x)满足另一...设Hill算子L=-α~2+u(x)具有周期有限带位势u(x)。众所周知,与谱带左端点E_(2j)相应的特征函数ψ_j(x)满足著名的McKean-Trubowitz迹恒等式:sum from j=0 to N ψ_j^2(x)=1. 本文证明,谱带右端点E_(2j-1)相应的特征函数φ_j(x)满足另一个迹恒等式:u(x)=-2 sum from j=1 to N φ_j(x)+σ,其中σ=E_0+ sum from j=1 to N(E_(2j)-E_(2j-1). ψ_j与φ_j满足的Hill方程组分别被此二个迹公式非线性化为两个Liouville意义下的完全可积系统:Neumann系统与Bargmamm系统。展开更多
文摘本文在介绍用户程控交换机故障诊断基本原理的基础上,采用功能测试的方法,对不同的印刷电路板使用不同的等效黑盒进行测试。在完全不改变整机结构的情况下,仅增加一块诊断板,便可通过软件对各种印刷电路板及其单元电路进行测试和故障诊断。故障定位的准确度对单块印刷电路板,单元电路以及单个 IC 芯片分别为100%,80%以及和70%左右。
文摘It is difficult to solve complete coverage path planning directly in the obstructed area. Therefore, in this paper, we propose a method of complete coverage path planning with improved area division. Firstly, the boustrophedon cell decomposition method is used to partition the map into sub-regions. The complete coverage paths within each sub-region are obtained by the Boustrophedon back-and-forth motions, and the order of traversal of the sub-regions is then described as a generalised traveling salesman problem with pickup and delivery based on the relative positions of the vertices of each sub-region. An adaptive large neighbourhood algorithm is proposed to quickly obtain solution results in traversal order. The effectiveness of the improved algorithm on traversal cost reduction is verified in this paper through multiple sets of experiments. .
文摘设Hill算子L=-α~2+u(x)具有周期有限带位势u(x)。众所周知,与谱带左端点E_(2j)相应的特征函数ψ_j(x)满足著名的McKean-Trubowitz迹恒等式:sum from j=0 to N ψ_j^2(x)=1. 本文证明,谱带右端点E_(2j-1)相应的特征函数φ_j(x)满足另一个迹恒等式:u(x)=-2 sum from j=1 to N φ_j(x)+σ,其中σ=E_0+ sum from j=1 to N(E_(2j)-E_(2j-1). ψ_j与φ_j满足的Hill方程组分别被此二个迹公式非线性化为两个Liouville意义下的完全可积系统:Neumann系统与Bargmamm系统。
