Pattern Recognition With Weighted Complex Networks

In this paper we introduce a weighted complex networks model to investigate and recognize structures of patterns. The regular treating in pattern recognition models is to describe each pattern as a high-dimensional vector which however is insufficient to express the structural information. Thus, a number of methods are developed to extract the structural information, such as different feature extraction algorithms used in pre-processing steps, or the local receptive fields in convolutional networks. In our model, each pattern is attributed to a weighted complex network, whose topology represents the structure of that pattern. Based upon the training samples, we get several prototypal complex networks which could stand for the general structural characteristics of patterns in different categories. We use these prototypal networks to recognize the unknown patterns. It is an attempt to use complex networks in pattern recognition, and our result shows the potential for real-world pattern recognition. A spatial parameter is introduced to get the optimal recognition accuracy, and it remains constant insensitive to the amount of training samples. We have discussed the interesting properties of the prototypal networks. An approximate linear relation is found between the strength and color of vertexes, in which we could compare the structural difference between each category. We have visualized these prototypal networks to show that their topology indeed represents the common characteristics of patterns. We have also shown that the asymmetric strength distribution in these prototypal networks brings high robustness for recognition. Our study may cast a light on understanding the mechanism of the biologic neuronal systems in object recognition as well.

Complex networks constructed from irrational number sequences

In this paper, we construct (d, r) networks from sequences of different irrational numbers. In detail, segment an irrational number sequence of length M into groups of d digits which represent the nodes while two consecutive groups overlap by r digits (r = 0,1,...,d-1), and the undirected edges indicate the adjacency between two consecutive groups. (3, r) and (4, r) networks are respectively constructed from 14 different irrational numbers and their topological properties are examined. By observation, we find that network topologies change with different values of d, r and even sequence length M instead of the types of irrational numbers, although they share some similar features with traditional random graphs. We make a further investigation to explain these interesting phenomena and propose the identical-degree random graph model. The results presented in this paper provide some insight into distributions of irrational number digits that may help better understanding of the nature of irrational numbers.

A spatial sampling optimization package using MSN theory

The density and distribution of spatial samples heavily affect the precision and reliability of estimated population attributes. An optimization method based on Mean of Surface with Nonhomogeneity (MSN) theory has been developed into a computer package with the purpose of improving accuracy in the global estimation of some spatial properties, given a spatial sample distributed over a heterogeneous surface; and in return, for a given variance of estimation, the program can export both the optimal number of sample units needed and their appropriate distribution within a specified research area. (C) 2010 Elsevier Ltd. All rights reserved.

Zebrafish peptidoglycan recognition protein SC (zfPGRP-SC) mediates multiple intracellular signaling pathways

Insect PGRPs can function as bacterial recognition molecules triggering proteolytic and/or signal transduction pathways, with the resultant production of antimicrobial peptides. To explore if zebrafish peptidoglycan recognition protein SC (zfPGRP-SC) has such effects, RNA interference (siRNA) and high-density oligonucleotide microarray analysis were used to identify differentially expressed genes regulated by zfPGRP-SC. The mRNA levels for a set of genes involved in Toll-like receptor signaling pathway, such as TLRs, SARM, MyD88, TRAF6 and nuclear factor (NF)-kappa B2 (p100/p52), were examined by quantitative RT-PCR (QT-PCR). The results from the arrays and QT-PCR showed that the expression of 133 genes was involved in signal transduction pathways, which included Toll-like receptor signaling, Wnt signaling, BMP signaling, insulin receptor signaling, TGF-beta signaling, GPCR signaling, small GTPase signaling, second-messenger-mediated signaling, MAPK signaling, JAK/STAT signaling, apoptosis and anti-apoptosis signaling and other signaling cascades. These signaling pathways may connect with each other to form a complex network to regulate not just immune responses but also other processes such as development and apoptosis. When transiently over-expressed in HEK293T cells, zfPGRP-SC inhibited NF-kappa B activity with and without lipopolysacharide (LPS) stimulation. (C) 2008 Elsevier Ltd. All rights reserved.

The costs and benefits in an unusual symbiosis: experimental evidence that bitterling fish (Rhodeus sericeus) are parasites of unionid mussels in Europe

