检索结果-内蒙古大学图书馆

2006 2nd International Conference on Semantics Knowledge and Grid, SKG

作者： Ronghui, Wu Renfa, Li Fei, Yu Guangxue, Yue Cheng, Xu School of Computer and Communication Hunan University Changsha410082 China State Key Laboratory of Information Security Graduate School Chinese Academy of Sciences Beijing 100049 China Provincial Key Laboratory of Computer Information Processing Technology Jiangsu Province Suzhou University Suzhou 150063 China College of Informationg Engineering JiaXing University JiaXing 314000 China

ISBN: (纸本)0769532055

Recently, Authentication protocol has been recognized as an important factor for grid computing security. This paper described a new simple and efficient Grid authentication system providing user anonymity. Our system is based on hash function, and mobile users only do symmetric encryption and decryption. In our system, it takes only one round of messages exchange between the mobile user and the visited network, and one round of message exchange between the visited network and the corresponding home network. The proposed architecture possesses several desirable emerging properties that enable it to provide an improved level of security for grid computing systems.. © 2006 IEEE.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

Research on user authentication for grid computing security

Research on user authentication for grid computing security

引用

2nd International Conference on Semantics, Knowledge, and Grid, SKG 2006

作者： Wu, Ronghui Li, Renfa Yu, Fei Yue, Guangxue Xu, Cheng School of Computer and Communication Hunan University Changsha 410082 China State Key Laboratory of Information Security Graduate School Chinese Academy of Sciences Beijing 100049 China Provincial Key Laboratory of Computer Information Processing Technology Jiangsu Province Suzhou University Suzhou 150063 China College of Informationg Engineering JiaXing University JiaXing 314000 China

ISBN: (纸本)076952673X

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

An online semantic tree for link detection

引用

Journal of Convergence information technology 2012年第5期7卷 147-157页

作者： He, Ruifang Hong, Yu Information System and Software Engineering Lab School of Computer Science and Technology Tianjin University Tianjin 15001 China Jiangsu Provincial Key Laboratory of Computer Information Processing Technology School of Computer Science and Technology Soochow University Suzhou 215006 China

Link Detection (abbr. LDT) is to determine whether two stories discuss the same topic in Topic Detection and Tracking (abbr. TDT) track. The key issue is to correctly measure the relevance between two stories. Most researches on LDT use a series of independent words to describe stories (each story is a text specially discussing news), and the relevance between two stories is determined based on the percentage and weight of overlapping words between them. Although substantial improvement has been achieved, inadequate descriptions of word sense and semantics still have negative influences on the accuracy of LDT. In this paper we propose an online semantic tree, which is hierarchically constructed by the most relevant words extracted from previous story streams. In online semantic tree, word sense is described by a series of words in a sense closed-loop, and semantic relation among words is measured by depth and width of level that words locate in. In LDT, online semantic tree is built for each story, and the relevance between two stories is determined by measuring the KL divergence between their online semantic trees. The method performs quite well on TDT4 corpus. The Min Norm CDet of the method in testing is 0.2274 lower than that of the baseline.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Inverse Depth Line Model of LiDAR Data for Traversable Region Segmentation 4

Inverse Depth Line Model of LiDAR Data for Traversable Regio...

引用

4th International Conference on Electronic information technology and computer Engineering, EITCE 2020

作者： Liu, Zhen Ren, Mingwu Jin, Zhong School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing Jiangsu China Key Lab. of Intelligent Percept. and Syst. for High-Dimensional Information of Ministry of Education Nanjing University of Science and Technology Nanjing Jiangsu China

ISBN: (纸本)9781450387811

In this paper, we propose an Inverse Depth Line (IDL) model of LiDAR data for traversable region segmentation. This model first organizes the disordered point cloud with a 2D structure array to store and index the point cloud. Then, IDL is deduced based on the scanning model of LiDAR. With the help of IDL, the road plane is represented as a straight line in 2D space. Based on IDL, an inverse depth segmentation (IDS) algorithm is proposed to classify obstacles. The inverse depth of positive obstacles and negative obstacles are projected above and below IDL respectively. IDS greatly simplifies and accelerates the obstacle segmentation. We conduct experiments on both structured and unstructured environments. Experiments show that the proposed method is robust and gets promising results in road and obstacle detection. The method implements real-Time segmentation of traversable regions and obstacles. The average processing time for each frame is just 14 ms. © 2020 ACM.

关键词： Inverse problems

来源：评论

学校读者我要写书评

暂无评论

Solving traveling salesman problem by ant colony optimization algorithm with association rule

引用

Journal of information and Computational Science 2007年第3期4卷 1011-1016页

作者： Gao, Shang Xia, Xiaoyan Zhang, Lei Zhuang, Fengting School of Electronics and Information Jiangsu University of Science and Technology Zhenjiang 212003 China Provincial Key Laboratory of Computer Information Processing Technology Soochow University Suzhou 215006 China

The traveling salesman problem (TSP) is among the most important combinatorial problems. Ant colony optimization (ACO) algorithm is a recently developed algorithm which has been successfully applied to several NP-hard problems, such as traveling salesman problem, quadratic assignment problem and job-shop problem. Association rule (AR) is the key in knowledge in data mining for finding the best data sequence. A new algorithm which integrates ACO and AR is proposed to solve TSP problems. Compare with the simulated annealing algorithm, the standard genetic algorithm and the standard ant colony algorithm, the new algorithm is better than ACO.

关键词： Traveling salesman problem

