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

International Conference on Electronic computer technology

作者： Daming Feng Yanqin Zhu Provincial Key Laboratory of Computer Information Processing Technology Soochow University Suzhou China Soochow University Suzhou Jiangsu CN

ISBN: (纸本)9781424435623

Almost all proposed routing protocols are based on minimum hops in mobile ad hoc network. But through the research on the real communication of wireless nodes, we find that sometimes the path which has the minimum hops from the source to the destination may not be the best path. Considered the remaining power and the node selfishness, we propose an improved AODV routing protocol, I-AODV in this paper. We use a new term, node status, regard the node status as a function of the remaining power and the fame and regard the node status as the basic condition for choosing the next hop in the new routing protocol.

关键词： Routing protocols Ad hoc networks Monitoring Mobile ad hoc networks Laboratories computer networks information processing Mobile communication Wireless communication Data communication

来源：评论

学校读者我要写书评

暂无评论

Identifying query interfaces of deep web entries automatically

引用

Journal of Computational information Systems 2009年第3期5卷 1477-1485页

作者： Cui, Zhiming Fang, Wei Huang, Li Xian, Xuefeng Zhang, Shukui Jiangsu Provincial Key Laboratory of Computer Information Processing Technology Soochow University Suzhou 215006 China Institute of Intelligent Information Processing and Application Soochow University Suzhou 215006 China

A large number of high-quality web information is deeply hidden in the Web, which can not be indexed by conventional search engines, be called Deep Web. Because query interface is the only entrance to the Deep Web, we should find Deep Web query entries firstly. In this paper, we propose a new strategy that automatically and accurately identifies Deep Web entries based on Maximum Entropy and Bayes classifier from features that extracted from web form, link and page. Our experiments over real web pages show that the new approach can classify Deep Web entries accurately and efficiently. 1553-9105/ Copyright © 2009 Binary information Press.

关键词： Search engines

来源：评论

学校读者我要写书评

暂无评论

A Character Detection Algorithm in DCT Domain for Video

A Character Detection Algorithm in DCT Domain for Video

引用

Chinese Conference on Pattern Recognition (CCPR)

作者： Ningbo Zhu Weiming Dai Gaobo Yang Gang Wang College of Computer and Communication Hunan University Changsha China Jiangsu Province Computer Information Processing Technology Key Laboratory Suzhou University Suzhou China

A DCT-domain based character detection algorithm is proposed for video stream. It utilizes the directional features of the texture in character blocks and the property that the characters in video usually distribute in row or column. The character/non-character blocks are effectively separated by a new adaptive threshold, then the noise and false text regions are further removed by morphological operation. Finally, the text regions are accurately obtained by horizontal and vertical projection. Experimental results demonstrate that the proposed approach can detect characters accurately even in video with complex background , and it is of good robustness and high practical value.

关键词： Detection algorithms Discrete cosine transforms TV Educational institutions information processing Laboratories Streaming media Morphological operations Video compression Noise robustness

来源：评论

学校读者我要写书评

暂无评论

Research of secure intranet/internet access platform based on ontology

引用

Journal of Networks 2009年第10期4卷 1009-1016页

作者： Shen, Shigen Ye, Lihua Yue, Guangxue Yu, Fei College of Mathematics and Information Engineering Jiaxing University Jiaxing China College of Computer and Communication Hunan University Changsha China Department of Computer Science and Technology Huaihua University Huaihua China Jiangsu Provincial Key Laboratory of Computer Information Processing Technology Suzhou China

