用点形图描述运动链的结构

阐述了顶点的邻接线及闭合形的邻接角等新概念 ,论述了用点形图及转置图描述运动链拓扑结构、距离尺度结构和相对位形尺度结构的方法。本研究表明

描述运动链结构的点形图

首次提出了点形图和转置图的新概念和新理论 ,给出了它们的几何图形描述和矩阵描述 ,阐述了顶点及闭合形的关联度、邻接度等一系列新概念 ,论述了转置图的性质、功能和特点 ,提出并证明了关于点形图的九个基本定理及其两个推论。点形图不仅具有严密性、方便性和实用性 ,而且具有普遍性 ,它是传统图的发展与延伸。

GRAPH GRAMMAR METHOD FOR 3-D CORNER DETECTION

Most of local feature descriptors assume that the scene is planar. In the real scene, the captured images come from the 3-D world. 3-D corner as a novel invariant feature is important for the image matching and the object detection, while automatically discriminating 3-D corners from ordinary corners is difficult. A novel method for 3-D corner detection is proposed based on the image graph grammar, and it can detect the 3-D features of corners to some extent. Experimental results show that the method is valid and the 3-D corner is useful for image matching.

Glacier Fluctuations between 1975 and 2008 in the Greater Himalaya Range of Zanskar,Southern Ladakh

Glaciers in the Himalaya are often heavily covered with supraglacial debris,making them difficult to study with remotely-sensed imagery alone.Various methods such as band ratios can be used effectively to map clean-ice glaciers;however,a thicker layer of debris often makes it impossible to distinguish between supraglacial debris and the surrounding terrain.Previously,a morphometric mapping approach employing an ASTER-derived digital elevation model has been used to map glaciers in the Khumbu Himal and the Tien Shan.This study on glaciers in the Greater Himalaya Range in Zanskar,southern Ladakh,aims (i) to use the morphometric approach to map large debris-covered glaciers;and (ii) to use Landsat and ASTER data and GPS and field measurements to document glacier change over the past four decades.Field work was carried out in the summers of 2008.For clean ice,band ratios from the ASTER dataset were used to distinguish glacial features.For debris-covered glaciers,topographic features such as slope were combined with thermal imagery and supervised classifiers to map glacial margins.The method is promising for large glaciers,although problems occurred in the distal and lateral parts and in the fore field of the glaciers.A multi-temporal analysis of glaciers in Zanskar showed that in general they have receded since at least the mid-to late-1970s.However,some few glaciers that advanced or oscillated - probably because of specific local environmental conditions - do exist.

Improving vertex-frontier based GPU breadth-first search

Breadth-first search(BFS) is an important kernel for graph traversal and has been used by many graph processing applications. Extensive studies have been devoted in boosting the performance of BFS. As the most effective solution, GPU-acceleration achieves the state-of-the-art result of 3.3×109 traversed edges per second on a NVIDIA Tesla C2050 GPU. A novel vertex frontier based GPU BFS algorithm is proposed, and its main features are three-fold. Firstly, to obtain a better workload balance for irregular graphs, a virtual-queue task decomposition and mapping strategy is introduced for vertex frontier expanding. Secondly, a global deduplicate detection scheme is proposed to remove reduplicative vertices from vertex frontier effectively. Finally, a GPU-based bottom-up BFS approach is employed to process large frontier. The experimental results demonstrate that the algorithm can achieve 10% improvement over the state-of-the-art method on diverse graphs. Especially, it exhibits 2-3 times speedup on low-diameter and scale-free graphs over the state-of-the-art on a NVIDIA Tesla K20 c GPU, reaching a peak traversal rate of 11.2×109 edges/s.

Full Graph Methods of Switched Current Circuit Solution

Circuits with switched current are described by an admittance matrix and seeking current transfers then means calculating the ratio of algebraic supplements of this matrix. As there are also graph methods of circuit analysis in addition to algebraic methods, it is clearly possible in theory to carry out an analysis of the whole switched circuit in two-phase switching exclusively by the graph method as well. For this purpose it is possible to plot a Mason graph of a circuit, use transformation graphs to reduce Mason graphs for all the four phases of switching, and then plot a summary graph from the transformed graphs obtained this way. First the author draws nodes and possible branches, obtained by transformation graphs for transfers of EE （even-even） and OO （odd-odd） phases. In the next step, branches obtained by transformation graphs for EO and OE phase are drawn between these nodes, while their resulting transfer is 1 multiplied by z^1/2. This summary graph is extended by two branches from input node and to output node, the extended graph can then be interpreted by the Mason＇s relation to provide transparent current transfers. Therefore it is not necessary to compose a sum admittance matrix and to express this consequently in numbers, and so it is possible to reach the final result in a graphical way.

