基于关联规则的Apriori-Partition算法的可视化研究

关联规则的提取是数据挖掘中的重要研究内容,对关联规则提取中的Apriori算法进行了分析与研究,针对该算法的运算效率不高,对该算法进行了优化。Partition算法以经典的Apriori算法为基础,通过将数据库分成几个互不相交的块来实现算法效率的提高。同时,还介绍了一种基于Apriori-Partition算法的可视化挖掘模型,并讨论了该可视化模型的实现方法。

基于快排Partition算法的MMC电容电压均衡方法

子模块电容电压均衡是保证模块化多电平换流器(MMC)正常运行的重要部分。对于含有大量子模块的MMC型柔性直流输电(MMC-HVDC)系统,减小排序复杂度、降低器件的开关频率是工程设计的重要目标。为此,提出了一种基于快排的MMC电容电压均衡方法。基于分治思想,引入快速排序partition算法进行半快速排序,大幅度降低了排序次数,同时引入保持因子尽量保持子模块的投入状态,进而降低开关频率。最后在MATLAB/Simulink中搭建两端31电平的MMCHVDC模型进行仿真,仿真结果验证了将快排partition算法与保持因子法结合应用于子模块均压的有效性和正确性。

PARTITION算法的实现

自 1 96 2年 Hoare提出快速排序算法以来 ,就成为各种程序设计、数据结构和算法等方面教科书的必备例题 .然而其中的 partition算法几乎都采取了二重循环的形式 ,掩盖了 partition的线性本质 ,削弱了程序的可读性 .本文介绍了 Nico Romuto所做的改进 ,最后给出了一种新的实现方法 ,采取了 while- if- else的形式 ,准确表达了 partition的线性本质 。

Partition算法及其实现

划分算法是快速排序算法中的重要组成部分,本文讨论了划分算法的几种形式,将通常的双循环形式的算法改写成单循环形式的算法。

Kafka中改进型Partition过载优化算法

Kafka作为一种发布-订阅机制的高吞吐量分布式消息系统,广受业界关注。随着应用场景垂直化、多样化,Kafka现有的技术体系面临挑战。Partition过载问题(POP)指消息分发、消息订阅等操作引起Partition过度服务,并影响到物理载体Broker的性能。该问题是由Kafka中Partition文件配置管理的被动、僵化及孤立等不足所导致。针对此,提出一种改进型Partition过载优化算法(IPOOA)。该算法通过即时服务耗量、Partition相似度和配置文件自动修改相结合,实现消息分发预测以及消息分发与文件配置管理协同,从而可有效缓解Partition过载问题出现。实验从Kafka集群CPU使用率、Kafka服务延时率、Kafka系统收敛延时比等几个方面验证了算法的有效性及合理性。

A Sharding Scheme Based on Graph Partitioning Algorithm for Public Blockchain

Blockchain technology,with its attributes of decentralization,immutability,and traceability,has emerged as a powerful catalyst for enhancing traditional industries in terms of optimizing business processes.However,transaction performance and scalability has become the main challenges hindering the widespread adoption of blockchain.Due to its inability to meet the demands of high-frequency trading,blockchain cannot be adopted in many scenarios.To improve the transaction capacity,researchers have proposed some on-chain scaling technologies,including lightning networks,directed acyclic graph technology,state channels,and shardingmechanisms,inwhich sharding emerges as a potential scaling technology.Nevertheless,excessive cross-shard transactions and uneven shard workloads prevent the sharding mechanism from achieving the expected aim.This paper proposes a graphbased sharding scheme for public blockchain to efficiently balance the transaction distribution.Bymitigating crossshard transactions and evening-out workloads among shards,the scheme reduces transaction confirmation latency and enhances the transaction capacity of the blockchain.Therefore,the scheme can achieve a high-frequency transaction as well as a better blockchain scalability.Experiments results show that the scheme effectively reduces the cross-shard transaction ratio to a range of 35%-56%and significantly decreases the transaction confirmation latency to 6 s in a blockchain with no more than 25 shards.

