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

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

基于Real-time PCR法检测乳粉中牛源性成分定量研究

基于Real-timePCR建立了乳粉中牛源性成分相对定量检测方法,并对牛的特异性引物与探针进行了特异性、灵敏度和稳定性测试。通过模拟不同浓度牛乳粉与马乳粉混合样本,根据其△Ct值的函数关系进行线性拟合进而绘制标准曲线,建立乳粉中牛源性成分的相对定量检测。结果显示,该方法的最低检测限为0.00001 mg/mL,回收率为91.11%~119.2%,组间变异系数≤0.58%、组内变异系数≤1.44%。说明该方法在特异性与稳定性上适用于乳粉中牛源性成分及含量的掺假检测。

一种基于real-time PCR技术的TTV检测方法的建立及应用

目的:本研究旨在开发一种具有更高灵敏度和特异性的TTV检测技术,为揭示TTV在多种疾病过程中的作用提供重要的技术支持。方法:为了更精确、灵敏的检测TTV,本研究分析了目前公布的所有亚型的TTV基因序列,在此基础上建立了一种基于UTR区域的real-time PCR检测方法,并与文献报道应用较为广泛的PCR检测方法进行了对比。结果:本研究建立的方法在1×10^(7)~1×10^(1) copies/μL标准品浓度范围内具有良好的线性关系,相关系数为1.000,斜率为-3.446,检测下限为1×10^(1) copies/μL。重复性试验结果显示,组内变异系数为7.22%,表明本方法重复性、稳定性较强。针对30份临床样本,使用本研究建立的real-time PCR检测方法及目前被多个研究所使用的4套引物进行对比。结果表明,本研究所建立的方法灵敏度显著高于文献中报道的4种方法(P<0.01);Sanger测序结果表明,本方法检测出的30份阳性样本均为TTV,检测特异性为100%。结论:本研究采用基于TaqMan探针的real-time PCR检测方法,检测灵敏性高、覆盖基因型范围广,尤其对于TTV病毒载量较低的情况下能够进行定量检测,对于TTV病毒的致病性及作为免疫标志物的应用提供重要的技术支持。

Gaussian mixture models for clustering and classifying traffic flow in real-time for traffic operation and management

Based on Gaussian mixture models（GMM）, speed, flow and occupancy are used together in the cluster analysis of traffic flow data. Compared with other clustering and sorting techniques, as a structural model, the GMM is suitable for various kinds of traffic flow parameters. Gap statistics and domain knowledge of traffic flow are used to determine a proper number of clusters. The expectation-maximization （E-M） algorithm is used to estimate parameters of the GMM model. The clustered traffic flow pattems are then analyzed statistically and utilized for designing maximum likelihood classifiers for grouping real-time traffic flow data when new observations become available. Clustering analysis and pattern recognition can also be used to cluster and classify dynamic traffic flow patterns for freeway on-ramp and off-ramp weaving sections as well as for other facilities or things involving the concept of level of service, such as airports, parking lots, intersections, interrupted-flow pedestrian facilities, etc.

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.

Real-time data processing method for CO_(2) dispersion interferometer on EAST

A real-time data processing system is designed for the carbon dioxide dispersion interferometer(CO_(2)-DI)on EAST.The system utilizes the parallel and pipelining capabilities of an fieldprogrammable gate array(FPGA)to digitize and process the intensity of signals from the detector.Finally,the real-time electron density signals are exported through a digital-to-analog converter(DAC)module in the form of analog signals.The system has been successfully applied in the CO_(2)-DI system to provide low-latency electron density input to the plasma control system on EAST.Experimental results of the latest campaign with long-pulse discharges on EAST(2022–2023)demonstrate that the system can respond effectively in the case of rapid density changes,proving its reliability and accuracy for future electron density calculation.

A real-time performance improvement method for composite time scale

The composite time scale(CTS)provides a stable,accurate,and reliable time scale for modern society.The improvement of CTS’s real-time performance will improve its stability,which strengths related applications’performance.Aiming at this goal,a method achieved by determining the optimal calculation interval and accelerating adjustment stage is proposed in this paper.The determinants of the CTS’s calculation interval(characteristics of the clock ensemble,the measurement noise,the time and frequency synchronization system’s noise and the auxiliary output generator noise floor)are studied and the optimal calculation interval is obtained.We also investigate the effect of ensemble algorithm’s initial parameters on the CTS’s adjustment stage.A strategy to get the reasonable initial parameters of ensemble algorithm is designed.The results show that the adjustment stage can be finished rapidly or even can be shorten to zero with reasonable initial parameters.On this basis,we experimentally generate a distributed CTS with a calculation interval of 500 s and its stability outperforms those of the member clocks when the averaging time is longer than1700 s.The experimental result proves that the CTS’s real-time performance is significantly improved.

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.

