基于Blending-Clustering集成学习的大坝变形预测模型

【目的】变形是反映大坝结构性态最直观的效应量,构建科学合理的变形预测模型是保障大坝安全健康运行的重要手段。针对传统大坝变形预测模型预测精度低、误报率高等问题导致的错误报警现象,【方法】选取不同预测模型和聚类算法集成,构建了一种Blending-Clustering集成学习的大坝变形预测模型,该模型以Blending对单一预测模型集成提升预测精度为核心,并通过Clustering聚类优选预测值改善模型稳定性。以新疆某面板堆石坝变形监测数据为实例分析,通过多模型预测性能比较,对所提出模型的预测精度和稳定性进行全面评估。【结果】结果显示:Blending-Clustering模型将预测模型和聚类算法集成,均方根误差(RMSE)和归一化平均百分比误差(nMAPE)明显降低,模型的预测精度得到显著提高;回归相关系数(R~2)得到提升,模型具备更强的拟合能力;在面板堆石坝上22个测点变形数据集上的预测评价指标波动范围更小,模型的泛化性和稳定性得到有效增强。【结论】结果表明:Blending-Clustering集成预测模型对于预测精度、泛化性和稳定性均有明显提升,在实际工程具有一定的应用价值。

Clustered张拉整体结构的动力学建模

针对clustered张拉整体结构,提出了一种基于任意拉格朗日-欧拉(arbitrary Lagrangian-Eulerian, ALE)法的多体动力学模型。相较于传统的拉格朗日法模型,该研究中的模型具有更为简单的运动学约束。首先,引入了一种ALE时变长度索单元,其网格节点与物质点可以独立运动,提供了一种自然的方式描述结构中运动的滑轮和滑动绳索;其次,利用达朗贝尔原理,推导了该单元的广义力向量并计算了相应的雅可比矩阵;然后,建立了张拉整体系统的动力学方程,并利用广义α算法对其进行求解,选取节点的全局位置坐标和物质坐标作为广义坐标,其中全局位置坐标可以被不同物体共享,以减少动力学方程的自由度数和消除物体间的约束;最后,展示了一个数值算例,10层可折叠张拉整体塔架,对其折叠过程进行了准静态和动力学仿真,验证了模型的有效性。所提出的模型和算法可为clustered张拉整体结构的设计提供理论指导,具有工程意义。

Formation and transformation of metastable LPSO building blocks clusters in Mg-Gd-Y-Zn-Zr alloys by spinodal decomposition and heterogeneous nucleation

To study the formation and transformation mechanism of long-period stacked ordered(LPSO)structures,a systematic atomic scale analysis was conducted for the structural evolution of long-period stacked ordered(LPSO)structures in the Mg-Gd-Y-Zn-Zr alloy annealed at 300℃~500℃.Various types of metastable LPSO building block clusters were found to exist in alloy structures at different temperatures,which precipitate during the solidification and homogenization process.The stability of Zn/Y clusters is explained by the first principles of density functional theory.The LPSO structure is distinguished by the arrangement of its different Zn/Y enriched LPSO structural units,which comprises local fcc stacking sequences upon a tightly packed plane.The presence of solute atoms causes local lattice distortion,thereby enabling the rearrangement of Mg atoms in the different configurations in the local lattice,and local HCP-FCC transitions occur between Mg and Zn atoms occupying the nearest neighbor positions.This finding indicates that LPSO structures can generate necessary Schockley partial dislocations on specific slip surfaces,providing direct evidence of the transition from 18R to 14H.Growth of the LPSO,devoid of any defects and non-coherent interfaces,was observed separately from other precipitated phases.As a result,the precipitation sequence of LPSO in the solidification stage was as follows:Zn/Ycluster+Mg layers→various metastable LPSO building block clusters→18R/24R LPSO;whereas the precipitation sequence of LPSO during homogenization treatment was observed to be as follows:18R LPSO→various metastable LPSO building block clusters→14H LPSO.Of these,14H LPSO was found to be the most thermodynamically stable structure.

A flexible,modular and versatile functional part assembly toolkit for gene cluster engineering in Streptomyces

