基于模糊决策的风力发电产业评价研究

根据风力发电技术产业的特点,构建改进层次分析与模糊一致矩阵相结合的方案决策数学模型,该模型既可以减少确定判断矩阵的盲目性,又可以避开评价体系中各等级间的隶属度确定问题,使评价结果更加可靠,适合于信息尚不完整、受主观因素影响较强的评价。实例验证了这一模型的合理性、可行性和有效性,具有实用价值。     

Joint relay selection and power allocation for amplify-and-forward two-path relaying networks

This paper presents a joint relay selection and power allocation scheme for amplify-and-forward two-path relaying networks,in which diferent relay nodes forward information symbols alternatively in adjacent time slots.Our approach is based on the maximization of the received signal-to-noise ratio under total power consumption by the transmission of the symbol.We show that in spite of inter-relay interferences,the maximization problem has a closed-form solution.Simulation results explicitly indicate that the performance of proposed approach outmatches the existing methods including equal power allocation and one-path relaying.     

灾害中生活类物资的供应分析——以汶川地震重灾区物资供应为例

救灾生活类物资在供应中面临着优化运输路线、降低运输成本、缩短运输时间3个难题。文章采用相关机会多目标规划模型,以汶川地震为例,总结并完善了自然灾害救助中的多物资的协作供应模式,为突发性重大灾害中多物资的协作供应的组织、实施、管理提供参考支持。     

供水管网中压力真实值的批次平差算法

分析了测压点优化布置的意义及原则,并根据供水周期性,依靠数量有限的测压点压力数据,结合管网的水力计算,利用传统的平差原理,将测压点以外的其它节点压力进行真实性校正,推算出了管网各节点的真实压力值,实现了通过有限测压点数据对管网所有节点压力的全面了解。     

基于路径维持概率的Ad Hoc跨层路由方案

本文基于路由稳定性,提出了一种基于路径维持概率的Ad Hoc网络跨层路由方案,根据节点间距离的大小,改变节点的发射功率,有效地减小了节点的功耗。仿真结果表明了该方案的有效性,并节省了功耗。     

Exact methods and a heuristic for the optimization of an integrated replenishment-storage planning problem

In this paper we study the coordination of different activities in a supply chain issued from a real case. Multiple suppliers send raw materials (RMs) to a distribution center (DC) that delivers them to a unique plant where the storage of the RMs and the finished goods is not possible. Then, the finished goods are directly shipped to multiple customers having just‐in‐time (JIT) demands. Under these hypotheses, we show that the problem can be reduced to multiple suppliers and one DC. Afterwards, we analyze two cases; in the first, we consider an uncapacitated storage at DC, and in the second, we analyze the capacitated storage case. For the first case, we show that the problem is NP‐hard in the ordinary sense using the Knapsack decision problem. We then propose two exact methods: a mixed integer linear program (MILP) and a pseudopolynomial dynamic program. A classical dynamic program and an improved one using the idea of Shaw and Wagelmans are given. With numerical tests we show that the dynamic program gives the optimal solution in reasonable time for quite large instances compared with the MILP. For the second case, the capacity limitation in DC is assumed, which makes the problem solving more challenging. We propose an MILP and a dynamic programming‐based heuristic that provides solutions close to the optimal solution in very short times.     

高性能计算中处理器功耗特征的评测与分析

高性能计算系统的系统结构和应用模式与单机系统或商用机群服务器系统都有很大的不同,掌握功耗特征是提高能效的前提。本文将支撑功耗管理的低功耗技术分为动态资源休眠和动态速率调节两类,并就处理器的这两类机制在高性能计算中的应用进行评测,验证了功耗管理在高性能计算中的有效性,量化分析了处理器功耗特征,指出了当前管理方案的不足及改进设想,对进一步能耗优化有重要的指导意义。     

基于人工神经网络的暂态电能质量现象的分类与识别

暂态电能质量信号具有发生随机性,持续时间短和非平稳的特性,使得信号的识别实现较为困难。目前对电能质量信号进行辨识的方法有基于规则的专家系统方法、基于神经网络的方法以及结合小波变换技术的神经网络方法等。利用小波变换和人工神经网络的结合方法,对各种暂态现象实现有效地识别和初步地分类。     

高层次数据流的多电压低功耗综合方法

为了有效地进行算法行为描述到寄存器传输级结构描述的转换,提出一种同时考虑功能单元功耗、互连功耗和电压转换功耗的模型和基于网络流的低功耗设计方法.首先对给定的数据流图进行单电压高层次综合,然后对单电压综合结果迭代地进行多电压调整;提取每次迭代时需要调整的网络流子图,对该子图运行最小费用最大流增量算法.该方法充分利用前面迭代中得到的优化解,避免了对整个网络流的重复计算.实验结果表明,文中方法在互连功耗、电压转换功耗和总功耗等方面均有较大优化.     

用扫描链重构来提高EFDR编码的测试压缩率和降低测试功耗

为了解决系统芯片测试中日益增长的测试数据和测试功耗的问题,提出一种不影响芯片正常逻辑功能的扫描链重构算法--Run-Reduced-Reconfiguration(3R).该算法针对扩展频率导向游程(EFDR)编码来重排序扫描链和调整扫描单元极性,重新组织测试数据,减少了游程的数量.从而大人提高了EFDR编码的测试压缩率并降低测试功耗;分析了扫描链调整对布线长度带来的影响后,给出了权衡压缩率和布线长度的解决方案.在ISCAS89基准电路上的实验结果表明,使用3R算法后,测试压缩率提高了52%,测试移位功耗降低了53%.