基于实例的检索

基于实例的推理是人工智能中一项重要推理技术,而推理的核心是检索.介绍了产品设计的相似度计算方法,以及实例特征参数权系数值的确定方法,最后给出产品设计实例库三级检索算法.     

一种基于稳健匹配准则的视频文本跟踪方法

本文首先根据文本中各个字符的颜色相似的特性,确定已知文本块的文本的颜色,利用文本的颜色信息二值化文本图像以得到文本块中的字符数、字符的尺寸和间距;其次,根据视频图像的大小和视频的播放速度确定搜索窗口的大小,并利用文本的运动信息来预测搜索窗口的位置;第三,根据在相邻两帧中具有相同内容文本的颜色相似的特性,提出了一个可以解决脉冲噪声和部分缺损或遮挡问题的稳健匹配准则来跟踪文本块;最后,确定跟踪输出的文本的颜色、尺寸和运动方式。本文方法可以很好地跟踪平移、缩小或放大、旋转、淡入淡出和部分被遮挡的水平或倾斜排列的文本,并且可以记录文本平移、旋转和缩放的速度。     

Website accessibility: a survey of local e-government websites and legislation in Northern Ireland

The provision of accessible websites is a legal requirement under the Disability Discrimination Act 1995, which applies throughout Great Britain and Northern Ireland, and the Equality (disability, etc.) (Northern Ireland) Order 2000. A survey of local e-government websites indicated that few local councils in the devolved administration of Northern Ireland offered websites which were adequately usable by people with a disability, yet most citizen-government transactions occur at the local level. Design for all has obvious commercial benefits, but it has also become a legal obligation, and application of accessible design principles should improve the online experience of all users.     

A computational study of LP-based heuristic algorithms for two-dimensional guillotine cutting stock problems

In this paper we develop and compare several heuristic methods for solving the general two-dimensional cutting stock problem. We follow the Gilmore-Gomory column generation scheme in which at each iteration a new cutting pattern is obtained as the solution of a subproblem on one stock sheet. For solving this subproblem, in addition to classical dynamic programming, we have developed three heuristic procedures of increasing complexity, based on GRASP and Tabu Search techniques, producing solutions differing in quality and in time requirements. In order to obtain integer solutions from the fractional solutions of the Gilmore-Gomory process, we compare three rounding procedures, rounding up, truncated branch and bound and the solution of a residual problem. We have coded and tested all the combinations of algorithms and rounding procedures. The computational results obtained on a set of randomly generated test problems show their relative efficiency and allow the potential user to choose from among them, according to the available computing time. Rceived: January 9, 2001 / Accepted: December 10, 2001     

检测骨架图形特征点的新方法

端点、折点、歧点和交点是骨架图形的重要特点是，提出用快速查表法检测侯选特征点，再进行侯选特征点聚集，用局部结构分析，去除假特征点，判别真特征点的类型，并对折点给以大致的定量描述。实验结果表明，该方法能快速有效地找出骨架图形的特征点，在目标识别、字符识别等应用中起着关键作用。     

Effect of local alloy disorder on the emission kinetics of deep donors (DX centers) in AlxGa1-xAs

In this paper we summarize our recent studies of the effects of local alloy disorder on the properties ofDX levels. A single emission rate is observed in GaAs where all Si-donors have identical local environments. In contrast, three discrete emission rates are observed in dilute AlGaAs alloys, suggesting that the group IV donor moves towards the interstitial site, thereby “selecting” three of the twelve surrounding group III atoms. We present evidence for an ordering of theDX levels consistent with Morgan’s model of a deepening potential well for theDX level as Al atoms are subsequently substituted for Ga atoms near the relaxed donor. These conclusions are consistent with earlier calculations of Chadi and Chang.     

基于ISO质量体系认证在线计量数据智能统计和查询

ISO质量体系认证标准要求对计量数据进行计算和评价。公司的信息管理系统可以自动计算统计参数，并可以方便的进行分析和查询，提高企业工作效率，改善产品质量。论文为国家自然科学基金“现代制造质量控制、溯源中若干理论问题与技术基础的研究”(项目号：59735120)中的一部分。     

移动IP的关键技术

本详细描述了移动IP的工作过程，并介绍了移动IP的隧道技术和IPSec，最后对移动IP技术中存在几个热点问题进行了讨论。     

On finding optimal and near-optimal lineal spanning trees

The search for good lineal, or depth-first, spanning trees is an important aspect in the implementation of a wide assortment of graph algorithms. We consider the complexity of findingoptimal lineal spanning trees under various notions of optimality. In particular, we show that several natural problems, such as constructing a shortest or a tallest lineal tree, are NP-hard. We also address the issue of polynomial-time, near-optimization strategies for these difficult problems, showing that efficient absolute approximation algorithms cannot exist unlessP = NP.This author's research was supported in part by the Sandia University Research Program and by the National Science Foundation under Grant M IP-8603879.This author's research was supported in part by the National Science Foundation under Grants ECS-8403859 and MIP-8603879.     

Parallel branch-and-bound search in Parlog

The concurrent logic languages, of which Parlog is one, have been promoted as a new generation of software languages specifically designed for parallel programming. This paper investigates their application to a search problem commonly used as an illustration of artificial intelligence techniques, the 8-puzzle. It notes that programs written in the concurrent logic languages which do not pay attention to the parallelism can fall into two possible traps: either there is little real parallelism in them due to data dependencies, or there is too much parallelism and any practical architecture will be overwhelmed. A solution which controls the parallelism using user-defined priorities is proposed. This solution has the advantage of being architecture-independent.