Streptomyces has enormous potential to produce novel natural products(NPs)as it harbors a huge reservoir of uncharacterized and silent natural product biosynthetic gene clusters(BGCs).However,the lack of efficient gene cluster engineering strategies has hampered the pace of new drug discovery.Here,we developed an easy-to-use,highly flexible DNA assembly toolkit for gene cluster engineering.The DNA assembly toolkit is compatible with various DNA assembling approaches including Biobrick,Golden Gate,CATCH,yeast homologous recombination-based DNA assembly and homing endonuclease-mediated assembly.This compatibility offers great flexibility in handling multiple genetic parts or refactoring large gene clusters.To demonstrate the utility of this toolkit,we quantified a library of modular regulatory parts,and engineered a gene cluster(act)using characterized promoters that led to increased production.Overall,this work provides a powerful part assembly toolkit that can be used for natural product discovery and optimization in Streptomyces.

Deep Learning and Tensor-Based Multiple Clustering Approaches for Cyber-Physical-Social Applications

The study delves into the expanding role of network platforms in our daily lives, encompassing various mediums like blogs, forums, online chats, and prominent social media platforms such as Facebook, Twitter, and Instagram. While these platforms offer avenues for self-expression and community support, they concurrently harbor negative impacts, fostering antisocial behaviors like phishing, impersonation, hate speech, cyberbullying, cyberstalking, cyberterrorism, fake news propagation, spamming, and fraud. Notably, individuals also leverage these platforms to connect with authorities and seek aid during disasters. The overarching objective of this research is to address the dual nature of network platforms by proposing innovative methodologies aimed at enhancing their positive aspects and mitigating their negative repercussions. To achieve this, the study introduces a weight learning method grounded in multi-linear attribute ranking. This approach serves to evaluate the significance of attribute combinations across all feature spaces. Additionally, a novel clustering method based on tensors is proposed to elevate the quality of clustering while effectively distinguishing selected features. The methodology incorporates a weighted average similarity matrix and optionally integrates weighted Euclidean distance, contributing to a more nuanced understanding of attribute importance. The analysis of the proposed methods yields significant findings. The weight learning method proves instrumental in discerning the importance of attribute combinations, shedding light on key aspects within feature spaces. Simultaneously, the clustering method based on tensors exhibits improved efficacy in enhancing clustering quality and feature distinction. This not only advances our understanding of attribute importance but also paves the way for more nuanced data analysis methodologies. In conclusion, this research underscores the pivotal role of network platforms in contemporary society, emphasizing their potential for both positive contributions and adverse consequences. The proposed methodologies offer novel approaches to address these dualities, providing a foundation for future research and practical applications. Ultimately, this study contributes to the ongoing discourse on optimizing the utility of network platforms while minimizing their negative impacts.

Falcon Optimization Algorithm-Based Energy Efficient Communication Protocol for Cluster-Based Vehicular Networks

Rapid development in Information Technology(IT)has allowed several novel application regions like large outdoor vehicular networks for Vehicle-to-Vehicle(V2V)transmission.Vehicular networks give a safe and more effective driving experience by presenting time-sensitive and location-aware data.The communication occurs directly between V2V and Base Station(BS)units such as the Road Side Unit(RSU),named as a Vehicle to Infrastructure(V2I).However,the frequent topology alterations in VANETs generate several problems with data transmission as the vehicle velocity differs with time.Therefore,the scheme of an effectual routing protocol for reliable and stable communications is significant.Current research demonstrates that clustering is an intelligent method for effectual routing in a mobile environment.Therefore,this article presents a Falcon Optimization Algorithm-based Energy Efficient Communication Protocol for Cluster-based Routing(FOA-EECPCR)technique in VANETS.The FOA-EECPCR technique intends to group the vehicles and determine the shortest route in the VANET.To accomplish this,the FOA-EECPCR technique initially clusters the vehicles using FOA with fitness functions comprising energy,distance,and trust level.For the routing process,the Sparrow Search Algorithm(SSA)is derived with a fitness function that encompasses two variables,namely,energy and distance.A series of experiments have been conducted to exhibit the enhanced performance of the FOA-EECPCR method.The experimental outcomes demonstrate the enhanced performance of the FOA-EECPCR approach over other current methods.

