Au-Au2S复合纳米球壳微粒的空腔谐振及参量讨论

Au-Au2S复合纳米球壳微粒（金纳米球壳），是一种新型复合结构的纳米微粒，其结构为纳米级的Au2S介质球外包裹了一层几个纳米厚的黄金球壳。这种复合纳米球壳微粒可以被抽象为球型谐振腔。报道了它的空腔谐振吸收的实验结果，并且运用经典理论结合介观结构特征，讨论了有关Au-Au2S复合纳米球壳微粒空腔谐振吸收的一些重要参量，其中包括谐振吸收波长、品质因数、谐振能量等。另外，还讨论了金球壳的厚度对这些重要参量的影响。     

非傍轴平顶高斯光束M2因子两种定义的比较研究

基于功率密度的二阶矩方法,推导出了非傍轴平顶高斯(FG)光束束宽和远场发散角的解析表达式·研究表明,当w0/λ→0时,远场发散角趋于渐近值θmax=63.435°,与阶数无关·使用非傍轴高斯光束代替傍轴高斯光束作为理想光束,研究了非傍轴FG光束的M2因子,并与传统定义的M2因子作了比较·在非傍轴范畴,非傍轴FG光束的M2因子不仅与阶数N有关,而且与w0/λ有关·按照定义,当w0/λ→0时,非傍轴FG光束的M2因子不等于0,对阶数N=1,2,3时,M2因子分别趋于0.913,0.882和0.886·当N→∞时,M2因子取最小值M2min=0.816·     

关于矩阵方程X+A*X-nA＝I的正定解

本文对任意正整数n界定了矩阵方程X A*X-nA=I的正定解的特征值的范围,给出了它的极大正定解一个充分条件.     

非傍轴平顶高斯光束M2因子两种定义的比较研究

基于功率密度的二阶矩方法，推导出了非傍轴平顶高斯(FG)光束束宽和远场发散角的解析表达式.研究表明，当w0/λ→0时，远场发散角趋于渐近值θmax=63.435°，与阶数无关.使用非傍轴高斯光束代替傍轴高斯光束作为理想光束，研究了非傍轴FG光束的M2因子，并与传统定义的M2因子作了比较.在非傍轴范畴，非傍轴FG光束的M2因子不仅与阶数N有关，而且与w0/λ有关.按照定义，当w0/λ→0时，非傍轴FG光束的M2因子不等于0，对阶数N=1, 2, 3时，M2因子分别趋于0.913,0.882和0.886.当N→∞时，M2因子取最小值M2min=0.816.     

粒子-转子模型和推转壳模型中的能谱统计分析

用粒子–转子模型和推转壳模型研究了6个粒子分别填充在单j壳和双j壳上的混沌行为.分析了单j壳和双j壳情况下能谱的最近邻能级间距分布和谱刚度随自旋及推转频率的变化,结果表明,当组态空间大小不变时,系统在双j壳(g_7/2+d_5/2)情况下比在单j壳(i_13/2)情况下更规则,而当组态空间从单j壳(i_13/2)扩大到双j壳(i_13/2+g_9/2)时,系统的混沌程度变化不大.同时比较了将6个粒子的两体相互作用分别取为δ力和对力时的系统的混沌行为     

The Action Functional for Moyal Planes

Modulo some natural generalizations to noncompact spaces, we show in this Letter that Moyal planes are nonunital spectral triples in the sense of Connes. The action functional of these triples is computed, and we obtain the expected result, i.e. the noncommutative Yang–Mills action associated with the Moyal product. In particular, we show that Moyal gauge theory naturally fits into the rigorous framework of noncommutative geometry.     

Generalized Complex Spectral Decomposition for a Quantum Decay Process

By extending the notion of mixed states to functionals acting on the space of observables with diagonal singularity we obtain a well-defined complex spectral decomposition of the time evolution for a quantum decaying system. In this formalism, generalized Gamow states are obtained with well-defined physical properties.     

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.     

加权二次有理Bézier插值曲线

在本文中,给定一组有序空间数据点列及每个数据点的切矢向量,利用加权二次有理Bézier曲线对数据点作插值曲线,使该曲线具有C1连续性,并且权因子只是对相应顶点曲线附近产生影响,同调整两个相邻的权因子可以调整这两个相邻顶点之间的曲线和它的控制多边形.     

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.