管内机器人研究中的几项新技术

介绍了我们研制的管内机器人中应用的具有创新性的三项技术：１．轮式全主动新型行走机构；２．内壁环带视觉装置；３．新型离心喷涂器。     

PPS：基于PROSITE数据库检索蛋白质功能位点的计算机程序

用标准Ｃ语言在ＩＢＭ－ＰＣ兼容微机上开发了基于ＰＲＯＳＩＴＥ数据库检索蛋白质序列功能位点的ＰＰＳ程序，ＰＲＯＳＩＴＥ是Ｂａｉｒｏｃｈ建立的蛋白质功能位点或结构模式的资料库，为蛋白质序列分析和结构功能研究提供了新工具。     

A Low-Complexity Multiuser Detector for Asynchronous CDMA QPSK Adaptive Antenna Array Systems

This paper proposes a low complexity joint space-time multiuser detection algorithm for asynchronous DS/CDMA antenna array systems. The proposed multiuser detector is composed of an adaptive antenna array, used as a linear beamformer, and a sliding window decorrelator. A QPSK modulation scheme is used in order to increase bandwidth efficiency. Numerical results are given in terms of Bit Error Rate (BER) under the assumption of a frequency-selective Rayleigh slow fading channel. In particular, the proposed receiver is shown to be near-far resistant, even in worst fading cases, and to exploit completely array introduction while maintaining acceptable computational complexity. The proposed architecture avoids linear filter realization of the decorrelator, which is impractical in the case of a large number of users, and operates with relatively short data frames instead of the complete information sequence. Finally, this receiver is very flexible to changes in timing configuration.     

测井曲线拐点在测井层序地层分析中的应用研究

在层序地层学研究中，层序界面的划分是基础和重要的环节，而利用测井资料分析可以进行层序界面划分和进行较长期基准面旋回识别。测井曲线的值是深度的函数，测井曲线的一阶导数表示了曲线变化的趋势和变化的快慢，在某一范围内，当一阶导数呈现符号转换时，相对应的深度点的测井值即为该范围内极大（极小）值；测井曲线的二阶导数则表示曲线的凹凸性，在某一范围内，当二阶导数呈现符号转换时，相对应的深度点代表了测井曲线的拐点，即反映曲线凹凸性变化的转折点，亦即地层的分界面。基于以上特点，提出利用测井曲线拐点进行层序界面划分的原理和方法，并结合岩心和录井资料，对白音查干凹陷达28井腾格尔组不同级次沉积旋回、地层垒积、旋回特征随沉积厚度变化特点和不同级次基准面旋回进行研究，最后得到该地层单井测井层序地层分析结果。     

Threshold‐Based Camera Motion Characterization of MPEG Video

We propose an efficient scheme for camera motion characterization in MPEG‐compressed video. The proposed scheme detects six types of basic camera motions through threshold‐based qualitative interpretation, in which fixed thresholds are applied to motion model parameters estimated from MPEG motion vectors (MVs). The efficiency and robustness of the scheme are validated by the experiment with real compressed video sequences.     

运动估计块匹配两级搜索算法

根据视频图像相邻块在空间上具有很大的相关性,吸收了矢量预测块匹配的核心思想,提出一种两级块匹配运动估计算法,在第一级中,首先根据矢量预测确定一个小区域,然后在此区域内进行快速搜索,如果在第一级中没有搜索到匹配块则进行第二级搜索,该算法可大大提高搜索速度.     

网格技术在广播电视中的应用

网格是继Internet和Web技术之后的第三个信息技术浪潮。简述了网格的定义、特点和基本体系结构 ,并且分析了网格技术在广播电视中的应用     

On inversive maximal period polynomials over finite fields

Over finite field GF(q) withq a power of an odd primep, we characterize inversive maximal period polynomials in terms of polynomials of orderq + 1, and then we study some properties of polynomials of orderq + 1.This paper was written while the author was visiting the Institute of Information Processing, Austrian Academy of Sciences, AustriaThe author would like to thank the Institute of Information Processing, Austrian Academy of Sciences, Austria, for its hospitality and for using its facilities     

Node-pair reliability of network systems with small distances between adjacent nodes

A new method for computing the node-pair reliability of network systems modeled by random graphs with nodes arranged in sequence is presented. It is based on a recursive algorithm using the “sliding window” technique, the window being composed of several consecutive nodes. In a single step, the connectivity probabilities for all nodes included in the window are found. Subsequently, the window is moved one node forward. This process is repeated until, in the last step, the window reaches the terminal node. The connectivity probabilities found at that point are used to compute the node-pair reliability of the network system considered. The algorithm is designed especially for graphs with small distances between adjacent nodes, where the distance between two nodes is defined as the absolute value of the difference between the nodes’ numbers. The maximal distance between any two adjacent nodes is denoted by Γ(G), where G symbolizes a random graph. If Γ(G)=2 then the method can be applied for directed as well as undirected graphs whose nodes and edges are subject to failure. This is important in view of the fact that many algorithms computing network reliability are designed for graphs with failure-prone edges and reliable nodes. If Γ(G)=3 then the method's applicability is limited to undirected graphs with reliable nodes. The main asset of the presented algorithms is their low numerical complexity—O(n), where n denotes the number of nodes.     

基于小波的彩色序列图象压缩编码

此文提出了一种基于小波变换的运动估计算法，时间复杂度比常规算法降低了一个数量级，同时在估值精度上可与常规算法媲美。利用更佳频率分辨率小波分解处理运动补偿余量误差善了复现图象质量。实验结果表明，该算法在高压缩比情况下图象复现质量显著优于ＭＰＥＧ－２，具有广阔的应用前景。