Unsaturated bi-heterometal clusters in metal-vacancy sites of 2D MoS2 for efficient hydrogen evolution

The valence states and coordination structures of doped heterometal atoms in two-dimensional(2D)nanomaterials lack predictable regulation strategies.Hence,a robust method is proposed to form unsaturated heteroatom clusters via the metal-vacancy restraint mechanism,which can precisely regulate the bonding and valence state of heterometal atoms doped in 2D molybdenum disulfide.The unsaturated valence state of heterometal Pt and Ru cluster atoms form a spatial coordination structure with Pt–S and Ru–O–S as catalytically active sites.Among them,the strong binding energy of negatively charged suspended S and O sites for H+,as well as the weak adsorption of positively charged unsaturated heterometal atoms for H*,reduces the energy barrier of the hydrogen evolution reaction proved by theoretical calculation.Whereupon,the electrocatalytic hydrogen evolution performance is markedly improved by the ensemble effect of unsaturated heterometal atoms and highlighted with an overpotential of 84 mV and Tafel slope of 68.5 mV dec^(−1).In brief,this metal vacancy-induced valence state regulation of heterometal can manipulate the coordination structure and catalytic activity of heterometal atoms doped in the 2D atomic lattice but not limited to 2D nanomaterials.

Effects of interstitial cluster mobility on dislocation loops evolution under irradiation of austenitic steel

The evolution of dislocation loops in austenitic steels irradiated with Fe^(+)is investigated using cluster dynamics(CD)simulations by developing a CD model.The CD predictions are compared with experimental results in the literature.The number density and average diameter of the dislocation loops obtained from the CD simulations are in good agreement with the experimental data obtained from transmission electron microscopy(TEM)observations of Fe~+-irradiated Solution Annealed 304,Cold Worked 316,and HR3 austenitic steels in the literature.The CD simulation results demonstrate that the diffusion of in-cascade interstitial clusters plays a major role in the dislocation loop density and dislocation loop growth;in particular,for the HR3 austenitic steel,the CD model has verified the effect of temperature on the density and size of the dislocation loops.

Weak Merging Scenario of CLASH Cluster A209

We study the structural and dynamical properties of A209 based on Chandra and XMM-Newton observations.We obtain detailed temperature,pressure,and entropy maps with the contour binning method,and find a hot region in the NW direction.The X-ray brightness residual map and corresponding temperature profiles reveal a possible shock front in the NW direction and a cold front feature in the SE direction.Combined with the galaxy luminosity density map we propose a weak merger scenario.A young sub-cluster passing from the SE to NW direction could explain the optical subpeak,the intracluster medium temperature map,the X-ray surface brightness excess,and the X-ray peak offset together.

Engineering of oxygen vacancy and bismuth cluster assisted ultrathin Bi_(12)O_(17)Cl_(2)nanosheets with efficient and selective photoreduction of CO_(2)to CO

The photocatalytic conversion of CO_(2)into solar‐powered fuels is viewed as a forward‐looking strategy to address energy scarcity and global warming.This work demonstrated the selective photoreduction of CO_(2)to CO using ultrathin Bi_(12)O_(17)Cl_(2)nanosheets decorated with hydrothermally synthesized bismuth clusters and oxygen vacancies(OVs).The characterizations revealed that the coexistences of OVs and Bi clusters generated in situ contributed to the high efficiency of CO_(2)–CO conversion(64.3μmol g^(−1)h^(−1))and perfect selectivity.The OVs on the facet(001)of the ultrathin Bi_(12)O_(17)Cl_(2)nanosheets serve as sites for CO_(2)adsorption and activation sites,capturing photoexcited electrons and prolonging light absorption due to defect states.In addition,the Bi‐cluster generated in situ offers the ability to trap holes and the surface plasmonic resonance effect.This study offers great potential for the construction of semiconductor hybrids as multiphotocatalysts,capable of being used for the elimination and conversion of CO_(2)in terms of energy and environment.

A Shared Natural Neighbors Based-Hierarchical Clustering Algorithm for Discovering Arbitrary-Shaped Clusters

