Mechanics of rubber shear springs

FEA calculations have been carried out for a model rubber shear spring, consisting of a block of a highly elastic material, bonded between two rigid parallel plates and sheared by displacing one of the plates parallel to the other in its own plane. The block was prevented from deforming in the perpendicular direction, and thus was deformed in plane strain. Stress distributions along the bond-line and the center-line are reported and compared with those expected from the theory of large elastic deformations. Unexpected tensile stresses were found to develop in the interior of the sheared block. They are attributed to the absence on the end surfaces of the stresses needed to maintain a simple shear, causing a pronounced change in the reference pressure—a consequence that is usually overlooked. Because the internal stresses are governed by the boundary conditions, they were strongly affected by the shape of the end surfaces. In addition, they were reduced markedly by assigning values to Poisson's ratio slightly lower than 0.5, thus allowing some volume expansion of the rubber. Strain energy release rates were also evaluated for growth of a crack along the bond-line, starting at the edges, and compared with those reported previously by Lindley and Teo [Energy for crack growth at the bonds of rubber springs, Plast. Rubber Mat. Appl. 4 (1979) 29-37], Muhr et al. [A fracture mechanics study of natural rubber-to-metal bond failure, J. Adhes. Sci. Technol. 10 (1996) 593-616], Gregory and Muhr [Stiffness and fracture analysis of bonded rubber blocks in simple shear, in: D. Boast, V.A. Coveny (Eds.), Finite Element Analysis of Elastomers, Professional Engineering Publications, Bury St. Edmunds, UK, 1999, pp. 265-274] and Gough and Muhr [Initiation of failure of rubber close to bondlines, in: Proceedings of the International Rubber Conference, Maastricht, Netherlands, June 2005, IOM Communications Ltd., London, 2005, pp. 165-174]. They confirm that a long crack at the compression edge will grow faster than one at the tension edge, but the results for short cracks were inconclusive.     

Edge agreement of second-order multi-agent system with dynamic quantization via the directed edge Laplacian

This work explores the edge agreement problem of second-order multi-agent systems with dynamic quantization under directed communication. To begin with, by virtue of the directed edge Laplacian, we propose a model reduction representation of the closed-loop multi-agent system depending on the spanning tree subgraph. Considering the limitations of the finite bandwidth channels, the quantization effects of second-order multi-agent systems under directed graph are considered. The static quantizers generally contain a fixed quantization interval and infinite quantization level, which are, to some extent, inefficient and impractical. To further reduce the bit depth (number of bits available) and to obtain better precision, the dynamic quantized communication strategy referring to zooming in-zooming out scheme is required. Based on the reduced model associated with the essential edge Laplacian, the asymptotic stability of second-order multi-agent systems under dynamic quantized effects with only finite quantization level can be guaranteed. Finally, the simulation of altitude alignment of micro air vehicles is provided to verify the theoretical results.     

Classification of edges using compactly supported shearlets

We analyze the detection and classification of singularities of functions $f={\chi }_S$, where $S?{\mathbb{R}}^d$ and $d=2,3$. It will be shown how the set ?S can be extracted by a continuous shearlet transform associated with compactly supported shearlets. Furthermore, if ?S is a $d?1$ dimensional piecewise smooth manifold with $d=2$ or 3, we will classify smooth and non-smooth components of ?S. This improves previous results given for shearlet systems with a certain band-limited generator, since the estimates we derive are uniform. Moreover, we will show that our bounds are optimal. Along the way, we also obtain novel results on the characterization of wavefront sets in 3 dimensions by compactly supported shearlets. Finally, geometric properties of ?S such as curvature are described in terms of the continuous shearlet transform of f.     

Hamiltonicity of edge chromatic critical graphs

Vizing conjectured that every edge chromatic critical graph contains a 2-factor. Believing that stronger properties hold for this class of graphs, Luo and Zhao (2013) showed that every edge chromatic critical graph of order $n$ with maximum degree at least $\frac{6n}{7}$ is Hamiltonian. Furthermore, Luo et al. (2016) proved that every edge chromatic critical graph of order $n$ with maximum degree at least $\frac{4n}{5}$ is Hamiltonian. In this paper, we prove that every edge chromatic critical graph of order $n$ with maximum degree at least $\frac{3n}{4}$ is Hamiltonian. Our approach is inspired by the recent development of Kierstead path and Tashkinov tree techniques for multigraphs.     

一种直流力矩电机系统的滞滑摩擦补偿方法

