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

International Conference on information technology and computer Science, ITCS

作者： Zining Cao Department of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing China Provincial Key Laboratory for Computer Information Processing Technology Soochow University Suzhou China

In this paper, we introduce branching context bisimulation, branching normal bisimulation and branching barbed congruence for higher order pi-calculus. Moreover we prove the equivalence of the three branching bisimula... 详细信息

关键词： Context computer science Calculus information technology Laboratories information processing Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

An Improved AODV Routing Protocol Based on Remaining Power and Fame

An Improved AODV Routing Protocol Based on Remaining Power a...

引用

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Texture image segmentation using Brushlet-domain hidden Markov models

Texture image segmentation using Brushlet-domain hidden Mark...

引用

MIPPR 2009 - Remote Sensing and GIS Data processing and Other Applications: 6th International Symposium on Multispectral Image processing and Pattern Recognition

作者： Liu, Fang Yang, Kai Hao, Hongxia Hou, Biao Zhong, Hua School of Computer Science and Technology Xidian University Xi'an Shanxi 710071 China Intelligent Perception and Image Understanding Key Lab. of Ministry of Education of China Xi'an Shanxi 710071 China Intelligent Information Processing Laboratory Xidian University Xi'an Shanxi 710071 China

ISBN: (纸本)9780819478092

By researching the Brushlet domain coefficients of texture images, we found that the distribution of the magnitudes of Brushlet domain coefficients roughly meet rayleigh distribution. And there are correlations between Brushlet coefficients in adjacent scales. Therefore, Rayleigh Mixture Model (RMM) is used to characterize the statistics of the magnitudes of Brushlet coefficients. To capture the inter-scale persistence of Brushlet coefficients, a "four to four" models with markov property is adopted in this paper. On the basis, by combining with the multi-scale Bayesian segmentation method, we propose a multiscale Bayesian texture segmentation algorithm that is based on a Brushlet domain hidden Markov tree (BruHMT) model. The experiment results indicate that our method is feasible and effective. Especially for coarse texture, our method is superior than texture segmentation method using Wavelet domain hidden Markov tree (WHMT) model. © 2009 Copyright SPIE - The International Society for Optical Engineering.

关键词： Hidden Markov models

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A NOVEL LEARNING MODEL-KERNEL GRANULAR SUPPORT VECTOR MACHINE

A NOVEL LEARNING MODEL-KERNEL GRANULAR SUPPORT VECTOR MACHIN...

引用

2009 International Conference on Machine Learning and Cybernetics(2009机器学习与控制论国际会议)

作者： HU-SHENG GUO WEN-JIAN WANG CHANG-QIAN MEN School of Computer and Information Technology Shanxi University Taiyuan 030006 China Key Laboratory of Computational Intelligence and Chinese Information Processing of Ministry of Education Taiyuan 030006 China

This paper presents a novel machine learning model-Kernel Granular Support Vector Machine (KGSVM), which combines traditional support vector machine (SVM) with granular computing theory. By dividing granules and replacing with them in kernel space, the datasets can be reduced effectively without changing data distribution. And then the generalization performance and training efficiency of SVM can be improved. Simulation results on UCI datasets demonstrate that KGSVM is highly scalable for large datasets and very effective in terms of classification.

关键词： Kernel granular support vector machine Support vector machine Kernel space Granules

来源：评论

学校读者我要写书评

暂无评论

An attribute reduction approach and its accelerated version for hybrid data

An attribute reduction approach and its accelerated version ...

引用

IEEE International Conference on Cognitive Informatics

作者： Wei Wei Jiye Liang Yuhua Qian Feng Wang School of Computer and Information Technology Shanxi University Taiyuan Shanxi China Chinese Information Processing of Ministry of Education Key Laboratory of Computational Intelligence Taiyuan Shanxi China

In practical issues, categorical data and numerical data usually coexist, and a unified data reduction technique for hybrid data is desirable. In this paper, an information measure is proposed for computing the discernibility power of a categorical or numeric attribute. Based on the measure, a uniform definition of significance of attributes with categorical values and numerical values is proposed. Furthermore, an algorithm to obtain an attribute reduct from hybrid data is presented, and one of its accelerated version is also constructed. Experiments show that these two algorithms can get the same reducts, and the classification accuracies of reduced datasets are similar with the ones using Hu's algorithm. However, the accelerated version consumes much less time than the original one and Hu's algorithm do.

关键词： Acceleration information systems Power measurement Set theory Entropy Fuzzy set theory Argon Fuzzy sets Laboratories Computational intelligence

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Different thresholds of bond percolation in scale-free networks with identical degree sequence

引用

Physical Review E 2009年第3期79卷 031110-031110页

作者： Zhongzhi Zhang Shuigeng Zhou Tao Zou Lichao Chen Jihong Guan School of Computer Science Fudan University Shanghai 200433 China Shanghai Key Laboratory of Intelligent Information Processing Fudan University Shanghai 200433 China Department of Computer Science and Technology Tongji University 4800 Cao’an Road Shanghai 201804 China

Generally, the threshold of percolation in complex networks depends on the underlying structural characterization. However, what topological property plays a predominant role is still unknown, despite the speculation of some authors that degree distribution is a key ingredient. The purpose of this paper is to show that power-law degree distribution itself is not sufficient to characterize the threshold of bond percolation in scale-free networks. To achieve this goal, we first propose a family of scale-free networks with the same degree sequence and obtain by analytical or numerical means several topological features of the networks. Then, by making use of the renormalization-group technique we determine the threshold of bond percolation in our networks. We find an existence of nonzero thresholds and demonstrate that these thresholds can be quite different, which implies that power-law degree distribution does not suffice to characterize the percolation threshold in scale-free networks.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：