Low-Rank Multi-View Subspace Clustering Based on Sparse Regularization

Multi-view Subspace Clustering (MVSC) emerges as an advanced clustering method, designed to integrate diverse views to uncover a common subspace, enhancing the accuracy and robustness of clustering results. The significance of low-rank prior in MVSC is emphasized, highlighting its role in capturing the global data structure across views for improved performance. However, it faces challenges with outlier sensitivity due to its reliance on the Frobenius norm for error measurement. Addressing this, our paper proposes a Low-Rank Multi-view Subspace Clustering Based on Sparse Regularization (LMVSC- Sparse) approach. Sparse regularization helps in selecting the most relevant features or views for clustering while ignoring irrelevant or noisy ones. This leads to a more efficient and effective representation of the data, improving the clustering accuracy and robustness, especially in the presence of outliers or noisy data. By incorporating sparse regularization, LMVSC-Sparse can effectively handle outlier sensitivity, which is a common challenge in traditional MVSC methods relying solely on low-rank priors. Then Alternating Direction Method of Multipliers (ADMM) algorithm is employed to solve the proposed optimization problems. Our comprehensive experiments demonstrate the efficiency and effectiveness of LMVSC-Sparse, offering a robust alternative to traditional MVSC methods.

基于Multi-Agent的无人机集群体系自主作战系统设计

针对无人集群自主作战体系设计中的关键问题,提出基于Multi-Agent的无人集群自主作战系统设计方法。建立无人集群各节点的Agent模型及其推演规则;对于仿真系统模块化和通用化的需求,设计系统互操作式接口和无人集群自主作战的交互关系;开展无人集群系统仿真推演验证。仿真结果表明,所提设计方案不仅能够有效开展并完成自主作战网络生成-集群演化-效能评估的全过程动态演示验证,而且能够通过重复随机试验进一步评估无人集群的协同作战效能,最后总结了集群协同作战的策略和经验。

Polynomial Approach to Optimal One-wafer Cyclic Scheduling of Treelike Hybrid Multi-Cluster Tools via Petri Nets

A treelike hybrid multi-cluster tool is composed of both single-arm and dual-arm cluster tools with a treelike topology. Scheduling such a tool is challenging. For a hybrid treelike multi-cluster tool whose bottleneck individual tool is process-bound, this work aims at finding its optimal one-wafer cyclic schedule. It is modeled with Petri nets such that a onewafer cyclic schedule is parameterized as its robots' waiting time.Based on the model, this work proves the existence of its onewafer cyclic schedule that features with the ease of industrial implementation. Then, computationally efficient algorithms are proposed to find the minimal cycle time and optimal onewafer cyclic schedule. Multi-cluster tool examples are given to illustrate the proposed approach. The use of the found schedules enables industrial multi-cluster tools to operate with their highest productivity.

Cluster consensus of second-order multi-agent systems via pinning control

This paper investigates the cluster consensus problem for second-order multi-agent systems by applying the pinning control method to a small collection of the agents. Consensus is attained independently for different agent clusters according to the community structure generated by the group partition of the underlying graph and sufficient conditions for both cluster and general consensus are obtained by using results from algebraic graph theory and the LaSalle Invariance Principle. Finally, some simple simulations are presented to illustrate the technique.

MRBCH: A Multi-Path Routing Protocol Based on Credible Cluster Heads for Wireless Sensor Networks

Wireless sensor networks are widely used for its flexibility, but they also suffer from problems like limited capacity, large node number and vulnerability to security threats. In this paper, we propose a multi-path routing protocol based on the credible cluster heads. The protocol chooses nodes with more energy remained as cluster heads at the cluster head choosing phase, and then authenticates them by the neighbor cluster heads. Using trust mechanisms it creates the credit value, and based on the credit value the multi-path cluster head routing can finally be found. The credit value is created and exchanged among the cluster heads only. Theoretical analysis combined with simulation results demonstrate that this protocol can save the resource, prolong the lifetime, and ensure the security and performance of the network.

Location of Electric Vehicle Charging Station Based on Spatial Clustering and Multi-hierarchical Fuzzy Evaluation