Hybrid Strategy of Partitioned and Monolithic Methods for Solving Strongly Coupled Analysis of Inverse and Direct Piezoelectric and Circuit Coupling

The inverse and direct piezoelectric and circuit coupling are widely observed in advanced electro-mechanical systems such as piezoelectric energy harvesters.Existing strongly coupled analysis methods based on direct numerical modeling for this phenomenon can be classified into partitioned or monolithic formulations.Each formulation has its advantages and disadvantages,and the choice depends on the characteristics of each coupled problem.This study proposes a new option:a coupled analysis strategy that combines the best features of the existing formulations,namely,the hybrid partitioned-monolithic method.The analysis of inverse piezoelectricity and the monolithic analysis of direct piezoelectric and circuit interaction are strongly coupled using a partitioned iterative hierarchical algorithm.In a typical benchmark problem of a piezoelectric energy harvester,this research compares the results from the proposed method to those from the conventional strongly coupled partitioned iterative method,discussing the accuracy,stability,and computational cost.The proposed hybrid concept is effective for coupled multi-physics problems,including various coupling conditions.

Restraint effect of partition wall on the tunnel floor heave in layered rock mass

The presence of horizontal layered rocks in tunnel engineering significantly impacts the stability and strength of the surrounding rock mass,leading to floor heave in the tunnel.This study focused on preparing layered specimens of rock-like material with varying thickness to investigate the failure behaviors of tunnel floors.The results indicate that thin-layered rock mass exhibits weak interlayer bonding,causing rock layers near the surface to buckle and break upwards when subjected to horizontal squeezing.With an increase in the layer thickness,a transition in failure mode occurs from upward buckling to shear failure along the plane,leading to a noticeable reduction in floor heave deformation.The primary cause of significant deformation in floor heave is upward buckling failure.To address this issue,the study proposes the installation of a partition wall in the middle of the floor to mitigate heave deformation of the rock layers.The results demonstrate that the partition wall has a considerable stabilizing effect on the floor,reducing the zone of buckling failure and minimizing floor heave deformation.It is crucial for the partition wall to be sufficiently high to prevent buckling failure and ensure stability.Through simulation calculations on an engineering example,it is confirmed that implementing a partition wall can effectively reduce floor heave and enhance the stability of tunnel floor.

Density estimation-based method to determine sample size for random sample partition of big data

Random sample partition(RSP)is a newly developed big data representation and management model to deal with big data approximate computation problems.Academic research and practical applications have confirmed that RSP is an efficient solution for big data processing and analysis.However,a challenge for implementing RSP is determining an appropriate sample size for RSP data blocks.While a large sample size increases the burden of big data computation,a small size will lead to insufficient distribution information for RSP data blocks.To address this problem,this paper presents a novel density estimation-based method(DEM)to determine the optimal sample size for RSP data blocks.First,a theoretical sample size is calculated based on the multivariate Dvoretzky-Kiefer-Wolfowitz(DKW)inequality by using the fixed-point iteration(FPI)method.Second,a practical sample size is determined by minimizing the validation error of a kernel density estimator(KDE)constructed on RSP data blocks for an increasing sample size.Finally,a series of persuasive experiments are conducted to validate the feasibility,rationality,and effectiveness of DEM.Experimental results show that(1)the iteration function of the FPI method is convergent for calculating the theoretical sample size from the multivariate DKW inequality;(2)the KDE constructed on RSP data blocks with sample size determined by DEM can yield a good approximation of the probability density function(p.d.f);and(3)DEM provides more accurate sample sizes than the existing sample size determination methods from the perspective of p.d.f.estimation.This demonstrates that DEM is a viable approach to deal with the sample size determination problem for big data RSP implementation.

Algorithm Selection Method Based on Coupling Strength for Partitioned Analysis of Structure-Piezoelectric-Circuit Coupling

