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

International Conference on Mechatronics and Automation

作者： Tang, Guoliang Cai, Zhongmin Pu, Jiexin Huang, Xin-Han School of Information Technology Henan University of Traditional Chinese Medicine Zhengzhou China Department of Computer Application Henan Business College Zhengzhou China Institute of Electric Information Engineering University of Henan Science and Technology Luoyang China Department of Control Science and Engineering Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9781424451418

A daytime and nighttime color image fusion method based on IHS transform and Multi-Wavelet transform is presented. The method can automatically merge images of a scene captured under different illumination and can be used for practical purposes. Specifically, the fused image can give more information of the context of night-time traffic videos, which makes them easier to be understood. The context is automatically captured by a camera in a fixed-position during daytime and then is fused into a nighttime image of the same scene. The advantages of this method are that it preserves the important local perceptual cues and it can avoid the problems with traditional methods such as aliasing, ghosting and haloing. © 2010 IEEE.

关键词： Color

来源：评论

学校读者我要写书评

暂无评论

Entity answer extraction of web table

Entity answer extraction of web table

引用

2010 7th International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2010

作者： Xu, Yangbo Yu, Zhengtao Mao, Cunli Wang, Yasheng Guo, Jianyi School of Information Engineering and Automation Kunming University of Science and Technology Kunming 650051 China Institute of Intelligent Information Processing Computer Technology Application Key Laboratory of Yunnan Province Kunming 650051 China

ISBN: (纸本)9781424459346

This paper presents an entity answer extraction method based on list web table. Firstly, extract table from page using the features of web page table and label, segment the table that includes the potential entity answers by calculating the relevance of web table's title and query context, merge the table elements of each column according to table properties, and merge the web table's title with the merged elements of column again. Secondly, using merged passage as context of entity recognition, and recognize the entity for each element of the table, thus get the probability of the column elements belongs to the same type of entity answer, and locate the passages of entity answers and the entity answers. Finally, we conduct the experiment in the task of Entity Track of TREC2009. It turns out that the proposed method shows a very good result, the accuracy of entity answer extraction for web table has achieved 99.08%. ©2010 IEEE.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

Self-adapting semantic sensitivities for Semantic Similarity based Crossover

Self-adapting semantic sensitivities for Semantic Similarity...

引用

2010 6th IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010

作者： Uy, Nguyen Quang McKay, Bob O'Neill, Michael Hoai, Nguyen Xuan Natural Computing Research and Application Group University College Dublin Ireland School of Computer Science and Engineering Seoul National University Korea Republic of School of Information Technology Hanoi University Viet Nam

ISBN: (纸本)9781424469109

This paper presents two methods for self-adapting the semantic sensitivities in a recently proposed semantics-based crossover: Semantic Similarity based Crossover (SSC) [1]. The first self-adaptation method is inspired by a self-adaptive method for controlling mutation step size in Evolutionary Strategies (1/5 rule). The design of the second takes into account more of our previous experimental observations, that SSC works well only when a certain portion of events successfully exchange semantically similar subtrees. These two proposed methods are then tested on a number of real-valued symbolic regression problems, their performance being compared with SSC using predetermined sensitivities and with standard crossover. The results confirm the benefits of the second self-adaption method. © 2010 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

A four-level matching model for semantic web service selection based on QoS ontology

A four-level matching model for semantic web service selecti...

引用

作者： Guo, Guangjun Yu, Fei Chen, Zhigang Xie, Dong Department of Computer Science and Technology Hunan Institute of Humanities Science and Technology Loudi China Guangdong Province Key Lab of EC Market Application Technology GuangDong University of Business Studies Guangzhou China College of Information Science and Engineering Central South University Changsha China

ISBN: (纸本)9780769543604

Services discovery based on syntactic matching cannot adapt to the open and dynamic environment of the web. In order to realize service selection for supporting QoS constraints, a Four-Level Matching Model for Semantic Web Service based on QoS Ontology and the QoS ontology for web service are presented. The Matching Engine works with the concepts of domain ontology and QoS ontology, it executes application Domain Matching, Description Matching of Service, Function Matching of Service, QoS Matching in sequence for describing the user's service request and registered service advertising which could be interpreted under ontology, because they provide a formal and semantic specification of conceptualization for improveing efficiency and accuracy of services selection. © 2010 IEEE.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Decision tree algorithm based on average Euclidean distance