For the charging station construction of electric vehicle,location selecting is a key issue.There are two problems in location selection of the electric vehicle charging station.One is determining the location of charging station;the other is evaluating the location of charging station.To determine the charging station location,an spatial clustering algorithm is proposed and programmed.The example simulation shows the effectiveness of the spatial clustering algorithm.To evaluate the charging station location,a multi-hierarchical fuzzy method is proposed.Based on the location factors of electric vehicle charging station,the hierarchical evaluation structure of electric vehicle charging station location is constructed,including three levels,4first-class factors and 14second-class factors.The fuzzy multi-hierarchical evaluation model and algorithm are built.The analysis results show that the multi-hierarchical fuzzy method can reasonably complete the electric vehicle charging station location evaluation.

Cluster-assisted generation of multi-charged ions in nanosecond laser ionization of pulsed hydrogen sulfide beam at 1064 and 532 nm

The multi-charged sulfur ions of Sq^＋ （q ≤ 6） have been generated when hydrogen sulfide cluster beams are irradiated by a nanosecond laser of 1064 and 532 nm with an intensity of 10^10- 10^12W.cm^-2. S^6＋ is the dominant multicharged species at 1064 nm, while S^4＋, S^3＋ and S^2＋ ions are the main multi-charged species at 532 nm. A three-step model （i.e., multiphoton ionization triggering, inverse bremsstrahlung heating, electron collision ionizing） is proposed to explain the generation of these multi-charged ions at the laser intensity stated above. The high ionization level of the clusters and the increasing charge state of the ion products with increasing laser wavelength are supposed mainly due to the rate-limiting step, i.e., electron heating by absorption energy from the laser field via inverse bremsstrahlung, which is proportional to λ2,λA being the laser wavelength.

Multi-face detection based on downsampling and modified subtractive clustering for color images

This paper presents a multi-face detection method for color images. The method is based on the assumption that faces are well separated from the background by skin color detection. These faces can be located by the proposed method which modifies the subtractive clustering. The modified clustering algorithm proposes a new definition of distance for multi-face detection, and its key parameters can be predetermined adaptively by statistical information of face objects in the image. Downsampling is employed to reduce the computation of clustering and speed up the process of the proposed method. The effectiveness of the proposed method is illustrated by three experiments.

Outlier detection based on multi-dimensional clustering and local density

Outlier detection is an important task in data mining. In fact, it is difficult to find the clustering centers in some sophisticated multidimensional datasets and to measure the deviation degree of each potential outlier. In this work, an effective outlier detection method based on multi-dimensional clustering and local density(ODBMCLD) is proposed. ODBMCLD firstly identifies the center objects by the local density peak of data objects, and clusters the whole dataset based on the center objects. Then, outlier objects belonging to different clusters will be marked as candidates of abnormal data. Finally, the top N points among these abnormal candidates are chosen as final anomaly objects with high outlier factors. The feasibility and effectiveness of the method are verified by experiments.

Energy-Efficient Multi-Mode Clusters Maintenance(M^2CM) for Hierarchical Wireless Sensor Networks

How to energy-efficiently maintain the topology of wireless sensor networks(WSNs) is still a difficult problem because of their numerous nodes,highly dynamic nature,varied application scenarios and limited resources.An energy-efficient multi-mode clusters maintenance(M2CM) method is proposed based on localized and event-driven mechanism in this work,which is different from the conventional clusters maintenance model with always periodically re-clustered among the whole network style based on time-trigger for hierarchical WSNs.M2 CM can meet such demands of clusters maintenance as adaptive local maintenance for the damaged clusters according to its changes in time and space field.,the triggers of M2 CM include such events as nodes' residual energy being under the threshold,the load imbalance of cluster head,joining in or exiting from any cluster for new node or disable one,etc.Based on neighboring relationship of the damaged clusters,one can start a single cluster(inner-cluster) maintenance or clusters(inter-cluster) maintenance program to meet diverse demands in the topology management of hierarchical WSNs.The experiment results based on NS2 simulation show that the proposed method can significantly save energy used in maintaining a damaged network,effectively narrow down the influenced area of clusters maintenance,and increase transmitted data and prolong lifetime of network compared to the traditional schemes.

Multi-Hazard Evaluation Using Cluster Analysis—For Designated Evacuation Centers of Yokohama