Faced with the general trend of centralization of information, the biggest challenge to enterprise is how to ensure that all fixed computers and different mobile devices anywhere can access securely and quickly enterprise's businesses. To solve this problem, an Ontology-based Secure intranet/Internet Access Platform (OSAP) is presented. Ontology has been applied to the field of software resources sharing. Software resource ontology is defined for building the foundation of Software Resource Ontology Sharing Model (SROSM) and the OSAP. The OSAP framework is presented by semantic modeling based on SROSM for providing users with better and higher QOS in sharing software resources. The OSAP is designed with OSAP Portal, Connection Module, Session Management Module, Security Module, RDP Module, and Bitmap Caching Module. The design ideas and functionalities of all modules are introduced. Based on the open Remote Desktop Protocol (RDP), the OSAP prototype is realized and key technologies including client display, data compression and security are described. To guarantee data transmission security and avoid access problem due to the firewall obstructing port 3389, the SSL protocol is employed to encapsulate RDP data packages between clients and OSAP as the RDP is used between OSAP and Terminal Services servers. Experimental results demonstrate that the OSAP has better performance involving response time, network usage, RAM usage and CPU usage. © 2009 ACADEMY PUBLISHER.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

A Fast 2D Otsu Thresholding Algorithm Based on Improved Histogram

A Fast 2D Otsu Thresholding Algorithm Based on Improved Hist...

引用

Chinese Conference on Pattern Recognition (CCPR)

作者： Ningbo Zhu Gang Wang Gaobo Yang Weiming Dai School of Computer and Communication Hunan University Changsha Hunan China Provincial Key Laboratory for Computer Information Processing Technology Soochow University Soochow Jiangsu China

Otsu adaptive thresholding is widely used in classic image segmentation. Two-dimensional Otsu thresholding algorithm is regarded as an effective improvement of the original Otsu method. To reduce the high computational complexity of 2D Otsu method, a fast algorithm is proposed based on improved histogram. Two-dimensional histogram is projected onto the diagonal, which forms 1D histogram with obvious peak and valley distribution. Then two-dimensional Otsu method is applied on a line that is vertical to the diagonal to find the optimal threshold. Furthermore, three look-up tables are utilized to improve the computational speed by eliminating the redundant computation in original two-dimensional Otsu method. Theoretical analysis and experimental simulation show that the proposed approach greatly enhances the speed of thresholding and has better immunity to salt and pepper noise.

关键词： Histograms Image segmentation Computational efficiency Laboratories information processing Computational complexity Computational modeling Analytical models Image processing computer vision

来源：评论

学校读者我要写书评

暂无评论

Robust copy detection by mining temporal self-similarities

Robust copy detection by mining temporal self-similarities

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Zhipeng Wu Qingming Huang Shuqiang Jiang Chinese Academy and Sciences Beijing China Institute of Computer Technology Key Laboratory of Intell. Information Process. Chinese Academy and Sciences Beijing China

This paper introduces a self-similarity matrix (SSM) based video copy detection scheme and a visual character-string (VCS) descriptor for SSM matching. SSM, which exploits the spatial and temporal information in a video clip, is extracted from exhaustive calculation of distances between the frames. The SSM based method treats the video clip as a whole and transforms the temporal self-similarity into a matrix. Moreover, by implementing the proposed VCS descriptor, the problem of SSM alignment failure and size variation can also be solved properly. Experimental evaluations based on CIVR07 copy detection corpus validate the effectiveness of the proposed solution.

关键词： Robustness Lips Robust stability Content addressable storage Data mining Availability Watermarking Monitoring Protection Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Utilizing affective analysis for efficient movie browsing

Utilizing affective analysis for efficient movie browsing

引用

IEEE International Conference on Image processing

作者： Shiliang Zhang Qi Tian Qingming Huang Wen Gao Shipeng Li Microsoft Research Asia Beijing China Key Laboratory of Intelligent Information Process Institute of Computer Technology Beijing China Chinese Academy and Sciences Beijing China

Because of the fast increasing number of movies and long time span each movie lasts, novel methods should be developed to help users browse movies and find their desired clips effectively. Affective information in movies is closely related with users' experiences and preferences. Therefore, in this paper, we analyze the affective states of movies and propose affective information based movie browsing. Affective movie content analysis is challenging due to the great variety of movie contents and styles. To address this challenge, we first extract rich audio-visual features. Then, feature selection and affective modeling are carried out to select and map effective features into corresponding affective states. Finally, we propose novel Affective Visualization techniques which intuitively visualize affective states to achieve efficient and user-friendly movie browsing. Experiments on representative movie dataset demonstrate the effectiveness of our proposed methods.