In clustering algorithms,the selection of neighbors significantly affects the quality of the final clustering results.While various neighbor relationships exist,such as K-nearest neighbors,natural neighbors,and shared neighbors,most neighbor relationships can only handle single structural relationships,and the identification accuracy is low for datasets with multiple structures.In life,people’s first instinct for complex things is to divide them into multiple parts to complete.Partitioning the dataset into more sub-graphs is a good idea approach to identifying complex structures.Taking inspiration from this,we propose a novel neighbor method:Shared Natural Neighbors(SNaN).To demonstrate the superiority of this neighbor method,we propose a shared natural neighbors-based hierarchical clustering algorithm for discovering arbitrary-shaped clusters(HC-SNaN).Our algorithm excels in identifying both spherical clusters and manifold clusters.Tested on synthetic datasets and real-world datasets,HC-SNaN demonstrates significant advantages over existing clustering algorithms,particularly when dealing with datasets containing arbitrary shapes.

Multiscale and Auto-Tuned Semi-Supervised Deep Subspace Clustering and Its Application in Brain Tumor Clustering

In this paper,we introduce a novel Multi-scale and Auto-tuned Semi-supervised Deep Subspace Clustering(MAS-DSC)algorithm,aimed at addressing the challenges of deep subspace clustering in high-dimensional real-world data,particularly in the field of medical imaging.Traditional deep subspace clustering algorithms,which are mostly unsupervised,are limited in their ability to effectively utilize the inherent prior knowledge in medical images.Our MAS-DSC algorithm incorporates a semi-supervised learning framework that uses a small amount of labeled data to guide the clustering process,thereby enhancing the discriminative power of the feature representations.Additionally,the multi-scale feature extraction mechanism is designed to adapt to the complexity of medical imaging data,resulting in more accurate clustering performance.To address the difficulty of hyperparameter selection in deep subspace clustering,this paper employs a Bayesian optimization algorithm for adaptive tuning of hyperparameters related to subspace clustering,prior knowledge constraints,and model loss weights.Extensive experiments on standard clustering datasets,including ORL,Coil20,and Coil100,validate the effectiveness of the MAS-DSC algorithm.The results show that with its multi-scale network structure and Bayesian hyperparameter optimization,MAS-DSC achieves excellent clustering results on these datasets.Furthermore,tests on a brain tumor dataset demonstrate the robustness of the algorithm and its ability to leverage prior knowledge for efficient feature extraction and enhanced clustering performance within a semi-supervised learning framework.

Knowledge-Driven Possibilistic Clustering with Automatic Cluster Elimination

Traditional Fuzzy C-Means(FCM)and Possibilistic C-Means(PCM)clustering algorithms are data-driven,and their objective function minimization process is based on the available numeric data.Recently,knowledge hints have been introduced to formknowledge-driven clustering algorithms,which reveal a data structure that considers not only the relationships between data but also the compatibility with knowledge hints.However,these algorithms cannot produce the optimal number of clusters by the clustering algorithm itself;they require the assistance of evaluation indices.Moreover,knowledge hints are usually used as part of the data structure(directly replacing some clustering centers),which severely limits the flexibility of the algorithm and can lead to knowledgemisguidance.To solve this problem,this study designs a newknowledge-driven clustering algorithmcalled the PCM clusteringwith High-density Points(HP-PCM),in which domain knowledge is represented in the form of so-called high-density points.First,a newdatadensitycalculation function is proposed.The Density Knowledge Points Extraction(DKPE)method is established to filter out high-density points from the dataset to form knowledge hints.Then,these hints are incorporated into the PCM objective function so that the clustering algorithm is guided by high-density points to discover the natural data structure.Finally,the initial number of clusters is set to be greater than the true one based on the number of knowledge hints.Then,the HP-PCM algorithm automatically determines the final number of clusters during the clustering process by considering the cluster elimination mechanism.Through experimental studies,including some comparative analyses,the results highlight the effectiveness of the proposed algorithm,such as the increased success rate in clustering,the ability to determine the optimal cluster number,and the faster convergence speed.

Fixed-Time Cluster Optimization for Multi-Agent Systems Based on Piecewise Power-Law Design

