Group path covering and distance two labeling of graphs

For a positive integer d, an L(d,1)-labeling f of a graph G is an assignment of integers to the vertices of G such that |f(u)−f(v)|?d if uv∈E(G), and |f(u)−f(v)|?1 if u and u are at distance two. The span of an L(d,1)-labeling f of a graph is the absolute difference between the maximum and minimum integers used by f. The L(d,1)-labeling number of G, denoted by λd,1(G), is the minimum span over all L(d,1)-labelings of G. An L^′(d,1)-labeling of a graph G is an L(d,1)-labeling of G which assigns different labels to different vertices. Denote by the L^′(d,1)-labeling number of G. Georges et al. [Discrete Math. 135 (1994) 103-111] established relationship between the L(2,1)-labeling number of a graph G and the path covering number of Gc, the complement of G. In this paper we first generalize the concept of the path covering of a graph to the t-group path covering. Then we establish the relationship between the L^′(d,1)-labeling number of a graph G and the (d−1)-group path covering number of Gc. Using this result, we prove that and for bipartite graphs G can be computed in polynomial time.     

Integrating airborne multispectral imagery and airborne LiDAR data for enhanced lithological mapping in vegetated terrain

Practical and financial constraints associated with traditional field-based lithological mapping are often responsible for the generation of maps with insufficient detail and inaccurately located contacts. In arid areas with well exposed rocks and soils, high-resolution multi- and hyperspectral imagery is a valuable mapping aid as lithological units can be readily discriminated and mapped by automatically matching image pixel spectra to a set of reference spectra. However, the use of spectral imagery in all but the most barren terrain is problematic because just small amounts of vegetation cover can obscure or mask the spectra of underlying geological substrates. The use of ancillary information may help to improve lithological discrimination, especially where geobotanical relationships are absent or where distinct lithologies exhibit inherent spectral similarity. This study assesses the efficacy of airborne multispectral imagery for detailed lithological mapping in a vegetated section of the Troodos ophiolite (Cyprus), and investigates whether the mapping performance can be enhanced through the integration of LiDAR-derived topographic data. In each case, a number of algorithms involving different combinations of input variables and classification routine were employed to maximise the mapping performance. Despite the potential problems posed by vegetation cover, geobotanical associations aided the generation of a lithological map - with a satisfactory overall accuracy of 65.5% and Kappa of 0.54 - using only spectral information. Moreover, owing to the correlation between topography and lithology in the study area, the integration of LiDAR-derived topographic variables led to significant improvements of up to 22.5% in the overall mapping accuracy compared to spectral-only approaches. The improvements were found to be considerably greater for algorithms involving classification with an artificial neural network (the Kohonen Self-Organizing Map) than the parametric Maximum Likelihood Classifier. The results of this study demonstrate the enhanced capability of data integration for detailed lithological mapping in areas where spectral discrimination is complicated by the presence of vegetation or inherent spectral similarities.     

Necessary optimality conditions for fuzzy variational problems

The main aims of this study are to derive the fuzzy Euler-Lagrange conditions for both fuzzy unconstrained and constrained variational problems based on the concepts of differentiability and integrability of a fuzzy mapping that may be parameterized by the left and right-hand functions of its α-level sets.     

Strong stability of the mono-tubular heat exchanger equation with output feedback

We investigate asymptotic behavior of the C₀-semigroup T(t) associated with the mono-tubular heat exchanger equation with output feedback by a perturbation method. It is shown that T(t) is bounded if a constraint is satisfied by the parameters and the spatial distribution function. Further, applying the Arendt-Batty-Lyubich-Vu theorem, a criterion is established to judge strong stability of T(t).     

Similarity-based image organization and browsing using multi-resolution self-organizing map

An algorithm is presented in this paper to facilitate the exploration of large image collections based on visual similarities. Starting with an unordered and unannotated set of images, the algorithm first extracts the salient details into feature vectors using both color and gradient information. The feature vectors are then used to train a self-organizing map which maps high-dimensional feature vectors onto a 2D canvas so that images with similar feature vectors are grouped together. When users browse the image collection, an image collage is generated that selects and displays the most pertinent set of images based on which portion of the 2D canvas is currently in view. Flowing from an overview to details is a seamless operation controlled simply by pan and zoom, with representative images selected in a consistent and predictable way. To make organizing larger image collections practical in interactive time, the organization algorithm is designed to run in parallel on graphics processing units. Overall this paper presents an end-to-end solution that facilitates the surfing of image collections in a fresh way.     

浅谈RSA数字签名技术在综合船桥系统中的应用

随着Internet的快速发展,网络在综合船桥系统中得到了广泛的应用。在享受网络带来的便利的同时,它的各种弊端也日益显露,如网上数据传输的完整性等问题。为了很好地解决这一问题,将RSA数字签名和数字摘要应用于综合船桥系统中。在保证数据安全传输的同时,很好地验证了数据的完整性,同时完成了发送方的身份验证。     

用VB开发Duffing方程混沌动力学系统仿真软件

基于Lisual Basic6.0编制了杜芬（Duffing)方程混沌特性分析的仿真软件,利用该软件不仅可方便地显示该系统在相空间上的轨迹线图,而且可绘制时程曲线图、幅频图和庞加菜（Poincare)截面图等。软件操作简便,运行可靠。     

An Artificial Neural Network Classifier Design Based-on Variable Kernel and Non-Parametric Density Estimation

This paper proposes a probabilistic variant of the SOM-kMER (Self Organising Map-kernel-based Maximum Entropy learning Rule) model for data classification. The classifier, known as pSOM-kMER (probabilistic SOM-kMER), is able to operate in a probabilistic environment and to implement the principles of statistical decision theory in undertaking classification problems. A distinctive feature of pSOM-kMER is its ability in revealing the underlying structure of data. In addition, the Receptive Field (RF) regions generated can be used for variable kernel and non-parametric density estimation. Empirical evaluation using benchmark datasets shows that pSOM-kMER is able to achieve good performance as compared with those from a number of machine learning systems. The applicability of the proposed model as a useful data classifier is also demonstrated with a real-world medical data classification problem.     

基于实体模型的三维真实感流动模拟软件的研究与开发

注射成型的流动模拟在预测复杂薄壁型腔的流动行为方面已经比较准确。现行的数值方法主要采用基于中性层的有限元／有限差分／控制体积法,但中性层模型的引入使得模拟软件在应用中具有极大的局限性。本文采用实体模型取代中性层模型,开发了三维真实感流动模拟软件。最后,应用实例证明此模型能够处理由流行CAD系统生成的复杂型腔模型。     

On the Efficient Evaluation of Coalescence Integrals in Population Balance Models

The solution of population balance equations is a function f(t,r,x) describing a population density of particles of the property x at time t and space r. For instance, the additional independent variable x may denote the particle size. The describing partial differential equation contains additional sink and source terms involving integral operators. Since the coordinate x adds at least one further dimension to the spatial directions and time coordinate, an efficient numerical treatment of the integral terms is crucial. One of the more involved integral terms appearing in population balance models is the coalescence integral, which is of the form ∫ ₀ ^x κ(x–y, y) f(y) f(x–y)dy. In this paper, we describe an evaluation method of this integral which needs only operations, where n is the number of degrees of freedom with respect to the variable x. This cost can also be obtained in the case of a grid geometrically refined towards x=0.