离散式任意充磁角度Halbach永磁电机解析模型研究

Halbach电机因其自身优势在新型船舶推进、海洋洋流发电等方面受到广泛关注. 本文在假设铁磁材料线性和定子内表面光滑的条件下, 通过将任意充磁角度Halbach阵列等效为两组90° Halbach(或180° Halbach)阵列的矢量合成, 提出了一种分析离散式任意充磁角度Halbach永磁电机气隙磁场的解析方法; 通过对电机中磁标量势的傅里叶级数进行计算, 推导出了最简单的90° Halbach永磁电机在极坐标系下的气隙磁密表达式, 并在此基础上, 给出了任意充磁角度Halbach电机永磁体磁化强度在一个极下的表达式, 进而得出任意充磁角度Halbach电机气隙磁密的分布, 并分析了气隙磁密与电机极对数、永磁体厚度和充磁角度间的关系. 最后通过有限元和试验结果验证了本文方法的正确性. 关键词： 离散式Halbach电机 任意充磁角度 矢量等效 解析模型     

Scattering Matrix Modeling of Photon Migration in Turbid Media

Ｉｎｔｒｏｄｕｃｔｉｏｎ　　Ｏｐｔｉｃａｌｔｏｍｏｇｒａｐｈｙｕｓｉｎｇｎｅａｒｉｎｆｒａｒｅｄｌｉｇｈｔｔｏｅｘｔｒａｃｔｉｎｔｅｒｉｏｒａｂｎｏｒｍａｌｉｔｉｅｓｉｎｆｏｒｍａｔｉｏｎａｔｔｒａｃｔｓｍａｎｙｒｅｓｅａｒｃｈｉｎｔｅｒｅｓｔｓｉｎｂｉｏｍｅｄｉｃａｌｏｐｔｉｃｓ［１］,ｂｅｃａｕｓｅｉｔｐｒｏｖｉｄｅｓａｎａｌｔｅｒｎａｔｉｖｅｐｏｔｅｎｔｉａｌｍｏｄａｌｉｔｙｔｏｐｒｏｂｅｂｒｅａｓｔｃａｎｃｅｒａｎｄｍｏｎｉｔｏｒｂｒａｉｎａｎｄｍｕｓｃｌｅｏｘｙｇｅｎａｔｉｏｎｎｏｎ…     

任意相位差条纹信号细分方法的研究

为消除传统细分方法中由于两路条纹信号不正交引入的细分误差，提出了一种可对任意相位差条纹信号直接细分的新方法。根据两路条纹信号的极性和幅值大小，把一个信号周期分成8个区段。高速采集两路条纹信号，通过判断信号采样点所处的区段是否跳变对信号幅值交点进行动态跟踪。对不足一个周期的条纹移动，当测量出起点与终点的幅值，计算出其所在的区段及位置后，结合两路信号的交点，可实现对任意相位差条纹信号的细分。实验结果表明，该方法突破了传统细分方法必须信号正交的限制，可对任意相位差信号进行准确地细分，降低了条纹测量中器件安装与调试的难度，具有更强的环境适应性和抗干扰能力。     

次线性期望下的一般中心极限定理

受Peng-中心极限定理的启发,本文主要应用G-正态分布的概念,放宽Peng-中心极限定理的条件,在次线性期望下得到形式更为一般的中心极限定理.首先,将均值条件E[X_n]=ε[X_n]=0放宽为|E[X_n]|+|ε[X_n]|=O(1/n);其次,应用随机变量截断的方法,放宽随机变量的2阶矩与2+δ阶矩条件;最后,将该定理的Peng-独立性条件进行放宽,得到卷积独立随机变量的中心极限定理.     

Highly edge-connected factors using given lists on degrees

Let G be a 2k-edge-connected graph with and let for every . A spanning subgraph F of G is called an L-factor, if for every . In this article, we show that if for every , then G has a k-edge-connected L-factor. We also show that if and for every , then G has a k-edge-connected L-factor.     

On a family of highly regular graphs by Brouwer,Ivanov, and Klin

Highly regular graphs for which not all regularities are explainable by symmetries are fascinating creatures. Some of them like, e.g., the line graph of W. Kantor’s non-classical $GQ(5^2,5)$, are stumbling stones for existing implementations of graph isomorphism tests. They appear to be extremely rare and even once constructed it is difficult to prove their high regularity. Yet some of them, like the McLaughlin graph on 275 vertices and Ivanov’s graph on 256 vertices are of profound beauty. This alone makes it an attractive goal to strive for their complete classification or, failing this, at least to get a deep understanding of them. Recently, one of the authors discovered new methods for proving high regularity of graphs. Using these techniques, in this paper we study a classical family of strongly regular graphs, originally discovered by A.E. Brouwer, A.V. Ivanov, and M.H. Klin in the late 80s. We analyse their symmetries and show that they are $(3,5)$-regular but not 2-homogeneous. Thus we promote these graphs to the distinguished club of highly regular graphs with few symmetries.     

On percolation and ‐hardness

The edge‐percolation and vertex‐percolation random graph models start with an arbitrary graph G, and randomly delete edges or vertices of G with some fixed probability. We study the computational complexity of problems whose inputs are obtained by applying percolation to worst‐case instances. Specifically, we show that a number of classical ‐hard problems on graphs remain essentially as hard on percolated instances as they are in the worst‐case (assuming ). We also prove hardness results for other ‐hard problems such as Constraint Satisfaction Problems and Subset‐Sum, with suitable definitions of random deletions. Along the way, we establish that for any given graph G the independence number and the chromatic number are robust to percolation in the following sense. Given a graph G, let be the graph obtained by randomly deleting edges of G with some probability . We show that if is small, then remains small with probability at least 0.99. Similarly, we show that if is large, then remains large with probability at least 0.99. We believe these results are of independent interest.     

A scaling limit for the length of the longest cycle in a sparse random digraph

We discuss the length of the longest directed cycle in the sparse random digraph , constant. We show that for large there exists a function such that a.s. The function where is a polynomial in . We are only able to explicitly give the values , although we could in principle compute any .     

An improved watermarking method based on double random phase encoding technique

An improved watermarking method, based on the double random phase encoding technique and the cascaded-phases iterative algorithm and random-phase-shift algorithm, is proposed. This method can significantly reduce the needs of watermarking information storage for different multimedia products, and provide a reasonable criterion of determining the authenticity of a product for the copyright owner. This method can also be applied to track the source of copies. The effectiveness of this method was verified through numerical simulations.