螺栓连接大变形梁非线性振动特性的实验研究

柔性机械臂、大型可展开天线等机械结构的动作精度受运动过程中大变形几何非线性和连接处接触非线性的影响十分显著。以含螺栓连接结构的大变形梁作为研究对象，针对动力学建模和振动特性开展了实验研究，通过数值计算验证了实验发现的非线性振动特性。搭建了含螺栓连接柔性大变形梁的实验台架，开展了敲击和正弦激振的实验测试。实验结果表明，螺栓连接的柔性梁较连续梁的（无螺栓连接）模态频率降低，阻尼增加，反映出随着激励能量增大，模态频率降低的非线性模态特征。改变螺栓连接位置会显著影响结构的模态频率，其变化规律可由求解线性矩阵特征值定性反映。     

On s-hamiltonian line graphs of claw-free graphs

For an integer $s\ge 0$, a graph $G$ is $s$-hamiltonian if for any vertex subset $S?V\left(G\right)$ with $\left|S\right|\le s$, $G?S$ is hamiltonian, and $G$ is $s$-hamiltonian connected if for any vertex subset $S?V\left(G\right)$ with $\left|S\right|\le s$, $G?S$ is hamiltonian connected. Thomassen in 1984 conjectured that every 4-connected line graph is hamiltonian (see Thomassen, 1986), and Ku?zel and Xiong in 2004 conjectured that every 4-connected line graph is hamiltonian connected (see Ryjá?ek and Vrána, 2011). In Broersma and Veldman (1987), Broersma and Veldman raised the characterization problem of $s$-hamiltonian line graphs. In Lai and Shao (2013), it is conjectured that for $s\ge 2$, a line graph $L\left(G\right)$ is $s$-hamiltonian if and only if $L\left(G\right)$ is $(s+2)$-connected. In this paper we prove the following.(i) For an integer $s\ge 2$, the line graph $L\left(G\right)$ of a claw-free graph $G$ is $s$-hamiltonian if and only if $L\left(G\right)$ is $(s+2)$-connected.(ii) The line graph $L\left(G\right)$ of a claw-free graph $G$ is 1-hamiltonian connected if and only if $L\left(G\right)$ is 4-connected.     

PI-强LU富足半群

通过对C-L^U-富足半群的刻画,给出了PI-强L^U富足半群的结构定理。     

数学专业师范生教学技能的调查研究--以四川文理学院为例

教学技能是教师最重要的专业素质，是师范生在大学期间需要掌握的基础职业技能。通过调查研究表明，数学专业大学生教学基本功发展不平衡，不同年级学生的教学技能水平存在显著差异。教学实践、课改认知、教学交流、自主练习是影响教学技能的四个主因子。男女生在表达技能、教学设计技能、几何作图技能等方面差异显著，而在教材分析、多媒体使用方面不存在显著性差异。要通过完善教学技能培养机制，夯实师范基础技能培养，改革教学技能培养方式等途径，合力提高师范生的教学技能，增强就业竞争力。     

Finding any given 2‐factor in sparse pseudorandom graphs efficiently

Given an $n$‐vertex pseudorandom graph $G$ and an $n$‐vertex graph $H$ with maximum degree at most two, we wish to find a copy of $H$ in $G$, that is, an embedding $\phi :V\left(H\right)\to V\left(G\right)$ so that $\phi \left(u\right)\phi \left(v\right)\in E\left(G\right)$ for all $uv\in E\left(H\right)$. Particular instances of this problem include finding a triangle‐factor and finding a Hamilton cycle in $G$. Here, we provide a deterministic polynomial time algorithm that finds a given $H$ in any suitably pseudorandom graph $G$. The pseudorandom graphs we consider are $\left(p,\lambda \right)$‐bijumbled graphs of minimum degree which is a constant proportion of the average degree, that is, $\mathrm{\Omega }\left(pn\right)$. A $\left(p,\lambda \right)$‐bijumbled graph is characterised through the discrepancy property: $|e\left(A,B\right)?p|A||B||<\lambda \sqrt{|A||B|}$ for any two sets of vertices $A$ and $B$. Our condition $\lambda =O(p^{2}n/\log n)$ on bijumbledness is within a log factor from being tight and provides a positive answer to a recent question of Nenadov. We combine novel variants of the absorption‐reservoir method, a powerful tool from extremal graph theory and random graphs. Our approach builds on our previous work, incorporating the work of Nenadov, together with additional ideas and simplifications.