Interspecific symbiotic relationships involve a complex network of interactions, and understanding their outcome requires quantification of the costs and benefits to both partners. We experimentally investigated the costs and benefits in the relationship between European bitterling fish (Rhodeus sericeus) and freshwater mussels that are used by R. sericeus for oviposition. This relationship has hitherto been thought mutualistic, on the premise that R. sericeus use mussels as foster parents of their embryos while mussels use R. sericeus as hosts for their larvae. We demonstrate that R. sericeus is a parasite of European mussels, because it (i) avoids the cost of infection by mussel larvae and (ii) imposes a direct cost on mussels. Our experiments also indicate a potential coevolutionary arms race between bitterling fishes and their mussel hosts; the outcome of this relationship may differ between Asia, the centre of distribution of bitterling fishes, and Europe where they have recently invaded.

Effects of inoculated Microcoleus vaginatus on the structure and function of biological soil crusts of desert

Microcoleus vaginatus Gom., the dominant species in biological soil crusts (BSCs) in desert regions, plays a significant role in maintaining the BSC structure and function. The BSC quality is commonly assessed by the chlorophyll a content, thickness, and compressive strength. Here, we have studied the effect of different proportions of M. vaginatus, collected from the Gurbantunggut Desert in northwestern China, on the BSC structure and function under laboratory conditions. We found that when M. vaginatus was absent in the BSC, the BSC coverage, quantified by the percentage of BSC area to total land surface area, was low with a chlorophyll a content of 4.77 x 10(-2) mg g(-1) dry soil, a thickness of 0.86 mm, and a compressive strength of 12.21 Pa. By increasing the percentage of M. vaginatus in the BSC, the BSC coverage, chlorophyll a content, crust thickness, and compressive strength all significantly increased (P < 0.01). The maximum chlorophyll a content (13.12 mg g(-1)dry soil), the highest crust thickness, and the compressive strength (1.48 mm and 36.60 Pa, respectively) occurred when the percentage of inoculated M. vaginatus reached 80% with a complex network of filaments under scanning electron microscope. The BSC quality indicated by the above variables, however, declined when the BSC was composed of pure M. vaginatus (monoculture). In addition, we found that secretion of filaments and polymer, which stick sands together in the BSC, increased remarkably with the increase of the dominant species until the percentage of M. vaginatus reached 80%. Our results suggest that not only the dominant species but also the accompanying taxa are critical for maintaining the structure and functions of the BSC and thus the stability of the BSC ecosystems.

基于粗糙集-BP神经网络的发动机故障诊断

由于发动机光谱分析监控数据中磨损微粒种类过多,如果将这些微粒信息直接作为神经网络的输入,则存在输入层神经元过多、网络结构复杂等诸多问题。本文将粗糙集引入到发动机故障诊断中来,利用粗糙集在属性约简方面的优势,删除冗余磨损微粒,提取出重要磨损微粒,并将其作为BP神经网络的输入,建立发动机故障诊断模型。该方法降低输入层的神经元个数,简化了网络结构,缩短网络训练时间,并且由于剔除了冗余磨损微粒,减少了由该部分微粒信息不准确而带来的误差,有效提高了故障诊断的精确度。最后通过算例分析验证了相关算法和诊断模型的准确性和有效性。

Path Planner for Intelligent Laser Surface Modification

An optimal algorithm of manufacturing path planner for intelligent laser surface modification is presented. Elements included in the optimal objective have been analyzed. A 6-D manufacture trace that satisfies the requirements of special craft and 5-axis laser processing robot system has been generated from the path planner by method of parallel section in which combinations of modification spots size with curvature of processing surfaces and modification craft parameters are considered. Related experiments have been successfully carried out with the computer integrated multifunctional laser manufacturing system.

A shortest path algorithm for moving objects in spatial network databases

One of the most important kinds of queries in Spatial Network Databases (SNDB) to support location-based services (LBS) is the shortest path query. Given an object in a network, e.g. a location of a car on a road network, and a set of objects of interests, e.g. hotels,gas station, and car, the shortest path query returns the shortest path from the query object to interested objects. The studies of shortest path query have two kinds of ways, online processing and preprocessing. The studies of preprocessing suppose that the interest objects are static. This paper proposes a shortest path algorithm with a set of index structures to support the situation of moving objects. This algorithm can transform a dynamic problem to a static problem. In this paper we focus on road networks. However, our algorithms do not use any domain specific information, and therefore can be applied to any network. This algorithm’s complexity is O(klog2 i), and traditional Dijkstra’s complexity is O((i + k)2).

