智慧系统及其在智慧城市应用的前沿技术分析

为解决城市"复杂巨系统"组织运行中的人-机-物协同融合等共性问题,构建面向智慧城市应用服务的通用平台,结合智慧系统基础理论研究,通过对IBM(International Business Machines Corporation)、阿里云计算有限公司、华为技术有限公司及北京易华录信息技术股份有限公司等中外企业智慧系统在智慧城市中的实际应用分析,明确了智慧系统的基本内涵与特征,提出了智慧系统的通用组成,开展了智慧系统体系架构的设计,并从感、传、智、用4个系统单元设计技术和一个系统总体设计技术角度,全面阐述了智慧系统面向智慧城市应用的前沿技术体系构成及其应用方向,为智慧系统的设计提供了技术指引和系统构建参考.     

考虑近区多重散射的目标RCS图形电磁算法

计算目标雷达散射截面时,对于存在近区多次散射的目标,对存在近区耦合场的单元的识别非常复杂。从磁场积分方程出发,结合图形电磁计算平台GRECO,经过适当的坐标转换,可快速识别对单元产生耦合场的区域;同时,采用迭代物理光学方法,计算了典型目标的近场与远场RCS。数值算例证明了本方法的有效性,本方法考虑了目标的多重散射特性,使得图形电磁计算方法从物理光学方法扩展应用到迭代物理光学方法。     

基于视觉的UCAV自主着陆蒙特卡洛仿真研究

介绍了不确定性分析方法的应用以及不确定性的数学模型。回顾了蒙特卡洛仿真在飞控系统的鲁棒分析、鲁棒控制律设计以及灵敏度分析等方面的研究成果。设计并实现了基于MATLAB分布计算引擎（MATLAB Distributed Computing Engine）的分布式蒙特卡洛仿真方案,开发了可以创建分布式仿真任务的蒙特卡洛仿真工具MCST（Monte Carlo Simulation Tool）,可以方便地对于Simulink模型进行蒙特卡洛仿真。并且使用该工具进行基于视觉的UCAV自主着陆仿真研究。

Abstract：

Application of uncertainty analysis methods was introduced as well as some general used uncertainty models. The most basic uncertainty analysis method is Monte Carlo Simulation,which is a powerful and practical tool to deal with non-linear systems with very large amount of uncertainties. However,the great disadvantage of Monte Carlo is that it is very intensive computationally. Given to such a drawback,a distributed computing tool,which is named Monte Carlo Simulation Tool and based on MATLAB Distributed Computing Engine and Distributed Computing Toolbox,was developed in order to execute independent MATLAB operations simultaneously on a cluster of computers,speeding up execution of large amount of simulations. The MCST can easily be used to Simulink models for Monte Carlo Simulation. Monte Carlo Simulation has been applied to vision-based autonomous landing of Unmanned Combat Aerial Vehicles （UCAVs） with uncertainties of initial conditions and sensor measurements. Simulation results show that there is a high mission successful probability,which means the autonomous landing control law is insensitive to uncertainties.     

Dominance-based rough set approach as a paradigm of knowledge discovery and granular computing

Dominance-based rough set approach (DRSA) permits representation and analysis of all phenomena involving monotonicity relationship between some measures or perceptions. DRSA has also some merits within granular computing, as it extends the paradigm of granular computing to ordered data, specifies a syntax and modality of information granules which are appropriate for dealing with ordered data, and enables computing with words and reasoning about ordered data. Granular computing with ordered data is a very general paradigm, because other modalities of information constraints, such as veristic, possibilistic and probabilistic modalities, have also to deal with ordered value sets (with qualifiers relative to grades of truth, possibility and probability), which gives DRSA a large area of applications.     

DNA modular subtraction algorithm based on linear self-assembly

This paper presents a DNA algorithm based on linear self-assembly which gives the result of the modular subtraction operation of two nonnegative integers. For two n-bit nonnegative integers A and B, the algorithm gives the result of A-B mod 2 ⁿ . An extended borrow tag which indicates the relation of the minuend and the subtrahend is included in the resulting strand so that the pre-classification based on A>B or B>A is not required before the experiment. From the resulting strand, we can draw the information of operation result, operands, borrow, and the tag of the relation between the minuend and the subtrahend. The algorithm takes advantage of the parallelism characteristic of DNA computing: while given two sets of operands (one the minuend set and the other subtrahend set), the modular subtraction operation of these two sets can be achieved by a parallel processing procedure. The feasibility of the algorithm is based on a known experiment. The algorithm is of spontaneous characteristic which prevents the scale of the experimental procedures from growing with the length of the operands. As for the length of the operands n, there are O(n) kinds of strands required in the experiment, and the biochemical experimental procedures can be accomplished in constant number of steps.     

浅谈GPU在遥感影像融合中的应用

探讨了GPU的发展历史和硬件特性,针对融合处理中不同的遥感影像数据源在GPU中实现了HIS变换融合、加权融合、Brovey比值融合,并与其在CPU中的实现做了比较,得到的融合影像是一致的。     

单应变换下无人机序列图像高效率压缩算法

针对高空无人机航拍序列图像的实时图像压缩问题,设计了一种基于单应变换的可精确定比的高压缩性能低计算复杂度航拍序列图像压缩算法.该算法使用机载惯导数据进行编码帧组划分并获得中间帧相对于首尾帧的初始单应变换,进而通过多子区匹配实现对单应矩阵的快速精确求解,然后通过单应变换来实现对中间帧的整体运动估计和补偿,最后用JPEG2000算法对帧组数据进行整体压缩.实验结果表明,相对于传统算法,该算法具有计算复杂度低、压缩比高、保真度好、可精确定比压缩的优点.     

储量信息可视化技术研究与实现

储量信息是油气勘探、开发工作的重要成果,综合展示这些成果对地质综合研究人员有重要的指导作用。本文从探明储量的数据模型出发,用边界表示模型的方法,设计了多边形柱状模型来体现储量数据,并用Qt和C++结合Open Inventor三维可视化开发工具对上述模型进行了程序实现,实现了储量信息的人机交互以及三维展示功能,使地质研究人员和决策人员能够直观掌握区块的储量上报、动用等信息。     

量子计算原理及研究进展

 量子计算机是量子力学与计算问题相结合的产物,是近几年的研究热点,引起了广泛的社会关注。本文回顾量子计算机的发展,介绍了量子算法和量子计算模型,并以离子阱和超导线路为例阐述了量子计算机的物理实现,然后介绍了为了克服消相干而发展出的量子编码,以玻色取样为例讨论了量子霸权。展望未来,近期内可以展示量子霸权,进而实现解决特定问题的量子模拟器,但是普适的量子计算机的研制仍然需要很长的时间。     

基于Hadoop的即时查询分析平台

为了解决大数据的深度挖掘和即时查询的需求,建立了一个分布式、可伸缩、低成本和大容量的并行计算集群,实现了半结构化数据的SQL查询分析,并提供了标准对外接口。