来源：评论

学校读者我要写书评

暂无评论

A brief analysis about boundary region partition reduction standard

A brief analysis about boundary region partition reduction s...

引用

2007 Workshop on Intelligent information technology Application, IITA 2007

作者： Du, Weifeng Yue, Guangxue Cheng, Xu School of Information Engineering Jiaxing University Jiaxing 314001 China School of Computer and Communication Hunan University Changsha 410000 China Provincial Key Lab. of Image Processing and Imagecom Communication Nanjing University of Pos and Telecommunications Nanjing 210003 China

ISBN: (纸本)076953063X

In his paper, Prof. Ye Dongyi pointed out that the reduction approach introduced by Hu Xiaohua etc. will give wrong result in some situation. In this paper we come to a conclusion by analysis that the reduction approach is to keep boundary region partition unchangeable virtually. It is just different from the reduction approach given by Ye Dongyi. Then, we analyze the logic characteristic of boundary region partition reduction standard. © 2007 IEEE.

关键词： data reduction formal logic rough set theory boundary region partition reduction standard logic characteristics Rough set theory Formal logic data reduction boundary regions

来源：评论

学校读者我要写书评

暂无评论

Image retrieval based on bit-plane distribution feature

Image retrieval based on bit-plane distribution feature

引用

6th International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2009

作者： Shan, Zhao Jing, Lui School of Computer Science and Technology Henan Polytechnic University Jiaozuo 454003 China Jiangsu Prov. Key Lab. on Image Processing and Image Communication Nanjing University of Posts and Communication Nanjing 210003 China

ISBN: (纸本)9780769537351

Based on the analysis of color histogram for image retrieval, a new descriptor, bit-plane distribution feature(BPDF), is proposed in this paper. The image is firstly divided into eight bit-planes. Meantime, the Gray code of bit-planes is used to avoid the effect of changes in the intensity values on bit-planes. Then, according to the distribution of each bit-plane, a feature vector is constructed by the first four significant planes which contain most of the structural information of the image. Finally, the Mahalanobis distance is adopted to measure the similarity because of the correlation between the concerned vectors after designing a correlation-weighted matrix. Comparisons are conducted between BPDF and other descriptors. Experimental results show that the proposed method provides more significantly retrieval results than the traditional ones. © 2009 IEEE.

关键词： Image retrieval

来源：评论

学校读者我要写书评

暂无评论

3D Representation of Chinese Event Factuality

3D Representation of Chinese Event Factuality

引用

第十五届汉语词汇语义学国际研讨会

作者： CAO Yuan ZHU Qiaoming LI Peifeng School of Computer Science and Technology of Soochow University Key Lab of Computer Information Processing Technology of Jiangsu Province

In general,Chinese event factuality is determined by the specific vocabularies and syntactic structures of *** Chinese event factuality corpus is to annotate these specific vocabularies and syntactic *** these information is raw and complex,it will result in high computation complexity and low correct rate if we use these information to compute factuality *** paper proposes a 3D representation of Chinese event factuality based on the annotated factual information in a Chinese event factuality *** also presents the transformation rules between the factual information and 3D representation and those between the 3D representation and event *** experimental results demonstrate the effectiveness of our 3D representation.

关键词： Representation of Chinese Event Factuality

来源：评论

学校读者我要写书评

暂无评论

Research on improved coding and decoding algorithm for fountain codes

Research on improved coding and decoding algorithm for fount...

引用

International Conference on Wireless Communications and Signal processing (WCSP)

作者： Zhifeng Zhu Liulei Zhou Jia Hou School of Electronics and Information Engineering Soochow University Jiangsu China Provincial Key Laboratory for Computer Information Processing Technology Soochow University Jiangsu China

ISBN: (纸本)9781479973408

Fountain code is a class of graph-based linear erasure codes, which can effectively solve the problems such as network congestion and feedback cracking for its characteristics of rateless and can resume when interrupted, and has a lower complexity of encoding and decoding. However, there are still some problems in the process of encoding and decoding, including the degree distribution structure may be destroyed, parameters of the generating matrix are not fixed, and it cannot recover source datas from the remaining encoded packets with no degree one. So, the basic theory of fountain codes from three aspects are introduced in this paper, i.e., degree distribution, encoding and decoding principles. Therefore the improved algorithms according to the above three aspects are presented. Simulation results show that the proposed algorithm is more efficient than the previous one.

关键词： Decoding Encoding Algorithm design and analysis Solitons Robustness Vectors Signal processing algorithms

来源：评论

学校读者我要写书评

暂无评论

Advances in Data and Web Management 1

引用

丛书名： Lecture Notes in computer Science

1000年

作者： Qing Li Ling Feng Jian Pei Sean X. Wang Xiaofang Zhou Qiao-Ming Zhu

ISBN: (数字)9783642006722

ISBN: (纸本)9783642006715

This book constitutes the proceedings of the joint International Conference APWeb/WAIM 2009 which was held in Suzhou, China, during April 1-4, 2009. The 42 full papers presented together with 26 short papers and the abstracts of 2 keynote speeches were carefully reviewed and selected for inclusion in the book. The topics covered are query processing, topic-based techniques, Web data processing, multidimensional data analysis, stream data processing, data mining and its applications, and data management support to advanced applications.

关键词： computer Communication Networks Data Mining and Knowledge Discovery information Systems Applications (incl. Internet) information Storage and Retrieval Pattern Recognition information Systems and Communication Service

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：