39145518
Boundary Constrained Manifold Unfolding
15959526
Cut-and-Paste Editing over 3D Meshes
A novel direct cut-and-paste editing method over 3D triangular meshes is proposed in this paper. The source feature mesh is transferred to the position where it is to be pasted through the corresponding planes. The planes are created using the least squares approximation. To decrease the distortion of pasting region, the local mesh representation is used, and the pasted region is reconstructed in the least squares sense. Then, the boundary vertices of the source feature mesh are connected with the target mesh. This method is applicable to source geometry features with non-zero genus. It can be performed at interactive rates and produces less distortion and natural results
7650649
Fully Automatic Text Categorization by Exploiting WordNet
This paper proposes a Fully Automatic Categorization approach for Text (FACT) by exploiting the semantic features from WordNet and document clustering. In FACT, the training data is constructed automatically by using the knowledge of the category name. With the support of WordNet, it first uses the category name to generate a set of features for the corresponding category. Then, a set of documents is labeled according to such features. To reduce the possible bias originating from the category name and generated features, document clustering is used to refine the quality of initial labeling. The training data are subsequently constructed to train the discriminative classifier. The empirical experiments show that the best performance of FACT can achieve more than 90% of the baseline SVM classifiers in F1 measure, which demonstrates the effectiveness of the proposed approach.
1737886
An Effective Approach for Hiding Sensitive Knowledge in Data Publishing
Recent efforts have been made to address the problem of privacy preservation in data publishing. However, they mainly focus on preserving data privacy. In this paper, we address another aspect of privacy preservation in data publishing, where some of the knowledge implied by a dataset are regarded as private or sensitive information. In particular, we consider that the data are stored in a transaction database, and the knowledge is represented in the form of patterns. We present a data sanitization algorithm, called SanDB, for effectively protecting a set of sensitive patterns, meanwhile attempting to minimize the impact of data sanitization on the non-sensitive patterns. The experimental results show that SanDB can achieve significant improvement over the best approach presented in the literature.
9654945
Discovering unexpected information from your competitors' web sites
Ever since the beginning of the Web, finding useful information from the Web has been an important problem. Existing approaches include keyword-based search, wrapper-based information extraction, Web query and user preferences. These approaches essentially find information that matches the user's explicit specifications. This paper argues that this is insufficient. There is another type of information that is also of great interest, i.e., unexpected information, which is unanticipated by the user. Finding unexpected information is useful in many applications. For example, it is useful for a company to find unexpected information bout its competitors, e.g., unexpected services and products that its competitors offer. With this information, the company can learn from its competitors and/or design counter measures to improve its competitiveness. Since the number of pages of a typical commercial site is very large and there are also many relevant sites (competitors), it is very difficult for a human user to view each page to discover the unexpected information. Automated assistance is needed. In this paper, we propose a number of methods to help the user find various types of unexpected information from his/her competitors' Web sites. Experiment results show that these techniques are very useful in practice and also efficient.
45821814
Positive solutions of a nonlinear four-point boundary value problems
In this paper, by using the Krasnoselskii's theorem in a cone, we study the existence of at least one or two positive solutions to the four-point boundary value problemy^''(t)+a(t)f(y(t))=0,00. As an application, we also give some examples to demonstrate our results.
19080227
Positive solutions of a nonlinear three-point boundary value problem
In this paper, by using Krasnoselskii's fixed point theorem in a cone, we study the existence of single and multiple positive solutions to the three-point boundary value problem (BVP)y''(t)+a(t)f(y(t))=0,0