一种测量透明平行平板折射率的新方法

通过测量激光细光束经平行平板玻璃所产生的位移,可确定平行平板的的折射率。本文阐述了该方法的测量原理,给出了测量公式,并详细分析了测量误差。计算机模拟计算结果表明,当平板厚度为50mm时,如果入射角测量标准偏差为1”,平板厚度和光线位移量测量标准偏差均为0.001mm,则折射率测量的标准偏差可达6×10~(-5),此时入射角约55°。     

Efficient processing of spatial joins with DOT-based indexing

A spatial join is a query that searches for a set of object pairs satisfying a given spatial relationship from a database. It is one of the most costly queries, and thus requires an efficient processing algorithm that fully exploits the features of the underlying spatial indexes. In our earlier work, we devised a fairly effective algorithm for processing spatial joins with double transformation (DOT) indexing, which is one of several spatial indexing schemes. However, the algorithm is restricted to only the one-dimensional cases. In this paper, we extend the algorithm for the two-dimensional cases, which are general in Geographic Information Systems (GIS) applications. We first extend DOT to two-dimensional original space. Next, we propose an efficient algorithm for processing range queries using extended DOT. This algorithm employs the quarter division technique and the tri-quarter division technique devised by analyzing the regularity of the space-filling curve used in DOT. This greatly reduces the number of space transformation operations. We then propose a novel spatial join algorithm based on this range query processing algorithm. In processing a spatial join, we determine the access order of disk pages so that we can minimize the number of disk accesses. We show the superiority of the proposed method by extensive experiments using data sets of various distributions and sizes. The experimental results reveal that the proposed method improves the performance of spatial join processing up to three times in comparison with the widely-used R-tree-based spatial join method.     

A level set method based on the Bayesian risk for medical image segmentation

This paper proposes an alternative criterion derived from the Bayesian risk classification error for image segmentation. The proposed model introduces a region-based force determined through the difference of the posterior image densities for the different classes, a term based on the prior probability derived from Kullback-Leibler information number, and a regularity term adopted to avoid the generation of excessively irregular and small segmented regions. Compared with other level set methods, the proposed approach relies on the optimum decision of pixel classification and the estimates of prior probabilities; thus the approach has more reliability in theory and practice. Experiments show that the proposed approach is able to extract the complicated shapes of targets and robust for various types of medical images. Moreover, the algorithm can be easily extendable for multiphase segmentation.     

基于混合聚类的城市道路多时段控制研究*

多方案控制具有简单实用、可靠性好,稳定性高,性价比高等的优点,在城市交通控制中得到了广泛应用。本研究在利用指数平滑异同移动平均法对缺失交通数据进行修补的基础上,运用快速聚类与系统聚类相结合的混合聚类方法对交通数据进行分析,并以经典的Silhouttte评价指标作为聚类终止条件,同时兼顾/考虑了交通数据时序性,消除聚类结果中的三类“奇异点”,最后利用交通信号配时软件SYNCHRO制定了相应时段的控制方案。相关的案例分析显示,优化后的多时段控制方案可以更好地适应交通流的波动,车均延误减少9.79%,其中时序性考虑可以有效改善控制方案频繁切换对交通流的扰动,避免其负效应对混合聚类改善效果的影响。     

CS-Chord:基于聚类分离的分布式高维向量索引

M-Chord是一种基于P2P网络的高维向量索引,其聚类边缘的向量容易与搜索圆频繁相交,使得查找的区域增多,降低了M-Chord的效率。提出一种基于聚类分离的分布式高维向量索引(CS-Chord),将边缘区域的高频检索向量从Chord环中分离出来,集中存储在服务器上,中心区域的向量仍存储于Chord环中,节省了大量资源的定位时间,从而提高检索效率。实验结果表明:在查询半径为0.2时,CS-Chord距离计算次数约为2000,比M-Chord减少了约2500次;CS-Chord消息转发次数约降低150次,仅为M-Chord的50%。     

基于C—V模型的目标检测与提取

在目标检测与提取中,传统的蛇模型和基于活动轮廓的局部区域检测方法受到初始条件或者自身的收敛性约束的影响,不仅时间花费多,而且不具备鲁棒性。本文提出一种基于C V模型的变分水平集的目标检测与提取方法,通过大量实验验证,在花费时间和鲁棒性上得到了显著的改善。     

Reachability determination in acyclic Petri nets by cell enumeration approach

Reachability is one of the most important behavioral properties of Petri nets. We propose in this paper a novel approach for solving the fundamental equation in the reachability analysis of acyclic Petri nets, which has been known to be NP-complete. More specifically, by adopting a revised version of the cell enumeration method for an arrangement of hyperplanes in discrete geometry, we develop an efficient solution scheme to identify firing count vector solution(s) to the fundamental equation on a bounded integer set, with a complexity bound of O((nu)^n−m), where n is the number of transitions, m is the number of places and u is the upper bound of the number of firings for all individual transitions.     

On the estimation of adequate test set size using fault failure rates

Test set size in terms of the number of test cases is an important consideration when testing software systems. Using too few test cases might result in poor fault detection and using too many might be very expensive and suffer from redundancy. We define the failure rate of a program as the fraction of test cases in an available test pool that result in execution failure on that program. This paper investigates the relationship between failure rates and the number of test cases required to detect the faults. Our experiments based on 11 sets of C programs suggest that an accurate estimation of failure rates of potential fault(s) in a program can provide a reliable estimate of adequate test set size with respect to fault detection and should therefore be one of the factors kept in mind during test set construction. Furthermore, the model proposed herein is fairly robust to incorrect estimations in failure rates and can still provide good predictive quality. Experiments are also performed to observe the relationship between multiple faults present in the same program using the concept of a failure rate. When predicting the effectiveness against a program with multiple faults, results indicate that not knowing the number of faults in the program is not a significant concern, as the predictive quality is typically not affected adversely.     

Guarding a set of line segments in the plane

We consider the following problem: Given a finite set of straight line segments in the plane, find a set of points of minimum size, so that every segment contains at least one point in the set. This problem can be interpreted as looking for a minimum number of locations of policemen, guards, cameras or other sensors, that can observe a network of streets, corridors, tunnels, tubes, etc. We show that the problem is strongly NP-complete even for a set of segments with a cubic graph structure, but in P for tree structures.     

Conservative and aggressive rough SVR modeling

Support vector regression provides an alternative to the neural networks in modeling non-linear real-world patterns. Rough values, with a lower and upper bound, are needed whenever the variables under consideration cannot be represented by a single value. This paper describes two approaches for the modeling of rough values with support vector regression (SVR). One approach, by attempting to ensure that the predicted high value is not greater than the upper bound and that the predicted low value is not less than the lower bound, is conservative in nature. On the contrary, we also propose an aggressive approach seeking a predicted high which is not less than the upper bound and a predicted low which is not greater than the lower bound. The proposal is shown to use ?-insensitivity to provide a more flexible version of lower and upper possibilistic regression models. The usefulness of our work is realized by modeling the rough pattern of a stock market index, and can be taken advantage of by conservative and aggressive traders.