OBS网络的拥塞控制汇聚算法分析

传统OBS网络汇聚算法没有综合考虑边缘节点汇聚算法和核心节点的数据调度算法二者之间的相互联系，其通信性能受限。在分析OBS网络边缘节点汇聚算法对核心节点数据调度的影响后，提出了一种新的边缘节点汇聚算法——基于OBS网络的拥塞控制汇聚算法（CCAA）。该算法通过分析边缘节点汇聚参数对数据调度的影响，调整汇聚算法实现对核心节点调度成功率的影响，最终实现了提高核心节点数据调度的成功概率。     

谱聚类在给水管网分区优化中的应用

利用图划分技术和图论算法实现给水管网分区。根据给水管网分析,确定分区数量,建立权重邻接矩阵并计算图拉普拉斯矩阵及其特征向量,通过多路图划分对隐藏在特征向量中的聚类信息进行数据挖掘,采用遗传算法和K均值方法实现最佳节点聚类。利用PageRank和最短路径算法确定水表和阀门位置,最终实现给水管网优化分区。实际给水管网模型分区实例表明所提方法在给水管网分区的有效性。     

焊接加固热作用对工形截面压弯钢构件承载性能的影响

为研究焊接加固热作用及不同初始负载对工字形压弯钢柱承载性能的影响,基于考虑热影响的热结构耦合分析方法进行了热源模型热输入改进,并考虑初始几何缺陷、初始残余应力及摩擦等,完成了不同负载下焊接加固的3个工字形压弯钢柱的模拟分析。研究了焊接位移时程、腹板应力应变重分布及荷载位移关系,通过有限元分析与相应试验结果对比验证,进而获得了试验无法获得的焊接温度场、翼缘与加固板间的焊接应力应变重分布以及翼缘边缘屈服承载力等结果,并将承载力结果与规范计算结果对比,考察了现有设计方法。结果表明,焊接顺序决定焊接变形的发展过程,焊接热输入和初始负载共同决定持载焊接的位移变化范围和焊接残余变形的大小;初始负载越大,应力应变重分布往偏心受力方向发展更多,承载力越低,而初始残余应力不影响极限承载力;采用考虑热影响的有限元方法具有一定可行性和总体安全性,规范设计方法仍有可提升空间。     

基于Landsat8遥感影像的地表温度反演方法对比研究

随着数据的自由共享，Landsat8系列卫星的遥感数据已经成为地表温度反演的重要数据之一。本文基于Landsat8数据的地表温度反演算法，选择大兴安岭地区漠河市作为研究区域。采用基于Landsat8热红外波段的辐射传输模型法、单窗方法、劈窗算法等不同方法对地表温度进行反演，探究高纬度地区地表温度分布规律，并运用野外实测地温数据进行验证。结果表明：针对本研究区的3种地表温度反演的拟合效果都较好，温度误差在1℃左右，其中辐射传输方程法所得结果精度更高，可为高纬度地区夏季地表温度反演与冻土退化等研究提供一定的参考价值。     

SEEIP核心企业局域智慧能源网络框架及优化配置方法

智慧节能工业园区（SEEIP）的核心企业能源配置对产业集群的循环经济节能降耗具有重要作用。针对SEEIP建设与既有工业园区核心企业能源系统的智慧化改造，提出一种基于信息和通信技术（ICT）的局域智慧能源网络框架，并给出了能源生产模块、能源转换模块与能源蓄存模块中各种能源介质及品位的能量计算数学模型。以经济成本与环境影响为目标的函数，给出了SEEIP企业能源网络系统配置的优化模型，并采用改进的差异演化算法（DE）结合数据库查询技术求解该混合整数非线性规划（MINLP）优化问题，给出企业能源系统最佳配置方案，以满足用户冷、热、电需求。     

机载 LiDAR生成DEM的一些关键问题评述

提取DEM是机载LiDAR技术应用研究关键内容之一,从LiDAR数据滤波、DEM模型选择、内插、误差控制和数据压缩等几个方面,分析当前利用机载激光雷达数据提取DEM的主要研究进展.着重讨论插值滤波、倾角滤波和形态学滤波算法,定量分析滤波算法的性能;分析比较确定性内插方法和地学统计内插方法,并指出内插方法在提高精度同时也要考虑稳定性和序同构性;论述DEM格网压缩和三角网压缩方法,并指出在满足地形可视化需要的同时提高压缩效率;并进行了总结展望,为相关研究提供参考.     

插装式电液比例流量放大阀特性分析

插装阀具有通流量大、结构简单和成本低等优点,广泛应用于液压系统中。笔者针对一种主级基于流量放大原理、先导级采用单级伺服比例方向阀的两级插装比例节流阀特性进行分析,建立了该比例节流阀的简化数学模型,获得了简化条件下的特性关系式。以此为基础,在SimulationX软件环境中建立该液压阀的仿真模型,利用实验数据对模型正确性进行验证,运用验证后的仿真模型对比例阀性能特性进行分析。结果表明：该液压阀输出流量静态特性存在死区,阶跃响应存在时间滞后,主阀流量放大倍数并不是常数,性能影响因素与主阀反馈槽预开量、面积梯度、级间过渡容腔体积以及先导阀通流能力等相关。     