关键词： Motion pictures Visualization Hidden Markov models Feature extraction Data mining information analysis Humans Analysis of variance Asia Content addressable storage

来源：评论

学校读者我要写书评

暂无评论

Exploring Syntactic Features for Pronoun Resolution Using Context-Sensitive Convolution Tree Kernel

Exploring Syntactic Features for Pronoun Resolution Using Co...

引用

International Conference on Asian Language processing (IALP)

作者： Kong Fang Yancui Li Guodong Zhou Qiaoming Zhu Jiangsu Provincial Key Lab for Computer Information Processing Technology School of Computer Science and Technology Soochow Univ. Suzhou China College of Information Technology Henan Institute of Science and Technology Xinxiang Henan China Jiangsu Provincial Key Lab. for Comput. Inf. Process. Technol. Soochow Univ. Suzhou Suzhou China

This paper proposes to use a convolution kernel over parse tree to model syntactic structure information for pronoun resolution. Our study reveals that the syntactic structure features embedded in a parse tree are very effective for pronoun resolution and these features can be well captured by the context-sensitive convolution tree kernel. Evaluation on the ACE 2003 corpus shows that among all structured syntactic feature space, shortest path tree achieves the best performance. Then we incorporate more features into SPT, result shows that SPT can use successfully with normal features. Finally, we compare our system with other pronoun resolution systems, our results are outstanding in success rate than normal features and tree kernel-based method of Yang.

关键词： Convolution Kernel information processing computer science Educational institutions information technology Paper technology Electronic mail Data mining Labeling

来源：评论

学校读者我要写书评

暂无评论

A Packet Loss Discrimination Algorithm in Wireless IP Networks

A Packet Loss Discrimination Algorithm in Wireless IP Networ...

引用

International Conference on Wireless Communications, Networking and Mobile Computing (WiCom)

作者： Hai-tao Zhao Yu-ning Dong Yang Li College of Communication and Information Engineering Nanjing University of Posts and Telecommunications Nanjing China Jiangsu Provincial Key Laboratory of Computer Information Processing Technology Suzhou University Suzhou China

In this paper, we propose an algorithm WMTA (wireless multimedia transmission algorithm) for multimedia transmission control over wireless-wired IP networks. The relationship between packet length and packet loss rate over the Markov wireless error model is investigated. Based on this character, the algorithm can detect the nature of packet losses by sending large and small packets alternately, and control the sending rate of nodes. Furthermore, by use of an updating factor K, the algorithm can adapt to the changes of network states quickly. Extensive computer simulations demonstrate that the proposed scheme is effective in satisfying the end to end quality of service and reducing the congestion loss rate in various network topologies.

关键词： IP networks Wireless networks Electronic mail Streaming media TCPIP Quality of service Propagation losses History Performance loss Educational institutions

来源：评论

学校读者我要写书评

暂无评论

Linear support vector machine based on kernel function

引用

Journal of Computational information Systems 2009年第4期5卷 1089-1095页

作者： Gao, Shang Hu, Xuekun Zhang, Zaiyue Cao, Cungen School of Computer Science and Engineering Jiangsu University of Science and Technology Zhenjiang 212003 China Provincial Key Laboratory of Computer Information Processing Technology Soochow University Suzhou 215006 China Institute of Computing Technology The Chinese Academy of Sciences Beijing 100080 China

Support vector machine is kind of novel machine learning method, based on statistical learning theory, which becomes the hotspot of machine learning because of its excellent learning performance. The method of support vector machine has been developed for solving classification and regression problems. Training a support vector machine requires the solutions of a very large quadratic programming problem. The algorithm is usually slow when there are many data. In order to improve the running speed, three regression models based on kernel function are introduced. One of three models is changed into a system of linear equations problem, the other models are changed into linear programming problems and their dual problems are given. Simulation results show the effectiveness of the methods, and the computation complexity are largely reduced. The kernel function and the parameter of models selection are compared and analyzed by means of an example. © 2009 Binary information Press August, 2009.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：