Integrated building design is inherently a multi-objective optimization problem where two or more conflicting objectives must be minimized and/or maximized concurrently.Many multi-objective optimization algorithms hav...Integrated building design is inherently a multi-objective optimization problem where two or more conflicting objectives must be minimized and/or maximized concurrently.Many multi-objective optimization algorithms have been developed;however few of them are tested in solving building design problems.This paper compares performance of seven commonly-used multi-objective evolutionary optimization algorithms in solving the design problem of a nearly zero energy building(n ZEB) where more than 1.610 solutions would be possible.The compared algorithms include a controlled non-dominated sorting genetic algorithm witha passive archive(p NSGA-II),a multi-objective particle swarm optimization(MOPSO),a two-phase optimization using the genetic algorithm(PR_GA),an elitist non-dominated sorting evolution strategy(ENSES),a multi-objective evolutionary algorithm based on the concept of epsilon dominance(ev MOGA),a multi-objective differential evolution algorithm(sp MODE-II),and a multi-objective dragonfly algorithm(MODA).Several criteria was used to compare performance of these algorithms.In most cases,the quality of the obtained solutions was improved when the number of generations was increased.The optimization results of running each algorithm20 times with gradually increasing number of evaluations indicated that the PR_GA algorithm had a high repeatability to explore a large area of the solution-space and achieved close-to-optimal solutions with a good diversity,followed by the p NSGA-II,ev MOGA and sp MODE-II.Uncompetitive results were achieved by the ENSES,MOPSO and MODA in most running cases.The study also found that 1400-1800 were minimum required number of evaluations to stabilize optimization results of the building energy model.展开更多
This paper reviewed the recent progress in the field of electrocardiogram (ECG) compression and compared the efficiency of some compression algorithms. By experimenting on the 500 cases of ECG signals from the ECG dat...This paper reviewed the recent progress in the field of electrocardiogram (ECG) compression and compared the efficiency of some compression algorithms. By experimenting on the 500 cases of ECG signals from the ECG database of China, it obtained the numeral indexes for each algorithm. Then by using the automatic diagnostic program developed by Shanghai Zhongshan Hospital, it also got the parameters of the reconstructed signals from linear approximation distance threshold (LADT), wavelet transform (WT), differential pulse code modulation (DPCM) and discrete cosine transform (DCT) algorithm. The results show that when the index of percent of root mean square difference(PRD) is less than 2.5%, the diagnostic agreement ratio is more than 90%; the index of PRD cannot completely show the damage of significant clinical information; the performance of wavelet algorithm exceeds other methods in the same compression ratio (CR). For the statistical result of the parameters of various methods and the clinical diagnostic results, it is of certain value and originality in the field of ECG compression research.展开更多
In this article we summarize some aperiodic checkpoint placement algorithms for a software system over infinite and finite operation time horizons, and compare them in terms of computational accuracy. The underlying p...In this article we summarize some aperiodic checkpoint placement algorithms for a software system over infinite and finite operation time horizons, and compare them in terms of computational accuracy. The underlying problem is formulated as the maximization of steady-state system availability and is to determine the optimal aperiodic checkpoint sequence. We present two exact computation algorithms in both forward and backward manners and two approximate ones;constant hazard approximation and fluid approximation, toward this end. In numerical examples with Weibull system failure time distribution, it is shown that the combined algorithm with the fluid approximation can calculate effectively the exact solutions on the optimal aperiodic checkpoint sequence.展开更多
Discrete curves are composed of a set of ordered discrete points distributed at the intersection of the scanning plane and the surface of the object. In order to accurately calculate the geometric characteristics of a...Discrete curves are composed of a set of ordered discrete points distributed at the intersection of the scanning plane and the surface of the object. In order to accurately calculate the geometric characteristics of any point on the discrete curve, a distance-based Gaussian weighted algorithm is proposed to estimate the geometric characteristics of three-dimensional space discrete curves. According to the definition of discrete derivatives, the algorithm fully considers the relative position difference between a specific point and its neighboring points, introduces the distance weighting idea, and integrates the smoothing strategy. The experiment uses two spatial discrete curves for uniform and non-uniform sampling, and compares them with two commonly used estimation algorithms. The comparative analysis is carried out in terms of sampling density, neighborhood radius and noise resistance. The experimental results show that the Gaussian distance weighted algorithm is effective and provides an efficient algorithm for underground pipeline safety detection.展开更多
The study and comparison of sequences of characters from a finite alphabet is relevant to various areas of science, notably molecular biology. The measurement of sequence similarity involves the consideration of the p...The study and comparison of sequences of characters from a finite alphabet is relevant to various areas of science, notably molecular biology. The measurement of sequence similarity involves the consideration of the possible sequence alignments in order to find an optimal one for which the “distance” between sequences is minimum. In biology informatics area, it is a more important and difficult problem due to the long length (100 at least) of sequence, this cause the compute complexity and large memory require. By associating a path in a lattice to each alignment, a geometric insight can be brought into the problem of finding an optimal alignment, this give an obvious encoding of each path. This problem can be solved by applying genetic algorithm, which is more efficient than dynamic programming and hidden Markov model using commomly now.展开更多
Different fusion algorithm has its own advantages and limitations,so it is very difficult to simply evaluate the good points and bad points of the fusion algorithm. Whether an algorithm was selected to fuse object ima...Different fusion algorithm has its own advantages and limitations,so it is very difficult to simply evaluate the good points and bad points of the fusion algorithm. Whether an algorithm was selected to fuse object images was also depended upon the sensor types and special research purposes. Firstly,five fusion methods,i. e. IHS,Brovey,PCA,SFIM and Gram-Schmidt,were briefly described in the paper. And then visual judgment and quantitative statistical parameters were used to assess the five algorithms. Finally,in order to determine which one is the best suitable fusion method for land cover classification of IKONOS image,the maximum likelihood classification( MLC) was applied using the above five fusion images. The results showed that the fusion effect of SFIM transform and Gram-Schmidt transform were better than the other three image fusion methods in spatial details improvement and spectral information fidelity,and Gram-Schmidt technique was superior to SFIM transform in the aspect of expressing image details. The classification accuracy of the fused image using Gram-Schmidt and SFIM algorithms was higher than that of the other three image fusion methods,and the overall accuracy was greater than 98%. The IHS-fused image classification accuracy was the lowest,the overall accuracy and kappa coefficient were 83. 14% and 0. 76,respectively. Thus the IKONOS fusion images obtained by the Gram-Schmidt and SFIM were better for improving the land cover classification accuracy.展开更多
A new deterministic formulation,called the conditional expectation formulation,is proposed for dynamic stochastic programming problems in order to overcome some disadvantages of existing deterministic formulations.We ...A new deterministic formulation,called the conditional expectation formulation,is proposed for dynamic stochastic programming problems in order to overcome some disadvantages of existing deterministic formulations.We then check the impact of the new deterministic formulation and other two deterministic formulations on the corresponding problem size,nonzero elements and solution time by solving some typical dynamic stochastic programming problems with different interior point algorithms.Numerical results show the advantage and application of the new deterministic formulation.展开更多
The implementation of the coordinate rotational digital computer （CORDIC） algorithm with wave pipelining technique on field programmable gate array （FPGA） is described. All data in FPGA-based wave pipelining pass ...The implementation of the coordinate rotational digital computer （CORDIC） algorithm with wave pipelining technique on field programmable gate array （FPGA） is described. All data in FPGA-based wave pipelining pass through a number of logic gates, in the same way that all data pass through the same number of registers in a conventional pipeline. Moreover, all paths are routed using identical routing resources. The manual placement, timing driven routing and timing analyzing techniques are applied to optimize the layout for achieving good path balance. Experimental results show that a 256-LUT logic depth circuit mapped on XC4VLX15-12 runs as high as 330 MHz, whichis a little lower than the speed of 336 MHz based on the conventional 16-stage pipelining in the same chip. The latency of the wave pipelining circuit is 30.3 ns, which is 36.4% shorter than the latency of 16-stage conventional pipelining circuit.展开更多
文摘Integrated building design is inherently a multi-objective optimization problem where two or more conflicting objectives must be minimized and/or maximized concurrently.Many multi-objective optimization algorithms have been developed;however few of them are tested in solving building design problems.This paper compares performance of seven commonly-used multi-objective evolutionary optimization algorithms in solving the design problem of a nearly zero energy building(n ZEB) where more than 1.610 solutions would be possible.The compared algorithms include a controlled non-dominated sorting genetic algorithm witha passive archive(p NSGA-II),a multi-objective particle swarm optimization(MOPSO),a two-phase optimization using the genetic algorithm(PR_GA),an elitist non-dominated sorting evolution strategy(ENSES),a multi-objective evolutionary algorithm based on the concept of epsilon dominance(ev MOGA),a multi-objective differential evolution algorithm(sp MODE-II),and a multi-objective dragonfly algorithm(MODA).Several criteria was used to compare performance of these algorithms.In most cases,the quality of the obtained solutions was improved when the number of generations was increased.The optimization results of running each algorithm20 times with gradually increasing number of evaluations indicated that the PR_GA algorithm had a high repeatability to explore a large area of the solution-space and achieved close-to-optimal solutions with a good diversity,followed by the p NSGA-II,ev MOGA and sp MODE-II.Uncompetitive results were achieved by the ENSES,MOPSO and MODA in most running cases.The study also found that 1400-1800 were minimum required number of evaluations to stabilize optimization results of the building energy model.
文摘This paper reviewed the recent progress in the field of electrocardiogram (ECG) compression and compared the efficiency of some compression algorithms. By experimenting on the 500 cases of ECG signals from the ECG database of China, it obtained the numeral indexes for each algorithm. Then by using the automatic diagnostic program developed by Shanghai Zhongshan Hospital, it also got the parameters of the reconstructed signals from linear approximation distance threshold (LADT), wavelet transform (WT), differential pulse code modulation (DPCM) and discrete cosine transform (DCT) algorithm. The results show that when the index of percent of root mean square difference(PRD) is less than 2.5%, the diagnostic agreement ratio is more than 90%; the index of PRD cannot completely show the damage of significant clinical information; the performance of wavelet algorithm exceeds other methods in the same compression ratio (CR). For the statistical result of the parameters of various methods and the clinical diagnostic results, it is of certain value and originality in the field of ECG compression research.
文摘In this article we summarize some aperiodic checkpoint placement algorithms for a software system over infinite and finite operation time horizons, and compare them in terms of computational accuracy. The underlying problem is formulated as the maximization of steady-state system availability and is to determine the optimal aperiodic checkpoint sequence. We present two exact computation algorithms in both forward and backward manners and two approximate ones;constant hazard approximation and fluid approximation, toward this end. In numerical examples with Weibull system failure time distribution, it is shown that the combined algorithm with the fluid approximation can calculate effectively the exact solutions on the optimal aperiodic checkpoint sequence.
文摘目的基于机器学习构建高精度、可解释性好的后路腰椎椎体间融合术后慢性疼痛(chronic post-surgical pain,CPSP)风险预测模型,为临床早期识别高危人群、实现精准预防提供可靠工具。方法回顾性分析2019年1月至2023年12月在我院行后路腰椎椎体间融合术患者759例,其中男375例,女384例,33~80(55.28±9.94)岁。按7∶3比例分层随机分为训练集(n=531)和测试集(n=228)。收集所有患者术前、术中、术后共40项特征数据。行数据预处理和LASSO回归特征筛选后,构建7种机器学习模型,以受试者工作特征曲线下面积(area under the curve,AUC)、F1分数等作为核心指标筛选模型,使用沙普利加法解释(Shapley additive explanations,SHAP)工具对其进行可解释性分析。结果最终筛选出CPSP核心预测特征10项,其中疼痛灾难化量表(pain catastrophizing scale,PCS)、术前手术部位疼痛、并发症为三大核心驱动因素(累计贡献48.21%)。朴素贝叶斯(AUC=0.914)、逻辑回归(AUC=0.913)模型表现出较好的模型效果,朴素贝叶斯特异度达0.958,逻辑回归综合性能更均衡(F1分数=0.685)。SHAP分析明确了各特征对于预测结果的影响作用方向及强度,揭示PCS评分超过30分时,CPSP风险显著升高的阈值效应。结论利用解释性强的可解释机器学习算法所构建的后路腰椎椎体间融合术后CPSP风险预测模型,具有良好的判别效能和临床可解释性,且核心预测因子有助于指导临床个性化防控策略的开展,推动脊柱外科从“经验医学”向“数据驱动精准预防”转变。
文摘Discrete curves are composed of a set of ordered discrete points distributed at the intersection of the scanning plane and the surface of the object. In order to accurately calculate the geometric characteristics of any point on the discrete curve, a distance-based Gaussian weighted algorithm is proposed to estimate the geometric characteristics of three-dimensional space discrete curves. According to the definition of discrete derivatives, the algorithm fully considers the relative position difference between a specific point and its neighboring points, introduces the distance weighting idea, and integrates the smoothing strategy. The experiment uses two spatial discrete curves for uniform and non-uniform sampling, and compares them with two commonly used estimation algorithms. The comparative analysis is carried out in terms of sampling density, neighborhood radius and noise resistance. The experimental results show that the Gaussian distance weighted algorithm is effective and provides an efficient algorithm for underground pipeline safety detection.
文摘The study and comparison of sequences of characters from a finite alphabet is relevant to various areas of science, notably molecular biology. The measurement of sequence similarity involves the consideration of the possible sequence alignments in order to find an optimal one for which the “distance” between sequences is minimum. In biology informatics area, it is a more important and difficult problem due to the long length (100 at least) of sequence, this cause the compute complexity and large memory require. By associating a path in a lattice to each alignment, a geometric insight can be brought into the problem of finding an optimal alignment, this give an obvious encoding of each path. This problem can be solved by applying genetic algorithm, which is more efficient than dynamic programming and hidden Markov model using commomly now.
基金Supported by Chinese National Natural Science Foundation(51208016)Beijing Natural Science Foundation(8122008)Beijing Education Commission Fund(KM201310005023)
文摘Different fusion algorithm has its own advantages and limitations,so it is very difficult to simply evaluate the good points and bad points of the fusion algorithm. Whether an algorithm was selected to fuse object images was also depended upon the sensor types and special research purposes. Firstly,five fusion methods,i. e. IHS,Brovey,PCA,SFIM and Gram-Schmidt,were briefly described in the paper. And then visual judgment and quantitative statistical parameters were used to assess the five algorithms. Finally,in order to determine which one is the best suitable fusion method for land cover classification of IKONOS image,the maximum likelihood classification( MLC) was applied using the above five fusion images. The results showed that the fusion effect of SFIM transform and Gram-Schmidt transform were better than the other three image fusion methods in spatial details improvement and spectral information fidelity,and Gram-Schmidt technique was superior to SFIM transform in the aspect of expressing image details. The classification accuracy of the fused image using Gram-Schmidt and SFIM algorithms was higher than that of the other three image fusion methods,and the overall accuracy was greater than 98%. The IHS-fused image classification accuracy was the lowest,the overall accuracy and kappa coefficient were 83. 14% and 0. 76,respectively. Thus the IKONOS fusion images obtained by the Gram-Schmidt and SFIM were better for improving the land cover classification accuracy.
基金This research was partially supported by the Natural Science Research Foundation of Shaanxi Province(2001SL09)
文摘A new deterministic formulation,called the conditional expectation formulation,is proposed for dynamic stochastic programming problems in order to overcome some disadvantages of existing deterministic formulations.We then check the impact of the new deterministic formulation and other two deterministic formulations on the corresponding problem size,nonzero elements and solution time by solving some typical dynamic stochastic programming problems with different interior point algorithms.Numerical results show the advantage and application of the new deterministic formulation.
文摘目的对比分析非均整(FFF)模式下Acuros XB(AXB)算法与各向异性解析算法(AAA)在宫颈癌容积旋转调强放射治疗(VMAT)中的剂量学差异,探讨其临床适用性。方法选取15例宫颈癌术后患者,年龄46~75岁,中位年龄62岁;病理类型为13例鳞状细胞癌,2例腺癌。在Eclipse16.1计划系统设计VMAT-FFF计划,分别应用AXB算法与AAA计算剂量,对比靶区剂量、适形度(CI)、均匀性(HI)、危及器官(OAR)受量及正常组织低剂量暴露(V_(1)~V_(40))。结果AXB算法与AAA的靶区D_(max)、D_(mean)、D_(2%)、D_(50%)差异有统计学意义[(5377.07±21.84)cGy vs(5322.22±23.91)cGy、(5086.07±5.22)cGy vs(5077.49±7.34)cGy、(5191.01±10.47)cGy vs(5169.13±14.30)cGy、(5087.33±5.62)cGy vs(5079.59±7.67)cGy。P<0.05],AXB算法所得CI(0.9200±0.0034 vs 0.9172±0.0022。P<0.05)及OAR的V_(50)预测值显著高于AAA[膀胱:(22.63±7.33)%vs(22.11±7.05)%;直肠:(24.33±5.55)%vs(23.24±5.39)%。P<0.05],但HI较差(0.0450±0.0029 vs 0.0409±0.0034。P<0.001)。AAA计算的正常组织V_(1)和V_(5)较AXB算法显著更高[(73.70±7.02)%vs(72.37±7.06)%、(53.47±6.68)%vs(53.27±6.71)%。P<0.05],其余V_(10)~V_(40)差异无统计学意义(P>0.05)。结论AXB算法更适用于需精准保护OAR的宫颈癌VMAT-FFF计划,而AAA在靶区HI上更具优势。临床应根据治疗需求优化算法选择。
文摘The implementation of the coordinate rotational digital computer （CORDIC） algorithm with wave pipelining technique on field programmable gate array （FPGA） is described. All data in FPGA-based wave pipelining pass through a number of logic gates, in the same way that all data pass through the same number of registers in a conventional pipeline. Moreover, all paths are routed using identical routing resources. The manual placement, timing driven routing and timing analyzing techniques are applied to optimize the layout for achieving good path balance. Experimental results show that a 256-LUT logic depth circuit mapped on XC4VLX15-12 runs as high as 330 MHz, whichis a little lower than the speed of 336 MHz based on the conventional 16-stage pipelining in the same chip. The latency of the wave pipelining circuit is 30.3 ns, which is 36.4% shorter than the latency of 16-stage conventional pipelining circuit.
