μC／OS—III为缩短中断关闭时间作出的改进

本文介绍了实时内核的中断机制,研究了μC／OS-III为缩短中断关闭时间做出的改进。通过对比μc／OS—II以及μC／OS—III的中断管理办法,分析μC／OS—III在哪些方面作出了改进。这些改进使得μC／OS—III的实时性能得到显著提升,使得μC／OS—III的中断关闭时间大大缩短。     

The Study of Otsu Algorithm Applied in the Measuring of Ash Proportion

To further improve the boiler ash ratio detection methods and resource utilization, through image processing technology for boiler ash ratio analysis, the article first studied the one-dimensional Otsu algorithm, and then for the one-dimensional Otsu algorithm, in order to improve the accuracy of the algorithm, then it puts forward a two-dimensional Otsu algorithm. Finally the two-dimensional Otsu algorithm combined with the one-dimensional Otsu algorithm and the improved Otsu algorithm. By analyzing the improved Otsu algorithm, this paper considers the pixel gray value, neighborhood information, excluding light, noise and the relative efficiency of one-dimensional Otsu algorithm higher accuracy. The relative dimensional Otsu algorithm operating efficiency has been greatly improved. Improved Otsu algorithm in dealing with boiler ash ratio detection has played a very good part in the ecological environment, economic development and some other important aspects.     

Reducing cache and TLB power by exploiting memory region and privilege level semantics

The L1 cache in today’s high-performance processors accesses all ways of a selected set in parallel. This constitutes a major source of energy inefficiency: at most one of the N fetched blocks can be useful in an N-way set-associative cache. The other N-1 cachelines will all be tag mismatches and subsequently discarded.We propose to eliminate unnecessary associative fetches by exploiting certain software semantics in cache design, thus reducing dynamic power consumption. Specifically, we use memory region information to eliminate unnecessary fetches in the data cache, and ring level information to optimize fetches in the instruction cache. We present a design that is performance-neutral, transparent to applications, and incurs a space overhead of mere 0.41% of the L1 cache.We show significantly reduced cache lookups with benchmarks including SPEC CPU, SPECjbb, SPECjAppServer, PARSEC, and Apache. For example, for SPEC CPU 2006, the proposed mechanism helps to reduce cache block fetches from the data and instruction caches by an average of 29% and 53% respectively, resulting in power savings of 17% and 35% in the caches, compared to the aggressively clock-gated baselines.     

西南干旱地区城市水系规划研究——以昆明高新产业基地为例

针对西南干旱地区干湿分明,雨季单点暴雨强度大,旱季水资源不足,地形坡度大等特点,以昆明高新产业基地开发建设为例,运用斑块-廊道-基质模式理论以及集聚间有离析最优格局理论,对区域现状水系进行梳理及改造,结合水系功能的转变,构建与城市发展相适宜的防洪与景观体系。通过对河道、池塘特征的系统分析研究,确定了水系的生态需水量。根据生态需水量的研究成果,提出了利用上游水库、区域内库塘蓄水及城市再生水等满足生态需水要求的措施,保证旱季生态需水要求,满足水系生态系统在不同时期的完整性。     

基于视觉一致性的图像检索

提出一种新的彩色图像分割方法,将图像分割成具有明显视觉一致性的区域,这种一致性能够模拟人观察图像时的视觉感受,例如图像中的一片区域具有相同的颜色、纹理。对这样的一致性区域建立特征描述符,如颜色编码、连通系数、面积比例,其中颜色编码是通过将像素在HSI颜色空间中量化得到,进而为整幅图像建立特征描述;然后将这种特征描述用于图像的检索。实验结果表明,这种方法不仅能够很好地模拟图像所带给人的视觉感受,而且对具有视觉一致性的图像检索效果也有很好的表现。     

Delineating Boundaries for Imprecise Regions

In geographic information retrieval, queries often name geographic regions that do not have a well-defined boundary, such as “Southern France.” We provide two algorithmic approaches to the problem of computing reasonable boundaries of such regions based on data points that have evidence indicating that they lie either inside or outside the region. Our problem formulation leads to a number of subproblems related to red-blue point separation and minimum-perimeter polygons, many of which we solve algorithmically. We give experimental results from our implementation and a comparison of the two approaches. This research is supported by the EU-IST Project No. IST-2001-35047 (SPIRIT) and by grant WO 758/4-2 of the German Research Foundation (DFG).     

HLA中的数据过滤机制

高层体系结构HLA是分布式仿真的一种技术框架和集成标准,它提供了一种数据过滤机制来判断每个仿真应用可以产生、发送和接收什么样的信息。这种数据过滤机制可以有效的提高整个仿真系统的可扩展性,它的具体实现就是声明管理和数据分发管理。该文在对HLA中的数据过滤机制深入研究的基础上,详细分析了该机制的基本原理,并通过其典型算法的介绍．阐述了该机制的具体实现方法。     

基于粗糙集的图像感兴趣区域自动提取算法

在分析常规区域生长算法的基础上,提出一种基于粗糙集理论的感兴趣区域自动提取算法．在显著度图和相对位置指示图的基础上,以像素点的显著度、相对位置及颜色信息构成知识表达系统,通过属性约简和值约简,导出了有用的区域生长决策规则。实验结果表明：该方法与现有算法相比,它能够更好地提取图像感兴趣区域。     

含核Vague区域和Vague洞区域关系及蕴涵定理

模糊区域的空间信息表示和区域关系处理在空间数据库、地理信息系统和人工智能等领域具有重要的意义.引入Vague集的概念和理论对含核Vague区域和Vague洞区域关系进行了系统的研究.基于Vague集给出了含核Vague区域、Vague洞区域和区域划分等概念;详细分析了处于不同平面中的含核Vague区域和Vague洞区域关系;给出了基于Vague集的区域关系交集模型和子区域关系间的蕴涵定理和算法;进一步给出了实例分析.研究成果可较好地处理含核Vague区域和Vague洞区域内的模糊点不确定的隶属信息和确定含核Vague区域与Vague洞区域的关系等问题.     

基于感兴趣区域的小波变换可分级视频编码研究

随着Internet和无线通信的飞速发展,人们在网络上实时获取视频数据已经成为可能。由于传输网络和接收终端的多样性,所以需要视频流能适应多种不同传输、解码和显示的要求,由此产生了可分级视频编码。文中在可分级视频编码的基础上对其进行改进,把感兴趣区域的检测和小波变换应用到可分级编码中,该方法中对视频流进行感兴趣区域检测,利用小波变换对增强层中的感兴趣区域进行编码,由于小波变换具有良好的空间方向选择性,与人眼的视觉特性十分吻合,从而得到很好的效果。