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

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

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     

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

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

移动IP的关键技术

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

异构空间信息的分级共识模型研究

Internet上异构、分布的空间信息因各自独立、相对封闭而无法相互沟通和协作,从而形成了空间信息孤岛。论文利用计算机的知识表示理论和Ontology技术能够明确表达相关领域共识的特点,探索性地提出了异构空间信息的分级共识模型。该模型为解决上述问题提供了一条切实可行的新思路。     

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.     

Age effects in coding tasks: Componential analysis and test of the sensory deficit hypothesis.

Multiple forms of a symbol-digit substitution task were used to provide a componential analysis of age differences in coding task performance. The results demonstrated age differences in feature encoding, memory, and visual search. A 2nd experiment was conducted with young adults to investigate a sensory deficit as a locus of age differences. The spatial contrast sensitivity deficit of older adults was simulated on forms by applying a digital filter. Persons in the age-simulated contrast condition performed worse than those in the normal contrast condition. The stimulus degradation effect was linked to visual search speed. The study illustrates the utility of componential analysis and offers direct support for the hypothesis that sensory deficits affect performance on tasks used to assess intelligence (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Plasticity of feature-based selection in triple-conjunction search.

Two experiments examined the disruption of feature-based selection in triple-conjunction search at multiple target transfers. In Experiment 1, after 10 training sessions, a new target possessing previous distractor features was introduced. This produced disruption in RT and fixation number, but no disruption in feature-based selection. Specifically, there was a tendency to fixate objects sharing the target's contrast polarity and shape and this did not change even upon transfer to the new target. In Experiment 2, 30 training sessions were provided with three target transfers. At the first transfer, the results replicated Experiment 1. Subsequent transfers did not produce disruption on any measure. These findings are discussed in terms of strength theory, Guided Search, rule-based approaches to perceptual learning, and the area activation model. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Integration of batching and scheduling for hot rolling production in the steel industry

This paper investigates the hot rolling production scheduling problem in the steel industry and proposes a new mixed integer programming model for this problem based on the monolithic modeling strategy that integrates batching and scheduling. Using this strategy, the new model can simultaneously schedule multiple turns and simultaneously determine the production timetable of these turns in a global optimal view. A long-term tabu search heuristic using frequency-based memory is developed to obtain near-optimal solutions for this problem. Three kinds of speed-up strategies are developed to accelerate the search procedure of the proposed tabu search. A practical scheduling system combining the proposed mathematical model and the tabu search heuristic has been developed and tested on instances collected from practical production data. The experimental results show that the proposed mathematical model and the tabu search heuristic outperform both the current manual scheduling method and the traditional serial method.