Potts models with magnetic field: Arithmetic,geometry, and computation

We give a sheaf theoretic interpretation of Potts models with external magnetic field, in terms of constructible sheaves and their Euler characteristics. We show that the polynomial countability question for the hypersurfaces defined by the vanishing of the partition function is affected by changes in the magnetic field: elementary examples suffice to see non-polynomially countable cases that become polynomially countable after a perturbation of the magnetic field. The same recursive formula for the Grothendieck classes, under edge-doubling operations, holds as in the case without magnetic field, but the closed formulae for specific examples like banana graphs differ in the presence of magnetic field. We give examples of computation of the Euler characteristic with compact support, for the set of real zeros, and find a similar exponential growth with the size of the graph. This can be viewed as a measure of topological and algorithmic complexity. We also consider the computational complexity question for evaluations of the polynomial, and show both tractable and NP-hard examples, using dynamic programming.     

Soliton interaction under the influence of higher-order effects

In this paper, we present exact N-soliton solution by employing simple, straightforward Darboux transformation based on the Lax pair for Hirota equation, a higher-order nonlinear Schrödinger (HNLS) equation. As examples, one- and two-soliton solutions in explicit forms are given and their properties are also analyzed. A bound solution without interaction will be theoretically predicted if one can adjust frequency shift for each soliton appropriately. Further, we obtain the approximate eigenvalues by employing two-soliton solution and discuss analytically the interaction between neighboring solitons under the influence of the higher-order effects. It is shown that the combined effects of the higher-order effects can restrain the interaction between neighboring solitons to some extent. The results are proved by directly solving HNLS equation numerically.     

束晕-混沌的复杂性理论与控制方法及其应用前景

本文系统论述涉及强流加速器等强流离子束装置中产生的束晕-混沌的复杂性理论与控制方法及其应用前景。强流离子束在核材料生产与增殖、洁净核能、放射性废物嬗变、放射性药物生产、重离子聚变、高能物理、核科学与工程、国防与民用工业和医疗等许多方面都有极其重要的应用潜力和诱人的发展前景。尤其是，近年来强流加速器驱动的放射性洁净核能系统是国内外关注的热门课题，因为它比常规核电更安全、更干净、更便宜。但是，强流离子束形成的束晕-混沌的复杂性现象已引起了国内外广泛关注，需要加以抑制、控制和消除这类现象，解决这一难题已经成为强流离子束应用中的关键问题之一。目前不仅必须深入研究这类束晕-混沌的复杂特性及其产生的物理机制，而且需要研究如何实现对束晕-混沌的有效控制，并寻求和发展其新理论、新方法和新技术。这就向强流离子束物理和非线性-复杂性科学及其技术提出了一系列极富挑战性的新课题。本文结合国内外的研究概况，根据我们多年来的研究成果，特别是我们首创性地提出了一些束晕-混沌的有效控制方法，它们包括：非线性反馈控制法，小波反馈控制法，变结构控制法，延迟反馈控制法，参数自适应控制法等，进行重点的介绍。对上述课题当前的主要进展及相关问题进行系统的总结和比较全面综述的评论。最后，指出该领域今后的研究方向，以推动这个崭新领域的深入研究和应用发展。     

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

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

用楔形柱面光纤微透镜耦合的1.3μm SOA组件

运用激光模式耦合理论分析了半导体光放大器(SOA)与单模通信光纤的连接损耗,并设计制作了楔形柱面光纤微透镜用来实现两者的模斑匹配,有效地降低了器件的光耦合损耗.本文介绍了楔形柱面光纤微透镜耦合的1.3 μm半导体光放大器(SOA)组件及其制作方法.该组件的最大增益不小于14 dB,其偏振灵敏度小于1 dB,增益波动不大于0.5 dB.     

空间光通信指令传输的抗干扰设计

设计一种用归零码及多重相关解调技术的传输方案，并给了所需的几种抗干扰单元电路，最后结合实验说明了此方案可提高不良环境下传输数据的置信率。     

求解通信网节点间全部路由的逻辑代数化算法

经典的D IJKSTRA和BELLM AN-F LOYD通信网络路由算法,只能根据特定网络参数得到最佳路由,却无法获得网络存在的全部可用路由,而通信网理论研究及网络管理等方面,往往需要获得节点之间的全部可用路由.研究出一种路由新算法,遵循逻辑代数运算规则、采用关联矩阵中行与行之间整合与删除方式计算,N个节点的网络只需N-1次整合及删除运算,就能得到源节点到任意节点两点之间全部路由结果.详细论证了算法的正确性与合理性,简介了算法的并行运算可行性及与经典路由算法的兼容性等问题.通过算例详细说明算法的计算过程,并验证其正确性.     

Orderings of uniquely colorable hypergraphs

For a mixed hypergraph H=(X,C,D), where C and D are set systems over the vertex set X, a coloring is a partition of X into ‘color classes’ such that every C∈C meets some class in more than one vertex, and every D∈D has a nonempty intersection with at least two classes. A vertex-orderx₁,x₂,…,x_n on X (n=|X|) is uniquely colorable if the subhypergraph induced by {x_j:1?j?i} has precisely one coloring, for each i (1?i?n). We prove that it is NP-complete to decide whether a mixed hypergraph admits a uniquely colorable vertex-order, even if the input is restricted to have just one coloring. On the other hand, via a characterization theorem it can be decided in linear time whether a given color-sequence belongs to a mixed hypergraph in which the uniquely colorable vertex-order is unique.     

Reducing structural changes in van Emde Boas' data structure to the lower bound for the dynamic predecessor problem

We consider the problem of maintaining a dynamic ordered set of n integers in a universe U under the operations of insertion, deletion and predecessor queries. The computation model used is a unit-cost RAM, with a word length of w bits, and the universe size is |U|=2^w. We present a data structure that uses O(|U|/log|U|+n) space, performs all the operations in O(loglog|U|) time and needs O(loglog|U|/logloglog|U|) structural changes per update operation. The data structure is a simplified version of the van Emde Boas' tree introducing, in its construction and functioning, new concepts, which help to keep the important information for searching along the path of the tree, in a more compact and organized way.     

Computational Complexity in Algebraic Systems

Computability and computational complexity were first considered over the fields of real and complex numbers and generalized to arbitrary algebraic systems. This article approaches the theory of computational complexity over an arbitrary algebraic system by taking computability over the list extension for a computational model of it. We study the resultant polynomial complexity classes and mention some NP-complete problems.