Multi-Scale Aggregation Graph Neural Networks Based on Feature Similarity for Semi-Supervised Learning

The problem of extracting meaningful data through graph analysis spans a range of different fields, such as social networks, knowledge graphs, citation networks, the World Wide Web, and so on. As increasingly structured data become available, the importance of being able to effectively mine and learn from such data continues to grow. In this paper, we propose the multi-scale aggregation graph neural network based on feature similarity (MAGN), a novel graph neural network defined in the vertex domain. Our model provides a simple and general semi-supervised learning method for graph-structured data, in which only a very small part of the data is labeled as the training set. We first construct a similarity matrix by calculating the similarity of original features between all adjacent node pairs, and then generate a set of feature extractors utilizing the similarity matrix to perform multi-scale feature propagation on graphs. The output of multi-scale feature propagation is finally aggregated by using the mean-pooling operation. Our method aims to improve the model representation ability via multi-scale neighborhood aggregation based on feature similarity. Extensive experimental evaluation on various open benchmarks shows the competitive performance of our method compared to a variety of popular architectures.     

SKLOF:一种新的超新星候选范围约减算法

超新星是宇宙学中的“标准烛光”, 其在星系中爆发的概率很低, 是一种特殊、稀少的天体, 只有在大量观测的星系数据中才有机会遇到, 而正处于爆发期的超新星会照亮其整个星系从而在观测获得的星系光谱中具有较明显的特征。但是, 目前已发现的超新星数量相对于大量的天体而言又是非常稀少的, 搜寻它们所用的计算时间成为能否进行后续观测的关键, 因此需要寻找高效率的超新星搜寻方法。对超新星候选范围进行约减的LOF算法的时间复杂度较高, 计算量大, 不适用于大规模数据集。为此通过对LOF算法进行改进, 提出了一种在海量星系光谱中快速约减超新星候范围的新方法(SKLOF)。首先对光谱数据集中离中心点近的数据点进行数据剪枝, 剪掉那些肯定不是超新星候选体的光谱数据对象, 然后利用改进的LOF算法计算剩余的光谱数据的孤立性因子并降序排列进行离群搜索, 最后获得超新星候选体的较小的搜索范围以便进行后续的证认。实验结果表明, 该算法十分有效, 不仅在精确度上有所提高, 而且相比于LOF算法还进一步缩短了算法的运行时间, 提高了算法的执行效率。     

一种校正相位测量轮廓术量化误差的算法

为了减小相位测量轮廓术中因数字化设备内部结构的量化处理过程引起的相位量化误差,提高相位测量精度。针对相位测量精度要求较高且表面凹凸变化不大的被扫描物体提出了一种能够有效校正相位测量轮廓术量化误差的算法,测量相位中的每一个像素点利用其相邻像素点进行校正。实验结果显示,校正之后,相位量化误差标准差减小了41.38%,相位测量的精度得到了提高。     

关于序列覆盖s映射

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

关于凸子集和（绝对）收缩核

讨论了线性度量空间中凸子集在什么情况下为该空间的收缩核，以及在什么情况下为绝对收缩核。     

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.     

L-拓扑空间中的相对强F紧性与相对超F紧性

In this paper,two concepts of relative compactness-the relative strong fuzzy compactness and the relative ultra-fuzzy compactness are defined in L-topological spaces for an arbitrary L-set.Properties of relative strong fuzzy sets and relative ultra-fuzzy compact sets are studied in detail and some characteristic theorems are given.Some examples are illustrated.     

Variable neighborhood search for minimum cost berth allocation

The berth allocation problem is to allocate space along the quayside to incoming ships at a container terminal in order to minimize some objective function. We consider minimization of total costs for waiting and handling as well as earliness or tardiness of completion, for all ships. We assume ships can arrive at any given time, i.e., before or after the berths become available. The resulting problem, which subsumes several previous ones, is expressed as a linear mixed 0–1 program. As it turns out to be too time-consuming for exact solution of instances of realistic size, a Variable Neighborhood Search (VNS) heuristic is proposed, and compared with Multi-Start (MS), a Genetic Search algorithm (GA) and a Memetic Search algorithm (MA). VNS provides optimal solutions for all instances solved to optimality in a previous paper of the first two authors and outperforms MS, MA and GA on large instances.     

General variable neighborhood search for the continuous optimization

We suggest a new heuristic for solving unconstrained continuous optimization problems. It is based on a generalized version of the variable neighborhood search metaheuristic. Different neighborhoods and distributions, induced from different metrics are ranked and used to get random points in the shaking step. We also propose VNS for solving constrained optimization problems. The constraints are handled using exterior point penalty functions within an algorithm that combines sequential and exact penalty transformations. The extensive computer analysis that includes the comparison with genetic algorithm and some other approaches on standard test functions are given. With our approach we obtain encouraging results.     

A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows

This paper presents a solution methodology for the heterogeneous fleet vehicle routing problem with time windows. The objective is to minimize the total distribution costs, or similarly to determine the optimal fleet size and mix that minimizes both the total distance travelled by vehicles and the fixed vehicle costs, such that all problem’s constraints are satisfied. The problem is solved using a two-phase solution framework based upon a hybridized Tabu Search, within a new Reactive Variable Neighborhood Search metaheuristic algorithm. Computational experiments on benchmark data sets yield high quality solutions, illustrating the effectiveness of the approach and its applicability to realistic routing problems. This work is supported by the General Secretariat for Research and Technology of the Hellenic Ministry of Development under contract GSRT NM-67.