L波段微波功率合成技术研究

无人机机载功率放大器的性能一直是限制无人机技术发展的主要因素,为此提出了将功率合成技术应用于无人机数据系统的方法解决上述问题。利用微带线技术结合系统性的电路调试方法,辅以Advanced Design System仿真软件优化设计,同时采用实频技术法进行宽带功放设计,成功研制了频段在1.3 GHz~1.7 GHz的功率放大器,单路功率放大器采用级联的技术输出功率为8 W,两路合成后,实测总输出功率为15.67 W,合成效率达97%,性能稳定,达到实用水平。     

面向IP地址集过滤的高效包分类技术

针对传统防火墙线性匹配算法匹配效率低、维护困难等问题,提出并实现了一种面向IP地址集过滤的高效、灵活的Netfilter扩展框架Salist。 Salist包含一个基于内核虚拟文件的表管理模块,一个可自动对IP地址集进行去重、归并和排序的表内规则管理模块,一个基于Bsearch算法的高效的包匹配模块。通过理论分析和实际测试证明, Salist使包匹配算法时间复杂度由传统线性匹配的O( n)降低为O( log n),规则合并减少了规则表占用的内核内存空间10%以上,按文件分离的规则管理机制简化了对规则集进行维护的难度。结果表明Salist使用在核心网络设备中可极大提高包转发速率,降低规则的内存占用和管理难度。     

基于激光雷达的大兴安岭典型森林生物量制图技术研究

森林生物量作为森林生态系统基本的数量表征,表明了森林的经营水平和开发利用价值,并能反映其与环境在物质循环和能量流动方面的复杂关系。同时,森林生物量也是林业问题和生态问题研究的基础。以内蒙古大兴安岭国家野外生态站为研究区域,通过对机载激光雷达(LiDAR)点云数据的预处理,利用计算机编程提取LiDAR点云数据的结构参数,以植被分位数高度变量与密度变量为自变量,结合地面调查数据,建立生物量与LiDAR结构参数的回归模型(决定系数为0.69,均方根误差为0.34)。运用IDL编程对LiDAR点云块数据进行运算并生成分辨率为20m×20m的栅格图像,拼接后得到整个区域的地上生物量分布图,对生成的地上生物量分布图进行验证的R2为0.78,RMSE为23.09t/hm2,平均估测精度达83%。     

手机触摸屏测试仪目标定位的算法研究

在手机触摸屏测试仪的测试过程中,相机与测头之间位置关系的精确校准是测头在手机屏幕上精确操作的前提.针对两者之间的位置关系,以光纤传感器为基准,利用最小二乘法拟合出测头扫描光纤传感器的位置信息,先通过小区域去噪法后,再利用Blob分析算法对相机和光纤传感器采集的图像进行校准,并根据测头、相机和传感器三者之间的几何关系,最后采用矩阵变换关系得到检测目标的定位数据.通过在手机触摸屏上标定三个Mark点与PC机接收的响应坐标值进行比对,实验定位精度达到0.01 mm,Blob分析算法为手机触摸屏测试仪的目标定位检测提供了理论依据和实际的应用价值.     

Trust-based group services selection in web-based service-oriented environments

Multi-agent technologies have been widely employed for the development of web-based systems, including web-based e-markets, web-based grid computing, e-governments and service-oriented software systems. In these service-oriented systems, service provider agents and service consumer agents are autonomous and rational entities, which can enter and leave the environments freely. For simplicity, we use terms ‘provider’ and ‘consumer’ to represent this two types of agents. How to select the most suitable service providers according to a service request from a consumer in such an open environment is a very challenging issue. In this paper, we propose an innovative trust model, called the GTrust model, for service group selection in general service-oriented environments. In the GTrust model, the trust evaluation for a service group is based on the functionality coverage of the group, the dependency relationships among individual services in the group, the ratings of individual services on the attributes of the service request and a similarity measurement of the extent to which reference reports can reflect the service request in terms of the priority distribution of attributes. The experimental results and analysis demonstrate the good performance of the GTrust model on the service group selection in service-oriented environments.     

