幅相一致行波管高频电路CAD研究

 在行波管的设计和装配过程中，各部件的尺寸必须严格控制，高频电路参数的离散对行波管色散特性有极大的影响。使用螺旋导电面模型，模拟计算了高频结构各主要参数离散对色散特性和轴向互作用耦合阻抗的影响。分析计算了夹持杆宽度、翼片高度、螺旋线平均半径、螺距、夹持杆介电常数等离散时对色散特性和轴向互作用耦合阻抗的影响，为新型幅相一致行波管的设计和生产提供了很有价值的参考建议。     

FFT-based algorithms for the string matching with mismatches problem

The string matching with mismatches problem requires finding the Hamming distance between a pattern P of length m and every length m substring of text T with length n. Fischer and Paterson's FFT-based algorithm solves the problem without error in O(σnlogm), where σ is the size of the alphabet Σ [SIAM–AMS Proc. 7 (1973) 113–125]. However, this in the worst case reduces to O(nmlogm). Atallah, Chyzak and Dumas used the idea of randomly mapping the letters of the alphabet to complex roots of unity to estimate the score vector in time O(nlogm) [Algorithmica 29 (2001) 468–486]. We show that the algorithm's score variance can be substantially lowered by using a bijective mapping, and specifically to zero in the case of binary and ternary alphabets. This result is extended via alphabet remappings to deterministically solve the string matching with mismatches problem with a constant factor of 2 improvement over Fischer–Paterson's method.     

Bit-parallel approximate string matching algorithms with transposition

Using bit-parallelism has resulted in fast and practical algorithms for approximate string matching under Levenshtein edit distance, which permits a single edit operation to insert, delete or substitute a character. Depending on the parameters of the search, currently the fastest non-filtering algorithms in practice are the O(km/wn) algorithm of Wu and Manber, the O((k+2)(m−k)/wn) algorithm of Baeza-Yates and Navarro, and the O(m/wn) algorithm of Myers, where m is the pattern length, n is the text length, k is the error threshold and w is the computer word size. In this paper we discuss a uniform way of modifying each of these algorithms to permit also a fourth type of edit operation: transposing two adjacent characters in the pattern. This type of edit distance is also known as Damerau edit distance. In the end we also present an experimental comparison of the resulting algorithms.     

抽指加权宽带扇形叉指声表面波滤波器的等效电路分析

扇形换能器可以看成若干个沿孔径方向划分的均匀孔径换能器电端并联而成，根据梅森(Mason)等效电路模型以及由其延伸的混合场等效电路模型，推导出整个扇形换能器的导纳矩阵和频率响应，其中采用复阻抗模型考虑了叉指电极与自由表面的阻抗不连续的因素。本方法能够模拟指间反射、三次行程、指条寄生阻抗以及外围电路等对器件性能的影响；理论模拟与实验结果吻合。     

Determination of the degree of cure under dynamic and isothermal curing conditions with electrical impedance spectroscopy

This article presents a new methodology for the quantitative determination of the progress of the curing reaction of a thermosetting resin, using the results of electrical impedance spectroscopy. The method is an extension of the use of the imaginary impedance maximum as a reaction progress indicator and is based on the demonstration of a close correlation between the reaction rate, as measured by conventional differential scanning calorimetry, and the rate of change of the value of the imaginary impedance spectrum maximum. Tests on a commercial aerospace epoxy resin under both isothermal and dynamic heating conditions with calorimetry and impedance spectroscopy have demonstrated the validity of the method and set the accuracy limits involved. This technique can be used as a real-time online control tool for thermoset composite manufacturing. © 2003 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 42: 146–154, 2004     

螺旋线径向挤压变形对其慢波结构冷测特性的影响

 介绍了用MAFIA软件的准周期边界条件计算螺旋线行波管慢波结构的色散和耦合阻抗，以及用ANSYS软件对螺旋线径向挤压变形建模的方法，并对螺旋线受挤压径向变形对其冷测特性的影响进行了详细的分析。结果表明:螺旋线径向挤压变形会导致相速增大，而在通常的变形范围内耦合阻抗也会增加；当变形继续增大时耦合阻抗上升到最大值后开始下降。     

匹配问题实例空间和解空间结构

本文通过研究匹配问题的实例空间，匈牙利算法和解空间三者之间的关系，指出S实例空间的数目与问题复杂度之间的关系既不是充分也不是必要的，而如何对问题的解空间进行合理的分解才能是问题的关键。     

Fold‐2‐covering triangular embeddings

For a graph G and a positive integer m, G_(m) is the graph obtained from G by replacing every vertex by an independent set of size m and every edge by m² edges joining all possible new pairs of ends. If G triangulates a surface, then it is easy to see from Euler's formula that G_(m) can, in principle, triangulate a surface. For m prime and at least 7, it has previously been shown that in fact G_(m) does triangulate a surface, and in fact does so as a “covering with folds” of the original triangulation. For m = 5, this would be a consequence of Tutte's 5‐Flow Conjecture. In this work, we investigate the case m = 2 and describe simple classes of triangulations G for which G₍₂₎ does have a triangulation that covers G “with folds,” as well as providing a simple infinite class of triangulations G of the sphere for which G₍₂₎ does not triangulate any surface. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 79–92, 2003     

全固态多波长飞秒脉冲激光系统

利用棱镜对引进频谱空间啁啾来补偿飞秒脉冲激光二次谐波产生中的相位失配,提高了倍频效率建立了一套全固态、多波长(1065nm, 532nm,823.1nm, 402nm)飞秒脉冲激光系统自制的Nd:YVO4激光器输出532nm绿光激光,最高平均功率可达5.6W当用2.5W绿光激光泵浦时,从自制的钛宝石激光器及经BBO倍频可分别输出中心波长为823.1nm和402nm,平均功率300mW和73mW,谱宽32.3nm和5.1nm,脉宽22fs和33.3fs、重复率108MHz的近红外和蓝光激光整个系统具有结构紧凑、倍频效率高、运行稳定的特点.     

Enumeration of perfect matchings of a type of Cartesian products of graphs

Let G be a graph and let Pm(G) denote the number of perfect matchings of G.We denote the path with m vertices by P_m and the Cartesian product of graphs G and H by G×H. In this paper, as the continuance of our paper [W. Yan, F. Zhang, Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians, Adv. Appl. Math. 32 (2004) 175-188], we enumerate perfect matchings in a type of Cartesian products of graphs by the Pfaffian method, which was discovered by Kasteleyn. Here are some of our results:1. Let T be a tree and let C_n denote the cycle with n vertices. Then Pm(C₄×T)=∏(2+α²), where the product ranges over all eigenvalues α of T. Moreover, we prove that Pm(C₄×T) is always a square or double a square.2. Let T be a tree. Then Pm(P₄×T)=∏(1+3α²+α⁴), where the product ranges over all non-negative eigenvalues α of T.3. Let T be a tree with a perfect matching. Then Pm(P₃×T)=∏(2+α²), where the product ranges over all positive eigenvalues α of T. Moreover, we prove that Pm(C₄×T)=[Pm(P₃×T)]².