In this study, we propose an algorithm selection method based on coupling strength for the partitioned analysis ofstructure-piezoelectric-circuit coupling, which includes two types of coupling or inverse and direct piezoelectriccoupling and direct piezoelectric and circuit coupling. In the proposed method, implicit and explicit formulationsare used for strong and weak coupling, respectively. Three feasible partitioned algorithms are generated, namely(1) a strongly coupled algorithm that uses a fully implicit formulation for both types of coupling, (2) a weaklycoupled algorithm that uses a fully explicit formulation for both types of coupling, and (3) a partially stronglycoupled and partially weakly coupled algorithm that uses an implicit formulation and an explicit formulation forthe two types of coupling, respectively.Numerical examples using a piezoelectric energy harvester,which is a typicalstructure-piezoelectric-circuit coupling problem, demonstrate that the proposed method selects the most costeffectivealgorithm.

Partitioning Calculation Method of Short-Circuit Current for High Proportion DG Access to Distribution Network

Aiming at the problemthat the traditional short-circuit current calculationmethod is not applicable to Distributed Generation(DG)accessing the distribution network,the paper proposes a short-circuit current partitioning calculation method considering the degree of voltage drop at the grid-connected point of DG.Firstly,the output characteristics of DG in the process of low voltage ride through are analyzed,and the equivalent output model of DG in the fault state is obtained.Secondly,by studying the network voltage distribution law after fault in distribution networks under different DG penetration rates,the degree of voltage drop at the grid-connected point of DG is used as a partition index to partition the distribution network.Then,iterative computation is performed within each partition,and data are transferred between partitions through split nodes to realize the fast partition calculation of short-circuit current for high proportion DG access to distribution network,which solves the problems of long iteration time and large calculation error of traditional short-circuit current.Finally,a 62-node real distribution network model containing a high proportion of DG access is constructed onMATLAB/Simulink,and the simulation verifies the effectiveness of the short-circuit current partitioning calculation method proposed in the paper,and its calculation speed is improved by 48.35%compared with the global iteration method.

Understanding and simulating of three-dimensional subsurface hydrological partitioning in an alpine mountainous area, China

Critical zone(CZ)plays a vital role in sustaining biodiversity and humanity.However,flux quantification within CZ,particularly in terms of subsurface hydrological partitioning,remains a significant challenge.This study focused on quantifying subsurface hydrological partitioning,specifically in an alpine mountainous area,and highlighted the important role of lateral flow during this process.Precipitation was usually classified as two parts into the soil:increased soil water content(SWC)and lateral flow out of the soil pit.It was found that 65%–88%precipitation contributed to lateral flow.The second common partitioning class showed an increase in SWC caused by both precipitation and lateral flow into the soil pit.In this case,lateral flow contributed to the SWC increase ranging from 43%to 74%,which was notably larger than the SWC increase caused by precipitation.On alpine meadows,lateral flow from the soil pit occurred when the shallow soil was wetter than the field capacity.This result highlighted the need for three-dimensional simulation between soil layers in Earth system models(ESMs).During evapotranspiration process,significant differences were observed in the classification of subsurface hydrological partitioning among different vegetation types.Due to tangled and aggregated fine roots in the surface soil on alpine meadows,the majority of subsurface responses involved lateral flow,which provided 98%–100%of evapotranspiration(ET).On grassland,there was a high probability(0.87),which ET was entirely provided by lateral flow.The main reason for underestimating transpiration through soil water dynamics in previous research was the neglect of lateral root water uptake.Furthermore,there was a probability of 0.12,which ET was entirely provided by SWC decrease on grassland.In this case,there was a high probability(0.98)that soil water responses only occurred at layer 2(10–20 cm),because grass roots mainly distributed in this soil layer,and grasses often used their deep roots for water uptake during ET.To improve the estimation of soil water dynamics and ET,we established a random forest(RF)model to simulate lateral flow and then corrected the community land model(CLM).RF model demonstrated good performance and led to significant improvements in CLM simulation.These findings enhance our understanding of subsurface hydrological partitioning and emphasize the importance of considering lateral flow in ESMs and hydrological research.

Airgap-harmonic-oriented Partitioned Design Method of PMV Motor with Improved Torque Performances