基于布谷鸟搜索神经网络的微波加热温度预测模型

微波加热是一种与被加热物直接相互作用的选择性加热方式，具有清洁、节能、减排等特点。针对工业物料作为微波加热负载时，其温度非线性变化的特点，以微波工业加热过程中的多维、海量参数为研究对象，基于泛函接神经网络模型提取样本数据的深度特征，提出了一种基于布谷鸟搜索算法，优化BP神经网络的网络参数，建立了以"数据驱动"为手段微波加热工业物料温度模型。仿真实验结果证明了所提出模型的准确性、实时性。     

两种铬源对热应激肉鸡生长性能和屠宰性能的影响

【实验目的】本试验旨在研究不同铬源（酵母铬和烟酸铬）对热应激肉鸡生长及屠宰性能的影响。【方法】选择15日龄AA肉仔鸡180只,随机分为3组,1组为对照组,饲喂基础日粮(不加铬),2组为添加酵母铬组,3组为添加烟酸铬组,铬添加量均为3 mg/kg,每个组6个重复,每个重复10只鸡,试验期4周。【结果】试验结果表明：日粮中补铬3 mg/kg显著提高了15~28 d、29~42 d热应激肉鸡日增重、饲料消耗和饲料转化效率(P<0.05),不同铬源差异不显著(P>0.05)。于28、42日龄,每处理随机抽取18只,每重复3只,屠宰测定屠宰指标。结果表明：28 d时两种铬源对肉鸡的屠宰率、半净膛率、全净膛率均未产生显著影响(P>0.05),但腹脂率显著降低(P<0.05);42 d时试验组对肉鸡的半净膛率、全净膛率无显著影响(P>0.05),屠宰率显著高于对照组,腹脂率显著低于对照组(P<0.05);试验组之间差异不显著(P>0.05)。【结论】因此,日粮中添加酵母铬和烟酸铬能改善热应激肉鸡的生长性能和屠宰性能,不同铬源之间差异不显著。     

第三产业绿色技术创新效率时空差异及动态演变

本研究旨在提出促进长江经济带第三产业绿色技术创新水平提升的建议,为推进经济带协同一体的高质量发展提供理论依据。基于Min-DS模型,测度2001—2018年第三产业绿色技术创新效率,并结合Dagum基尼系数和Kernel密度估计,揭示区域及其子地区绿色技术创新效率变化的时空差异特征、贡献率及动态演变规律。以长江经济带为例研究得知：在观察期内经济带第三产业绿色技术创新效率总体呈上升趋势,下游地区效率具有显著优势;但各省市效率变化趋势存在较大差异,效率强度区域的空间分布随时间改变;上中下游地区内及之间绿色技术创新效率的时空差异是经济带时空差异的主要来源。本研究系统分析了长江经济第三产业绿色技术创新效率的分布及演变特征,得到了其提升绿色技术创新水平的有效路径。     

Restoration algorithm with wavelength reservation collision avoidance in ASON

Aiming at the problem of link fault restoration in ASON, an improved equalizing routing algorithm (ERA) is introduced to proportion the load at the routing phase. In order to solve the easy blocking problem for the network without wavelength converter because of the wavelength continuity constraint, the algorithm WRCA is proposed at the wavelength assignment phase. This algorithm is realized by adding collision detection object (CDO) in the path message of the resource reservation protocol with traffic engineering extension (RSVP TE). Depending on the value of the CD flag, different wavelength selection strategies are applied at the destination node, and the blocks resulting from wavelength reservation collision are reduced. The simulation experiments compare four wavelength assignment algorithms with the same routing algorithm ERA. The results show that compared with the traditional first fit algorithm (FF) and random fit algorithm (RD), the FF and RD employing CD scheme can effectively reduce the blocking ratio of the whole network, and enhance the practical applicability of the restoration algorithms.     

AUTOMATIC CONTINGENCY SELECTION AND RANKING BY NETWORK PROGRAMMING APPROACH

This paper presents a new approach ,to the automatic contingency selection and ranking by the network flow programming (NFP). A complex cost optimisation model based on economy and security, and several simplified models are proposed in the paper. The performance index is the total load curtailment or its weighted value. All the solution algorithms are OKA. The model and its algorithm is tested on IEEE 30-Bus System and the encouraging results are obtained.     

Load balancing strategy and ant optimization algorithm for grids

In view of the Campus Grid construction,which is also a crucial part of ChinaGrid project,the performance decline for grid scheduling algorithms when non-dedicated nodes emerge in multi-grid environment is studied.A load balancing algorithm to optimize resource usage rate is proposed.The paper involves three parts: problem modeling,algorithm design,and experiment evaluation.The experimental results show that the proposed algorithm is effective for solving the problem of resource usage rate decline under the discussed grid circumstance.     