Dear Editor,This letter focuses on the fixed-time(FXT)cluster optimization problem of first-order multi-agent systems(FOMASs)in an undirected network,in which the optimization objective is the sum of the objective functions of all clusters.A novel piecewise power-law control protocol with cooperative-competition relations is proposed.Furthermore,a sufficient condition is obtained to ensure that the FOMASs achieve the cluster consensus within an FXT.

A novel method for clustering cellular data to improve classification

Many fields,such as neuroscience,are experiencing the vast prolife ration of cellular data,underscoring the need fo r organizing and interpreting large datasets.A popular approach partitions data into manageable subsets via hierarchical clustering,but objective methods to determine the appropriate classification granularity are missing.We recently introduced a technique to systematically identify when to stop subdividing clusters based on the fundamental principle that cells must differ more between than within clusters.Here we present the corresponding protocol to classify cellular datasets by combining datadriven unsupervised hierarchical clustering with statistical testing.These general-purpose functions are applicable to any cellular dataset that can be organized as two-dimensional matrices of numerical values,including molecula r,physiological,and anatomical datasets.We demonstrate the protocol using cellular data from the Janelia MouseLight project to chara cterize morphological aspects of neurons.

Path-Based Clustering Algorithm with High Scalability Using the Combined Behavior of Evolutionary Algorithms

Path-based clustering algorithms typically generate clusters by optimizing a benchmark function.Most optimiza-tion methods in clustering algorithms often offer solutions close to the general optimal value.This study achieves the global optimum value for the criterion function in a shorter time using the minimax distance,Maximum Spanning Tree“MST”,and meta-heuristic algorithms,including Genetic Algorithm“GA”and Particle Swarm Optimization“PSO”.The Fast Path-based Clustering“FPC”algorithm proposed in this paper can find cluster centers correctly in most datasets and quickly perform clustering operations.The FPC does this operation using MST,the minimax distance,and a new hybrid meta-heuristic algorithm in a few rounds of algorithm iterations.This algorithm can achieve the global optimal value,and the main clustering process of the algorithm has a computational complexity of O�k2×n�.However,due to the complexity of the minimum distance algorithm,the total computational complexity is O�n2�.Experimental results of FPC on synthetic datasets with arbitrary shapes demonstrate that the algorithm is resistant to noise and outliers and can correctly identify clusters of varying sizes and numbers.In addition,the FPC requires the number of clusters as the only parameter to perform the clustering process.A comparative analysis of FPC and other clustering algorithms in this domain indicates that FPC exhibits superior speed,stability,and performance.

Cluster DetectionMethod of Endogenous Security Abnormal Attack Behavior in Air Traffic Control Network

In order to enhance the accuracy of Air Traffic Control(ATC)cybersecurity attack detection,in this paper,a new clustering detection method is designed for air traffic control network security attacks.The feature set for ATC cybersecurity attacks is constructed by setting the feature states,adding recursive features,and determining the feature criticality.The expected information gain and entropy of the feature data are computed to determine the information gain of the feature data and reduce the interference of similar feature data.An autoencoder is introduced into the AI(artificial intelligence)algorithm to encode and decode the characteristics of ATC network security attack behavior to reduce the dimensionality of the ATC network security attack behavior data.Based on the above processing,an unsupervised learning algorithm for clustering detection of ATC network security attacks is designed.First,determine the distance between the clustering clusters of ATC network security attack behavior characteristics,calculate the clustering threshold,and construct the initial clustering center.Then,the new average value of all feature objects in each cluster is recalculated as the new cluster center.Second,it traverses all objects in a cluster of ATC network security attack behavior feature data.Finally,the cluster detection of ATC network security attack behavior is completed by the computation of objective functions.The experiment took three groups of experimental attack behavior data sets as the test object,and took the detection rate,false detection rate and recall rate as the test indicators,and selected three similar methods for comparative test.The experimental results show that the detection rate of this method is about 98%,the false positive rate is below 1%,and the recall rate is above 97%.Research shows that this method can improve the detection performance of security attacks in air traffic control network.

Accelerated Particle Swarm Optimization Algorithm for Efficient Cluster Head Selection in WSN

