二维滤波器分布式算法结构的改进与实现

针对数字滤波器对现场可编程门阵列(FPGA)的资源利用率过低的现状,对Meher等人提出的二维分布式有限长单位冲激响应(FIR)滤波器结构进行了改进,增加了延时模块,用二进制位权乘法(*2n)替代移位相加结构.提出了基于二维分布式算法的两种设计结构:"延时型"和"改进型",并且应用FPGA实现了这两种结构.根据"改进型"和"延时型"两种结构分别设计了3,7,15,31,63阶Ⅱ型线性FIR滤波器.为验证"改进型"FIR滤波器的设计效果,应用Altera DE2开发板及其配套的AD/DA子板进行测试,结果显示:设计好的滤波器完全滤除了通带外信号,实现了带通滤波的目标.     

物联网技术在输变电设备状态监测中的应用

智能电网是物联网应用的最重要领域之一.在分析物联网概念及研究热点的基础上,初步探讨物联网在智能电网中输变电设备在线监测、电动汽车和智能家居的应用前景,以输变电设备智能监测、状态评估和全寿命周期管理为背景,提出包括智能感知层、数据通信层、信息整合层和智能应用层的输变电设备物联网体系架构,并详细探讨体系架构中所涉及到的若干关键技术,主要包括一体化智能监测装置、编码和标识体系、通信技术、全景信息建模、信息处理技术、全寿命周期管理、安全威胁与措施以及标准化,指出这些技术的研究方向和存在问题.     

基于Wicket的服务化生产管理系统设计

为了实现企业各业务系统的整合,将面向服务的开发模式SOA架构引入Wicket框架中.利用Wicket框架开发Web应用系统的优越性,形成一种全新的开发框架模式.通过生产管理系统的开发实例,给出了基于SOA架构的Wicket框架的实现过程.基于Wicket的服务化开发模式能实现平台间的相互操作,有效提升了Web应用系统的可移植性和安全性.所设计的开发框架模式对减少企业应用的升级成本具有重要的应用前景.     

基于分布式光纤的混凝土低温入仓监测试验及分析

高温季节浇筑混凝土时,气温和太阳辐射对已浇筑仓的表层混凝土温度影响大.采用分布式光纤对已浇筑仓混凝土受新浇筑混凝土的冷击过程进行实时在线监测,并建立有限元模型进行温度场及徐变应力场的反馈分析.分析表明,高温季节浇筑低温混凝土,在浇筑仓表面养护效果差的情况下,将导致下层混凝土表面温度在短时间内降低10℃以上.     

白洋淀流域分布式水文模型开发与验证

针对白洋淀流域水资源保护工作开发了分布式水文模型WEP-L模型。WEP-L模型是对流域水循环过程与能量循环过程的综合模拟,具有较高的模拟精度。对白洋淀流域1956 } 2000年的径流模拟计算表明:主要水文站的相对误差在5%以内,Nash-Sutcliffe效率系数在0. 8以上,可以用于白洋淀流域的水文循环分析。     

基于物理过程的分布式流域水沙预报模型

将分布式水文模型与土壤侵蚀产沙模型相互嵌套,构建了一个分布式流域水沙预报模型。模型基于DEM,将流域离散为“坡面+ 沟道”系统,采用“+ 1 ”分级方法将沟道组织为河网,实现了流域水沙预报的并行计算。坡面单元划分为植被层、地表层、非饱和带和地下水层,模拟了降雨、截留、蒸散发、入渗、地表径流、壤中流和地下水、各种形式的侵蚀产沙及泥沙输移;沟道进行汇流演算以及泥沙输移。模型在李子溪流域对长系列降雨的模拟结果表明,模型的水文模块模拟精度良好,侵蚀产沙模块模拟效果基本令人满意。     

基于流映射的负载均衡调度算法研究

网络管理者需要能够提供可扩展性、吞吐率保证及报文顺序的高性能路由器体系结构.目前基于Crossbar的集中式路由器体系结构难以实现性能和规模的可扩展,基于两级Mesh网络的负载均衡交换结构成为扩展Internet路由器容量的有效的途径.负载均衡路由器存在严重的报文乱序现象,输出端报文重定序复杂度为O(N2).文中提出一种区域均等的负载均衡交换结构,每k个连续的中间级输入端口划分为一个区域,输入端采用基于流映射的负载分配算法UFFS-k(Uniform Fine-grain Frame Spreading,k为聚合粒度,简称UFFS-k),在k个连续的外部时间槽,以细粒度的方式将同一条流的k个信元分派到固定的映射区域,通过理论证明,该调度策略可获得100%吞吐率并能够保证报文的顺序.为避免流量区域集中现象,采用双循环(dual-rotation)方式构建不同输入端口的流到区域的映射关系;为实现负载在中间级输入端口的均衡分布,每个输入端口维护全局统一视图的流量分布矩阵,UFFS-k调度算法根据流量分布矩阵调度单位帧,可以证明,对任意输出端口j,同一区域OQj队列长度相同且不同区域OQj队列长度至多差1,从而实现了100%负载均衡度.UFFS-k调度算法分布于每个输入端口独立执行,根据流到区域的映射关系及负载分布状态分派信元,模拟结果显示,当聚合粒度k=2时,UFFS-k算法在同类维序算法中表现出最优延迟性能.     

The road to intelligence

It is argued that robotic platforms are the way forward towards building intelligent systems, where multiple sensors and manipulation are used for cognitive processes. It is also argued that the cue for developing the right architecture for such a system is human language.     

A distributed problem‐solving framework for probabilistic software effort estimation

Distributed problem‐solving (DPS) systems use a framework of human organizational notions and principles of intelligent systems to solve complex problems. Human organizational notions are used to decompose a complex problem into sub‐problems that can be solved using intelligent systems. The solutions of these sub‐problems are combined to solve the original complex problem. In this paper, we propose a DPS system for probabilistic estimation of software development effort. Using a real‐world software engineering dataset, we compare the performance of the DPS system with a neural network (NN) and show that the performance of the DPS system is equal to or better than that of the NN with the additional benefits of modularity, probabilistic estimates, greater interpretability, flexibility and capability to handle incomplete input data.     

Scheduling light-trails on WDM rings

We consider the problem of scheduling communication on optical WDM (wavelength division multiplexing) networks using the light-trails technology. We seek to design scheduling algorithms such that the given transmission requests can be scheduled using a minimum number of wavelengths (optical channels). We provide algorithms and close lower bounds for two versions of the problem on an n$n$ processor linear array/ring network. In the stationary   version, the pattern of transmissions (given) is assumed to not change over time. For this, a simple lower bound is c$c$, the congestion or the maximum total traffic required to pass through any link. We give an algorithm that schedules the transmissions using O(c+logn)$O(c+logn)$ wavelengths. We also show a pattern for which Ω(c+logn/loglogn)$\Omega (c+logn/loglogn)$ wavelengths are needed. In the on-line   version, the transmissions arrive and depart dynamically, and must be scheduled without upsetting the previously scheduled transmissions. For this case we give an on-line algorithm which has competitive ratio Θ(logn)$\Theta (logn)$. We show that this is optimal in the sense that every on-line algorithm must have competitive ratio Ω(logn)$\Omega (logn)$. We also give an algorithm that appears to do well in simulations (for the classes of traffic we consider), but which has competitive ratio between Ω(log²n/loglogn)$\Omega ({log}^{2}n/loglogn)$ and O(log²n)$O\left({log}^{2}n\right)$. We present detailed simulations of both our algorithms.