Subword complexity of the Fibonacci–Thue–Morse sequence: The proof of Dekking’s conjecture

Recently F. M. Dekking conjectured the form of the subword complexity function for the Fibonacci–Thue–Morse sequence. In this note we prove his conjecture by purely computational means, using the free software Walnut.     

给定度序列图的覆盖成本和反向覆盖成本的研究

具有n个顶点且度序列为(m,2,…,2,1,…,1)(1的重数为m)的连通图不止一个(这些图均为树),而每个树对应唯一一个段序列(l₁,l₂,…,l_m).通过对任意一树移动最长段的悬挂点到最短段悬挂点的方式得到另一树,比较前后两树的覆盖成本和反向覆盖成本,给出了具有最小覆盖成本和反向覆盖成本的极树,并且进一步给出了取得最小覆盖成本和反向覆盖成本的顶点.     

On amenability of two-generator groups

A discrete group G is amenable if there exists a finitely additive probability measure on G which is invariant under left translations and is defined on all subsets of G. It is proved that if the group is generated by two elements and is amenable then there are words being relators whose most of the consecutive pairs of the letters belong to a certain four-element set of pairs. This fact is applied to reproving non-amenability of a braid group. The same group provides an example showing that such type of condition is not su?cient for amenabilty.     

汽配件颜色喷涂顺序问题的TSP转化与建模

汽配件颜色喷涂顺序问题通常以生产线上相邻汽配件颜色切换次数少为最优目标,以进一步降低生产成本.该类问题具有所有汽配件都必须喷涂一次且只喷涂一次的特点,为此提出了TSP转化与建模的方法.将待喷涂汽配件定义为TSP顶点,任意两个待喷涂汽配件的颜色切换定义为顶点的距离,仿照TSP问题构建0-1规划模型;类似于顶点距离,将某些汽配件的颜色或类别不相邻要求定义为0-1矩阵,巧妙地构造了喷涂生产的约束条件.该建模方法简单快速,通用性高,适用于具有类似特点的各类生产实践问题.     

基于回波平移序列的快速三维磁共振温度成像方法

高强度聚焦超声（HIFU）是一种无创的热消融疗法，为保证其安全性和有效性，需要一种精度高、速度快的测温方法在其治疗过程中对温度进行监控.基于质子共振频率位移（PRFS）的磁共振温度成像（MRT）对温度具有较高的灵敏度，且与温度具有良好的线性关系，因此常被用于引导HIFU治疗.然而在实际应用中，HIFU治疗的最大隐患在于可能造成表皮灼伤，并且灼伤区域可能与焦点区域相隔较远.因此MRT的监控范围十分重要.本文基于三维回波平移成像序列，结合可控混叠的空间并行成像技术，实现了时间分辨率为3 s的快速三维温度成像.为了验证该方法的精度，本文首先设计了仿体降温实验，利用光纤温度计验证回波平移序列测温的准确度和精确度.然后在室温条件下扫描离体猪肉组织，对比加速前后的MRT的测温精确度.在HIFU加热条件下扫描离体猪肉组织，对比加速前后的MRT的测温准确度.结果显示，本文提出的方法可以在3 s内完成三维温度精准测量，对于HIFU治疗的安全监控具有重要意义.     

A novel chaotic image encryption scheme using DNA sequence operations

In this paper, we propose a novel image encryption scheme based on DNA (Deoxyribonucleic acid) sequence operations and chaotic system. Firstly, we perform bitwise exclusive OR operation on the pixels of the plain image using the pseudorandom sequences produced by the spatiotemporal chaos system, i.e., CML (coupled map lattice). Secondly, a DNA matrix is obtained by encoding the confused image using a kind of DNA encoding rule. Then we generate the new initial conditions of the CML according to this DNA matrix and the previous initial conditions, which can make the encryption result closely depend on every pixel of the plain image. Thirdly, the rows and columns of the DNA matrix are permuted. Then, the permuted DNA matrix is confused once again. At last, after decoding the confused DNA matrix using a kind of DNA decoding rule, we obtain the ciphered image. Experimental results and theoretical analysis show that the scheme is able to resist various attacks, so it has extraordinarily high security.