轴角编码器测量中偏心带来的误差分析

介绍了应运多面体和自准直光管组合测量高准确度编码器角度的原理和方法，具体分析了多面体中心和编码器轴中心偏心时对测量角度产生的测量误差，并对自准直光管光轴和多面体中心、编码器轴中心两者偏心连线不重合时产生的测量误差进行了分析，同时对两中心偏心的方向进行了判定．实验证明，多面体中心与编码器轴中心不重合时对测量将产生按正弦或余弦规律变化的系统误差，同时自准直光管光轴和两者中心连线不重合对测量结果将不会产生影响．     

On graphs with exactly one anti-adjacency eigenvalue and beyond

The anti-adjacency matrix of a graph is constructed from the distance matrix of a graph by keeping each row and each column only the largest distances. This matrix can be interpreted as the opposite of the adjacency matrix, which is instead constructed from the distance matrix of a graph by keeping in each row and each column only the distances equal to 1. The (anti-)adjacency eigenvalues of a graph are those of its (anti-)adjacency matrix. Employing a novel technique introduced by Haemers (2019) [9], we characterize all connected graphs with exactly one positive anti-adjacency eigenvalue, which is an analog of Smith's classical result that a connected graph has exactly one positive adjacency eigenvalue iff it is a complete multipartite graph. On this basis, we identify the connected graphs with all but at most two anti-adjacency eigenvalues equal to ?2 and 0. Moreover, for the anti-adjacency matrix we determine the HL-index of graphs with exactly one positive anti-adjacency eigenvalue, where the HL-index measures how large in absolute value may be the median eigenvalues of a graph. We finally propose some problems for further study.     

Computing the eccentric-distance sum for graph operations

In this paper, we present explicit formulas for computing the eccentric-distance sum of the most important graph operations such as the Cartesian product, join, composition, disjunction, symmetric difference, cluster and corona product of graphs. Also, we apply our results to compute this eccentricity-related invariant for some important classes of molecular graphs and nano-structures by specializing components of these graph operations.     

Discrepancies between metric dimension and partition dimension of a connected graph

Let and be graphs where the set of vertices is the set of points of the integer lattice and the set of edges consists of all pairs of vertices whose city block and chessboard distances, respectively, are 1.In this paper it is shown that the partition dimensions of these graphs are 3 and 4, respectively, while their metric dimensions are not finite. Also, for every n3 there exists an induced subgraph of of order 3n-1 with metric dimension n and partition dimension 3. These examples will answer a question raised by Chartrand, Salehi and Zhang. Furthermore, graphs of order n9 having partition dimension n-2 are characterized, thus completing the characterization of graphs of order n having partition dimension 2, n, or n-1 given by Chartrand, Salehi and Zhang. The list of these graphs includes 23 members.     

套管井中仪器偏心对井壁超声电视图象的影响及其校正

文章研究了在套管井中仪器偏心对井壁超声电视图象的影响,提出了基于计算影响所用模型的校正方向,实验结果表明,该方法能较好地消除由于仪器偏心所引起的超声电视图象中的两条垂直黑带,明显地改善图象的质量,经对比度增强后,井壁的细节更加清楚。     

Properties of connected graphs having minimum degree distance

The degree distance of a connected graph, introduced by Dobrynin, Kochetova and Gutman, has been studied in mathematical chemistry. In this paper some properties of graphs having minimum degree distance in the class of connected graphs of order n and size m≥n−1 are deduced. It is shown that any such graph G has no induced subgraph isomorphic to P₄, contains a vertex z of degree n−1 such that G−z has at most one connected component C such that |C|≥2 and C has properties similar to those of G.For any fixed k such that k=0,1 or k≥3, if m=n+k and n≥k+3 then the extremal graph is unique and it is isomorphic to K₁+(K_1,k+1∪(n−k−3)K₁).