a shortest path algorithm for moving objects in spatial network databases

中国计算机学会

Theoretical and experimental research on time-optimal trajectory planning and control of industrial robots

提出了一种用于工业机器人时间最优轨迹规划及轨迹控制的新方法，它可以确保在关节位移、速度、加速度以及二阶加速度边界值的约束下，机器人手部沿笛卡尔空间中规定路径运动的时间阳短。在这种方法中，所规划的关节轨迹都采用二次多项式加余弦函数的形式，不仅可以保证各关节运动的位移、速度 、加速度连续而且还可以保证各关节运动的二阶加速度连续。采用这种方法，既可以提高机器人的工作效率又可以延长机器人的工作寿命以PUMA560机器人为对象进行了计算机仿真和机器人实验，结果表明这种方法是正确的有效的。它为工业机器人在非线性运动学约束条件下的时间最优轨迹规划及控制问题提供了一种较好的解决方案。

Direct dynamical test for deterministic chaos and optimal embedding of a chaotic time-series

We propose here a local exponential divergence plot which is capable of providing an alternative means of characterizing a complex time series. The suggested plot defines a time-dependent exponent and a ''plus'' exponent. Based on their changes with the embedding dimension and delay time, a criterion for estimating simultaneously the minimal acceptable embedding dimension, the proper delay time, and the largest Lyapunov exponent has been obtained. When redefining the time-dependent exponent LAMBDA(k) curves on a series of shells, we have found that whether a linear envelope to the LAMBDA(k) curves exists can serve as a direct dynamical method of distinguishing chaos from noise.

Satellite Constellation Design for Complex Coverage

Most traditional satellite constellation design methods are associated with a simple zonal or global, continuous or discontinuous coverage connected with a visibility of points on the Earth's surface. A new geometric approach for more complex coverage of a geographic region is proposed. Full and partial coverage of regions is considered. It implies that, at any time, the region is completely or partially within the instantaneous access area of a satellite of the constellation. The key idea of the method is a two-dimensional space application for maps of the satellite constellation and coverage requirements. The space dimensions are right ascension of ascending node and argument of latitude. Visibility requirements of each region can be presented as a polygon and satellite constellation as a uniform moving grid. At any time, at least one grid vertex must belong to the polygon. The optimal configuration of the satellite constellation corresponds to the maximum sparse grid. The method is suitable for continuous and discontinuous coverage. In the last case, a vertex belonging to the polygon should be examined with a revisit time. Examples of continuous coverage for a space communication network and of the United States are considered. Examples of discontinuous coverage are also presented.

The Main Path to C, N, O Elements in Big Bang Nucleosynthesis

The production of C, N, O elements in a standard big bang nucleosynthesis scenario is investigated. Using the up-to-date data of nuclear reactions in BBN, in particular the Li-8 (n, gamma) Li-9 which has been measured in China Institute of Atomic Energy, a full nucleosynthesis network calculation of BBN is carried out. Our calculation results show that the abundance of C-12 is increased for an order of magnitude after addition of the reaction chain Li-8(n, gamma) Li-9(alpha, n) B-12(beta) C-12, which was neglected in previous studies. We find that this sequence provides the main channel to convert the light elements into C, N, O in standard BBN.

移动机器人路径规划方法研究

针对室内动态非结构化环境下的移动机器人路径规划问题,提出了一种能够将全局路径规划方法和局部路径规划方法相结合、将基于反应的行为规划和基于慎思的行为规划相结合的路径规划方法.全局路径规划器采用A*算法生成到达目标点的子目标节点序列;局部路径规划器采用改进的人工势场方法对子目标节点序列中相邻两节点进行路径平滑和优化处理.在考虑了移动机器人运动学约束的前提下,该方法不但能够充分利用已知环境信息生成全局最优路径,而且还能及时处理所遇到的随机障碍信息.仿真研究与在室内复杂环境下的实际运行结果验证了该方法的有效性.