Automatic 3D model reconstruction of cutting tools from a single camera

Collision detection by machining simulation requires the 3D models of rotating cutters. However, the 3D models of a cutter and holder are not always available. In this paper, a new method is proposed to design an automatic vision-based 3D modeling system, which is able to quickly reconstruct the 3D model of a cutter and holder when they are installed onto the spindle. Only a single camera is mounted on the machine tool to capture the image of the rotating cutter and holder. By viewing the rotating cutter and holder as an object of surface of revolution, the contour of the imaged cutter and holder can be used to reconstruct the 3D model as a stack of circular cross-sections. Then the complete generating function of the cutter and holder can be recovered from the cross-sections. Finally, the 3D model of the cutter is built by rotating the generating function around the spindle axis. The effectiveness and accuracy of the proposed method are verified by experiments on-machine using 12 kinds of cutters and holders, which can satisfy the requirement of collision detection.     

On the complexity of deciding avoidability of sets of partial words

Blanchet-Sadri et al. have shown that Avoidability, or the problem of deciding the avoidability of a finite set of partial words over an alphabet of size k≥2, is NP-hard [F. Blanchet-Sadri, R. Jungers, J. Palumbo, Testing avoidability on sets of partial words is hard, Theoret. Comput. Sci. 410 (2009) 968-972]. Building on their work, we analyze in this paper the complexity of natural variations on the problem. While some of them are NP-hard, others are shown to be efficiently decidable. Using some combinatorial properties of de Bruijn graphs, we establish a correspondence between lengths of cycles in such graphs and periods of avoiding words, resulting in a tight bound for periods of avoiding words. We also prove that Avoidability can be solved in polynomial space, and reduces in polynomial time to the problem of deciding the avoidability of a finite set of partial words of equal length over the binary alphabet. We give a polynomial bound on the period of an infinite avoiding word, in the case of sets of full words, in terms of two parameters: the length and the number of words in the set. We give a polynomial space algorithm to decide if a finite set of partial words is avoided by a non-ultimately periodic infinite word. The same algorithm also decides if the number of words of length n avoiding a given finite set of partial words grows polynomially or exponentially with n.     

Finding an Euclidean anti--centrum location of a set of points

An obnoxious facility is to be located inside a polygonal region of the plane, maximizing the sum of the k smallest weighted Euclidean distances to n given points, each protected by some polygonal forbidden region. For the unweighted case and k fixed an O(n²logn) time algorithm is presented. For the weighted case a thorough study of the relevant structure of the multiplicatively weighted order-k-Voronoi diagram leads to the design of an O(kn³+n³logn) time algorithm for finding an optimal solution to the anti-t-centrum problem for every t=1,…,k, simultaneously.     

安全访问控制的XML关键字检索

XML(extensive makeup language)的关键字检索简单易用,用户不必了解数据库的模式,受到人们的广泛关注。当前的相关研究主要集中于关键字检索的算法以及返回结果的组织和排序,却忽视了其中的安全性问题。结合XML关键字搜索和XML安全控制,研究了基于安全访问控制的XML关键字检索技术。在XML关键字的最小最低公共祖先(smallest lowest common ancestors,SLCA)和基于视图的安全访问控制规则的基础上,确定基于安全访问控制规则的XML关键字检索结果;建立基于安全视图的关键字索引,以及在此基础上的关键字检索算法。实验表明,为了满足安全访问控制规则,该算法虽然需要额外的时间开销但总体上是高效的。     

基于兴趣视图子集的流立方体计算方法

流立方体计算是流式数据多维分析的重要基础,然而流式数据的动态性、无限性、突发性等特征使其面临巨大的挑战.在实际应用中,用户的兴趣通常集中在部分视图上,基于这个特点提出了一种基于兴趣视图子集的计算方法,依据用户历史查询信息确定兴趣视图子集与兴趣路径,同时定义了Stream-Tree结构用于在主存中物化存储兴趣视图子集所包含的数据单元,在运行过程中依据多层次时间窗口约束不断更新和维护Stream-Tree中存储的数据单元,而对于稀疏数据单元仅保留高层次的聚集值.实验和分析表明,该方法能够在有限的主存空间中维持流立方体当前窗口内的数据单元,同时能够支持快速更新维护存储结构和响应用户查询.     

基于聚类方法的空间度量物化选择算法

在空间数据仓库中,由于物化视图中空间度量的聚集结果需要占用较大的存储空间,因此只能选择部分空间度量进行物化.而现有的物化视图选择算法大部分只是针对视图选择设计的,没有考虑视图中度量的选择.为此,针对空间度量的区域合并操作,提出基于聚类方法的空间度量物化选择算法.把可合并的空间对象组进行聚类,在每个聚类中计算合并组的收益...     

Global existence and nonexistence for degenerate parabolic equations with nonlinear boundary flux

In this paper, by constructing various kinds of sub- and super-solutions and using the basic properties of M-matrix, we give the necessary and sufficient conditions of global existence for nonnegative solutions to a degenerate parabolic system with completely coupled boundary conditions, which generalize the recent results of, for instance, Cui [Z. Cui, Critical curves of the non-Newtonian polytropic filtration equations coupled with nonlinear boundary conditions, Nonlinear Anal. 68 (2008) 3201–3208], Zhou–Mu [J. Zhou, C. Mu, Algebraic criteria for global existence or blow-up for a boundary coupled system of nonlinear diffusion equations, Appl. Anal. 86 (2007) 1185–1197] etc.     

On global solutions to fractional functional differential equations with infinite delay in Fréchet spaces

In this paper, we investigate global uniqueness results for fractional functional differential equations with infinite delay in Fréchet spaces. We shall rely on a nonlinear alternative of Leray-Schauder type in Fréchet spaces due to Frigon and Granas. The results are obtained by using the α-resolvent family (S_α(t))_t≥0 on a complex Banach space X combined with the above-mentioned fixed point theorem. As an application, a controllability result with one parameter is also provided to illustrate the theory.     

On a new class of analytic functions associated with conic domain

The aim of this paper is to generalize the conic domain defined by Kanas and Wisniowska, and define the class of functions which map the open unit disk E onto this generalized conic domain. A brief comparison between these conic domains is the main motivation of this paper. A correction is made in selecting the range interval of order of conic domain.