一种简便快速的电子衍射谱分析方法

本文根据特征平行四边形法和N/(1/2)比值法提出了一种简便快速的电子衍射谱分析方法——图表法,由于它以一些简单的操作取代了常用分析法的数据测量和计算过程,因此具有简便、快速、可靠性高等优点。     

凸轮分度装置分度精度、停留精度检测系统

分度精度和停留精度是凸轮分度装置的重要性能指标,本文建立了以这两个参数为主测参数的凸轮分度装置检测系统,文中合理的选择了检测原理、传感器,并以对传感器的信号性质的分析为基础,配置了合理的系统硬件,设计了信号处理的方法,最后通过实验结果,说明本检测系统的适用性。     

业务过程模型库索引技术

为了有效管理数量庞大的业务过程模型,提高检索效率,分析了实际业务过程模型的特点,分析比较了已有的图数据库索引技术和业务过程模型检索的已有研究成果,结果表明,BeehiveZ系统能比较好地结合业务过程模型的特点进行检索,但还需要在嵌套模型检索和基于双互向模拟的模型相似性度量方面开展进一步的工作。     

基于多刀铣削过程的弧面分度凸轮建模方法

通过CAD软件的二次开发技术模拟多个铣刀同时铣削弧面分度凸轮的加工过程,给出一种孤面分度凸轮计算机辅助设计的建模方法.实例证明该种方法是正确可行的,并且大大简化弧面分度凸轮的建模过程,同时为建立复杂工作轮廓曲面凸轮的通用CAD系统提供依据.     

分度蜗杆副制造品质的提高方案

介绍了某厂滚齿机、插齿机、数控回转工作台等产品的关键部件——分度蜗杆副的制造,系统地分析了从设计图样、工艺路线、加工设备直至刀具、检验测量各个环节存在的问题,提出了攻关方案并付诸实施,取得了很好的成绩,制造精度由6~5级提高至4级。     

基才高维局部特征和LSH索引的图像检索技术

基于内容的图像检索（CBIR）技术使从海量图像资源中快速高效地提取有价值的信息得以实现,采用局部特征来表示图像并在此基础上进行图像相似性检索是当前的热门研究课题。文中将图像高维局部不变特征提取算法和LSH索引算法应用到基于内容的图像检索系统中,实验结果表明了该方法的有效性。     

Negotiating the semantic gap: from feature maps to semantic landscapes

In this paper, we present the results of a project that seeks to transform low-level features to a higher level of meaning. This project concerns a technique, latent semantic indexing (LSI), in conjunction with normalization and term weighting, which have been used for full-text retrieval for many years. In this environment, LSI determines clusters of co-occurring keywords, sometimes, called concepts, so that a query which uses a particular keyword can then retrieve documents perhaps not containing this keyword, but containing other keywords from the same cluster. In this paper, we examine the use of this technique for content-based image retrieval, using two different approaches to image feature representation. We also study the integration of visual features and textual keywords and the results show that it can help improve the retrieval performance significantly.     

Image indexing applied to typewriter font identification

A method is described to extract an index from a binary character image for database storage and retrieval. The index is hierarchical in nature, and different parts can retrieve character image clusters of different sizes. A hierarchy of Kohonen neural networks is used to generate the clusters on which the indexing method is based. The application is the identification of the font from a sample of printed characters. This is particularly important for forensic document examiners who may have to match a document of unknown origin with the equipment that may have produced it. A computerised system is expected to considerably reduce the time required for each document search.     

Bi4（SiO4）3晶体结构的X射线粉末衍射研究

在Ｘ射线衍射仪上收集了Ｂｉ_４（ＳｉＯ_４）_３的衍射数据；利用Ｒｉｅｔｖｅｌｄ方法对衍射数据进行指标化，Ｆ_（３０）＝１５８．９０；确定了Ｂｉ_４（ＳｉＯ_４）_３的晶体结构参数。结果发现：该结构中硅氧四面体是变形的孤立四面体，其中两个Ｏ－Ｓｉ－Ｏ键角为１０７．１３°，而另两个为１１４．２６°，详细报道了晶体结构，给出了晶体结构图；提出Ｂｉ离子最外层孤对的６ｓ２电子的存在是形成这种变形配位多面体的原因。     

A pictorial index mechanism for model-based matching

We are currently developing unified query processing strategies for image databases. To perform this task, model-based representations of images by content are being used, as well as a hierarchical generalization of a relatively new object-recognition technique called data-driven indexed hypotheses. As the name implies, it is index-based, from which its efficiency derives. Earlier approaches to data-driven model-based object recognition techniques were not capable of handling complex image data containing overlapping, partially visible, and touching objects due to the limitations of the features used for building models. Recently, a few data-driven techniques capable of handling complex image data have been proposed. In these techniques, as in traditional databases, iconic index structures are employed to store the image and shape representation in such a way that searching for a given shape or image feature can be conducted efficiently. Some of these techniques handle the insertion and deletion of shapes and/or image representations very efficiently and with very little influence on the overall system performance. However, the main disadvantage of all previous data-driven implementations is that they are main memory based. In the present paper, we describe a secondary memory implementation of data-driven indexed hypotheses along with some performance studies we have conducted.