软岩引水隧洞施工开挖过程围岩变形规律研究

以云南省滇中引水工程某段软岩引水隧洞建立实体模型,应用三维显式有限差分法程序FLAC3D对其施工开挖过程进行三维数值模拟。计算结果表明,软岩隧洞受到开挖面的空间约束效应,围岩应力逐步释放,相应围岩位移也逐渐增加;在横断面上,拱顶围岩沉降位移沿竖直径向的空间效应主要影响范围在3倍洞径(3D)左右,而拱腰围岩水平位移和拱底隆起位移在1.5D左右;掌子面向前推进过程中,掌子面的空间效应逐渐消失,拱顶、拱底位移在施工开挖面后方约2.5D~3D处趋于稳定,拱腰位移在约2D左右趋于稳定,围岩变形收敛:软岩隧洞需要及时施作初期支护,以提高围岩自承能力,限制位移的增长速度。     

显微红外热成像技术在故障定位中的应用

电子元器件是整机的基础,在装备的生产和使用过程中,元器件工作异常将影响整个装备的正常运行,元器件发生故障时,必须迅速、准确地进行故障分析和失效定位,避免军用装备在关键时刻发生故障。显微红外热成像技术是一种对电子元器件的微小面积进行高精度非接触的测量,能够显示元器件的反常热分布,暴露不合理的设计和工艺缺陷。论文介绍了显微红外热像仪的原理及特点,举例说明了显微红外热成像技术在失效分析故障定位中的应用,对元器件的故障失效分析和有效性检测提供了指导作用。     

Optimizing content placement in a peer-assisted VoD architecture

Recently, a new peer-assisted architecture to build content delivery systems has been presented. This architecture is based on the use of the storage capacity of end-users’ set-top boxes (STBs), connected in a peer-to-peer (P2P) manner in order to help the content servers in the delivery process. In these systems, the contents are usually split into a set of smaller pieces, called sub-streams, which are randomly injected at the STBs. The present paper is focused on Video on Demand (VoD) streaming and it is assumed that the STB-based content delivery system is deployed over the global Internet, where the clients are distributed over different ISP networks. In this scenario, three different strategies are studied for increasing the percentage of data uploaded by peers, in order to offload the content servers as much as possible. First of all, a new mechanism is presented which determines which sub-stream has to be placed at which STB by a Non-Linear Programming (NLP) formulation. A different strategy for reducing the content server load is to take advantage of the available bandwidth in the different ISP networks. In this sense, two new mechanisms for forwarding the VoD requests to different ISP networks are presented. Finally, the present paper also shows that in some situations the available uplink bandwidth is associated with STBs that do not have the required sub-streams. Regarding this concern, a new mechanism has been designed that dynamically re-allocates some streams, which are being transmitted from specific STBs, to different STBs, in order to find the necessary resources to start new streaming sessions.     

Window annealing for pixel-labeling problems

The pixel labeling problems in computer vision are often formulated as energy minimization tasks. Algorithms such as graph cuts and belief propagation are prominent; however, they are only applicable for specific energy forms. For general optimization, Markov Chain Monte Carlo (MCMC) based simulated annealing can estimate the minima states very slowly.This paper presents a sampling paradigm for faster optimization. First, in contrast to previous MCMCs, the role of detailed balance constraint is eliminated. The reversible Markov chain jumps are essential for sampling an arbitrary posterior distribution, but they are not essential for optimization tasks. This allows a computationally simple window cluster sample. Second, the proposal states are generated from combined sets of local minima which achieve a substantial increase in speed compared to uniformly labeled cluster proposals. Third, under the coarse-to-fine strategy, the maximum window size variable is incorporated along with the temperature variable during simulated annealing. The proposed window annealing is experimentally shown to be many times faster and capable of finding lower energy compared to the previous Gibbs and Swendsen-Wang cut (SW-cut) sampler. In addition, the proposed method is compared with other deterministic algorithms like graph cut, belief propagation, and spectral method in their own specific energy forms. Window annealing displays competitive performance in all domains.