Parametric circles and spheres

Formulations for parametric circles and spheres in terms of rational Gaussian (RaG) curves and surfaces are introduced. With the proposed formulations, a full circle is generated by interpolating a closed RaG curve to the vertices of an equilateral triangle, and a full sphere is generated by interpolating a closed RaG surface to the vertices of an octahedron with equilateral triangular faces. Generation of circles and spheres in this manner is very intuitive and easy to remember as the weights are all 1 and the nodes are all unique and uniformly spaced.     

基于Matlab语言的液压特性曲线的绘制

Matlab语言强大的运算、仿真能力，被广泛用在液压控制系统中。利用Matlab语言可以进行液压特性曲线的绘制，液压控制系统稳定性的检测，也可以进行液压控制系统的仿真。这里以两个实例，即单、双喷嘴挡板阀压力流量特性曲线的绘制，以及液压转矩放大器系统稳定性的检测，来说明它的强大的功能。     

非线性地基上桩结构物空间分析

本文提出了桩结构物－非线性地基空间相互作用分析的迭代法和非线性有限元法。其中，桩基分析用ｐ－ｙ曲线法。结合实际结构物进行了大量的计算及比较分析，成果是令人满意的，可以付诸应用。     

On principal component analysis, cosine and Euclidean measures in information retrieval

Clustering groups document objects represented as vectors. An extensive vector space may cause obstacles to applying these methods. Therefore, the vector space was reduced with principal component analysis (PCA). The conventional cosine measure is not the only choice with PCA, which involves the mean-correction of data. Since mean-correction changes the location of the origin, the angles between the document vectors also change. To avoid this, we used a connection between the cosine measure and the Euclidean distance in association with PCA, and grounded searching on the latter. We applied the single and complete linkage and Ward clustering to Finnish documents utilizing their relevance assessment as a new feature. After the normalization of the data PCA was run and relevant documents were clustered.     

3D model retrieval using principal plane analysis and dynamic programming

Three dimensional models play an important role in many applications; the problem is how to select the appropriate models from a 3D database rapidly and accurately. In recent years, a variety of shape representations, statistical methods, and geometric algorithms have been proposed for matching 3D shapes or models. In this paper, we propose a 3D shape representation scheme based on a combination of principal plane analysis and dynamic programming. The proposed 3D shape representation scheme consists of three steps. First, a 3D model is transformed into a 2D image by projecting the vertices of the model onto its principal plane. Second, the convex hall of the 2D shape of the model is further segmented into multiple disjoint triangles using dynamic programming. Finally, for each triangle, a projection score histogram and moments are extracted as the feature vectors for similarity searching. Experimental results showed the robustness of the proposed scheme, which resists translation, rotation, scaling, noise, and destructive attacks. The proposed 3D model retrieval method performs fairly well in retrieving models having similar characteristics from a database of 3D models.     

Expressing the equivalence of non‐isothermal and isothermal heat sterilization processes

Currently, the sterility of heat‐processed food and pharmaceuticals is assessed in terms of an F₀ value, based on the equivalence of the heat treatment to an isothermal process at a reference temperature. This F₀ value, however, has a meaning if, and only if, the inactivation kinetics of the targeted spores (or cells) follow a first‐order relationship and the temperature dependence of the D value, the reciprocal of the rate constant, is log‐linear. There is growing evidence that these conditions are not satisfied by many spores, including those of Clostridium botulinum and vegetative cells. Consequently, a replacement for the F₀ value is proposed in the form of a momentary equivalent time at the reference temperature based on the actual survival pattern of the spores, which need not be log‐linear. This equivalent time can be calculated together with the theoretical survival ratio in real time, thus enabling an operator to monitor the lethality of ongoing industrial heat processes. The concept is demonstrated with published survival data of C. botulinum, for which the Weibullian and log‐logistic models served as primary and secondary models, respectively. The safety factor according to the proposed method is in the number of added minutes of processing, beyond the theoretical time needed to reduce the survival ratio of the targeted spores or cells to a level that would produce practical (or commercial) sterility. Copyright © 2006 Society of Chemical Industry     

Isometric Piecewise Polynomial Curves

The main preoccupations of research in computer-aided geometric design have been on shape-specification techniques for polynomial curves and surfaces, and on the continuity between segments or patches. When modelling with such techniques, curves and surfaces can be compressed or expanded arbitrarily. There has been relatively little work on interacting with direct spatial properties of curves and surfaces, such as their arc length or surface area. As a first step, we derive families of parametric piecewise polynomial curves that satisfy various positional and tangential constraints together with arc-length constraints. We call these curves isometric curves. A space curve is defined as a sequence of polynomial curve segments, each of which is defined by the familiar Hermite or Bézier constraints for cubic polynomials; as well, each segment is constrained to have a specified arc length. We demonstrate that this class of curves is attractive and stable. We also describe the numerical techniques used that are sufficient for achieving real time interaction with these curves on low-end workstations.     

基于遥感案例推理的海岸带养殖信息提取

目前基于目视解释或光谱分类的养殖信息提取效率低,难以克服由于地物混杂带来的“椒盐”噪声现象且难以融合地学知识。针对养殖信息提取中存在的问题,首先在分析现有养殖信息提取方法和案例推理CBR(Case\|Based Reasoning)用于遥感图像处理的基础上,提出基于遥感案例推理的海岸带养殖信息提取的研究思路;其次,结合养殖区域的空间特征和属性特征,构建案例的表达模型以及CBR相似性推理模型;最后,对不属于案例构建区的粤西沙田镇进行养殖信息提取的CBR实验,精度达到84.56%。对比CBR方法和传统监督分类方法可知,CBR方法是实现海岸带养殖信息快速准确提取的一种有效手段。     

Group codes on certain algebraic curves with many rational points

We construct a series of algebraic geometric codes using a class of curves which have many rational points. We obtain codes of lengthq ² over _q , whereq = 2q ₀ ² andq ₀ = 2 ⁿ , such that dimension + minimal distance q ² + 1 – q ₀ (q – 1). The codes are ideals in the group algebra _q [S], whereS is a Sylow-2-subgroup of orderq ² of the Suzuki-group of orderq ² (q ² + 1)(q – 1). The curves used for construction have in relation to their genera the maximal number of GF _q -rational points. This maximal number is determined by the explicit formulas of Weil and is effectively smaller than the Hasse—Weil bound.Supported by Deutsche Forschungsgemeinschaft while visiting Essen University