Real-Time Intelligent Diagnosis of Co-frequency Vibration Faults in Rotating Machinery Based on Lightweight-Convolutional Neural Networks

The co-frequency vibration fault is one of the common faults in the operation of rotating equipment,and realizing the real-time diagnosis of the co-frequency vibration fault is of great significance for monitoring the health state and carrying out vibration suppression of the equipment.In engineering scenarios,co-frequency vibration faults are highlighted by rotational frequency and are difficult to identify,and existing intelligent methods require more hardware conditions and are exclusively time-consuming.Therefore,Lightweight-convolutional neural networks(LW-CNN)algorithm is proposed in this paper to achieve real-time fault diagnosis.The critical parameters are discussed and verified by simulated and experimental signals for the sliding window data augmentation method.Based on LW-CNN and data augmentation,the real-time intelligent diagnosis of co-frequency is realized.Moreover,a real-time detection method of fault diagnosis algorithm is proposed for data acquisition to fault diagnosis.It is verified by experiments that the LW-CNN and sliding window methods are used with high accuracy and real-time performance.

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.

Integrated strategy for real-time wind power fluctuation mitigation and energy storage system control

To address the impact of wind-power fluctuations on the stability of power systems,we propose a comprehensive approach that integrates multiple strategies and methods to enhance the efficiency and reliability of a system.First,we employ a strategy that restricts long-and short-term power output deviations to smoothen wind power fluctuations in real time.Second,we adopt the sliding window instantaneous complete ensemble empirical mode decomposition with adaptive noise(SW-ICEEMDAN)strategy to achieve real-time decomposition of the energy storage power,facilitating internal power distribution within the hybrid energy storage system.Finally,we introduce a rule-based multi-fuzzy control strategy for the secondary adjustment of the initial power allocation commands for different energy storage components.Through simulation validation,we demonstrate that the proposed comprehensive control strategy can smoothen wind power fluctuations in real time and decompose energy storage power.Compared with traditional empirical mode decomposition(EMD),ensemble empirical mode decomposition(EEMD),and complete ensemble empirical mode decomposition with adaptive noise(CEEMDAN)decomposition strategies,the configuration of the energy storage system under the SW-ICEEMDAN control strategy is more optimal.Additionally,the state-of-charge of energy storage components fluctuates within a reasonable range,enhancing the stability of the power system and ensuring the secure operation of the energy storage system.

Nanomaterial-assisted wearable glucose biosensors for noninvasive real-time monitoring:Pioneering point-of-care and beyond

This review explores glucose monitoring and management strategies,emphasizing the need for reliable and userfriendly wearable sensors that are the next generation of sensors for continuous glucose detection.In addition,examines key strategies for designing glucose sensors that are multi-functional,reliable,and cost-effective in a variety of contexts.The unique features of effective diabetes management technology are highlighted,with a focus on using nano/biosensor devices that can quickly and accurately detect glucose levels in the blood,improving patient treatment and control of potential diabetes-related infections.The potential of next-generation wearable and touch-sensitive nano biomedical sensor engineering designs for providing full control in assessing implantable,continuous glucose monitoring is also explored.The challenges of standardizing drug or insulin delivery doses,low-cost,real-time detection of increased blood sugar levels in diabetics,and early digital health awareness controls for the adverse effects of injectable medication are identified as unmet needs.Also,the market for biosensors is expected to expand significantly due to the rising need for portable diagnostic equipment and an ever-increasing diabetic population.The paper concludes by emphasizing the need for further research and development of glucose biosensors to meet the stringent requirements for sensitivity and specificity imposed by clinical diagnostics while being cost-effective,stable,and durable.

Real-Time Detection and Instance Segmentation of Strawberry in Unstructured Environment

The real-time detection and instance segmentation of strawberries constitute fundamental components in the development of strawberry harvesting robots.Real-time identification of strawberries in an unstructured envi-ronment is a challenging task.Current instance segmentation algorithms for strawberries suffer from issues such as poor real-time performance and low accuracy.To this end,the present study proposes an Efficient YOLACT(E-YOLACT)algorithm for strawberry detection and segmentation based on the YOLACT framework.The key enhancements of the E-YOLACT encompass the development of a lightweight attention mechanism,pyramid squeeze shuffle attention(PSSA),for efficient feature extraction.Additionally,an attention-guided context-feature pyramid network(AC-FPN)is employed instead of FPN to optimize the architecture’s performance.Furthermore,a feature-enhanced model(FEM)is introduced to enhance the prediction head’s capabilities,while efficient fast non-maximum suppression(EF-NMS)is devised to improve non-maximum suppression.The experimental results demonstrate that the E-YOLACT achieves a Box-mAP and Mask-mAP of 77.9 and 76.6,respectively,on the custom dataset.Moreover,it exhibits an impressive category accuracy of 93.5%.Notably,the E-YOLACT also demonstrates a remarkable real-time detection capability with a speed of 34.8 FPS.The method proposed in this article presents an efficient approach for the vision system of a strawberry-picking robot.

