Geometry Theorem Proving by Decomposing Polynomial System into Strong Regular Sets

This paper presents a complete method to prove geometric theorem by decomposing the corresponding polynomial system. into strong regular sets, by which one can compute some components for which the geometry theorem is true and exclude other components for which the geometry theorem is false. Two examples are given to show that the geometry theorems are conditionally true for some components which are excluded by other methods.

Three-dimensional inversion of knot defects recognition in timber cutting

The comprehensive utilization of wood is the main goal of log cutting,but knot defects increase the diffi-culty of rationally optimizing cutting.Due to the lack of real shape data of knot defects in logs,it is diffi cult for detection methods to establish a correlation between signal and defect morphology.An image-processing method is proposed for knot inversion based on distance regularized level set segmentation(DRLSE)and spatial vertex clustering,and with the inversion of the defects existing relative board position in the log,an inversion model of the knot defect is established.First,the defect edges of the top and bottom images of the boards are extracted by DRLSE and ellipse fi tting,and the major axes of the ellipses made coplanar by angle correction;second,the coordinate points of the top and bottom ellipse edges are extracted to form a spatial straight line;third,to solve the intersection dispersion of spatial straight lines and the major axis plane,K-medoids clustering is used to locate the vertex.Finally,with the vertex and the large ellipse,a 3D cone model is constructed which can be used to invert the shape of knots in the board.The experiment was conducted on ten defective larch boards,and the experimental results showed that this method can accurately invert the shapes of defects in solid wood boards with the advantages of low cost and easy operation.

Liver Segmentation in CT Images Based on DRLSE Model

Liver segmentation in CT images is an important step for liver volumetry and vascular evaluation in liver pre-surgical planning. In this paper, a segmentation method based on distance regularized level set evolution(DRLSE) model was proposed, which incorporated a distance regularization term into the conventional Chan-Vese (C-V) model. In addition, the region growing method was utilized to generate the initial liver mask for each slice, which could decrease the computation time for level-set propagation. The experimental results show that the method can dramatically decrease the evolving time and keep the accuracy of segmentation. The new method is averagely 15 times faster than the method based on conventional C-V model in segmenting a slice.

U-Concordant Semigroups

We introduce the relations Lu and Ru with respect to a subset U of idempotents. Based on Lv and Rv, we define a new class of semigroups which we name U-concordant semigroups. Our purpose is to describe U-concordant semigroups by generalized categories over a regular biordered set. We show that the category of U-concordant semigroups and admissible morphisms is isomorphic to the category of RBS generalized categories and pseudo functors. Our approach is inspired from Armstrong＇s work on the connection between regular biordered sets and concordant semigroups. The significant difference in strategy is by using RBS generalized categories equipped with pre-orders, we have no need to discuss the quotient of a category factored by a congruence.

A Triangular Decomposition Algorithm for Differential Polynomial Systems with Elementary Computation Complexity

In this paper, a new triangular decomposition algorithm is proposed for ordinary differential polynomial systems, which has triple exponential computational complexity. The key idea is to eliminate one algebraic variable from a set of polynomials in one step using the theory of multivariate resultant. This seems to be the first differential triangular decomposition algorithm with elementary computation complexity.