Here,we introduce a partitioned design method that is oriented toward airgap harmonic for permanent magnet vernier(PMV)motors.The method proposes the utilization of airgap flux harmonics as an effective bridge between the torque design region and the torque performances.To illustrate the efficacy of this method,a partitioned design PMV motor is presented and compared with the initial design.Firstly,the torque design region of the rotor is artfully divided into the torque enhancement region and ripple reduction region.Meanwhile,the main harmonics that generate output torque are chosen and enhanced,optimization.Moreover,the harmonics that generate torque ripple are selected and reduced based on torque harmonics optimization.Finally,the functions of the partitioned PMV motor torque are assessed based on the finite element method.By the purposeful design of these two regions,the output torque is strengthened while torque ripple is inhibited effectively,verifying the effectiveness and reasonability of the proposed design method.

A Two-Layer Active Power Optimization and Coordinated Control for Regional Power Grid Partitioning to Promote Distributed Renewable Energy Consumption

With the large-scale development and utilization of renewable energy,industrial flexible loads,as a kind of loadside resource with strong regulation ability,provide new opportunities for the research on renewable energy consumption problem in power systems.This paper proposes a two-layer active power optimization model based on industrial flexible loads for power grid partitioning,aiming at improving the line over-limit problem caused by renewable energy consumption in power grids with high proportion of renewable energy,and achieving the safe,stable and economical operation of power grids.Firstly,according to the evaluation index of renewable energy consumption characteristics of line active power,the power grid is divided into several partitions,and the interzone tie lines are taken as the optimization objects.Then,on the basis of partitioning,a two-layer active power optimization model considering the power constraints of industrial flexible loads is established.The upper-layer model optimizes the planned power of the inter-zone tie lines under the constraint of the minimum peak-valley difference within a day;the lower-layer model optimizes the regional source-load dispatching plan of each resource in each partition under the constraint of theminimumoperation cost of the partition,so as to reduce the line overlimit phenomenon caused by renewable energy consumption and save the electricity cost of industrial flexible loads.Finally,through simulation experiments,it is verified that the proposed model can effectively mobilize industrial flexible loads to participate in power grid operation and improve the economic stability of power grid.

DAO媒介:驱动未来社会算法化与自组织的元媒介

DAO媒介是以区块链算法等技术为基础,支持数字社群协同自治的媒介,具有区块链、智能合约与投票等功能特性和要素确权、技术信任、规则构架以及场景聚合等价值禀赋。对于数字生态显露的各种问题,“算法化”是重构数字生态、降解社会系统复杂性的关键机制,DAO媒介是支撑“自组织式”算法化的元媒介。DAO媒介与数字文明时代喷发的微粒个体、微资源、微价值、微需求、微场景等相匹配,能够深度匹配人的个性与自我,形成有效的趣缘连接,进而极大地释放数字文明的生产力。DAO媒介将深刻影响社会系统的构造,将微粒个体与相关社会要素“包裹”为闭环子系统,支持其准开放的系统边界、有效的异质性整合、可持续的规则重构、子系统与父级系统的持续分化和快速进化,等等。在数字文明时代,DAO媒介将使“重新部落化”的“地球村”变为现实,其驱动构筑的DAO社会将更加多元、更加富有创造力,不断拓展人类群体实践的自由度,使人类在高度异质性聚合基础上更加和谐有序地整合协同。

基于自适应变异粒子群算法的风光储微网调度

为克服传统粒子群算法在求解时容易形成局部最优,求解精度低的不足,提出了一种基于自适应变异粒子群优化的微电网调度求解方法。惯性权重采用自适应正态分布递减,随着迭代次数的增加更新粒子位置的移动策略,并且在算法后期引入变异环节。为验证算法的有效性,文章与其他算法进行收敛性能对比,并对两种典型天气情况下的微网运行成本模型仿真求解,得到最优调度。算例结果表明,改进算法能够对粒子全局最优搜索优化,效果优于其他算法,可合理调配分布式电源出力时段,具有良好的可行性。

短定子磁浮列车基于悬浮间隙实现测速和定位的算法仿真及应用