Hazard maps are usually prepared for each disaster, including seismic hazard maps, flood hazard maps, and landslide hazard maps. However, when the general public attempts to check their own disaster risk, most are likely not aware of the specific types of disaster. So, first of all, we need to know what kinds of hazards are important. However, the information that integrates multiple hazards is not well maintained, and there are few such studies. On the other hand, in Japan, a lot of hazard information is being released on the Internet. So, we summarized and assessed hazard data that can be accessed online regarding shelters (where evacuees live during disasters) and their catchments (areas assigned to each shelter) in Yokohama City, Kanagawa Prefecture. Based on the results, we investigated whether a grouping by cluster analysis would allow for multi-hazard assessment. We used four natural disasters (seismic, flood, tsunami, sediment disaster) and six parameters of other population and senior population. However, since the characteristics of the population and the senior population were almost the same, only population data was used in the final examination. From the cluster analysis, it was found that it is appropriate to group the designated evacuation centers in Yokohama City into six groups. In addition, each of the six groups was found to have explainable characteristics, confirming the effectiveness of multi-hazard creation using cluster analysis. For example, we divided, all hazards are low, both flood and Seismic hazards are high, sediment hazards are high, etc. In many Japanese cities, disaster prevention measures have been constructed in consideration of ground hazards, mainly for earthquake disasters. In this paper, we confirmed the consistency between the evaluation results of the multi-hazard evaluated here and the existing ground hazard map and examined the usefulness of the designated evacuation center. Finally, the validity was confirmed by comparing this result with the ground hazard based on the actual measurement by the past research. In places where the seismic hazard is large, the two are consistent with the fact that the easiness of shaking by actual measurement is also large.

An algorithm for segmentation of lung ROI by mean-shift clustering combined with multi-scale HESSIAN matrix dot filtering

A new algorithm for segmentation of suspected lung ROI(regions of interest)by mean-shift clustering and multi-scale HESSIAN matrix dot filtering was proposed.Original image was firstly filtered by multi-scale HESSIAN matrix dot filters,round suspected nodular lesions in the image were enhanced,and linear shape regions of the trachea and vascular were suppressed.Then,three types of information,such as,shape filtering value of HESSIAN matrix,gray value,and spatial location,were introduced to feature space.The kernel function of mean-shift clustering was divided into product form of three kinds of kernel functions corresponding to the three feature information.Finally,bandwidths were calculated adaptively to determine the bandwidth of each suspected area,and they were used in mean-shift clustering segmentation.Experimental results show that by the introduction of HESSIAN matrix of dot filtering information to mean-shift clustering,nodular regions can be segmented from blood vessels,trachea,or cross regions connected to the nodule,non-nodular areas can be removed from ROIs properly,and ground glass object(GGO)nodular areas can also be segmented.For the experimental data set of 127 different forms of nodules,the average accuracy of the proposed algorithm is more than 90%.

Presentation of a multi-index clustering technique for the mathematical programming of block-cave scheduling

Long-term planning is one of the most important stages that determines the distribution of cash flows over the mine life and the feasibility of the project. However, it is not feasible in block caving to generate a production schedule that will provide optimal operating strategies without considering geotechnical constraints. This paper develops a mixed-integer linear programming(MILP) model to optimize the extraction sequence of drawpoints over multiple time horizons of block-cave mines with respect to the draw control systems. A multi-similarity index clustering technique to solve the MILP model in a reasonable time is also presented. Application and comparison of production scheduling based on the draw control system and clustering technique are illustrated using 325 drawpoints over 15 periods. The results show a significant reduction in the size of the MILP model, and in the time required to solve it.

Dynamic cluster member selection method for multi-target tracking in wireless sensor network

Multi-target tracking(MTT) is a research hotspot of wireless sensor networks at present.A self-organized dynamic cluster task allocation scheme is used to implement collaborative task allocation for MTT in WSN and a special cluster member(CM) node selection method is put forward in the scheme.An energy efficiency model was proposed under consideration of both energy consumption and remaining energy balance in the network.A tracking accuracy model based on area-sum principle was also presented through analyzing the localization accuracy of triangulation.Then,the two models mentioned above were combined to establish dynamic cluster member selection model for MTT where a comprehensive performance index function was designed to guide the CM node selection.This selection was fulfilled using genetic algorithm.Simulation results show that this method keeps both energy efficiency and tracking quality in optimal state,and also indicate the validity of genetic algorithm in implementing CM node selection.

Algorithm for Multi-laser-target Tracking Based on Clustering Fusion

Multi-laser-target tracking is an important subject in the field of signal processing of laser warners. A clustering method is applied to the measurement of laser warner, and the space-time fusion for measurements in the same cluster is accomplished. Real-time tracking of multi-laser-target and real-time picking of multi-laser-signal are introduced using data fusion of the measurements. A prototype device of the algorithm is built up. The results of experiments show that the algorithm is very effective.

