DB2数据库查询优化策略

数据库的查询优化是改善应用程序性能的重要手段。通过分析IBM DB2数据库系统的最优化处理器的工作原理,对查询性能影响较大的统计信息更新、索引建立、SQL查询语句构造3个方面提出具体优化建议。建立了一套完整的测试方案,对每一条优化建议都使用具体SQL语句进行严格的验证。开发者要注意分析查询语句的时间开销和空间开销,才能写出较优的查询语句。     

一个基于优化的有限元模型修正方法

本文提供了一个基于一阶搜索优化的有限元模型修正方法。它只需利用结构模态试验的部分固有频率，就能获得较精确的有限元模型。文中附有某无人机上垂尾有限元模型修正的实例。根据上垂尾前二阶试验的固有频率，采用本文方法，对有限元模型进行了修正。修正后有限元模型的前二阶固有频率与试验值的相对误差在2．35％以内，而第三阶固有频率与试验值的相对误差仅为5．81％。它不仅大大地缩小了用修正前有限元模型算得的固有频率与试验值的相对误差，而且还能较精确地预测无试验结果的高阶固有频率值。     

静态SAT问题并行处理器的设计研究

针对SAT问题的复杂性及求解速度缓慢的问题，采用可重构器件FPGA设计，实现了静态回溯搜索算法SAT问题并行处理器，提出了研制动态SAT并行处理器的设想。     

Object-oriented query language access to relational databases: A semantic framework for query translation

This research investigates and approach to query processing in a multidatabase system that uses an objectoriented model to capture the semantics of other data models. The object-oriented model is used to construct a global schema, defining an integrated view of the different schemas in the environment. The model is also used as a self-describing model to build a meta-database for storing information about the global schema. A unique aspect of this work is that the object-oriented model is used to describe the different data models of the multidatabase environment, thereby extending the meta database with semantic information about the local schemas. With the global and local schemas all represented in an object-oriented form, structural mappings between the global schema and each local schema are then easily supported. An object algebra then provides a query language for expressing global queries, using the structural mappings to translate object algebra queries into SQL queries over local relational schema. The advantage of using an object algebra is that the object-oriented database can be viewed as a blackboard for temporary storage of local data and for establishing relationships between different databases. The object algebra can be used to directly retrieve temporarily-stored data from the object-oriented database or to transparently retrieve data from local sources using the translation process described in this paper.     

Robot Pose Estimation in Unknown Environments by Matching 2D Range Scans

A mobile robot exploring an unknown environment has no absolute frame of reference for its position, other than features it detects through its sensors. Using distinguishable landmarks is one possible approach, but it requires solving the object recognition problem. In particular, when the robot uses two-dimensional laser range scans for localization, it is difficult to accurately detect and localize landmarks in the environment (such as corners and occlusions) from the range scans.In this paper, we develop two new iterative algorithms to register a range scan to a previous scan so as to compute relative robot positions in an unknown environment, that avoid the above problems. The first algorithm is based on matching data points with tangent directions in two scans and minimizing a distance function in order to solve the displacement between the scans. The second algorithm establishes correspondences between points in the two scans and then solves the point-to-point least-squares problem to compute the relative pose of the two scans. Our methods work in curved environments and can handle partial occlusions by rejecting outliers.     

Capacitated Clustering Problems by Hybrid Simulated Annealing and Tabu Search

The capacitated clustering problem (CCP) is the problem in which a given set of weighted objects is to be partitioned into clusters so that the total weight of objects in each cluster is less than a given value (cluster ‘capacity’). The objective is to minimize the total scatter of objects from the ‘centre’ of the cluster to which they have been allocated. A simple constructive heuristic, a R-interchange generation mechanism, a hybrid simulated annealing (SA) and tabu search (TS) algorithm which has computationally desirable features using a new non-monotonic cooling schedule, are developed. A classification of the existing SA cooling schedules is presented. The effects on the final solution quality of the initial solutions, the cooling schedule parameters and the neighbourhood search strategies are investigated. Computational results on randomly generated problems with size ranging from 50 to 100 customers indicate that the hybrid SA/TS algorithm out-performs previous simulated annealing algorithms, a simple tabu search and local descent algorithms.     

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

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

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     

Structured document storage and refined declarative and navigational access mechanisms in HyperStorM

The combination of SGML and database technology allows to refine both declarative and navigational access mechanisms for structured document collection: with regard to declarative access, the user can formulate complex information needs without knowing a query language, the respective document type definition (DTD) or the underlying modelling. Navigational access is eased by hyperlink-rendition mechanisms going beyond plain link-integrity checking. With our approach, the database-internal representation of documents is configurable. It allows for an efficient implementation of operations, because DTD knowledge is not needed for document structure recognition. We show how the number of method invocations and the cost of parsing can be significantly reduced. Edited by Y.C. Tay. Received April 22, 1996 / Accepted March 16, 1997