基于语义的网格服务组合研究

随着网格技术的发展,以及网格中资源的不断增加,网格服务组合具有非常重要的意义。针对网格服务的动态性和分布性,提出了一种基于语义P2P的网格服务组织方式,并提出了将基于情景演算方法中的通用程序转化为HTN领域模板,通过加入用户偏好对SHOP2规划算法进行了改进,减小了规划空间,提高了规划效率。     

Performance Analysis of Two Ethernet over E1 Schemes

The Ethernet over E1 approach, which takes advantage of widely deployed telecom networks, is an efficient and economical way to interconnect two Ethernets in different regions. Two Ethernet over E1 schemes, namely a byte granularity scheme and a frame granularity scheme are discussed. The byte granularity scheme partitions Ethernet frames into several pieces for transmission and has a strict requirement on the maximum delay difference of multiple E1 links. To solve this problem, the newly proposed frame granularity scheme transmits separately each frame through E1 links without any partitioning. The architecture designs of both schemes are presented. This paper evaluates the throughput and delay performances of both schemes, both analytically from results calculated from delay models and using test results from field programmable gate array (FPGA) implementation. Although the frame granularity scheme has a slightly worse delay performance, it has a higher throughput, and is the only choice able to overcome large delay differences of the E1 links.     

上图像拓扑下向量优化问题弱有效解的通有稳定性

用函数的上图象之间的Hausdorff距离定义向量值函数间的距离，在此弱拓扑下研究了定义在紧距离空间上的一类具有普遍意义的n维向量值函数弱有效解的稳定性，指出在Baire分类意义下，大多数这类向量值函数的弱有效解是稳定的，且任一n维向量值函数都可以用所谓的本质函数来逼近。     

半连续函数通有连续性的一个推广

令X为度量空间,将定义在X上的下半连续有上界、上半连续有下界的实值函数f转化为集值映射F,通过Aubin定理,证明F在X上通有连续,进而证明f在X上通有连续,最后给出了定义在拓扑空间上的半连续实值函数通有连续性的一个直接证明。     

通有构形的特征多项式

首先, 给出广义平凡位置构形的定义, 并研究平凡位置构形、 广义平凡位置构形、 通有构形之间的关系. 其次, 通过建立构形和简单图的关系, 给出通有阈构形的子构形线性无关的充要条件以及通有阈构形的子构形的特征多项式.     

Research on Joint Resource Allocation for Multibeam Satellite Based on Metaheuristic Algorithms

With the rapid growth of satellite communication demand and the continuous development of high-throughput satellite systems, the satellite resource allocation problem—also called the dynamic resources management (DRM) problem—has become increasingly complex in recent years. The use of metaheuristic algorithms to obtain acceptable optimal solutions has become a hot topic in research and has the potential to be explored further. In particular, the treatment of invalid solutions is the key to algorithm performance. At present, the unused bandwidth allocation (UBA) method is commonly used to address the bandwidth constraint in the DRM problem. However, this method reduces the algorithm’s flexibility in the solution space, diminishes the quality of the optimized solution, and increases the computational complexity. In this paper, we propose a bandwidth constraint handling approach based on the non-dominated beam coding (NDBC) method, which can eliminate the bandwidth overlap constraint in the algorithm’s population evolution and achieve complete bandwidth flexibility in order to increase the quality of the optimal solution while decreasing the computational complexity. We develop a generic application architecture for metaheuristic algorithms using the NDBC method and successfully apply it to four typical algorithms. The results indicate that NDBC can enhance the quality of the optimized solution by 9–33% while simultaneously reducing computational complexity by 9–21%.     

Foliations by curves on threefolds

We study the conormal sheaves and singular schemes of one-dimensional foliations on smooth projective varieties X of dimension 3 and Picard rank 1. We prove that if the singular scheme has dimension 0, then the conormal sheaf is μ-stable whenever the tangent bundle $TX$ is stable, and apply this fact to the characterization of certain irreducible components of the moduli space of rank 2 reflexive sheaves on ${\mathbb{P}}^3$ and on a smooth quadric hypersurface $Q_3\subset {\mathbb{P}}^4$. Finally, we give a classification of local complete intersection foliations, that is, foliations with locally free conormal sheaves, of degree 0 and 1 on Q₃.     

多目标博弈加权纳什平衡点集的通用稳定性

在多目标博弈加权纳什平衡理论基础下，讨论多目标博弈在向量值支付函数伪连续条件下加权纳什平衡点的存在性结果；构建伪连续向量值支付函数的博弈空间，给出加权纳什平衡点的定义，同时定义多目标博弈的集值映射，并证明集值映射是非空的、凸的、usco映射；应用Fan-Glicksberg不动点定理、Fort定理以及本质平衡点的定义，讨论权向量和支付函数及策略集三者同时扰动下加权纳什平衡点的通有稳定性情况，得出在Baire分类意义下，构造的问题是本质的，也即是多目标博弈的加权纳什平衡点具有通有稳定性。     

Dn型通有构形的特征多项式

设W是n维欧氏空间中的D_n型Weyl群,以W的正根为法向量的超平面形成的通有构形称为D_n型通有构形,记为A(D_n)。首先建立了不含自环的符号图与A(D_n)的子构形的一一对应关系;其次,研究了一个符号圈线性相关的充要条件;最后从符号图的角度给出A(D_n)的子构形线性无关的充要条件。在此基础上,给出A(D_n)及其子构形的特征多项式的具体计算方法。