检索结果-南通市图书馆

Key technology of mine underground mobile positioning based on LiDAR and coded sequence pattern

中国有色金属学会会刊：英文版 2011年第S3期21卷 570-576页

作者： WANG Zhi1, 2, WU Li-xin1, 2, LI Hui-ying3.1. college of Resources and Civil Engineering, Northeastern university, Shenyang 110004, china 2. Academy of Disaster Reduction and Emergency Management, Ministry of Civil Affairs and Ministry of Education, Beijing Normal university, Beijing 100875, china 3. college of computer science and technology, jilin university, changchun 130012, china [a] college of Resources and Civil Engineering Northeastern University Shenyang 110004 China [b] Academy of Disaster Reduction and Emergency Management Ministry of Civil Affairs and Ministry of Education Beijing Normal University Beijing 100875 China [c] college of computer science and {3. Jilin University Changchun 130012 China

Technologies of underground mobile positioning were proposed based on LiDAR data and coded sequence pattern landmarks for mine shafts and tunnels environment to meet the needs of fast and accurate positioning and navigation of equipments in the mine underground without satellite navigation signals. A coded sequence pattern was employed for automatic matching of 3. scans. The methods of SIFT feature, Otsu segmentation and fast hough transformation were described for the identification, positioning and interpretation of the coded sequence patterns, respectively. The POSIT model was presented for speeding up computation of the translation and rotation parameters of LiDAR point data, so as to achieve automatic 3. mapping of mine shafts and tunnels. The moving positioning experiment was applied to evaluating the accuracy of proposed pose estimation method from LiDAR scans and coded sequence pattern landmarks acquired in an indoor environment. The performance was evaluated using ground truth data of the indoor setting so as to measure derivations with six degrees of freedom.

关键词： LiDAR coded sequence pattern mobile positioning SLAM algorithm POSIT algorithm

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

A fast SVM training algorithm based on the set segmentation and k-means clustering

引用

Progress in Natural science:Materials International 2003年第10期 30-35页

作者： YANG Xiaowei 1,2 , LIN Daying 1, HAO Zhifeng 1, LIANG Yanchun 3.*, LIU Guirong 2 and HAN Xu 2(1. Department of Applied Mathematics, South china university of technology, Guangzhou 510640, china 2. Centre for ACES, Department of Mechanical Engineering, National university of Singapore, 119260, Singapore 3. college of computer science and technology, jilin university, changchun 130012, china) Department of Applied Mathematics，South china university of technology，Guangzhou 510640，{3. Centre for ACES，Department of Mechanical Engineering，National university of Singapore，119260，Singapore Department of Applied Mathematics，South china university of technology，Guangzhou 510640，{3. college of computer science and {3.，jilin university，changchun 130012，china Centre for ACES，Department of Mechanical Engineering，National university of Singapore，119260，Singapore

At present, studies on training algorithms for support vector machines (SVM) are important issues in the field of machine learning. It is a challenging task to improve the efficiency of the algorithm without reducing the generalization performance of SVM. To face this challenge, a new SVM training algorithm based on the set segmentation and k means clustering is presented in this paper. The new idea is to divide all the original training data into many subsets, followed by clustering each subset using k means clustering and finally train SVM using the new data set obtained from clustering centroids. Considering that the decomposition algorithm such as SVM light is one of the major methods for solving support vector machines, the SVM light is used in our experiments. Simulations on different types of problems show that the proposed method can solve efficiently not only large linear classification problems but also large nonlinear ones.

关键词： support vector machines set segmentation k means clustering.

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

An extended Lagrangian support vector machine for classifications

引用

Progress in Natural science:Materials International 2004年第6期 57-61页

作者： YANG Xiaowei 1,2 ,SHU Lei 1,HAO Zhifeng 1,LIANG Yanchun 3.*,LIU Guirong 2 and HAN Xu 2(1. Department of Applied Mathematics,South china university of technology,Guangzhou 510640,{3. 2. Centre for ACES,Department of Mechanical Engineering,National university of Singapore,119260,Singapore 3. college of computer science and technology,jilin university,changchun 130012,{3.) Department of Applied Mathematics，South china university of technology，Guangzhou 510640，{3. Centre for ACES，Department of Mechanical Engineering，National university of Singapore，119260，Singapore Department of Applied Mathematics，South china university of technology，Guangzhou 510640，{3. college of computer science and {3.，jilin university，changchun 130012，china Centre for ACES，Department of Mechanical Engineering，National university of Singapore，119260，Singapore

Lagrangian support vector machine (LSVM) cannot solve large problems for nonlinear kernel classifiers. In order to extend the LSVM to solve very large problems, an extended Lagrangian support vector machine (ELSVM) for classifications based on LSVM and SVM light is presented in this paper. Our idea for the ELSVM is to divide a large quadratic programming problem into a series of subproblems with small size and to solve them via LSVM. Since the LSVM can solve small and medium problems for nonlinear kernel classifiers,the proposed ELSVM can be used to handle large problems very efficiently. Numerical experiments on different types of problems are performed to demonstrate the high efficiency of the ELSVM.

关键词： quadratic programming support vector machine decomposition algorithm LSVM ELSVM.

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Kernel model-based diagnosis

引用

Progress in Natural science:Materials International 2002年第2期12卷 63-67页

作者： OUYANG Dantong(Department of computer science, jilin university,{3., china) jilin Univ Dept Comp Sci Changchun 130012 Peoples R China

The methods for computing the kernel consistency-based diagnoses and the kernel abductive diagnoses are only suited for the situation where part of the fault behavioral modes of the components are known. The characterization of the kernel model-based diagnosis based on the general causal theory is proposed, which can break through the limitation of the above methods when all behavioral modes of each component are known. Using this method, when observation subsets deduced logically are respectively assigned to the empty or the whole observation set, the kernel consistency-based diagnoses and the kernel abductive diagnoses can deal with all situations. The direct relationship between this diagnostic procedure and the prime implicants/implicates is proved, thus linking theoretical result with implementation.

关键词： model-based diagnosis general causal theory prime implicant/implicate diagnostic space.

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

A software cascading faults model

引用

science china(Information sciences) 2011年第11期54卷 2454-2458页

作者： LIU YanHeng 1,2,LIU XueLian 3.& WANG Jian 1,2 1 Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education,jilin university,changchun {3.,china 2 college of computer science and technology,jilin university,changchun {3.,china 3.college of Software,jilin university,changchun {3.,china 1. Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China2. College of Computer Science and Technology Jilin University Changchun 130012 China3. College of Software Jilin University Changchun 130012 China

Functions and call relations are extracted into nodes and edges,respectively,by which a novel topological model is *** directional edges and the corresponding weight values express the call relations and tightness *** introducing two concepts of function fault-tolerant capability and software fault intensity and by designing a allocation rule on fault-tolerant capability,a cascading fault model is built to explore fault propagation *** on practical software networks show that a weak fault intensity,a small number of initial faults,and a strong fault-tolerant capability can slow down the spreading *** functions with more call relations and more closer tightness contribute more to the stability of the whole system.

关键词： software fault tolerant cascading faults fault-tolerant capability fault intensity

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Modal extension rule

引用

Progress in Natural science:Materials International 2005年第6期15卷 550-558页

作者： WU Xia*, SUN Jigui, LIN Hai and FENG Shasha(college of computer science and {3., jilin university, changchun 130012, china Key Laboratory for Symbolic Computation and Knowledge Engineering, jilin university, changchun 130012, china) college of computer science and {3. Jilin University Changchun 130012 China Key Laboratory for Symbolic Computation and Knowledge Engineering Jilin University Changchun 130012 China

Modal logics are good candidates for a formal theory of agents. The efficiency of reasoning method in modal logics is very important, because it determines whether or not the reasoning method can be widely used in systems based on agent. In this paper, we modify the extension rule theorem proving method we presented before, and then apply it to P-logic that is translated from modal logic by functional transformation. At last, we give the proof of its soundness and completeness.

关键词： theorem proving extension rule modal logics functional transformation.

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

A method of combining SE-tree to compute all minimal hitting sets

引用

Progress in Natural science:Materials International 2006年第2期16卷 169-174页

作者： ZHAO Xiangfu and OUYANG Dantong (School of computer science and technology,{3., changchun 130012, china Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, changchun 130012, china) [a]School of computer science and technology Jilin University Changchun China

In model-based diagnosis, the candidate diagnostic results are generally characterized by all minimal hitting sets for the collection of all conflict sets. In this paper, a new method is proposed to judge a hitting set by the number of conflict sets corresponding to components, and the computing procedure is formalized by combining revised SE-tree (set enumeration tree) with closed nodes to generate all minimal hitting sets. Results show that because closed nodes are added into SE-tree, the search efficiency is highly improved. Furthermore, the proposed method is easy to be understood and implemented. Compared with other effective algorithms with completeness in some experimental tests, the diagnosis efficiency of our proposed method is higher, particularly for single- and double-fault diagnosis.

关键词： model-based diagnosis conflict set minimal hitting set set enumeration tree.

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Complete quantum circuit of Haar wavelet based MRA

引用

Chinese science Bulletin 2005年第16期50卷 1796-1798页

作者： HE Yuguo1,2 & SUN Jigui1,3.1. college of computer science and {3., jilin university, changchun 130012, china 2. Department of computer science and Engineering, Beijing Institute of {3., Beijing 100081, china 3. Key Laboratory of Computation and Knowledge Engineering of Min-istry of Education, jilin university, changchun 130012, china college of computer science and {3. Jilin University Changchun 130012 China

Wavelet analysis has applications in many ar- eas, such as signal analysis and image processing. We pro- pose a method for generating the complete circuit of Haar wavelet based MRA by factoring butterfly matrices and con- ditional perfect shuffle permutation matrices. The factoriza- tion of butterfly matrices is the essential part of the design. As a result, it is the key point to obtain the circuits of I 2t ⊕ W ⊕ I 2n ? 2t ?2. In this paper, we use a simple means to de- velop quantum circuits for this kind of matrices. Similarly, the conditional permutation matrix is implemented entirely, combined with the scheme of Fijany and Williams. The cir- cuits and the ideas adopted in the design are simple and in- telligible.

关键词：量子计算量子算法量子电路 Haar微波 MRA

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Canonical Huffman code based full-text index

引用

Progress in Natural science:Materials International 2008年第3期18卷 325-330页

作者： Yi Zhang a,b, Zhili Pei a, Jinhui Yanga, Yanchun Liang a, a college of computer science and {3., jilin university, Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education, changchun 130012, china b Department of computer science, jilin {3. and Business college, changchun 13.062, china college of computer science and {3. Jilin University Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Changchun 130012 China Department of computer science Jilin Technology and Business College Changchun 130062 China

Full-text indices are data structures that can be used to find any substring of a given string. Many full-text indices require space larger than the original string. In this paper, we introduce the canonical Huffman code to the wavelet tree of a string T[1. . .n]. Compared with Huffman code based wavelet tree, the memory space used to represent the shape of wavelet tree is not needed. In case of large alphabet, this part of memory is not negligible. The operations of wavelet tree are also simpler and more efficient due to the canonical Huffman code. Based on the resulting structure, the multi-key rank and select functions can be performed using at most nH0 + jRj(lglgn + lgn lgjRj)+O(nH0) bits and in O(H0) time for average cases, where H0 is the zeroth order empirical entropy of T. In the end, we present an efficient construction algorithm for this index, which is on-line and linear.

关键词： Full-text index Su?x automaton Canonical Hu?man code

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Using multi-matching system based on a simplified deformable model of the human iris for iris recognition

引用

Journal of Bionic Engineering 2004年第3期1卷 183-190页

作者： MING Xing , XU Tao , WANG Zheng-xuan 1 2 3.1. college of computer science and {3., Nanling Campus,jilin university, 5988 Renmin Street,changchun 13.022, P. R. china 2. college of Mechanical science and Engineering, Nanling Campus,jilin university, 5988 Renmin Street, changchun 13.022, P. R. china 3. college of computer science and technology, Qianwei Campus,jilin university, 10 Qianwei Road, changchun 130012, P. R. china. jilin university jilin university jilin university

A new method for iris recognition using a multi-matching system based on a simplified deformable model of the human iris was proposed. The method defined iris feature points and formed the feature space based on a wavelet transform. In the matching stage it worked in a crude manner. Driven by a simplified deformable iris model, the crude matching was refined. By means of such multi-matching system, the task of iris recognition was accomplished. This process can preserve the elastic deformation between an input iris image and a template and improve precision for iris recognition. The experimental results indicate the va- lidity of this method.

关键词： iris recognition wavelet transform feature points deformable model

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：