Ehrenfeucht-Fraïssé games in finite set theory

In this article, with Ehrenfeucht-Fraïssé games we prove that Δ₁≠Δ₀ on BFR, which implies Δ≠Δ₀ on BFR, and thus solve an open problem raised by Albert Atserias in his dissertation (Δ₀,Δ₁,Δ are fragments of first order logic and BFR is a class of finite sets which in essence is equivalent to a class of finite pure arithmetic structures with built-in BIT predicate).     

Utilize bootstrap in small data set learning for pilot run modeling of manufacturing systems

If the production process, production equipment, or material changes, it becomes necessary to execute pilot runs before mass production in manufacturing systems. Using the limited data obtained from pilot runs to shorten the lead time to predict future production is this worthy of study. Although, artificial neural networks are widely utilized to extract management knowledge from acquired data, sufficient training data is the fundamental assumption. Unfortunately, this is often not achievable for pilot runs because there are few data obtained during trial stages and theoretically this means that the knowledge obtained is fragile. The purpose of this research is to utilize bootstrap to generate virtual samples to fill the information gaps of sparse data. The results of this research indicate that the prediction error rate can be significantly decreased by applying the proposed method to a very small data set.     

Chinese-based research on subject-covered information retrieval supervised by textual semantic domain

By means of analysis of artificial intervention in ready-retrieved text, training set used to compare with new texts from large-scale real texts corpus is provided. It is based on the data-originated presentation of training set that a special formula to calculate semantic cohesion between new texts and training set is devised. The semantic cohesion of new text is the average value of semantic evaluation of all elements involved, and semantic evaluation of an element depends on its semantic relevance with the training set and on the semantic ratio of its domain to synonymous domain. In terms of empirical verification a conclusion is drawn that semantic cohesion is the key measurement standard of textual retrieval. Despite the advantages of textual retrieval, limitations of formula-raised condition and analyst＇s accomplishments make the analysis involved in this paper imperfect.     

基于动态贝叶斯网络的社交圈归属匹配模型

为了帮助社交网中新成员寻找与之最为合适的社交圈,尝试采用动态贝叶斯网（DBN）理论解决社交网分析应用中成员（节点）与社交圈（集合）的匹配问题。将圈内成员个人的多项兴趣爱好程度作为描述社交圈基本属性的特征向量,对每一类圈子建立了带有辅助信息形式的DBN模型,求解最大输出概率即为最佳匹配对象。结果表明,在客观测试和主观评价两方面,该模型都收到了较为满意的结果。     

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.     

基于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.