关于图的下完美邻域数的上界一些结果

本文主要讨论了图的下完美邻域数 ,并给出了θ(G) =γ(G)的充分必要条件 ,并讨论了一些特殊图类的下完美邻域数的上界 ,特别对于树采用了对所有点分层的方法进行了较细致的讨论 ,给出了紧上界θ(T)≤ [n3] .     

Metaheuristics for the team orienteering problem

The Team Orienteering Problem (TOP) is the generalization to the case of multiple tours of the Orienteering Problem, known also as Selective Traveling Salesman Problem. A set of potential customers is available and a profit is collected from the visit to each customer. A fleet of vehicles is available to visit the customers, within a given time limit. The profit of a customer can be collected by one vehicle at most. The objective is to identify the customers which maximize the total collected profit while satisfying the given time limit for each vehicle. We propose two variants of a generalized tabu search algorithm and a variable neighborhood search algorithm for the solution of the TOP and show that each of these algorithms beats the already known heuristics. Computational experiments are made on standard instances.     

关于序列覆盖s映射

本文定义了两类序列覆盖映射，讨论了度晴空间的序列覆盖ｓ映象，特别地，我们证明了空间Ｘ具有点可数弱当且仅当Ｘ是度量空间的１序列覆盖的商ｓ映象，这回答了１９７０年Ｔ．Ｈｏｓｈｉｎａ提出了一个问题。     

A Petri net approach to the modelling and analysis of flexible manufacturing systems

In this paper we present an approach for modelling and analyzing flexible manufacturing systems (FMSs) using Petri nets. In this approach, we first build a Petri net model (PNM) of the given FMS in a bottom-up fashion and then analyze important qualitative aspects of FMS behaviour such as existence/absence of deadlocks and buffer overflows. The basis for our approach is a theorem we state and prove for computing the invariants of the union of a finite number of Petri nets when the invariants of the individual nets are known. We illustrate our approach using two typical manufacturing systems: an automated transfer line and a simple FMS.A shorter version of this paper was presented at the 1st ORSA/TIMS Special Interest Conference on FMSs, University of Michigan, Ann Arbor, August 1984.     

基于高斯混合尺度模型的压缩传感图像重构

在图像处理领域中,压缩传感重构是稀疏表示下的最重要的病态反问题之一。压缩传感图像重构利用图像可稀疏表示的先验知识,从比奈奎斯特采样率低得多的随机投影观测值中重构原始图像。为了克服传统的压缩传感算法中收敛速度慢和未利用变换系数的邻域统计特性的缺点,提出了基于高斯混合尺度模型的压缩传感图像重构算法,证明了独立的高斯混合尺度分布作为压缩传感重构的稀疏先验知识的可行性,结合全变差调整进一步提高算法的性能。实验结果表明,该算法有效地提高了重构图像的主观视觉效果和峰值信噪比,加快了压缩传感图像重构算法的收敛速度。     

Detecting community structure using label propagation with weighted coherent neighborhood propinquity

Community detection has become an important methodology to understand the organization and function of various real-world networks. The label propagation algorithm (LPA) is an almost linear time algorithm proved to be effective in finding a good community structure. However, LPA has a limitation caused by its one-hop horizon. Specifically, each node in LPA adopts the label shared by most of its one-hop neighbors; much network topology information is lost in this process, which we believe is one of the main reasons for its instability and poor performance. Therefore in this paper we introduce a measure named weighted coherent neighborhood propinquity (weighted-CNP) to represent the probability that a pair of vertices are involved in the same community. In label update, a node adopts the label that has the maximum weighted-CNP instead of the one that is shared by most of its neighbors. We propose a dynamic and adaptive weighted-CNP called entropic-CNP by using the principal of entropy to modulate the weights. Furthermore, we propose a framework to integrate the weighted-CNP in other algorithms in detecting community structure. We test our algorithm on both computer-generated networks and real-world networks. The experimental results show that our algorithm is more robust and effective than LPA in large-scale networks.     

Assessment and Prediction of Water Resources Vulnerability Based on a NRS-RF Model: A Case Study of the Song-Liao River Basin,China

The vulnerability of water resources is an important criterion for evaluating the carrying capacity of water resources systems under the influence of climate change and human activities. Moreover, assessment and prediction of river basins’ water resources vulnerability are important means to assess the water resources security state of river basins and identify possible problems in future water resources systems. Based on the constructed indicator system of water resources vulnerability assessment in Song-Liao River Basin, this paper uses the neighborhood rough set (abbreviated as NRS) method to reduce the dimensionality of the original indicator system to remove redundant attributes. Then, assessment indicators’ standard values after dimensionality reduction are taken as the evaluation sample, and the random forest regression (abbreviated as RF) model is used to assess the water resources vulnerability of the river basin. Finally, based on data under three different future climate and socio-economic scenarios, scenario predictions are made on the vulnerability of future water resources. The results show that the overall water resources vulnerability of the Song-Liao River Basin has not improved significantly in the past 18 years, and the overall vulnerability of the Song-Liao River Basin is in the level V of moderate to high vulnerability. In the future scenario 1, the overall water resources vulnerability of the river basin will improve, and it is expected to achieve an improvement to the level III of moderate to low vulnerability. At the same time, the natural vulnerability and vulnerability of carrying capacity will increase significantly in the future, and the man-made vulnerability will increase slowly, which will deteriorate to the level V of moderate to high vulnerability under Scenario 3. Therefore, taking active measures can significantly reduce the vulnerability of nature and carrying capacity, but man-made vulnerability will become a bottleneck restricting the fragility of the overall water resources of the river basin in the future.     

A hybrid metaheuristic method for the Maximum Diversity Problem

The Maximum Diversity Problem (MDP) consists in selecting a subset of m$m$ elements from a given set of n$n$ elements (n>m$n>m$) in such a way that the sum of the pairwise distances between the m$m$ chosen elements is maximized. We present a hybrid metaheuristic algorithm (denoted by MAMDP) for MDP. The algorithm uses a dedicated crossover operator to generate new solutions and a constrained neighborhood tabu search procedure for local optimization. MAMDP applies also a distance-and-quality based replacement strategy to maintain population diversity. Extensive evaluations on a large set of 120 benchmark instances show that the proposed approach competes very favorably with the current state-of-art methods for MDP. In particular, it consistently and easily attains all the best known lower bounds and yields improved lower bounds for 6 large MDP instances. The key components of MAMDP are analyzed to shed light on their influence on the performance of the algorithm.