Geometric interoperability via queries

The problem of geometric (model and system) interoperability is conceptualized as a non-trivial generalization of the problem of part interchangeability in mechanical assemblies. Interoperability subsumes the problems of geometric model quality, exchange, and interchangeability, as well as system integration. Until now, most of the interoperability proposals have been data-centric. Instead, we advocate a query-centric approach that can deliver interoperable solutions to many common geometric tasks in computer aided design and manufacturing, including model acquisition and exchange, metrology, and computer aided design/analysis integration.     

数据流上的连续预测聚集查询

提出了一种数据流上未来值的连续查询,称为连续预测查询．采用数理统计的方法给出了带有COUNT聚集函数的连续预测聚集查询实现算法．通过采用TPC-H标准测试数据和随机生成的模拟数据进行了实验．理论和实验结果表明,给出的带有COUNT的连续预测聚集查询实现算法具有很高的性能和精度．     

Evaluation of aluminium/alumina/titanium composites produced by continual annealing and roll-bonding process

Anodising, continual annealing and roll-bonding (CAR) processes were employed to fabricate aluminium/alumina/titanium composites with different amounts of alumina. After each rolling cycle, annealing treatment was performed at 300°C for 1?h. After six cycles of CAR process, the Al/0.22 vol.-% Al₂O₃/13vol.-%Ti composite showed uniform alumina and titanium particles distribution. The tensile strength of the composites first decreased after the first cycle, then increased up to 200?MPa after the sixth cycle. Conversely, by increasing the alumina content (Al/0.43vol.-%Al₂O₃/13vol.-%Ti composite), microhardness and tensile strength immediately increased. SEM micrographs demonstrated that by increasing the number of cycles, the dimples density increased from 0.007 to 0.028?µm^?2 for the first and the last cycles, respectively.     

Approximate all nearest neighbor search for high dimensional entropy estimation for image registration

Information theoretic criteria such as mutual information are often used as similarity measures for inter-modality image registration. For better performance, it is useful to consider vector-valued pixel features. However, this leads to the task of estimating entropy in medium to high dimensional spaces, for which standard histogram entropy estimator is not usable. We have therefore previously proposed to use a nearest neighbor-based Kozachenko-Leonenko (KL) entropy estimator.Here we address the issue of determining a suitable all nearest neighbor (NN) search algorithm for this relatively specific task.We evaluate several well-known state-of-the-art standard algorithms based on k-d trees (FLANN), balanced box decomposition (BBD) trees (ANN), and locality sensitive hashing (LSH), using publicly available implementations. In addition, we present our own method, which is based on k-d trees with several enhancements and is tailored for this particular application.We conclude that all tree-based methods perform acceptably well, with our method being the fastest and most suitable for the all-NN search task needed by the KL estimator on image data, while the ANN and especially FLANN methods being most often the fastest on other types of data. On the other hand, LSH is found the least suitable, with the brute force search being the slowest.     

一种基于数据流驱动的数据流连续查询模型

建立了基于数据流驱动的数据流连续查询模型,介绍了系统结构和解决方案,设计了一些通用的查询算子,并通过查询算子在查询链中的有序组合来构造出各种复杂的连续查询语句。实验表明,该模型可扩充性强,操作简单,适合小规模的数据流查询需要。     

Music in the home: Interfaces for music appliances

The development of networked information appliances, combined with the proliferation of broadband Internet access and e-commerce, has the potential to greatly affect media consumption in the home. In this paper we consider the influence of these developments on a common domestic activity, finding and listening to music. After summarising the relative strengths and weaknesses of accessing music in physical and digital formats, we present a design concept which is intended to combine the advantages of the old and new media. In particular, we focus on the problem of visual information seeking within the context of music and touchable screen displays.     

基于ALS抑制剂药效团模型的数据库搜索

以ALS抑制剂药效团模型为基础建立了提问结构,将药效团模型中的生物结构信息输入到多种小分子三维结构数据库中(NCI-3D和ACD-3D数据库),借助分子三维结构搜索软件(3DFS和ISIS/3D软件)和多种搜索方法(POW-ELL方法和遗传算法)分别搜寻出100多个符合特征结构信息的全新结构候选化合物。这些命中结构的分子特征信息为我们下一步进行分子设计,确定先导化合物结构明确了方向,并提供了重要依据。     

智能交通系统中数据通信协议的设计和实现

针对高速公路通信系统的现实通信环境和项目需求，提出了一种建立在TCP／UDP之上，利用16位CPC进行检错，利用连续ARQ进行差错控制，能够自动监测网络故障，自动恢复通信状态的全双工数据通信协议。     

Information Monitoring on the Web: A Scalable Solution

This paper presents WebCQ, a continual query system for large-scale Web information monitoring. WebCQ is designed to discover and detect changes to Web pages efficiently, and to notify users of interesting changes with personalized messages. Users' Web page monitoring requests are modeled as continual queries on the Web and referred to as Web page sentinels. The system consists of five main components: a change detection robot that discovers and detects changes, a proxy cache service that reduces the communication traffics to the original information provider on the remote server, a trigger evaluation tool that can filter only the changes that match certain thresholds, a personalized change presentation tool that highlights Web page changes, and a change notification service that displays and delivers interesting changes and fresh information to the right users at the right time. This paper describes the WebCQ system with an emphasis on the general issues in designing and engineering a large-scale information change monitoring system on the Web. There are two main contributions. First, we present the mechanisms that WebCQ provides to support various types of Web page sentinels for finding and displaying interesting changes to Web pages. The large collection of sentinel types allows WebCQ to efficiently locate and monitor a wide range of changes in Web pages. The second contribution is the development of sentinel grouping techniques for efficient and scalable processing of large number of concurrently running triggers and Web page sentinels. We report our initial experimental results showing the effectiveness of the proposed solutions.     

Structural Results About On-line Learning Models With and Without Queries

We solve an open problem of Maass and Turán, showing that the optimal mistake-bound when learning a given concept class without membership queries is within a constant factor of the optimal number of mistakes plus membership queries required by an algorithm that can ask membership queries. Previously known results imply that the constant factor in our bound is best possible.We then show that, in a natural generalization of the mistake-bound model, the usefulness to the learner of arbitrary yes-no questions between trials is very limited. We show that several natural structural questions about relatives of the mistake-bound model can be answered through the application of this general result. Most of these results can be interpreted as saying that learning in apparently less powerful (and more realistic) models is not much more difficult than learning in more powerful models.