分块子空间追踪算法

压缩传感理论是一种充分利用信号稀疏性或者可压缩性的全新信号采样理论。该理论表明，通过采集少量的信号测量值就能够实现可稀疏信号的精确重构。本文在研究现有经典重构算法的基础上，提出结合图像分块思想和回溯思想的分块子空间追踪算法（Block Subspace Pursuit, B_SP）用于压缩传感信号的重构。该算法以块结构获取图像，利用回溯过程实现支撑集的自适应筛选，最终实现图像信号的精确重构。实验结果表明，在相同测试条件下，该算法的重构效果无论从主观视觉上还是客观数据上都有不同程度的提高。     

Landscape Zonation, benefit functions and target-based planning: Unifying reserve selection strategies

The most widespread reserve selection strategy is target-based planning, as specified under the framework of systematic conservation planning. Targets are given for the representation levels of biodiversity features, and site selection algorithms are employed to either meet the targets with least cost (the minimum set formulation) or to maximize the number of targets met with a given resource (maximum coverage). Benefit functions are another recent approach to reserve selection. In the benefit function framework the objective is to maximize the value of the reserve network, however value is defined. In one benefit function formulation value is a sum over species-specific values, and species-specific value is an increasing function of representation. This benefit function approach is computationally convenient, but because it allows free tradeoffs between species, it essentially makes the assumption that species are acting as surrogates, or samples from a larger regional species pool. The Zonation algorithm is a recent computational method that produces a hierarchy of conservation priority through the landscape. This hierarchy is produced via iterative removal of selection units (cells) using the criterion of least marginal loss of conservation value to decide which cell to remove next. The first variant of Zonation, here called core-area Zonation, has a characteristic of emphasizing core-areas of all species. Here I separate the Zonation meta-algorithm from the cell removal rule, the definition of marginal loss of conservation value utilized inside the algorithm. I show how additive benefit functions and target-based planning can be implemented into the Zonation framework via the use of particular kinds of cell removal rules. The core-area, additive benefit function and targeting benefit function variants of Zonation have interesting conceptual differences in how they treat and trade off between species in the planning process.     

遗传算法优化超声辅助低共熔溶剂提取红枣总黄酮工艺研究

本文采用一种新型绿色溶剂提取红枣总黄酮,并对其提取工艺进行优化。通过单因素试验探究含水量、超声功率、提取时间、提取温度和料液比对红枣总黄酮得率的影响。在此基础上,采用遗传算法优化超声辅助低共熔溶剂提取红枣总黄酮工艺。结果表明：超声辅助低共熔溶剂提取红枣总黄酮最优的工艺参数为：含水量37%、超声功率167 W、提取时间30 min、提取温度54 ℃和料液比1∶26（g/mL）。在此条件下,所得红枣总黄酮得率为（29.33±0.37）mg/g。试验值和理论值的相对误差为1.24%。表明遗传算法可较好地模拟和预测不同提取条件下红枣总黄酮得率,且优化工艺参数是可行的。研究发现低共熔溶剂可作为一种新型、绿色溶剂用于高效提取红枣总黄酮。[关键词] 遗传算法|红枣|总黄酮|低共熔溶剂|工艺     

基于DPSA算法的“单库-单站”水资源优化调度方法研究

提出了单座水库与单座补水泵站水资源优化调度的非线性数学模型,模型以年内各时段的缺(弃)水量的平方最小为目标函数,各时段水库供水量和泵站引提水量为决策变量,各时段水库库容为状态变量,以年调节水库可供水量、泵站年引提水总量、水库与补水泵站的联合运行准则(泵站闲时补库、忙时供水)等为约束条件,并以南水北调东线一期江苏境内"骆马湖-皂河站"为实例,采用动态规划逐次逼近法进行求解。结果表明,相同供水保证率时,50%、75%、95%来水频率下泵站补水量、缺水量、弃水量比常规调度均有减少。     

基于模拟退火算法优化给水管线造价公式研究

