数字图像处理技术在测定电子荷质比中的应用

本文将数字图像处理（DIP）技术应用于塞曼效应实验中的图像处理，提出了利用边缘检测确定非均匀条纹峰值和利用鼠标定位切线法快速确定圆环半径的方法。建立了CCD实时监测处理系统，编制了实用软件，方便地测定了电子荷质经，其精度比胶片法提高个数量级以上。     

Mobile gamma-irradiation robot

The source container with 98 TBq of ¹³⁷Cs and shielding made from depleted uranium has the total weight of 264 kg, height of 0.370 and diameter 0.272 m. The container is joined to accessories allowing movment of the radiation beam. The dose rate at a distance of 0.4 m in the beam axis is 50 Gy/h. Various technical means are available for manipulation and transport. The irradiation process proceeds according to a precalculated program.The safety measures have been taken to secure the possible application in historical buildings and similar objects. The licence from health physics authorities has been obtained. The first irradiation process performed is described.     

改进的计算贴片天线谐振频率的变分方法

本文提出一种具有较高精度的计算微带贴片天线谐振特性的变分方法，其主要改进在于用边界导纳计入贴片边缘场和辐射场的效应。文中导出了具有导纳边界的任意形状贴片天线谐振频率的泛函变分表达式，并对不同结构参数的圆形贴片天线进行了数值计算。所得结果与测量值比较表明，误差在１％以下     

Equitable partitions into matchings and coverings in mixed graphs

Matchings and coverings are central topics in graph theory. The close relationship between these two has been key to many fundamental algorithmic and polyhedral results. For mixed graphs, the notion of matching forest was proposed as a common generalization of matchings and branchings.In this paper, we propose the notion of mixed edge cover as a covering counterpart of matching forest, and extend the matching–covering framework to mixed graphs. While algorithmic and polyhedral results extend fairly easily, partition problems are considerably more difficult in the mixed case. We address the problems of partitioning a mixed graph into matching forests or mixed edge covers, so that all parts are equal with respect to some criterion, such as edge/arc numbers or total sizes. Moreover, we provide the best possible multicriteria equalization.     

An overview of graph covering and partitioning

While graph covering is a fundamental and well-studied problem, this field lacks a broad and unified literature review. The holistic overview of graph covering given in this article attempts to close this gap. The focus lies on a characterization and classification of the different problems discussed in the literature. In addition, notable results and common approaches are also included. Whenever appropriate, this review extends to the corresponding partitioning problems.     

Distributed fuzzy logic based energy‐aware and coverage preserving unequal clustering algorithm for wireless sensor networks

In an energy‐constrained wireless sensor networks (WSNs), clustering is found to be an effective strategy to minimize the energy depletion of sensor nodes. In clustered WSNs, network is partitioned into set of clusters, each having a coordinator called cluster head (CH), which collects data from its cluster members and forwards it to the base station (BS) via other CHs. Clustered WSNs often suffer from the hot spot problem where CHs closer to the BS die much early because of high energy consumption contributed by the data forwarding load. Such death of nodes results coverage holes in the network very early. In most applications of WSNs, coverage preservation of the target area is a primary measure of quality of service. Considering the energy limitation of sensors, most of the clustering algorithms designed for WSNs focus on energy efficiency while ignoring the coverage requirement. In this paper, we propose a distributed clustering algorithm that uses fuzzy logic to establish a trade‐off between the energy efficiency and coverage requirement. This algorithm considers both energy and coverage parameters during cluster formation to maximize the coverage preservation of target area. Further, to deal with hot spot problem, it forms unequal sized clusters such that more CHs are available closer to BS to share the high data forwarding load. The performance of the proposed clustering algorithm is compared with some of the well‐known existing algorithms under different network scenarios. The simulation results validate the superiority of our algorithm in network lifetime, coverage preservation, and energy efficiency.     

Preparation of edge states by shaking boundaries

Preparing topological states of quantum matter, such as edge states, is one of the most important directions in condensed matter physics. In this work, we present a proposal to prepare edge states in Aubry–André–Harper (AAH) model with open boundaries, which takes advantage of Lyapunov control to design operations. We show that edge states can be obtained with almost arbitrary initial states. A numerical optimalization for the control is performed and the dependence of control process on the system size is discussed. The merit of this proposal is that the shaking exerts only on the boundaries of the model. As a by-product, a topological entangled state is achieved by elaborately designing the shaking scheme.     

Covering problems in edge- and node-weighted graphs

This paper discusses the graph covering problem in which a set of edges in an edge- and node-weighted graph is chosen to satisfy some covering constraints while minimizing the sum of the weights. In this problem, because of the large integrality gap of a naive linear programming (LP) relaxation, LP rounding algorithms based on the relaxation yield poor performance. Here we propose a stronger LP relaxation for the graph covering problem. The proposed relaxation is applied to designing primal–dual algorithms for two fundamental graph covering problems: the prize-collecting edge dominating set problem and the multicut problem in trees. Our algorithms are an exact polynomial-time algorithm for the former problem, and a 2-approximation algorithm for the latter problem. These results match the currently known best results for purely edge-weighted graphs.     

基于Top-hat变换的OSAHS图像边缘检测算法

提出了一种基于多方向、多尺度Top-hat变换的图像边缘检测方法,应用于阻塞性睡眠呼吸暂停低通气综合症(Obstructive Sleep Apnea Hypopnea Syndrome, OSAHS)早期病理图像的边缘检测及诊断。首先,构造不同方向、不同尺度的Top-hat算子增强图像的对比度,利用形态学梯度进行边缘检测,然后把各个算子检测到的图像边缘按照一定的权重进行组合,得到理想的边缘,以便准确地获得病理图像的相关参数,进而实现医学电子诊断。本文以口腔图像、咽喉声带处图像、鼻道内部图像的处理为例,这三组图像的处理结果表明,与传统的边缘算子相比较,该方法能使图像的边缘信息更完整、更准确,图像的边缘闭合度可达到97.67%。