Calibration of parallel kinematics machine using generalized distance error model

This paper focus on the accuracy enhancement of parallel kinematics machine through kinematics calibration. In the calibration processing, well-structured identification Jacobian matrix construction and end-effector position and orientation measurement are two main difficulties. In this paper, the identification Jacobian matrix is constructed easily by numerical calculation utilizing the unit virtual velocity method. The generalized distance errors model is presented for avoiding measuring the position and orientation directly which is difficult to be measured. At last, a measurement tool is given for acquiring the data points in the calibration processing. Experimental studies confirmed the effectiveness of method. It is also shown in the paper that the proposed approach can be applied to other typed parallel manipulators.

Diagnostics in generalized nonlinear models based on maximum L_q-likelihood estimation

In order to detect whether the data conforms to the given model, it is necessary to diagnose the data in the statistical way. The diagnostic problem in generalized nonlinear models based on the maximum Lq-likelihood estimation is considered. Three diagnostic statistics are used to detect whether the outliers exist in the data set. Simulation results show that when the sample size is small, the values of diagnostic statistics based on the maximum Lq-likelihood estimation are greater than the values based on the maximum likelihood estimation. As the sample size increases, the difference between the values of the diagnostic statistics based on two estimation methods diminishes gradually. It means that the outliers can be distinguished easier through the maximum Lq-likelihood method than those through the maximum likelihood estimation method.

Distance domination of generalized de Bruijn and Kautz digraphs

Let G= （V,A） be adigraph and k ≥ 1 an integer. For u,v ∈ V, we say that the vertex u distance k-dominate v if the distance from u to v at most k. A set D of vertices in G is a distance k-dominating set if each vertex of V ／ D is distance k-dominated by some vertex of D. The distance k-domination number of G, denoted by γk（G）, is the minimum cardinality of a distance k-dominating set of G. Generalized de Bruijn digraphs GB（n, d） and generalized Kautz digraphs Gg（n, d） are good candidates for interconnection k networks. Denote △k ：=（∑j^k=0 d^j）^-1. F. Tian and J. Xu showed that [n△k] ≤ γk（GB（n,d）） ≤ [n/d^k] and [n△k] ≤ γk（GK（n,d）） ≤ [n/d^k]. In this paper, we prove that every generalized de Bruijn digraph GB（n, d） has the distance k- domination number [n△k] or [n△k] ＋ 1, and the distance k-domination number of every generalized Kautz digraph GK（n, d） bounded above by [n/ （d^k-1 ＋d^k）]. Additionally, we present various sufficient conditions for γk（GB（n, d）） = [n△k] and γk（GK（n, d）） = [n△k].

Numerical investigation on broadband mid-infrared supercontinuum generation in chalcogenide suspended-core fibers

As2S3 and As2Se3 chalcogenide 3-bridges suspended-core fibers（SCFs） are designed with shifted zero-dispersion wavelengths（ZDWs） at around 1.5 μm, 2 μm, and 2.8 μm, respectively. A generalized nonlinear Schrodinger equation is used to numerically compare supercontinuum（SC） generation in these SCFs pumped at an anomalous dispersion region nearby their ZDWs. Evolutions of the long-wavelength edge（LWE）, the power proportion in the long-wavelength region（PPL）, and spectral flatness（SF） are calculated and analyzed. Meanwhile, the optimal pump parameters and fiber length are given with LWE, PPL, and SF taken into account. For As2S3 SCFs, SC from a 14 mm-long fiber with a ZDW of 2825 nm pumped at 2870 nm can achieve the longest LWE of - 13 μm and PPL up to ～72%. For As2Se3 SCFs, the LWE of 15.5 μm and the highest PPL of ～ 87% can be achieved in a 10 mm-long fiber with ZDW of 1982 nm pumped at 2000 nm. Although the As2Se3 SCFs can achieve much longer LWE than the As2S3 SCFs, the core diameter of As2Se3 SCFs will be much smaller to obtain a similar ZDW, leading to lower damage threshold and output power. Finally, the optimal parameters for generating SC spanning over different mid-IR windows are given.

2D registration based on contour matching for partial matching images

The mean Hausdorff distance, though highly applicable in image registration, does not work well on partial matching images. An improvement upon traditional Hausdorff-distance-based image registration method is proposed, which consists of the following two aspects. One is to estimate transformation parameters between two images from the distributions of geometric property differences instead of establishing explicit feature correspondences. This procedure is treated as the pre-registration. The other aspect is that mean Hausdorff distance computation is replaced with the analysis of the second difference of generalized Hausdorff distance so as to eliminate the redundant points. Experimental results show that our registration method outperforms the method based on mean Hausdorff distance. The registration errors are noticeably reduced in the partial matching images.

Generalized Minimum Rank Distance of Variable-Rate Linear Network Error Correction Codes

By extending the notion of the minimum distance for linear network error correction code(LNEC), this paper introduces the concept of generalized minimum rank distance(GMRD) of variable-rate linear network error correction codes. The basic properties of GMRD are investigated. It is proved that GMRD can characterize the error correction/detection capability of variable-rate linear network error correction codes when the source transmits the messages at several different rates.