A novel approach to annotating web service based on interface concept mapping and semantic expansion

With the rapid development of web service technology in these years, traditional standards have been matured during the process of service registry and discovery. However, it is difficult for service requesters to discover satisfactory web services. The reason for this phenomenon is that the traditional service organization mode lacks semantic understanding ability for service function interface. This paper proposes a novel approach to annotating web services. We first adopt domain ontology as a semantic context, and give our general framework of service semantic annotation. Then, interface concept mapping algorithm and service interface expansion algorithm are respectively presented in detail. Finally, the generation process of semantic web service repository is presented based on preceding algorithms. Simulation experiment results demonstrate that annotated web services by the proposed method can more satisfy requirements for service requesters than traditional ones by service matchmaking engine. It can get better service discovery effectiveness.     

软件自动化测试的合理应用

主要从软件自动化测试在工作中的实际经验出发,探讨如何合理应用"软件自动化测试"这一测试手段.同时也简单介绍了软件自动化测试的定义、目的等概念,以及常见的一些自动化测试工具软件.另外从对软件自动化测试的一些认识误区的分析中,让大家意识到软件自动化测试的合理应用是软件开发过程中降本增效的关键.     

An Efficient Path Planning and Control Algorithm for RUAV’s in Unknown and Cluttered Environments

This paper presents an efficient planning and execution algorithm for the navigation of an autonomous rotary wing UAV (RUAV) manoeuvering in an unknown and cluttered environment. A Rapidly-exploring Random Tree (RRT) variant is used for the generation of a collision free path and linear Model Predictive Control(MPC) is applied to follow this path. The guidance errors are mapped to the states of the linear MPC structure by using the nonlinear kinematic equations. The proposed path planning algorithm considers the run time of the planning stage explicitly and generates a continuous curvature path whenever replanning occurs. Simulation results show that the RUAV with the proposed methodology successfully achieves autonomous navigation regardless of its lack of prior information about the environment.     

医学生上网情况的调查与研究

目的:了解医学生的上网情况。方法:采用"医学生上网调查问卷",在七个不同专业500名学生中进行问卷调查。结果:有95.16%学生上网,上网学生中30.25%每次上网3h以上;上网目的以聊天、多媒体娱乐和玩游戏为主。结论:青年群体是网上的主力军,应警惕大学生网上迷路,鼓励上网学生要以理智态度控制上网时间,老师和学校应给予学生上网以恰当的引导和教育。     

Constructive approximation to real function by wavelet neural networks

We present a type of single-hidden layer feed-forward wavelet neural networks. First, we give a new and quantitative proof of the fact that a single-hidden layer wavelet neural network with n + 1 hidden neurons can interpolate n + 1 distinct samples with zero error. Then, without training, we constructed a wavelet neural network X _a (x, A), which can approximately interpolate, with arbitrary precision, any set of distinct data in one or several dimensions. The given wavelet neural network can uniformly approximate any continuous function of one variable.     

Distributed supervisory control of discrete-event systems with communication delay

This paper identifies a property of delay-robustness in distributed supervisory control of discrete-event systems (DES) with communication delays. In previous work a distributed supervisory control problem has been investigated on the assumption that inter-agent communications take place with negligible delay. From an applications viewpoint it is desirable to relax this constraint and identify communicating distributed controllers which are delay-robust, namely logically equivalent to their delay-free counterparts. For this we introduce inter-agent channels modeled as 2-state automata, compute the overall system behavior, and present an effective computational test for delay-robustness. From the test it typically results that the given delay-free distributed control is delay-robust with respect to certain communicated events, but not for all, thus distinguishing events which are not delay-critical from those that are. The approach is illustrated by a workcell model with three communicating agents.     

A new block-based method for copy move forgery detection under image geometric transforms

Copy move forgery detection (CMFD) is one of the most active subtopic in forgery scheme. The methods of CMFD are divided into to block-based method and keypoint-based method in general. Compared with keypoint-based method, block-based method can detect undetectable detail without morphology segmentation. But many block-based methods detect the plain copy-move forgeries only. They have been incompetent to detect the post-processing operations such as various geometrical distortions, and then fail to detect the forgery regions accurately. Therefore, this paper presents an improved block-based efficient method for CMFD. Firstly, after pre-processing, an auxiliary overlapped circular block is presented to divide the forged image into overlapped circular blocks. The local and inner image feature is extracted by the Discrete Radial Harmonic Fourier Moments (DRHFMs) with the overlapped circular block from the suspicious image. Then, the similar feature vectors of blocks are searched by 2 Nearest Neighbors (2NN) test. Euclidean distance and correlation coefficient is employed to filter these features and then remove the false matches. Morphologic operation is employed to delete the isolated pixels. A series of experiments are done to analyze the performance for CMFD. Experimental results show that the new DRHFMs can obtain outstanding performance even under image geometrical distortions.     

通用扫描线多边形填充算法

传统的扫描线多边形填充算法只适用于水平扫描线的逐行填充。文章提出通用扫描线多边形填充算法,该算法可以有效地解决任意间距、任意倾角的扫描线对多边形的填充问题。通用扫描线多边形算法采用了坐标变换、浮点数舍入策略等重要方法。顶点扫描线号是该算法中的核心概念。     

Convergence Results of One-Leg and Linear Multistep Methods for Multiply Stiff Singular Perturbation Problems

One-leg methods and linear multistep methods are two class of important numerical methods applied to stiff initial value problems of ordinary differential equations. The purpose of this paper is to present some convergence results of A-stable one-leg and linear multistep methods for one-parameter multiply stiff singular perturbation problems and their corresponding reduced problems which are a class of stiff differential-algebraic equations. Received April 14, 2000; revised June 30, 2000