一种基于向量空间模型的主观题批改算法

文字类主观题的自动批改是在线考试系统的一个关键技术。本文在研究主观题自动批改技术现状的基础上,提出了一种基于向量空间模型的短语级句子相似度计算方法,并基于该计算方法设计了一种主观题自动批改算法,经验证,实验结果基本达到预期目标。     

用于图像Hash的视觉相似度客观评价测度

由于评价图像Hash性能时,要求对两幅图像是否在感知上相似做出判断,因此针对这一需求,提出了一种衡量感知相似程度的评价测度。该测度的确定是先对图像进行低通滤波,再进行图像重叠分块;然后运用相关系数检测法计算每一对分块的相似程度,并对相似系数归一化,再分别计算若干个最小和最大的归一化相似系数的乘积;最后用最小相似系数乘积与最大相似系数乘积的比值作为感知相似性的测度。实验结果表明,该测度不仅可有效反映图像视觉质量的变化,而且能较好地区分两幅图像是否存在重要的视觉差异,其对感知相似进行评价的性能优于峰值信噪比。     

Point Set pattern matching ind-dimensions

In this paper we apply computational geometry techniques to obtain an efficient algorithm for the following point set pattern matching problem. Given a setS ofn points and a setP ofk points in thed-dimensional Euclidean space, determine whetherP matches anyk-subset ofS, where a match can be any similarity, i.e., the setP is allowed to undergo translation, rotation, reflection, and global scaling. Motivated by the need to traverse the sets in an orderly fashion to shun exponential complexity, we circumvent the lack of a total order for points in high-dimensional spaces by using an extension of one-dimensional sorting to higher dimensions (which we call circular sorting). This mechanism enables us to achieve the orderly traversal we sought. An optimal algorithm (in time and space) is described for performing circular sorting in arbitrary dimensions. The time complexity of the resulting algorithm for point set pattern matching is O(n logn+kn) for dimension one and O(kn^d) for dimensiond2.Supported in part by CNPq-Conselho Nacional de Desenvolvimento Cientifico e Tecnológico (Brazil) under Grants 200331/79, 300157/90-8, and 500787/91-3.Supported in part by the National Science Foundation under Grant CCR 8901815.     

Information Retrieval and Filtering of Multimedia Mineral Data

Most of the written materials are consisted of Multimedia (MM) information because beside text usually contain image information. The present information retrieval and filtering systems use only text parts of the documents or in best case images represented by keywords or image captions. Why do not use both, text and image features of the documents and in the retrieval or filtering process utilize more completely the document information content? Can such approach increase the effectiveness of retrieval and filtering processes? There is a very little difference between retrieval and filtering at an abstract level. In this paper, we will discuss some possible similarities and differences between them on the application level taking into account the experiments in retrieval and filtering of multimedia mineral information.     

机械结构相似度评价及可靠性预计研究

在用传统的相似产品法进行可靠性预计时,所选取的相似产品与评价对象之间差异较大,会造成预计结果的偏差较大。为解决这一问题,提出了一种基于"功能—运动—动作"结构化分解的可靠性预计新方法。通过明确产品的各大运动功能建立功能层,分析完成各功能的机械部件运动建立运动层,确定实现各机械部件运动的元动作运动单元建立元动作层,建立了可靠性预计的"功能—运动—元动作运动单元"层次模型。引入区间层次分析法,确定了"功能—运动—元动作运动单元"层次模型中各子代运动单元对父代运动单元的可靠性影响权重,并构建了由子代运动单元预计父代运动单元可靠性的数学模型。确定影响评价机械结构相似度的因素,构建了区间数综合评判云模型并选取与元动作运动单元相似的参考结构,以区间数综合评价云模型得出的相似度值修正参考结构的可靠性数据来预计元动作运动单元的可靠性。将元动作运动单元的可靠性预计值代入数学模型,层层预计父代运动单元的可靠性,从而得出整个产品的可靠性水平。最后以数控转台为例进行了分析,得出了可靠性预计值,并将该方法与传统方法进行了比较。结果表明,新的可靠性预计方法具有较好的可行性和较高的准确性。     

Cellular manufacturing system design considering machines reliability and parts alternative process routings

Cell formation is an important problem in the design of cellular manufacturing systems (CMS). Most cell formation methods appeared in the literature assume that each part has one process plan, and all machines are 100% reliable with unlimited capacity. However, this is not realistic in manufacturing systems. Considering machines reliability in addition to machines capacity and machine duplicates during the part route selection process help to obtain better machine grouping and minimum total cost for CMS. Considering these factors in addition to operations sequence and production volumes makes the problem more complex but more realistic. Most of the methods appeared in the literature to solve such problems use mathematical programming procedures that take large amount of computational efforts. Procedures using similarity coefficient method are more flexible in incorporating various important production data and lend easily to computer applications. A new similarity coefficient equation that incorporates all these production factors is developed. Also, a procedure that captures the similarity between machine groups and minimises the total CMS cost is developed. The procedure utilises functional cells to eliminate intercellular moves and achieve ‘one-piece flow’ practise. The methodology is compared with other methods in the literature and found to be more effective.     

坑道内爆炸冲击波相似律问题探讨

为研究坑道内爆炸冲击波相似律问题,进行了不同药量坑道堵口爆炸实验,并利用ANSYS/LSDYNA软件对原型坑道与模型坑道爆炸冲击波进行数值计算。结果表明:与自由大气中不同,同一坑道内不同药量爆炸产生的冲击波不符合爆炸相似律;若原型坑道与模型坑道几何相似,装药量之比为几何相似比的三次方,则原型坑道与模型坑道内爆炸冲击波符合爆炸相似律;坑道内爆炸冲击波数值模拟时,若原型坑道与模型坑道网格尺寸符合相应的几何相似比,则冲击波计算结果满足相似律,当坑道截面网格密度为1675~2977时可以达到计算精度要求。     

基于相似性的邮政信息网业务需求

邮政业务已基本实现信息化、网络化,但邮政业务种类繁多对网络的通信质量提出了新的要求。因此,文中提出基于相似性的邮政业务需求。邮政业务采用相似信息连接,即邮政节点有相似信息即建立连接。业务节点之间通过强连接形成具有相似性的网络团,弱连接形成整个邮政网络的信息交换。通过邮政业务相似建立的邮政网络改善了网络流量,优化了网络带宽。对邮政业务的仿真表明了理论的正确性。     

Parallelization of a dynamic SVD clustering algorithm and its application in information retrieval

We describe an implementation of a parallel document clustering scheme based on latent semantic indexing, which uses singular value decomposition. Given a set of documents, the clustering algorithm is dynamic in the sense that it automatically infers the number of clusters to be output. The parallel version has been implemented on a LAN and on a dual‐core system. Experimental evaluation of the algorithm shows an average speed‐up of 6.22 for the LAN implementation and an average speed‐up of 3.71 for the dual‐core implementation, while still maintaining a precision and recall in the range [0.85, 1]. To put these implementations in the context of information retrieval, we use the parallel clustering algorithm and develop a document similarity search system. The similarity search system shows good performance in terms of precision and recall. Copyright © 2010 John Wiley & Sons, Ltd.