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,tra...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.展开更多
The implicit partition algorithm used to solve fluid–structure coupling problems has high accuracy,but it requires a long computation time.In this paper,a semi-implicit fluid–structure coupling algorithm based on mo...The implicit partition algorithm used to solve fluid–structure coupling problems has high accuracy,but it requires a long computation time.In this paper,a semi-implicit fluid–structure coupling algorithm based on modal force prediction-correction is proposed to improve the computational efficiency.In the pre-processing stage,the fluid domain is assumed to be a pseudo-elastic solid and merged with the solid domain to form a holistic system,and the normalized modal information of the holistic system is calculated and stored.During the sub-step cycle,the modal superposition method is used to obtain the response of the holistic system with the predicted modal force as the load,so that the deformation of the structure and the updating of the fluid mesh can be achieved simultaneously.After solving the Reynolds-averaged Navier-Stokes equations in the fluid domain,the predicted modal force is corrected and a new sub-step cycle is started until the converged result is obtained.In this method,the computation of the fluid equations and the updating of the dynamic mesh are done implicitly,while the deformation of the structure is done explicitly.Two numerical cases,vortex induced oscillation of an elastic beam and fluid–structure interaction of a final stage blade,are used to verify the efficiency and accuracy of the proposed algorithm.The results show that the proposed method achieves the same accuracy as the implicit method while the computational time is reduced.In the case of the vortex-induced oscillation problem,the computational time can be reduced to 18.6%.In the case of the final stage blade vibration,the computational time can be reduced to 53.8%.展开更多
With the large-scale integration of renewable energy sources into the grid,distribution networks are increasingly challenged by issues related to renewable energy accommodation and the mainte-nance of power quality st...With the large-scale integration of renewable energy sources into the grid,distribution networks are increasingly challenged by issues related to renewable energy accommodation and the mainte-nance of power quality stability.To address the challenge that existing partitioning methods are inad-equate for the planning and operation needs of active distribution networks under frequently changing power flow conditions,a three-stage dynamic partitioning approach is proposed based on an im-proved sand cat swarm optimization(ISCSO)algorithm.Firstly,a comprehensive dynamic partitio-ning index is developed by integrating both structural and functional metrics,including modularity,voltage regulation capability,and regional renewable energy accommodation capacity.Secondly,to overcome the limitations of the conventional sand cat swarm optimization,namely its weak global ex-ploration ability and tendency to fall into local optima in the later optimization stages,chaotic map-ping is employed to initialize a uniformly distributed population.A nonlinear sensitivity mechanism is introduced to balance global exploration and local exploitation,alongside the design of a particle encoding and position updating scheme tailored for dynamic partitioning.Furthermore,a‘state re-tention-local adjustment-global reconstruction’partitioning structure is developed.To avoid unnec-essary partition changes under minor source-load fluctuations,the concept of overlapping nodes is introduced,enabling fine-tuned adjustments under such conditions.Finally,two experimental sce-narios are designed to validate the proposed method.Simulation results demonstrate strong electrical coupling performance and show that the method enhances voltage regulation and renewable energy integration capabilities across regions.展开更多
In this work, we introduce a method of fingerprint directional image partitioning based on GA. According to the fingerprint topology, A set of dynamic partition masks and a cost estimating function are designed to gui...In this work, we introduce a method of fingerprint directional image partitioning based on GA. According to the fingerprint topology, A set of dynamic partition masks and a cost estimating function are designed to guide the partitioning procedure. Finding best fitted mask application is converted to an functional optimizing problem, and we give out a GA solution to the problem. At last, we discuss the application of the proposed method in Fingerprint Classification.展开更多
In order to solve the parallel algorithm of Petri net system with concurrent function, so as to achieve the parallel control and simulation operation of this system, this paper proposes the function partition complete...In order to solve the parallel algorithm of Petri net system with concurrent function, so as to achieve the parallel control and simulation operation of this system, this paper proposes the function partition completeness theory and algorithms of Petri net parallelization, thereby providing the theoretical support for the realization of Petri parallel algorithms. Firstly, according to the concurrent characteristics of Petri net model, we analyze the parallelism of Petri net system; then, by giving the solving process of place invariants and the function partitioning of Petri net, we propose the function partitioning conditions and determination theorem of Petri net parallelization, and conduct its theoretical proof and practical verification. On this basis, we conduct the theoretical study and analysis on the situation that Petri net system has several kinds of parallel function partitioning, propose the completeness theorem of parallelism function partitioning in Petri net system, and verify it. Finally, we give the algorithms, application examples and simulation experiment results of parallel function partitioning of Petri net systems based on place invariant. The theoretical proof and experimental results show that the function partitioning conditions and completeness theory of Petri net parallelization based on place invariant are correct, and the parallel algorithms under such theoretical basis are also correct and effective.展开更多
Hardware/software（HW/SW） partitioning is one of the key processes in an embedded system.It is used to determine which system components are assigned to hardware and which are processed by software.In contrast with p...Hardware/software（HW/SW） partitioning is one of the key processes in an embedded system.It is used to determine which system components are assigned to hardware and which are processed by software.In contrast with previous research that focuses on developing efficient heuristic,we focus on the pre-process of the task graph before the HW/SW partitioning in this paper,that is,enumerating all the sub-graphs that meet the requirements.Experimental results showed that the original graph can be reduced to 67% in the worst-case scenario and 58% in the best-case scenario.In conclusion,the reduced task graph saved hardware area while improving partitioning speed and accuracy.展开更多
Considering the defects of conventional optimization methods, a novel optimization algorithm is introduced in this paper. Target space partitioning method is used in this algorithm to solve multi-objective optimizatio...Considering the defects of conventional optimization methods, a novel optimization algorithm is introduced in this paper. Target space partitioning method is used in this algorithm to solve multi-objective optimization problem, thus achieve the coherent solution which can meet the requirements of all target functions, and improve the population's overall evolution level. The algorithm which guarantees diversity preservation and fast convergence to the Pareto set is applied to structural optimization problems. The empirical analysis supports the algorithm and gives an example with program.展开更多
This paper presents an algorithm that combines the chaos optimization algorithm with the maximum entropy ( COA-ME) by using entropy model based on chaos algorithm,in which the maximum entropy is used as the second met...This paper presents an algorithm that combines the chaos optimization algorithm with the maximum entropy ( COA-ME) by using entropy model based on chaos algorithm,in which the maximum entropy is used as the second method of searching the excellent solution. The search direction is improved by chaos optimization algorithm and realizes the selective acceptance of wrong solution. The experimental result shows that the presented algorithm can be used in the partitioning of hardware/software of reconfigurable system. It effectively reduces the local extremum problem,and search speed as well as performance of partitioning is improved.展开更多
Information about the relative importance of each criterion or theweights of criteria can have a significant influence on the ultimate rank of alternatives.Accordingly,assessing the weights of criteria is a very impor...Information about the relative importance of each criterion or theweights of criteria can have a significant influence on the ultimate rank of alternatives.Accordingly,assessing the weights of criteria is a very important task in solving multi-criteria decision-making problems.Three methods are commonly used for assessing the weights of criteria:objective,subjective,and integrated methods.In this study,an objective approach is proposed to assess the weights of criteria,called SPCmethod(Symmetry Point of Criterion).This point enriches the criterion so that it is balanced and easy to implement in the process of the evaluation of its influence on decision-making.The SPC methodology is systematically presented and supported by detailed calculations related to an artificial example.To validate the developed method,we used our numerical example and calculated the weights of criteria by CRITIC,Entropy,Standard Deviation and MEREC methods.Comparative analysis between these methods and the SPC method reveals that the developedmethod is a very reliable objective way to determine the weights of criteria.Additionally,in this study,we proposed the application of SPCmethod to evaluate the efficiency of themulti-criteria partitioning algorithm.The main idea of the evaluation is based on the following fact:the greater the uniformity of the weights of criteria,the higher the efficiency of the partitioning algorithm.The research demonstrates that the SPC method can be applied to solving different multi-criteria problems.展开更多
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 pi...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.展开更多
To overcome some drawbacks of Viterbi algorithm （VA）, such as exponential growing complexity of decoding, and its poor performance under bad channel conditions, some available known information must be used as cons...To overcome some drawbacks of Viterbi algorithm （VA）, such as exponential growing complexity of decoding, and its poor performance under bad channel conditions, some available known information must be used as constrained condition and apriori knowledge for decoding. A new constrained VA is proposed by adding con- straint bits directly for conventional codec. Compared with the conventional VA, under the bad channel condi- tion, the proposed scheme can improve the peak signal to noise ratio （PSNR） of the decoding image 2--10 dB by changing the number of constrained bits. Experimental results show that it is an efficient error-controlling way for the transmission of set partitioning in hierarchical trees （SPIHT） coded image.展开更多
基金supported by Shandong Provincial Key Research and Development Program of China(2021CXGC010107,2020CXGC010107)the Shandong Provincial Natural Science Foundation of China(ZR2020KF035)the New 20 Project of Higher Education of Jinan,China(202228017).
文摘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.
基金support of the National Natural Science Foundation of China(No.51675406)the Basic Research Project Group,China(No.514010106-205)。
文摘The implicit partition algorithm used to solve fluid–structure coupling problems has high accuracy,but it requires a long computation time.In this paper,a semi-implicit fluid–structure coupling algorithm based on modal force prediction-correction is proposed to improve the computational efficiency.In the pre-processing stage,the fluid domain is assumed to be a pseudo-elastic solid and merged with the solid domain to form a holistic system,and the normalized modal information of the holistic system is calculated and stored.During the sub-step cycle,the modal superposition method is used to obtain the response of the holistic system with the predicted modal force as the load,so that the deformation of the structure and the updating of the fluid mesh can be achieved simultaneously.After solving the Reynolds-averaged Navier-Stokes equations in the fluid domain,the predicted modal force is corrected and a new sub-step cycle is started until the converged result is obtained.In this method,the computation of the fluid equations and the updating of the dynamic mesh are done implicitly,while the deformation of the structure is done explicitly.Two numerical cases,vortex induced oscillation of an elastic beam and fluid–structure interaction of a final stage blade,are used to verify the efficiency and accuracy of the proposed algorithm.The results show that the proposed method achieves the same accuracy as the implicit method while the computational time is reduced.In the case of the vortex-induced oscillation problem,the computational time can be reduced to 18.6%.In the case of the final stage blade vibration,the computational time can be reduced to 53.8%.
基金Supported by the Technology Project of State Grid Corporation Headquarters(No.5100-202322029A-1-1-ZN)the 2024 Youth Science Foun-dation Project(No.62303006).
文摘With the large-scale integration of renewable energy sources into the grid,distribution networks are increasingly challenged by issues related to renewable energy accommodation and the mainte-nance of power quality stability.To address the challenge that existing partitioning methods are inad-equate for the planning and operation needs of active distribution networks under frequently changing power flow conditions,a three-stage dynamic partitioning approach is proposed based on an im-proved sand cat swarm optimization(ISCSO)algorithm.Firstly,a comprehensive dynamic partitio-ning index is developed by integrating both structural and functional metrics,including modularity,voltage regulation capability,and regional renewable energy accommodation capacity.Secondly,to overcome the limitations of the conventional sand cat swarm optimization,namely its weak global ex-ploration ability and tendency to fall into local optima in the later optimization stages,chaotic map-ping is employed to initialize a uniformly distributed population.A nonlinear sensitivity mechanism is introduced to balance global exploration and local exploitation,alongside the design of a particle encoding and position updating scheme tailored for dynamic partitioning.Furthermore,a‘state re-tention-local adjustment-global reconstruction’partitioning structure is developed.To avoid unnec-essary partition changes under minor source-load fluctuations,the concept of overlapping nodes is introduced,enabling fine-tuned adjustments under such conditions.Finally,two experimental sce-narios are designed to validate the proposed method.Simulation results demonstrate strong electrical coupling performance and show that the method enhances voltage regulation and renewable energy integration capabilities across regions.
文摘In this work, we introduce a method of fingerprint directional image partitioning based on GA. According to the fingerprint topology, A set of dynamic partition masks and a cost estimating function are designed to guide the partitioning procedure. Finding best fitted mask application is converted to an functional optimizing problem, and we give out a GA solution to the problem. At last, we discuss the application of the proposed method in Fingerprint Classification.
基金Supported by the National Natural Science Foundation of China(61866006,61741203)the Natural Science Foundation of Guangxi Province(2016GXNSFAA380243)+1 种基金the Guangxi Innovation-Driven Development of Special Funds Project(Gui Ke AA17204091)the Guangxi Nanning Science and Technology Development Planning Project(2018015-5)
文摘In order to solve the parallel algorithm of Petri net system with concurrent function, so as to achieve the parallel control and simulation operation of this system, this paper proposes the function partition completeness theory and algorithms of Petri net parallelization, thereby providing the theoretical support for the realization of Petri parallel algorithms. Firstly, according to the concurrent characteristics of Petri net model, we analyze the parallelism of Petri net system; then, by giving the solving process of place invariants and the function partitioning of Petri net, we propose the function partitioning conditions and determination theorem of Petri net parallelization, and conduct its theoretical proof and practical verification. On this basis, we conduct the theoretical study and analysis on the situation that Petri net system has several kinds of parallel function partitioning, propose the completeness theorem of parallelism function partitioning in Petri net system, and verify it. Finally, we give the algorithms, application examples and simulation experiment results of parallel function partitioning of Petri net systems based on place invariant. The theoretical proof and experimental results show that the function partitioning conditions and completeness theory of Petri net parallelization based on place invariant are correct, and the parallel algorithms under such theoretical basis are also correct and effective.
基金Supported by the National Natural Science Foundation of China (60970016,61173032)
文摘Hardware/software（HW/SW） partitioning is one of the key processes in an embedded system.It is used to determine which system components are assigned to hardware and which are processed by software.In contrast with previous research that focuses on developing efficient heuristic,we focus on the pre-process of the task graph before the HW/SW partitioning in this paper,that is,enumerating all the sub-graphs that meet the requirements.Experimental results showed that the original graph can be reduced to 67% in the worst-case scenario and 58% in the best-case scenario.In conclusion,the reduced task graph saved hardware area while improving partitioning speed and accuracy.
基金National Natural Science Foundations of China (No. 60970004, No. 60743010)Natural Science Foundation of ShandongProvince, China (No. Z2008G02)
文摘Considering the defects of conventional optimization methods, a novel optimization algorithm is introduced in this paper. Target space partitioning method is used in this algorithm to solve multi-objective optimization problem, thus achieve the coherent solution which can meet the requirements of all target functions, and improve the population's overall evolution level. The algorithm which guarantees diversity preservation and fast convergence to the Pareto set is applied to structural optimization problems. The empirical analysis supports the algorithm and gives an example with program.
基金Sponsored by the Natural Science Foundation of Heilongjiang Province( Grant No B2007-07)Industrial Research Projects in Qiqihaer( Grant No GYGG-09009)
文摘This paper presents an algorithm that combines the chaos optimization algorithm with the maximum entropy ( COA-ME) by using entropy model based on chaos algorithm,in which the maximum entropy is used as the second method of searching the excellent solution. The search direction is improved by chaos optimization algorithm and realizes the selective acceptance of wrong solution. The experimental result shows that the presented algorithm can be used in the partitioning of hardware/software of reconfigurable system. It effectively reduces the local extremum problem,and search speed as well as performance of partitioning is improved.
文摘Information about the relative importance of each criterion or theweights of criteria can have a significant influence on the ultimate rank of alternatives.Accordingly,assessing the weights of criteria is a very important task in solving multi-criteria decision-making problems.Three methods are commonly used for assessing the weights of criteria:objective,subjective,and integrated methods.In this study,an objective approach is proposed to assess the weights of criteria,called SPCmethod(Symmetry Point of Criterion).This point enriches the criterion so that it is balanced and easy to implement in the process of the evaluation of its influence on decision-making.The SPC methodology is systematically presented and supported by detailed calculations related to an artificial example.To validate the developed method,we used our numerical example and calculated the weights of criteria by CRITIC,Entropy,Standard Deviation and MEREC methods.Comparative analysis between these methods and the SPC method reveals that the developedmethod is a very reliable objective way to determine the weights of criteria.Additionally,in this study,we proposed the application of SPCmethod to evaluate the efficiency of themulti-criteria partitioning algorithm.The main idea of the evaluation is based on the following fact:the greater the uniformity of the weights of criteria,the higher the efficiency of the partitioning algorithm.The research demonstrates that the SPC method can be applied to solving different multi-criteria problems.
基金the Japan Society for the Promotion of Science,KAKENHI Grant Nos.20H04199 and 23H00475.
文摘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.
文摘To overcome some drawbacks of Viterbi algorithm （VA）, such as exponential growing complexity of decoding, and its poor performance under bad channel conditions, some available known information must be used as constrained condition and apriori knowledge for decoding. A new constrained VA is proposed by adding con- straint bits directly for conventional codec. Compared with the conventional VA, under the bad channel condi- tion, the proposed scheme can improve the peak signal to noise ratio （PSNR） of the decoding image 2--10 dB by changing the number of constrained bits. Experimental results show that it is an efficient error-controlling way for the transmission of set partitioning in hierarchical trees （SPIHT） coded image.
