一个中频电源故障诊断自动检测系统

本文阐述了一个由８０９８单片机结合硬件所构成的中频电源故障诊断自动检测系统．开发和利用它丰富的软件来实现和完善中频电源故障的自动检测、诊断和处理能力．     

浙江中部夏熟作物田主要杂草生态相似性的数量分析

应用七级目测法对浙江中部地区27个夏熟作物田样点的杂草进行了优势等级调查，将所得数据转换成重要值，以杂草在27个样点中的重要值为运算指标，应用主成分分析法和图论聚类中的最小生成树法，对24种杂草的生态学相似性进行了比较，指出了长期使用单一的除草剂导致农田杂草种群迅速更迭的原因：杂草对除草剂的敏感性差异及不同杂草间的生态学特性的差异。     

运输网络中最小饱和流的求解

运输网络中常常由于流量的不可控易发生堵塞现象.网络发生堵塞时的饱和流值达不到最大流值.最小饱和流是运输网络,尤其是紧急疏散网络设计中很重要的一个参数.通过建立网络的割集矩阵来确定网络的堵塞截面,基于此提出了求解最小饱和流的线性规划模型及算法.举例分析表明,利用该算法计算网络最小饱和流更加简便、更加实用.     

Long-term optimal operation of series parallel reservoirs for critical period with specified monthly generation and average monthly storage

We present in this paper an efficient approach for solving the problem of planning the long-term (multiyear) operation of a multireservoir hydroelectric power system for the critical period with a monthly variable load. This load is equal to a certain percentage of the total generation at the end of the year, subject to satisfying a number of constraints on the hydrosystem, using the minimum norm formulation.The proposed method is efficient in computing time and in calculating the total expected benefits from the system during the critical period. Numerical results are reported for a real system in operation consisting of two rivers. Each river has two series reservoirs.This work was supported by the Natural Science and Engineering Research Council of Canada, Grant No. A4146.     

A note on the computational complexity of graph vertex partition

A stable set of a graph is a vertex set in which any two vertices are not adjacent. It was proven in [A. Brandstädt, V.B. Le, T. Szymczak, The complexity of some problems related to graph 3-colorability, Discrete Appl. Math. 89 (1998) 59-73] that the following problem is NP-complete: Given a bipartite graph G, check whether G has a stable set S such thatG-Sis a tree. In this paper we prove the following problem is polynomially solvable: Given a graph G with maximum degree 3 and containing no vertices of degree 2, check whether G has a stable set S such thatG-Sis a tree. Thus we partly answer a question posed by the authors in the above paper. Moreover, we give some structural characterizations for a graph G with maximum degree 3 that has a stable set S such that G-S is a tree.     

第I种非对称三态叠加多模叠加态光场的高次和压缩——第一正交分量的N次方H压缩效应

构造了第孙中禹种强度不等的非对称三态叠加多模叠加态光场|ψ₁^(ABC)〉_q.利用多模压缩态理论研究了态|ψ₁^(ABC)〉_q第一正交分量高次和压缩.结果发现:①当构成态|ψ₁^(ABC)〉_q的三个多模相干态光场的强度不相等时,在一定条件下,态|ψ₁^(ABC)〉_q的第一正交分量可出现任意幂次的高次和压缩.②当上述的三个多模相干态光场强度相等时,态|ψ₁^(ABC)〉_q的第一正交分量的高次和压缩现象消失.在这种情况下,态|ψ₁^(ABC)〉_q的第一正交分量恒处于NH最小测不准态.     

Parametric multiple sequence alignment and phylogeny construction

Bounds are given on the size of the parameter-space decomposition induced by multiple sequence alignment problems where phylogenetic information may be given or inferred. It is shown that many of the usual formulations of these problems fall within the same integer parametric framework, implying that the number of distinct optima obtained as the parameters are varied across their ranges is polynomially bounded in the length and number of sequences.     

Automorphisms of Green Orders and Their Derived Categories

In an earlier paper, Raphaël Rouquier and the author introduced the group of self-equivalences of a derived category. In the case of a Brauer tree algebra, we determined a nontrivial homomorphism of the Artin braid group to this group of self-equivalences. The class of Brauer tree algebras include blocks of finite group rings over a large enough field with cyclic defect groups. In the present paper we give an integral version of this homomorphism. Moreover, we identify some interesting arithmetic subgroups with natural groups of self-equivalences of the derived category.     

A Note on Cactus Trees: Variational vs. Recursive Approach

In this article we deal with the variational approach to cactus trees (Husimi trees) and the more common recursive approach, that are in principle equivalent for finite systems. We discuss in detail the conditions under which the two methods are equivalent also in the analysis of infinite (self-similar) cactus trees, usually investigated to the purpose of approximating ordinary lattice systems. Such issue is hardly ever considered in the literature. We show (on significant test models) that the phase diagram and the thermodynamic quantities computed by the variational method, when they deviates from the exact bulk properties of the cactus system, generally provide a better approximation to the behavior of a corresponding ordinary system. Generalizing a property proved by Kikuchi, we also show that the numerical algorithm usually employed to perform the free energy minimization in the variational approach is always convergent.