Decision tree algorithm based on average Euclidean distance

引用

2010 2nd International Conference on Future computer and Communication, ICFCC 2010

作者： Liu, Quan Hu, Daojing Yan, Qicui JiangSu Province Support Software Engineering R and D Center for Information Technology Application in Enterprise Suzhou Jiangsu 215006 China School of Computer Science and Technology Soochow University Suzhou Jiangsu 215006 China

ISBN: (纸本)9781424458226

Traditionally, the algorithm of ID3 takes the information gain as a standard of expanding attributes. During the process of selection of expanded attributes, attributes with more values are usually preferred to be selected. To solve such problem, a kind of AED algorithm based on average Euclidean distance in decision tree is proposed in this paper. The algorithm uses the average Euclidean distance as heuristic information. The experiment results show that the improved AED algorithm can avoid the variety bias of ID3 algorithm, and has no worse classification precision and less time cost than ID3. ©2010 IEEE.

关键词： Decision trees

来源：评论

学校读者我要写书评

暂无评论

Multicast-tree construction and streaming mechanism for intra 802.16 mesh networks

Multicast-tree construction and streaming mechanism for intr...

引用

International Conference on Networking and Distributed Computing

作者： Tsai, Huan-Wen Lin, Hsu-Cheng Chou, Chih-Lun Cheng, Sheng-Tzong Dept. of Digital Home Service Application Technology Home Networking Technology Center ITRI South Tainan Taiwan Dept. of Computer Science and Information Engineering National Cheng Kung University Tainan Taiwan

ISBN: (纸本)9780769542072

This work proposes a novel two-stage scheme for constructing an effective multicast tree. The first stage applies a priority-based algorithm to find suitable multicast points and construct effective multicast subtrees. The second stage applies an interference-aware Steiner tree to connect the source to each multicast sub-tree. Finally, an algorithm generates the final multicast tree topology. Simulation results reveal that the proposed approach outperforms others in the construction of a multicast tree and significantly reduces the interference of a mesh network. © 2010 IEEE.

关键词： IEEE Standards

来源：评论

学校读者我要写书评

暂无评论

Feature extraction by fusing local and global discriminant features: An application to face recognition

Feature extraction by fusing local and global discriminant f...

引用

IEEE International Conference on Computational Intelligence and Computing Research

作者： Shiladitya Chowdhury Jamuna Kanta Sing Dipak Kumar Basu Mita Nasipuri Department of Master of Computer Application Techno India Kolkata India Department of Computer Science & Engineering Jadavpur University Kolkata India

This paper presents a novel scheme for feature extraction for face recognition by fusing local and global discriminant features. The facial changes due to variations of pose, illumination, expression, etc. are often appeared only some regions of the whole face image. Therefore, global features extracted from the whole image fail to cope with these variations. To address these problems, face images are divided into a number of non-overlapping sub-images and then G-2DFLD method is applied to each of these sub-images as well as to the whole image to extract local and global discriminant features, respectively. The G-2DFLD method is found to be superior to other appearance-based methods for feature extraction. All these extracted local and global discriminant features are then fused to get a large feature vector. Its dimensionality is then reduced by the PCA technique to decrease overall complexity of the system. A multi-class SVM is used as a classifier for recognition based on these reduced features. The proposed method was evaluated on two popular face recognition databases, the AT&T (formerly ORL) and the UMIST face databases. The experimental results show that the new method outperforms the global features extracted by the PCA, 2DPCA, PCA+FLD, 2DFLD and G-2DFLD methods in terms of face recognition.

关键词： Feature extraction Principal component analysis Face Databases Face recognition Training Lighting

来源：评论

学校读者我要写书评

暂无评论

Polynomial algorithms for evaluation of reliability of parallel computer interconnection systems

引用

Iranian Journal of Electrical and computer engineering 2010年第1期9卷 52-58页

