{X,Y}-Cyclacene Graphs with Next Nearest Neighbor Interactions

Eigensolutions of {X( = C,B,N),Y( = C,B,N)}-cyclacene graphs with next nearest neighbor (nnn) interactions have been obtained in analytical forms by adapting n-fold rotational symmetry followed by two-fold rotational symmetry (or a plane of symmetry). Expressions of eigensolution indicate the subspectral relationship among such cyclacenes with an even number of hexagonal rings e.g., eigenvalues of {X,Y}-di-cyclacene are found in the eigenspectra of all such even cyclacenes. Total π-electron energies and highest occupied molecular orbital and lowest unoccupied molecular orbital (HOMO–LUMO) gaps are calculated using the analytical expressions obtained and are found to vary negligibly with the variation of nnn interactions in such cyclacenes. Total π-electron energy is found to increase due to increase in restriction intensity of nnn interactions, whereas the HOMO–LUMO gap of polyacenecs having the even number of hexagonal rings and with one electron at each site (atom) decreases with increase in the restriction intensity since such systems contain degenerate half-filled HOMO (bonding or nonbonding) that are much more vulnerable for perturbations imposed through nnn interactions.     

Entry into force of the UN Watercourses Convention: why should it matter?

The United Nations Watercourses Convention entered into force on 17 August 2014, following a long and complex journey that dates back to 1970 when the UN referred the matter to its legal arm, the International Law Commission. This article follows the Convention through that long and turbulent road, examines its main provisions and analyses the reasons for the delay of its entry into force. It concludes by answering the question of why entry into force of the Convention should indeed matter.     

相关条件下基于N-P准则的分布式检测理论研究

本文针对并行网络、二元局部判决的情况,研究了在相关条件下基于N-P准则的分布式检测融合算法,给出了在联合概率密度已知和未知两种情况下的最优融合规则的理论推导及相应的解决方案,并在实验仿真的基础上,得到了部分有益的结论。     

WCDMA系统接口信令消息的描述与实现

WCDMA作为第三代移动通信系统的主流标准，能够提供多种类型的多媒体服务。为了实现各种用户平面数据的传输，系统会提前通过控制平面对所需的无线资源进行分配。由于配置过程是通过接口之间发送控制平面应用协议消息来实现的，因此能否正确有效地对信令消息进行编解码成为保证系统稳定工作的关键因素。3GPP标准中，ASN．1语言被用来描述接口信令消息。首先简要介绍了WCDMA系统结构以及主要接口协议，重点描述了ASN．1存在的意义及其编解码规则，最后给出了基于ASN．1的开发环境下应用层网络协议的开发流程。     

Data structure and algorithms for fast automatic differentiation

In this paper we discuss the data structure and algorithms for the direct application of generalized Leibnitz rules to the numerical computation of partial derivatives in forward mode. The proposed data structure provides constant time access to the partial derivatives, which accelerates the automatic differentiation computations. The interaction among elements of the data structure is explained by several numerical examples. The paper contains analysis of the developed data structure and algorithms. Copyright © 2003 John Wiley & Sons, Ltd.     

基于小波变换的不同融合规则的图像融合研究

图像融合是一种重要的增强图像信息的方法。提出了一种基于多尺度分解的像素图像融合方法。利用小波变换按照不同融合规则及融合算子构造融合图像对应的小波系数。通过对可见光图像与红外图像进行融合的实验比较表明，以像素的局部能量为准则的融合效果更好，既可避免传统融合规则的信息损失，又提高了融合图像的空间分辨率和清晰度，融合图像更符合人的视觉特性，也有利于机器视觉。     

毛家河水电站库区岩溶发育特征及邻谷渗漏分析

毛家河水电站位于碳酸盐岩地区，库首距左岸邻谷可渡河14—23km、距右岸邻谷北盘江干流14．8km，水库两岸大型落水洞、溶洞及地下岩溶管道相对较为发育。为初步判断水库存在邻谷渗漏的可能性，对水库两岸可溶岩地层岩溶发育形态、特征及规律进行了勘察，并根据现场地质调查资料对3条可疑渗漏带进行了分析论证。     

Rectilinear steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors

We study the application of the geographic nearest neighbor approach to two problems. The first problem is the construction of an approximately minimum length rectilinear Steiner tree for a set ofn points in the plane. For this problem, we introduce a variation of a subgraph of sizeO(n) used by YaO [31] for constructing minimum spanning trees. Using this subgraph, we improve the running times of the heuristics discussed by Bern [6] fromO(n ² log n) toO(n log² n). The second problem is the construction of a rectilinear minimum spanning tree for a set ofn noncrossing line segments in the plane. We present an optimalO(n logn) algorithm for this problem. The rectilinear minimum spanning tree for a set of points can thus be computed optimally without using the Voronoi diagram. This algorithm can also be extended to obtain a rectilinear minimum spanning tree for a set of nonintersecting simple polygons.The results in this paper are a part of Y. C. Yee's Ph.D. thesis done at SUNY at Albany. He was supported in part by NSF Grants IRI-8703430 and CCR-8805782. S. S. Ravi was supported in part by NSF Grants DCI-86-03318 and CCR-89-05296.     

基于Apriori算法改进的关联规则提取算法

通过对Apriori算法的基本思想和性能的研究分析，认为Apriori算法存在一些不足。并且根据这些不足提出了相应的改进算法对Apriori算法进行优化，从而得到一种改进的Apriori算法，与原算法相比运算效率大大提高。