1787368
Subdivision Tree Representation of Arbitrary Triangle Meshes
We investigate a new way to represent arbitrary triangle meshes. We prove that a large class of triangle meshes, called normal triangle meshes, can be represented by a subdivision tree, where each subdivision is one of four elementary subdivision types. We also show how to partition an arbitrary triangle mesh into a small set of normal meshes. The subdivision tree representation can be used to encode mesh connectivity information. Our theoretical analysis shows that such a coding scheme is very promising.
42837717
Lossless Subdivision-Based Multiresolution Representation of Arbitrary Triangle Meshes Using Kite Trees
We introduce a new type of subdivision-based multiresolution representation for triangle meshes, kite trees, which has the flexibility to represent arbitrary triangle meshes losslessly. We also develop an algorithm for extracting a balanced kite tree representation of an arbitrary input mesh that preserves mesh topology and regularities in the subdivision structure. Our scheme allows us to combine surface information automatically extracted from input data with algorithmically-generated information in a single multiresolution representation and to represent the results of adaptive refinement of regular subdivision surfaces.
35303230
The termination criterion for subdivision of the rational Bézier curves
By using some elementary inequalities, authors in this paper makes further improvement for estimating the heights of Bézier curve and rational Bézier curve. And the termination criterion for subdivision of the rational Bézier curve is also improved. The conclusion of the extreme value problem is thus further confirmed.
38303932
Fuzzy inference based on fuzzy concept lattice
In this paper, a fuzzy inference method based on the notion of fuzzy concept lattice is studied. We first propose a new form of fuzzy concept lattice, and then based on three kinds of known fuzzy concept lattices and our new fuzzy concept lattice, two coherent fuzzy inference methods, the lower approximate fuzzy inference and the upper approximate fuzzy inference, are proposed, and the combined use of the two methods will make the fuzzy inference more precise.
14513289
Mining Console Logs for Large-Scale System Problem Detection
The console logs generated by an application contain messages that the application developers believed would be useful in debugging or monitoring the application. Despite the ubiquity and large size of these logs, they are rarely exploited in a systematic way for monitoring and debugging because they are not readily machine-parsable. In this paper, we propose a novel method for mining this rich source of information. First, we combine log parsing and text mining with source code analysis to extract structure from the console logs. Second, we extract features from the structured information in order to detect anomalous patterns in the logs using Principal Component Analysis (PCA). Finally, we use a decision tree to distill the results of PCA-based anomaly detection to a format readily understandable by domain experts (e.g. system operators) who need not be familiar with the anomaly detection algorithms. As a case study, we distill over one million lines of console logs from the Hadoop file system to a simple decision tree that a domain expert can readily understand; the process requires no operator intervention and we detect a large portion of runtime anomalies that are commonly overlooked.
644571
Parametric inference for progressive Type-I hybrid censored data on a simple step-stress accelerated life test model
This paper considers a simple step-stress accelerated life test model under progressive Type-I hybrid censoring scheme. The progressive Type-I hybrid censoring scheme and statistical method in synthetic accelerated stresses are provided so as to decrease the lifetime and reduce the test cost. An exponentially distributed life of test units and a cumulative exposure model are assumed. The maximum likelihood estimates of the model parameters are obtained using a pivotal quantity. Two useful lemmas and a theorem are given to construct the approximate confidence intervals for the model parameters. Finally, simulation results are provided to assess the method of inference developed in this article. The simulation results show that the method does improve for large sample size.
13125864
Bifurcations of limit cycles for a perturbed quintic Hamiltonian system with four infinite singular points
By using the theory of bifurcations of dynamical systems and the method of detection function to investigate the bifurcation of limit cycles of a perturbed quintic Hamiltonian system with 25 finite singular points and four infinite singular points. From the detection functions for the perturbed system, we prove that under different determined parameter condition, the given system has at least 22 and 20 limit cycles and the configurations of compound eyes are also obtained.