On Graphlike Manifolds with Contraction

ＯｎＧｒａｐｈｌｉｋｅＭａｎｉｆｏｌｄｓｗｉｔｈＣｏｎｔｒａｃｔｉｏｎＹｕａｎＦｕｙｏｎｇ（袁夫永）（ＵｎｉｖｅｒｓｉｔｙｏｆｓｔａｆｆａｎｄＷｏｒｋｅｒｓｏｆＡｇｒｉｃｕｌｔｕｒｅＲｅｃｌａｍａｔｉｏｎ）ＬｉｕＹａｘｉｎｇ（刘亚星）（Ｄｅｐａｒｔ...

GRADIENT OF REFERENCE DIFFERENCE BASED MATCHING ALGORITHM FOR IMAGE FEATURE POINT

During matching on feature point, gray correlation matching technology is utilized to extract multi-peaks as a coarse matching set. A pair of given corresponding reference points within the left and right images is used to calculate gradients of reference difference between the reference points and each feature point within the multi-peaks set. The unique correspondence is determined by criterion of minimal gradients of reference difference. The obtained correspondence is taken as a new pair of reference points to update the reference points continuously until all feature points in the left (or right) image being matched with the right (or left) image. The gradients of reference difference can be calculated easily by means of pre-setting a pair of obvious feature points in the left and right images as a pair of corresponding reference points. Besides, the efficiency of matching can be improved greatly by taking the obtained matching point as a new pair of reference points, and by updating the reference point continuously. It is proved that the proposed algorithm is valid and reliable by 3D reconstruction on two pairs of actual natural images with abundant and weak texture, respectively.

Positioning of grid points in wave front construction

In view of the relative positioning problem between non-regular quadrilateral grids and regular rectangle grid nodes in the wave front construction method, concrete realization problems with four grid positioning methods （vector cross product judgment, angle sum, intersection-point, and signs comparison algorithms） in wave front construction which are commonly used in computer graphics are compared and analyzed in this paper. Based on the stability analysis of the location method, the calculation examples show that the vector cross product judgment method is faster and more accurate than other methods in the realization of the relative positioning between non-regular quadrilateral grids and regular rectangle grid nodes in wave front construction. It provides precise grid point attribute values for the next steps of migration and demigration.

Graph-based single-copy routing in delay tolerant networks

This paper presents a new graph-based single-copy routmg method m delay tolerant networks （DTN）. With time goes on in the networks, a DTN connectivity graph is constituted with mobility of nodes and communication, and a corresponding greedy tree is obtained using a greedy algorithm in DTN connectivity graph. While there are some bad nodes such as disabled nodes or selfish nodes in delay tolerant networks, the nodes can choose the next p^oper intermediate node to transmit the mes- sage by comparing the location of neighboring nodes in the greedy tree. The single-copy routing method is very appropriate for energy-constrained, storage-constrained and bandwidth-constrained applications such as mobile wireless DTN networks. We show that delivery ratio is increased significantly by using the graph-based single-copy routing when bad nodes exist.

An Interactive Point-Picking Method by Combining 2D and 3D Views of a Slice Geometry

Interactive picking is a fundamental task for processing and images. Combining two-dimensional （2D） and three-dimensional digital graphics （3D） views is an important trend in processing medical sliced-geometries. With the goal of accurately picking points in sliced-geometries, we present a method to pick points interactively by combining 2D and 3D views of sliced-geometries. Four view windows are constructed to render sliced-geometries using medical imaging interaction toolkit （MITK）： three for 2D slices parallel to the XY, YZ, and XZ planes and one for surface rendering. Points picked in a view window can be rendered and modified in any window. After a point is picked, it is immediately converted into a world coordinate and stored. Points are only rendered and modified based on their world coordinates. This picking method can be used for fitting, observing, and measuring local regions. This method can also be used for interactive segments. Our experiment shows that the picking method is accurate and has a real-time picking effect.