陀螺漂移测试转台直流力矩电机系统中存在的非线性滞滑摩擦，使转台在PID控制下存在滞滑极限环。为提高转台定位精度，应用具有滞滑(stick-slip)摩擦的直流力矩电机系统模型，推导了一种补偿方法，对含有滞滑摩擦的PID控制转台直流力矩电机伺服系统进行滞滑摩擦补偿。在采用PID控制的转台电机系统定位工作状态下，这种滞滑补偿方法可以减小滞滑极限环的幅值。仿真结果证明了该补偿方法的有效性。     

An extremal problem for total domination stable graphs upon edge removal

A connected graph is total domination stable upon edge removal, if the removal of an arbitrary edge does not change the total domination number. We determine the minimum number of edges required for a total domination stable graph in terms of its order and total domination number.     

On edge star sets in trees

Let A be a Hermitian matrix whose graph is G (i.e. there is an edge between the vertices i and j in G if and only if the (i,j) entry of A is non-zero). Let λ be an eigenvalue of A with multiplicity m_A(λ). An edge e=ij is said to be Parter (resp., neutral, downer) for λ,A if m_A(λ)−m_A−e(λ) is negative (resp., 0, positive ), where A−e is the matrix resulting from making the (i,j) and (j,i) entries of A zero. For a tree T with adjacency matrix A a subset S of the edge set of G is called an edge star set for an eigenvalue λ of A, if |S|=m_A(λ) and A−S has no eigenvalue λ. In this paper the existence of downer edges and edge star sets for non-zero eigenvalues of the adjacency matrix of a tree is proved. We prove that neutral edges always exist for eigenvalues of multiplicity more than 1. It is also proved that an edge e=uv is a downer edge for λ,A if and only if u and v are both downer vertices for λ,A; and e=uv is a neutral edge if u and v are neutral vertices. Among other results, it is shown that any edge star set for each eigenvalue of a tree is a matching.     

On optimizing edge connectivity of product graphs

This work studies the super edge connectivity and super restricted edge connectivity of direct product graphs, Cartesian product graphs, strong product graphs and lexicographic product graphs. As a result, sufficient conditions for optimizing the edge connectivity and restricted edge connectivity of these graphs are presented.     

基于优选NIR光谱波数的绿豆产地无损检测方法

产地是影响农作物生产的重要环境因素,产地溯源对于食品安全具有重要意义。针对传统农产品产地检测一般采用化学分析法,其操作繁琐且存在破坏性和耗时较长等不足的问题,以北方寒地绿豆为研究对象,分别在白城、杜蒙、泰来等优质绿豆主产区,获取绿豆的籽粒和粉末两种状态的近红外光谱数据（NIR）,利用优选NIR光谱特征波数,建立了绿豆产地无损检测的新方法。首先在吸光度值较强的10 105.37~4 078.655 cm-1波数范围内,采用多元散射校正法（MSC）,对不同产地的绿豆原始光谱数据进行预处理,以消除光谱干扰信息。应用竞争性自适应重加权采样算法（CARS）,优选不同产地绿豆籽粒和粉末状态的光谱特征波数,以减少光谱曲线的特征向量维度。最后利用前馈神经网络（BP）自适应推理机制,建立了绿豆产地与其光谱特征波数之间非线性映射模型,并将网络输出的编码向量解析至产地名称,作为绿豆产地检测的输出结果。研究结果表明：（1）原始光谱经过多元散射校正预处理后,绿豆粉末光谱曲线的误差从12.87降到3.20,绿豆籽粒光谱曲线的误差从153.04降到27.73,提供有效可靠的光谱数据。（2）通过竞争性自适应重加权采样算法,提取绿豆光谱曲线的重要特征波数,从籽粒和粉末状态原始2 114个波数中,分别优化为61个和107个特征波数,波段总数目减少了94.94%以上,并将其作为绿豆产地识别的特征指标。（3）创新性提出了MSC-CARS-BP绿豆产地检测模型,以优选出的光谱特征波数为定量依据,分别对绿豆籽粒和粉末进行产地检测,预测集准确率为92.59%和98.63%,相关系数均达到0.99以上。该方法能够利用近红外光谱处理技术,实现绿豆产地无损检测的目标,为农产品产地自动快速溯源提供了技术支持和参考。     

A recursive color image edge detection method using Green's function approach

In this paper, an extended version of image edge detector using Green's function approach is proposed for detection of edges in the color vector space field. In the proposed method, the relationship between the Red, Green and Blue components is considered to design a differential operator for detection of edges in color images. By using the proposed operator, partial derivatives of all components of color image can simultaneously affect on the edge detection process. Therefore the proposed method can preserve the vector nature of color images during the edge processing stages. Also, the proposed method is compared both quantitatively and qualitatively with other color edge detectors. Experimental results show that the proposed method can efficiently preserve the edges even when the color images corrupted with different levels of noise.