Models to Simulate Effective Coverage of Fire Station Based on Real-Time Travel Times

In recent years,frequent fire disasters have led to enormous damage in China.Effective firefighting rescues can minimize the losses caused by fires.During the rescue processes,the travel time of fire trucks can be severely affected by traffic conditions,changing the effective coverage of fire stations.However,it is still challenging to determine the effective coverage of fire stations considering dynamic traffic conditions.This paper addresses this issue by combining the traveling time calculationmodelwith the effective coverage simulationmodel.In addition,it proposes a new index of total effective coverage area(TECA)based on the time-weighted average of the effective coverage area(ECA)to evaluate the urban fire services.It also selects China as the case study to validate the feasibility of the models,a fire station(FS-JX)in Changsha.FS-JX station and its surrounding 9,117 fire risk points are selected as the fire service supply and demand points,respectively.A total of 196 simulation scenarios throughout a consecutiveweek are analyzed.Eventually,1,933,815 sets of valid sample data are obtained.The results showed that the TECA of FS-JX is 3.27 km^(2),which is far below the standard requirement of 7.00 km^(2) due to the traffic conditions.The visualization results showed that three rivers around FS-JX interrupt the continuity of its effective coverage.The proposed method can provide data support to optimize the locations of fire stations by accurately and dynamically determining the effective coverage of fire stations.

FPGA implementation of 500-MHz high-count-rate high-time-resolution real-time digital neutron-gamma discrimination for fast liquid detectors

Fast neutron flux measurements with high count rates and high time resolution have important applications in equipment such as tokamaks.In this study,real-time neutron and gamma discrimination was implemented on a self-developed 500-Msps,12-bit digitizer,and the neutron and gamma spectra were calculated directly on an FPGA.A fast neutron flux measurement system with BC-501A and EJ-309 liquid scintillator detectors was developed and a fast neutron measurement experiment was successfully performed on the HL-2 M tokamak at the Southwestern Institute of Physics,China.The experimental results demonstrated that the system obtained the neutron and gamma spectra with a time accuracy of 1 ms.At count rates of up to 1 Mcps,the figure of merit was greater than 1.05 for energies between 50 keV and 2.8 MeV.

Exploration of instantaneous frequency for local control assessment in real-time hybrid simulation

Local control parameters such as instantaneous delay and instantaneous amplitude play an essential role in evaluating the performance and maintaining the stability of real-time hybrid simulation(RTHS).However,existing methods have limitations in obtaining this local assessment in either the time domain or frequency domain.In this study,the instantaneous frequency is introduced to determine local control parameters for actuator tracking assessment in a real-time hybrid simulation.Instantaneous properties,including amplitude,delay,frequency and phase,are then calculated based on analytic signals translated from actuator tracking signals through the Hilbert transform.Potential issues are discussed and solutions are proposed for calculation of local control parameters.Numerical simulations are first conducted for sinusoidal and chirp signals with time varying amplitude error and delay to demonstrate the potential of the proposed method.Laboratory tests also are conducted for a predefined random signal as well as the RTHS of a single degree of freedom structure with a self-centering viscous damper to experimentally verify the effectiveness of the proposed use of the instantaneous frequency.Results from the ensuing analysis clearly demonstrate that the instantaneous frequency provides great potential for local control assessment,and the proposed method enables local tracking parameters with good accuracy.

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.

Real-Time Object Detection and Face Recognition Application for the Visually Impaired

The advancement of navigation systems for the visually impaired has significantly enhanced their mobility by mitigating the risk of encountering obstacles and guiding them along safe,navigable routes.Traditional approaches primarily focus on broad applications such as wayfinding,obstacle detection,and fall prevention.However,there is a notable discrepancy in applying these technologies to more specific scenarios,like identifying distinct food crop types or recognizing faces.This study proposes a real-time application designed for visually impaired individuals,aiming to bridge this research-application gap.It introduces a system capable of detecting 20 different food crop types and recognizing faces with impressive accuracies of 83.27%and 95.64%,respectively.These results represent a significant contribution to the field of assistive technologies,providing visually impaired users with detailed and relevant information about their surroundings,thereby enhancing their mobility and ensuring their safety.Additionally,it addresses the vital aspects of social engagements,acknowledging the challenges faced by visually impaired individuals in recognizing acquaintances without auditory or tactile signals,and highlights recent developments in prototype systems aimed at assisting with face recognition tasks.This comprehensive approach not only promises enhanced navigational aids but also aims to enrich the social well-being and safety of visually impaired communities.