给水管线造价公式的精确性对工程经济分析与给水管网优化的科学性和经济性有重大影响。通过五个地区的铸铁管综合单价数据,采用最小二乘法对各组数据进行多项式一至十次的拟合,确定了给水管线造价公式的最佳拟合次数为三次;进一步采用模拟退火算法对拟合的多项式参数进行优化计算,求解给水管线造价公式。结果表明:凭借模拟退火算法随机全局搜索模式以及不受函数性质影响的优势,能够克服传统算法难以求解多阶导数的困难,提高公式拟合精度。     

基于RAGA的PPC模型在黑土区玉米调亏灌溉评价中的应用

调亏灌溉作为一种行之有效的节水灌溉方式,对黑土区农业水资源的可持续高效利用具有重要意义。而调亏灌溉方案的优劣取决于它的综合效果,难以直观评价。以2013年在黑龙江省红星农场进行的玉米调亏灌溉技术效应的试验研究为基础,选取了8个评价指标,采用投影寻踪分类模型(PPC),利用基于实数编码的加速遗传算法(RAGA)优化其投影方向,根据投影函数值得到各评价指标对综合评价的贡献大小对不同调亏处理的各项指标进行排序。结果表明:苗期水分调亏程度为田间持水量60%的处理为最佳调亏灌溉方案,产量和水分利用效率比适宜调亏灌溉处理分别提高了2.11%和6.42%。研究结果可为黑土区玉米灌溉管理提供科学依据。     

Wavelet Application in Algorithms of Data Mining

Wavelets have been widely applied in such research areas as image processing, computer vision, network management and data mining. Wavelets have many favorable properties, which are hierarchical and multiresolution decomposition structure, linear time and space complexity of the transformations. The paper presents wavelet application on the algorithms of data mining, in cluding as clustering, classification, distributed data mining, similarity search, approximate query processing, visualization and so on. Finally, the paper concludes by discussing the impact of wavelets on data mining research and outlining potential future research directions and applications.     

A MIMD PARALLEL ALGORITHM TO SOLVE TRIDIAGONAL TOEPLITZ LINEAR EQUATIONS

The rank one updating formula and the parallel eliminating algorithm for linear recurrence systems ane combined fo form a MTMD parallel algorithm fo solve tridiagonal Toeplitz Cinear equations. This algorithm has a simple strictire and requires onlty a few storages as well as in-terprocessor communications. There is no special demand on the number of processors in the parallel system. The speedup can come dose to p12 comparing with the LU decomposition method (p is the number of processors). It is worth pointing out that it is proposed algcmthn that considels and organizes the parallel arithmetic in the first order linear ricurrence systems with constant coefficients.     

A FINITE ELEMENT ALGORITHM FOR PARALLEL PROCESSING OF MULTI-FRONTS

In this paper,a new algorithm for solving large-scale finite element system is presented, which utilizes the architecture of parallel processing. Firstly, the structure is partitioned into sub-regions. Then multi-fronts are used to assemble and eliminate concurrently in every sub-region. Thus the condensed interface stiffness matrices and load vectors are obtained. By serially assembling and solving global equation to get interface displacements and backing to every sub-region, the inter-nodal displacements and element stresses can be solved. The results of computation show that it can not only increase the speed of computation,but also save the memory space of computer effectively. This algorithm is an effective method for solving large-scale structural finite element systems.     

NETWORK FEOW APPROACH TO RELIABILITY EVALUATION IN IARGE SCALE NETWORKS BY MIXING INCREASING ELOW WITH DECREASING FLOW

Based on the maximum flow principle about networks, a network flow approach to reliability evaluation in large scale netwerks ty mixing inereasing flow with decreasing flow is proposed in this paper.This approach gets the initial flow of each branch in a r.etwork associated with a state of the retwork by decreasing flows of some branches correlative to another state of the network.As a result, the number of flow compute required can be reduced enormously.The numerical example shows that the approach is powerful. The comparison of this approach with the minimal cutset one is also given in this paper.