基于快速彩色空间变换的足球机器人目标搜索

采用了一种将颜色信息从RGB空间映射到HSI空间的快速变换方法，在结合足球机器人视觉特点的基础上加以改进，并以此为依据采用建立颜色索引表与动态网格扫描相结合的搜索方法确定场上目标，进一步提高了足球机器人视觉系统的实时性．     

SF_6 旋弧灭弧室结构与驱弧磁场大小关系

ＳＦ６旋弧灭弧室利用电弧在磁场中快速旋转而熄弧，了解磁场的大小分布情况十分重要，因此采用向量磁位法对复杂结构下灭弧室磁场分布进行计算，同时也分析了铁磁物的存在对磁场分布的影响．     

论"美丑对照"与"以丑为美"的文艺美学观

本文运用比较的方法,论述了雨果的“美丑对照原则”与波德莱尔“以丑为美”理论的异同,并以他们各自的创作实践说明了这两种理论的运用都没有改变事物（描写的对象）的本质,只是在一定程度上改变了事物的原有面貌;它们都是对客观事物的具体反映和直接把握,是艺术家对人性善和美的异曲同工的追求,为人们提供了全面的艺术范例和审美观念。     

Activity Based Costing for Component-Based Software Development

Component-based software development is a promising set of technologies designed to move software creation from its current, labor-intensive, craft-like approach to a more modern, reuse-centered style. However, a lesson learned from previous radical software process innovations is that a strong technology alone is generally insufficient for successful adoption. In order for gains to be realized from such technologies the management practices surrounding the implementation of the new technology must also change. It is with this view that we propose the adoption of a complementary management approach called activity based costing (ABC) to allow organizations to properly account for and recognize the gains from a component-based approach. ABC enables a management environment where appropriate incentives are created for the development and reuse of software components. Data from a large software vendor who has experience with ABC in a traditional software development environment are presented, along with a chart of accounts for a modern, component-based model.     

一种基于鲁棒局部纹理特征的背景差分方法

针对复杂场景下运动目标的精确检测这一问题,提出一种对噪声鲁棒并具备灰度尺度不变性的局部纹理特征描述子LBP_Center,将其与像素的颜色信息结合应用于背景建模中,采用随机抽样的机制更新模型,同时引入背景复杂度以去除多模态动态背景产生的噪点。在标准测试数据集上的实验结果表明,该算法对柔性阴影及光照缓慢变化具备良好的鲁棒性,综合性能更优。     

Ground object recognition and segmentation from aerial image‐based 3D point cloud

Several attempts have been made to grasp three‐dimensional (3D) ground shape from a 3D point cloud generated by aerial vehicles, which help fast situation recognition. However, identifying such objects on the ground from a 3D point cloud, which consists of 3D coordinates and color information, is not straightforward due to the gap between the low‐level point information (coordinates and colors) and high‐level context information (objects). In this paper, we propose a ground object recognition and segmentation method from a geo‐referenced point cloud. Basically, we rely on some existing tools to generate such a point cloud from aerial images, and our method tries to give semantics to each set of clustered points. In our method, firstly, such points that correspond to the ground surface are removed using the elevation data from the Geographical Survey Institute. Next, we apply an interpoint distance‐based clustering and color‐based clustering. Then, such clusters that share some regions are merged to correctly identify a cluster that corresponds to a single object. We have evaluated our method in several experiments in real fields. We have confirmed that our method can remove the ground surface within 20 cm error and can recognize most of the objects.     

自动协议转换的嵌入式SNMP委托代理系统

在多厂商的环境中,委托代理是实现SNMP统一管理的一种有效辅助手段.据此,提出了一种嵌入式的SNMP委托代理的原型系统,并对系统的自动协议转换、MIB库动态加载、嵌入式设计分别加以阐述,实践验证了系统自动化程度高、效率显著等特点.     

A mean field annealing approach to accurate free form shape matching

The SoftAssign algorithm is an elegant free form shape matching algorithm. While its objective function can be interpreted as consisting of three desired terms: minimising a weighted sum of matching errors of combinations of all the points in the two free form shapes to be matched, equalising their weights (probabilities) of being real ones and also maximising the overlapping area between the free form shapes to be matched, the last term has no effect on the optimisation of the parameters of interest due to normalisation. In this paper, we reformulate the last two terms using the inequality about the geometric and algebraic averages and the sum of the powers of these probabilities. For the sake of computational efficiency, instead of considering combinations of all the points in the overlapping free form shapes to be matched, we employ the traditional closest point criterion to establish possible correspondences between the two overlapping free form shapes to be matched. The saddle point solution of the resulting objective function no longer yields a closed form solution to the parameters of interest. For easy computation, we then adopt a pseudo-linearisation method to linearise the first order derivative of the objective function, leading the parameters of interest to be tracked and estimated with a closed form solution. The parameters of interest are finally optimised using the efficient deterministic annealing scheme with the camera motion parameters estimated using the quaternion method in the weighted least squares sense. A comparative study based on both synthetic data and real images with partial overlap has shown that the proposed algorithm is promising for the automatic matching of overlapping 3D free form shapes subject to a large range of motions.     

A New Implementation of Automath

This paper presents aut, a modern Automath checker. It is a straightforward re-implementation of the Zandleven Automath checker from the seventies. It was implemented about five years ago, in the programming language C. It accepts both the AUT-68 and AUT-QE dialects of Automath. This program was written to restore a damaged version of Jutting's translation of Landau's Grundlagen. Some notable features: It is fast. On a 1 GHz machine it will check the full Jutting formalization (736 K of nonwhitespace Automath source) in 0.6 seconds. Its implementation of -terms does not use named variables or de Bruijn indices (the two common approaches) but instead uses a graph representation. In this representation variables are represented by pointers to a binder. The program can compile an Automath text into one big Automath single line-style -term. It outputs such a term using de Bruijn indices. (These -terms cannot be checked by modern systems like Coq or Agda, because the -typed -calculi of de Bruijn are different from the -typed -calculi of modern type theory.)The source of aut is freely available on the Web at the address .