On nodal prime Fano threefolds of degree 10

We study the geometry and the period map of nodal complex prime Fano threefolds with index 1 and degree 10.We show that these threefolds are birationally isomorphic to Verra threefolds,i.e.,hypersurfaces of bidegree (2,2) in P2 × P2.Using Verra's results on the period map for these threefolds and on the Prym map for double tale covers of plane sextic curves,we prove that the fiber of the period map for our nodal threefolds is the union of two disjoint surfaces,for which we give several descriptions.This result is the analog in the nodal case of a result of Debarre O,Iliev A,Manivel L (arXiv:0812.3670) in the smooth case.

High precision landing site mapping and rover localization for Chang'e-3 mission

This paper presents the comprehensive results of landing site topographic mapping and rover localization in Chang’e-3 mission.High-precision topographic products of the landing site with extremely high resolutions(up to 0.05 m)were generated from descent images and registered to CE-2 DOM.Local DEM and DOM with 0.02 m resolution were produced routinely at each waypoint along the rover traverse.The lander location was determined to be(19.51256°W,44.11884°N,-2615.451 m)using a method of DOM matching.In order to reduce error accumulation caused by wheel slippage and IMU drift in dead reckoning,cross-site visual localization and DOM matching localization methods were developed to localize the rover at waypoints;the overall traveled distance from the lander is 114.8 m from cross-site visual localization and 111.2 m from DOM matching localization.The latter is of highest accuracy and has been verified using a LRO NAC image where the rover trajeactory is directly identifiable.During CE-3 mission operations,landing site mapping and rover localization products including DEMs and DOMs,traverse maps,vertical traverse profiles were generated timely to support teleoperation tasks such as obstacle avoidance and rover path planning.

The Het R-binding site that activates expression of pat A in vegetative cells is required for normal heterocyst patterning in Anabaena sp. PCC 7120

Upon nitrogen step-down, Anabaena sp. PCC 7120 produces semi-regularly spaced heterocysts along filaments. HetR, the master regulator of heterocyst differenti- ation, has been shown to up-regulate hetP and hetZ in differentiating heterocysts via specific recognition sites. HetR is also predicted to bind to the promoter of patA, a gene required for heterocyst formation at intercalary positions. Here, we show that HetR binds to the predicted site 5′ from patA. Moreover, （1） deletion of the HetR-binding site greatly diminished the expression ofpatA in vegetative cells as shown with gfp, and （2） complementation of a patA mutant by a replicating plasmid that bears patA is largely prevented by removal of that binding site. In contrast, HetR- binding sites suppressed the expression of alr0202 （a homolog of hetZ） specifically in heterocysts and of alr3234 （a homolog of hetP） in whole filaments. Our results indicate that HetR can regulate gene expression in different modes.

VERTEX-DISJOINT QUADRILATERALS IN BIPARTITE GRAPHS

H. Wang considered the minimum degrees condition that G has largevertex-disjoint cycles in bipartite graphs. Motivated by this, we consider the small vertex-disjointcycles in bipartite graphs in this paper. We prove the following result: Let m ≥ 3, n ≥ 2 and k≥ 1 be three integers. Let G = (V_1,V_2;E) be a bipartite graph with |V_1| = |V_2| = n ≥ 2k+1.

Parametric curve with an implicit domain

In this paper we present a new representation of curve, named parametric curve with an implicit domain(PCID), which is a curve that exists in parametric form defined on an implicit domain. PCID provides a bridge between parametric curve and implicit curve because the conversion of parametric form or implicit form to PCID is very convenient and efficient. We propose a framework model for mapping given points to the implicit curve in a homeomorphic manner. The resulting map is continuous and does not overlap. This framework can be used for many applications such as compatible triangulation, image deformation and fisheye views. We also present some examples and experimental results to demonstrate the effectiveness of the framework of our proposed model.

Cubature Formula for Spherical Basis Function Networks

Some mathematical models in geophysics and graphic processing need to compute integrals with scattered data on the sphere.Thus cubature formula plays an important role in computing these spherical integrals.This paper is devoted to establishing an exact positive cubature formula for spherical basis function networks.The authors give an existence proof of the exact positive cubature formula for spherical basis function networks,and prove that the cubature points needed in the cubature formula are not larger than the number of the scattered data.