短定子磁浮列车测速和定位技术实现方式与传统轮轨不同,目前有多种技术实现方式,但都需要在磁浮列车上设置测速和定位设备或系统,且与悬浮控制系统相互独立,但悬浮控制系统对速度信号和位置信号又有一定的依赖性。因此,设计了一种基于悬浮间隙实现测速和定位的算法,并通过仿真达到算法设计预期目的,最后通过编程将算法嵌入磁浮列车的悬浮控制系统硬件平台,实现测速和定位的算法应用,测速和定位信号完全集成于悬浮控制系统中,摆脱悬浮控制系统对外置测速定位系统的依赖,提升磁浮列车在轨道交通市场的竞争力。

基于图神经网络的瑜伽动作多特征融合识别算法

针对现有瑜伽动作识别方法不能挖掘动作与形体特征等深层次信息的问题,提出了一种基于多特征融合图神经网络的改进瑜伽动作识别算法,该算法利用瑜伽的动作历史和形体信息,结合多特征融合和图神经网络的优势,通过建模形体和动作之间的关系图,得到形体信息对不同瑜伽动作类别的影响程度,以及历史动作的长时和短时性。在实验中,对比了该方法与其他算法在瑜伽动作识别任务中的表现。结果表明,该方法在准确率、精确率、召回率和F_(1)值等指标上有明显的提高,证明了该瑜伽动作识别算法的有效性。

不完整模态数据下基于布谷鸟算法的结构损伤识别研究

鉴于安装在结构上的少量传感器难以获得完整的模态数据,文章提出一种使用不完整模态数据来定位和量化结构损伤的有效方法。首先,采用一种改进的缩聚系统方法来匹配有限元模型和实际测量中的自由度差异,从而解决模态空间不完整性问题。然后,利用不完整模态数据获得的结构柔度矩阵计算结构的静态位移。最后,利用结构的静态位移建立损伤优化函数,并采用布谷鸟算法进行求解。通过数值模拟和试验验证了所提方法的有效性和鲁棒性。数值和试验结果表明,在测量传感器数量有限的情况下,所提出的损伤识别方法仍具有高效且稳定的性能。

Symplectic partitioned Runge-Kutta method based onthe eighth-order nearly analytic discrete operator and its wavefield simulations

We propose a symplectic partitioned Runge-Kutta （SPRK） method with eighth-order spatial accuracy based on the extended Hamiltonian system of the acoustic waveequation. Known as the eighth-order NSPRK method, this technique uses an eighth-orderaccurate nearly analytic discrete （NAD） operator to discretize high-order spatial differentialoperators and employs a second-order SPRK method to discretize temporal derivatives.The stability criteria and numerical dispersion relations of the eighth-order NSPRK methodare given by a semi-analytical method and are tested by numerical experiments. We alsoshow the differences of the numerical dispersions between the eighth-order NSPRK methodand conventional numerical methods such as the fourth-order NSPRK method, the eighth-order Lax-Wendroff correction （LWC） method and the eighth-order staggered-grid （SG）method. The result shows that the ability of the eighth-order NSPRK method to suppress thenumerical dispersion is obviously superior to that of the conventional numerical methods. Inthe same computational environment, to eliminate visible numerical dispersions, the eighth-order NSPRK is approximately 2.5 times faster than the fourth-order NSPRK and 3.4 timesfaster than the fourth-order SPRK, and the memory requirement is only approximately47.17% of the fourth-order NSPRK method and 49.41% of the fourth-order SPRK method,which indicates the highest computational efficiency. Modeling examples for the two-layermodels such as the heterogeneous and Marmousi models show that the wavefields generatedby the eighth-order NSPRK method are very clear with no visible numerical dispersion.These numerical experiments illustrate that the eighth-order NSPRK method can effectivelysuppress numerical dispersion when coarse grids are adopted. Therefore, this methodcan greatly decrease computer memory requirement and accelerate the forward modelingproductivity. In general, the eighth-order NSPRK method has tremendous potential value forseismic exploration and seismology research.