Successive lag cluster consensus on multi-agent systems via delay-dependent impulsive control

We introduce a new consensus pattern, named a successive lag cluster consensus(SLCC), which is a generalized pattern of successive lag consensus(SLC). By applying delay-dependent impulsive control, the SLCC of first-order and second-order multi-agent systems is discussed. Furthermore, based on graph theory and stability theory, some sufficient conditions for the stability of SLCC on multi-agent systems are obtained. Finally, several numerical examples are given to verify the correctness of our theoretical results.

基于一致性图的权重自适应多视角谱聚类算法

随着移动设备和互联网的普及,多视角数据的采集和分享变得更加容易,其可以从多个视角更准确地描述数据。目前,一些多视角聚类算法忽略了不同视角间的一致性潜在知识和不同视角的重要性。针对该问题,提出一种平衡视角间一致性信息的多视角聚类算法。首先通过调节视角权重学习视角间一致的共享相似度矩阵,提升共享矩阵的一致性,其中相关性强的视角具有的一致性信息更多,视角权重越大,在一致性学习中发挥的作用越大,而差异性大的视角其权重越小,在学习中发挥的作用越小。其次学习视角间的一致性样本嵌入以及不同视角的特征嵌入,并将特征嵌入中包含的多样性特征信息迁移到样本嵌入中,以此促进样本嵌入的一致性表达。在不同视角特征中包含多样性信息,可补充上述共享相似度矩阵学习中单一样本关系的不足。因此,采用二部图协同聚类,通过建立样本数据、样本嵌入和特征嵌入的关系图,学习样本的特征嵌入,并将其迁移到样本嵌入中。最后将图学习、谱聚类和特征嵌入学习整合到统一的框架中进行联合优化,得到最优的样本嵌入。实验结果表明,通过对样本嵌入进行K-means聚类,将该算法运行于5个真实数据集并与7种聚类算法对比,其中在3-Sources、Yale、MRSCV1数据集上的正确率均高于对比算法5%以上,验证了该算法的有效性。

考虑射孔摩阻的水平井段内多裂缝流量均衡分配规律研究

水平井分段多簇压裂过程中,簇间应力阴影将引起多裂缝进液差异。页岩气藏生产测井数据表明,超过40%的射孔簇对油气产量无贡献。为揭示多裂缝非均匀扩展机制,建立了考虑多孔介质流固耦合的多裂缝竞争扩展有限元模型,构建了井筒流动模型,并对压裂液流动压降进行了简化表征,设计引入了管流单元和流体连接单元,有效模拟了井筒与孔眼处的流量动态分配,研究了射孔摩阻对多裂缝进液分配比例的影响规律。结果表明:当射孔摩阻增大到特定阈值时,多裂缝流量分配比例将由簇间应力阴影转变为射孔摩阻控制,合理布置低孔密、孔数可有效增大射孔摩阻,促进多裂缝均衡扩展;利用该模型对西南某区块X水平井射孔方案进行优化,当簇间距为15 m、孔径为0.015 m、总孔数由50降至32时,单簇平均进液量提高了0.125 m^(3)/min,各簇进液差异系数为3.9%;非均匀布孔时,单簇平均进液量提高了0.101 m^(3)/min,各簇进液差异系数为4.1%。该研究为水平井多裂缝均匀扩展提供了理论方法和参考依据。

基于多阶近邻约束的深度不完整多视图聚类方法

多视图聚类是重要的无监督学习方法之一,然而在实际应用中很难获取完整的多视图数据,导致不完整多视图聚类问题.大多数已有的不完整多视图聚类方法只考虑了视图的属性信息,而忽视了数据结构信息对聚类的影响,使提取的特征不能充分表示原始数据的潜在结构.针对以上问题,提出一种基于多阶近邻约束的深度不完整多视图聚类方法.首先,利用具有自注意力机制的深度自编码器获取带有视图间信息交互的深层次隐含特征,并采用加权融合的方式获取视图的公共语义信息;然后,对于不完整多视图中的缺失数据,利用多视图的公共表示进行补全;最后,提出一种多阶近邻约束机制,该机制考虑不完整多视图数据的深层结构信息,利用多视图的互补性构建近似完整的近邻图,引导编码器学习更紧致、更有判别性的高级语义特征.在公共数据集上的实验结果证明了所提方法的有效性.