作者： Dash, R.K. Tripathy, C.R. Department of Computer Science and Application College of Engineering and Technology BP University of Technology Bhubaneswar Orissa India Department of Computer Science and Engineering and Information Technology Veer Surendra Sai University of Technology Burla Orissa India

Two new and efficient algorithms for evaluating the terminal reliability of parallel computer interconnection networks have been proposed. Both the algorithms are based on multiple decomposition approach. The former is meant for reliability evaluation of multi computers while the later is meant for multi stage interconnection networks. Using the first algorithm the reliability of some important multi computer networks based on cubic architecture have been evaluated. The second algorithm is a modified version of the first one, which takes into account the topological advantages of multi stage interconnection networks during the decomposition process. The terminal reliability of some important fault-tolerant multi-stage interconnection networks has been evaluated using the second algorithm for the purpose of comparison. The complexities of the proposed algorithms are found to be highly polynomial in nature. The proposed method of multiple decomposition is compared with some similar decomposition methods. The simulated results confirm that the proposed decomposition method is much better than its counter parts. The generality of the proposed method is assured by applying the same to evaluate the terminal reliability of Alternating group graph which is also an important interconnection network apart from cube like interconnection networks. © 2010 ACECR.

关键词： Reliability

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Approach to Face Recognition Using Generalized Two-Dimensional Fisher's Linear Discriminant Method

A Hybrid Approach to Face Recognition Using Generalized Two-...

引用

International Conference on Emerging Trends in engineering and Technology, ICETET

This paper presents a novel Hybrid Approach to Face Recognition using Generalized Two-Dimensional Fisher's Linear Discriminant (HAFR G-2DFLD) Method. It has been seen that the facial changes due to variations of pose, illumination, expression, etc. are appeared only some regions of the whole image. Therefore, the conventional face recognition methods, which use whole image for feature extraction and recognition, do not result much success. To cope with the above facial changes, face images are divided into a number of non-overlapping sub-images and then G-2DFLD method is applied to each of these sub-images as well as to the whole image to extract local and global discriminant features, respectively. A multi-class SVM is used as a classifier for each of the sub-images and also for the whole image for recognition based on those extracted features. Finally, a decision is made for recognition of the image by fusing the decisions of the individual SVMs. The proposed HAFR G-2DFLD method was evaluated on two popular face recognition databases, the AT&T and the UMIST face databases. The experimental results show that the new HAFR G-2DFLD method outperforms the conventional global feature extraction methods like, PCA, 2DPCA, PCA+FLD, 2DFLD and G-2DFLD methods in terms of face recognition.

关键词： Face Feature extraction Databases Face recognition Principal component analysis Support vector machines Image recognition

来源：评论

学校读者我要写书评

暂无评论

An efficient authentication protocol for virtual subnets on mobile ad hoc networks

An efficient authentication protocol for virtual subnets on ...

引用

International Symposium on computer Communication Control and Automation (3CA)

作者： Chuan-Wang Chang Ching-Hung Yeh Chen-Da Tsai Department of Computer Application Engineering Far East University Tainan Taiwan Department of Computer Science and Information Engineering Far East University Tainan Taiwan

ISBN: (纸本)9781424455652;9781424455669

Mobile Ad hoc networks are composed of self-organizing, multi-relaying nodes connected by wireless links that the virtual subnet technology provides support to reduce redundant transmission for efficient communication is necessary. In order to satisfy security requirements, a node of virtual subnet need to identify the other member nodes, hence the certificate and authentication of virtual subnets must be established to distinguish the member nodes and the unallied nodes. In this paper, an efficient authentication protocol for virtual subnets on mobile ad hoc networks is proposed to aim for the efficiency of certificate and authentication. For the purpose, nodes of a virtual subnet have their private key respectively and they share a public key to reduce the authentication overhead and improve the efficiency. According to protocol analysis, the proposed protocol will show that it is robust with respect to certificate and authentication and very suitable for virtual subnet communication on wireless ad hoc networks.

关键词： Authentication Mobile ad hoc networks Switches Public key Local area networks Wireless application protocol Cryptographic protocols Mobile communication Ad hoc networks Public key cryptography

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：