Novel channel estimation algorithm for OFDM/TDM over fast fading channels

For the shortage of tracking ability against fast fading channel of the existing pilot structures and channel estimation algorithms in OFDM combined with time division multiplexing (OFDM/TDM) system, an improved channel estimation algorithm is proposed. The channel transfer functions are obtained by estimating the channel properties with two adjacent time domain multiplexing (TDM) pilot sequences, while the channel state information of the OFDM/TDM symbols is obtained with interpolation Combined with frequency domain equalization based on minimum mean square error (MMSE-FDE), the proposed algorithm can significantly compensate the path loss over fast fading channels. Simulation results show that, compared with the existing channel estimation algorithms, the proposed algorithm can achieve better performance, which is not only capable of dealing with slow fading channels, but also has a better tracking ability against fast fading channels with the same data transmission efficiency.     

Improved WPAN meshed adaptive tree routing algorithm

To expand network coverage and enhance the reliability of wireless personal area network (WPAN), the problem of address overflow resulting from applying the meshed adaptive tree algorithm in large scale mesh network wis studied. By dividing the entire network into smaller sub networks, the subarea meshed adaptive tree wis constructed. An improved meshed adaptive tree routing algorithm wis proposed employing the hierarchical topology structure of the subarea meshed adaptive tree. Experimental results show that the algorithm expands the network coverage without increasing the routing overhead and the network load. It also effectively reduces the end to end delay and increases the packet delivery ratio and communication efficiency. It maintains a good performance in the networks with different scales and provides a theoretical basis for enhancing the coverage and reliability of WPAN.     

Improved marching cubes by combining case lookup table and adjacency lookup sub-table

The marching cubes (MC) is an effective surface rendering method in three-dimensional visualization for medical image sequence. However, most existing MC algorithms are slow and inefficient because they have to process all the cubes for isosurface extraction. An efficient MC algorithm is proposed by combing the case lookup table and a novel adjacent lookup sub-table to exclude unrelated empty cubes. By explicitly building the fix-length adjacent lookup sub-table that is independent on image sequences, the volumes elements are constrained to those only intersect with the isosurface. Both execution time and temporary storage space are further reduced by incorporating the heap data structure in algorithmic implementation. Experimental results on human head, chest foot CT data sets by using the visualization toolkit package show that the traversal cubes decreases by 95%, and the reconstruction time decreases by 20% without any loss of reconstruction quality. Therefore, the proposed method can remarkably speed up the rendering time and be easily integrated into 3D visualization for clinical application.     

Low complexity antenna selection algorithmsfor base-station coordination system

Two kinds of antenna selection algorithm one proposed according to the characteristics of base-station coordination system. One is called aggregate channel frobenius norm antenna selection (ACFAS), another one is individual channel frobenius norm antenna selection (ICFAS). The object function of antenna selection in ACFAS is based on the aggregate channel frobenius norm of all of the coordinating base-stations and users, while the object function of ICFAS is based on the individual channel frobenius norm of every base-station and user. With the complexity analysis and system simulations, it is proved that the antenna selection algorithms proposed are capable of reducing the complexity, yet at a cost of system capacity lost. So they are suboptimal algorithms.     

Application of DFT In the 2-D DOA Evaluation of MUSIC

In many special filtering system, the direction of arrival(DOA) should be evaluated for the received signal. MUSIC algorithms is a classic one and is applied widely, but its computing load is very large because there exist many transforms of matrix. As the number of uniform circle is, the data are cyclic in the searching of peak in MUSIC algorithm for 2-D evaluation of DOA. The authors discuss how to use DFT to reduce the computation load. At the same time, the simulation of performance shows that the proposed algorithm improves the efficiency by fifty percent, that is important for the project reality.     

Parallel algorithm for association rules in cluster

Based on comparing with the existing parallel algorithms for mining association rules, the paper analyzes CD,FDM,DDM algorithm in details. To overcome problems existing in efficiency of candidate sets pruning and execution time of these algorithms, the paper proposes parallel process algorithm with an improved parallel association rules. Finally the result of test on share-nothing cluster of workstation show that after adopting the improved algorithm, execution performance and efficiency are higher than others. This result indicates that the algorithm has achieved algorithm optimization.     

Application of a Particle Swarm Optimization Algorithm in Truss Structure Optimal Design

The particle swarm optimization (PSO) algorithm developed in recent years is a stochastic optimization algorithm based on swarm intelligence. It possesses advantages such as being a simple concept, ease of implementation and low resource occupation. The PSO algorithm was adopted to solve the problem of size optimization of truss structures with stress and displacement constraints. We present the basic principle of the original PSO algorithm in detail, and then introduce a constriction coefficient to modify it. Moreover, reasonable values of the coefficients are proposed for the modified PSO algorithm. Several classical problems are solved using the modified PSO algorithm, and the results compared with those using traditional optimization algorithms and genetic algorithms. Numerical results show that the modified PSO algorithm has good convergence and stability, and can be applied to the size optimization of truss structures.