Numerous wireless networks have emerged that can be used for short communication ranges where the infrastructure-based networks may fail because of their installation and cost.One of them is a sensor network with embedded sensors working as the primary nodes,termed Wireless Sensor Networks(WSNs),in which numerous sensors are connected to at least one Base Station(BS).These sensors gather information from the environment and transmit it to a BS or gathering location.WSNs have several challenges,including throughput,energy usage,and network lifetime concerns.Different strategies have been applied to get over these restrictions.Clustering may,therefore,be thought of as the best way to solve such issues.Consequently,it is crucial to analyze effective Cluster Head(CH)selection to maximize efficiency throughput,extend the network lifetime,and minimize energy consumption.This paper proposed an Accelerated Particle Swarm Optimization(APSO)algorithm based on the Low Energy Adaptive Clustering Hierarchy(LEACH),Neighboring Based Energy Efficient Routing(NBEER),Cooperative Energy Efficient Routing(CEER),and Cooperative Relay Neighboring Based Energy Efficient Routing(CR-NBEER)techniques.With the help of APSO in the implementation of the WSN,the main methodology of this article has taken place.The simulation findings in this study demonstrated that the suggested approach uses less energy,with respective energy consumption ranges of 0.1441 to 0.013 for 5 CH,1.003 to 0.0521 for 10 CH,and 0.1734 to 0.0911 for 15 CH.The sending packets ratio was also raised for all three CH selection scenarios,increasing from 659 to 1730.The number of dead nodes likewise dropped for the given combination,falling between 71 and 66.The network lifetime was deemed to have risen based on the results found.A hybrid with a few valuable parameters can further improve the suggested APSO-based protocol.Similar to underwater,WSN can make use of the proposed protocol.The overall results have been evaluated and compared with the existing approaches of sensor networks.

Efficient Clustering Network Based on Matrix Factorization

Contrastive learning is a significant research direction in the field of deep learning.However,existing data augmentation methods often lead to issues such as semantic drift in generated views while the complexity of model pre-training limits further improvement in the performance of existing methods.To address these challenges,we propose the Efficient Clustering Network based on Matrix Factorization(ECN-MF).Specifically,we design a batched low-rank Singular Value Decomposition(SVD)algorithm for data augmentation to eliminate redundant information and uncover major patterns of variation and key information in the data.Additionally,we design a Mutual Information-Enhanced Clustering Module(MI-ECM)to accelerate the training process by leveraging a simple architecture to bring samples from the same cluster closer while pushing samples from other clusters apart.Extensive experiments on six datasets demonstrate that ECN-MF exhibits more effective performance compared to state-of-the-art algorithms.

Improved Data Stream Clustering Method: Incorporating KD-Tree for Typicality and Eccentricity-Based Approach

Data stream clustering is integral to contemporary big data applications.However,addressing the ongoing influx of data streams efficiently and accurately remains a primary challenge in current research.This paper aims to elevate the efficiency and precision of data stream clustering,leveraging the TEDA(Typicality and Eccentricity Data Analysis)algorithm as a foundation,we introduce improvements by integrating a nearest neighbor search algorithm to enhance both the efficiency and accuracy of the algorithm.The original TEDA algorithm,grounded in the concept of“Typicality and Eccentricity Data Analytics”,represents an evolving and recursive method that requires no prior knowledge.While the algorithm autonomously creates and merges clusters as new data arrives,its efficiency is significantly hindered by the need to traverse all existing clusters upon the arrival of further data.This work presents the NS-TEDA(Neighbor Search Based Typicality and Eccentricity Data Analysis)algorithm by incorporating a KD-Tree(K-Dimensional Tree)algorithm integrated with the Scapegoat Tree.Upon arrival,this ensures that new data points interact solely with clusters in very close proximity.This significantly enhances algorithm efficiency while preventing a single data point from joining too many clusters and mitigating the merging of clusters with high overlap to some extent.We apply the NS-TEDA algorithm to several well-known datasets,comparing its performance with other data stream clustering algorithms and the original TEDA algorithm.The results demonstrate that the proposed algorithm achieves higher accuracy,and its runtime exhibits almost linear dependence on the volume of data,making it more suitable for large-scale data stream analysis research.