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

6th International Conference on Bio-Inspired computing: Theories and Applications, BIC-TA 2011

作者： Zeng, Xiangxiang Song, Tao Pan, Linqiang Zhang, Xingyi Key Laboratory on Image Processing and Intelligent Control Department of Control Science and Engineering Huazhong University of Science and Technology Wuhan 430074 China Key Lab of Intelligent Computing and Signal Processing School of Computer Science and Technology Anhui University Hefei 230039 China

ISBN: (纸本)9780769545141

Recently, Gutiérrez-Naranjo and Leporati considered performing basic arithmetic operations on a new class of bioinspired computing devices - spiking neural P systems (for short, SN P systems). However, the binary encoding mechanism used in their research looks like the encoding approach in electronic circuits, instead of the style of spiking neurons (in usual SN P systems, information are encoded as the time interval between spikes). In this work, three SN P systems are constructed as adder, subtracter and multiplier, respectively. In these devices, a number is inputted to the system as the interval of time elapsed between two spikes received by input neuron, the result of a computation is the time between the moments when the output neuron spikes. © 2011 IEEE.

关键词： Encoding (symbols)

来源：评论

学校读者我要写书评

暂无评论

Research on the maximum flow in large-scale network

Research on the maximum flow in large-scale network

引用

2011 7th International Conference on Computational intelligence and Security, CIS 2011

作者： Zhang, Yan-Ping Hua, Bo Jiang, Juan Zhang, Yuan Chen, Xiao-Yan School of Computer Science and Technology Anhui University Hefei 230039 China Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei 230039 Anhui Province China

ISBN: (纸本)9780769545844

This article covers a problem that often arises in real life situations-the maximum flow problem. This problem is a classical combinatorial optimization problem, which arises in many engineering and scientific applications. It is also the important content of computer science and operational research. In order to reduce computational complexity, many improvement methods have been proposed. In this paper, applying the thought of granular computing and combining the maximal clique, a new method is proposed to solve the approximately maximum flow problem in complex and large-scale network. By contracting the appropriate maximal clique in the network, we can calculate approximate maximum flow much more efficiently. Experimental results demonstrate that the algorithm we proposed can be used to compute approximate maximum flow in a relatively short period of time and also provide a new approach to the study on the maximum flow problem. © 2011 IEEE.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

Efficient query protocol for database's privacy

Efficient query protocol for database's privacy

引用

2011 2nd International Conference on Theoretical and Mathematical Foundations of Computer Science, ICTMF 2011

作者： Yuan, Xianping Zhong, Hong Huang, Hongsheng Yi, Lei Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei Anhui 230039 China School of Computer Science and Technology Anhui University Hefei Anhui 230039 China

ISBN: (纸本)9783642249983

To protect two party privacy of database's query, known solutions are encrypt the entire database and thus the encryption cost is excessively high. To resolve this problem, we construct a new efficient solution to database's query in semi-honest mode, Based on the assumption of combination commutative encryption and the oblivious transfer protocol. The protocol can safely and efficiently finished database's secure query lack of third-party participation. Furthermore, the correctness, the security and the computational complexity of this scheme are as well analyzed. The results of analysis show that compared with known solutions, the proposed scheme has much less computational complexity. © 2011 Springer-Verlag.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

A new scheme for information hiding based on digital images

A new scheme for information hiding based on digital images

引用

2011 7th International Conference on Computational intelligence and Security, CIS 2011

作者： Zhang, Yan-Ping Jiang, Juan Xu, Chao Hua, Bo Chen, Xiao-Yan School of Computer Science and Technology Anhui University Hefei 230039 China Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei 230039 Anhui Province China

ISBN: (纸本)9780769545844

Digital steganography is a kind of data security technique. In this paper, a new information hiding scheme was proposed. In this scheme, we embed secret message into still digital images based on (7, 4) Hamming Code and Wet Paper Codes. It embeds seven secret bits into a pixel-group of seven cover pixels at a time at first, if that is unsuccessful, it embeds the first three secret bits into that pixel-group once again. The simulation experiments show that the proposed scheme can achieve high embedding efficiency and large embedding payload. © 2011 IEEE.

关键词： Pixels

来源：评论

学校读者我要写书评

暂无评论

Analysis of asymptotic approximation SER in DiffAF cooperative communication networks

引用

Journal of Information and Computational Science 2011年第13期8卷 2893-2901页

作者： Xu, Lei Zhang, Hongwei Li, Xiaohui Wu, Xianliang Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei 230039 China

In conventional single-antenna systems, differential modulation is useful when the knowledge of channel state information (CSI) is not available. Some time division multiple access (TDMA) wireless cooperative relay protocols with differential modulation and their symbol error rate (SER) performance have recently been developed. However, their works always have complex structures, which can not be easily used in practice. For differential modulation schemes of amplify and forward (DiffAF) cooperative communication system, the tightly approximated SER formula, which has a simple structure, is gotten by using simplified calculation method of moment generating function (MGF). In high signal-to-noise ratio (SNR) conditions, this formula can describe the SER performance accurately, is also convenient for the research of network topology and optimum power allocation. 1548-7741/Copyright © 2011 Binary Information Press.

关键词： Cooperative communication

来源：评论

学校读者我要写书评

暂无评论

Novel Algorithm for Hand Vein Recognition Based on Retinex Method and SIFT Feature Analysis

Novel Algorithm for Hand Vein Recognition Based on Retinex M...

引用

The 2011 International Conference on Electric and Electronics(EEIC 2011)

作者： Hua-bin Wang Liang Tao Xue-you Hu Key Laboratory of Intelligent Computing & Signal Processing Ministry of Education Anhui University

Based on the Retinex method and the SIFT feature analysis, this paper presents a novel algorithm for hand vein recognition. First of all, the principle of the near-infrared hand vein image acquisition is introduced. Secondly, the Retinex method is used to normalize hand vein images, and the adaptive smoothing method is selected to estimate the illumination. Then gray cosine transform is used to enhance the discrimination of the skin and the vein in hand vein images. Thirdly, the SIFT feature analysis algorithm is used to extract the feature of hand vein. Finally, the match method of two hand vein images based on SIFT is given. A hand vein recognition system in Microsoft VC6.0 is also developed and the experimental results demonstrate the high efficiency of the proposed algorithm in runtime and correct recognition rate.

关键词： Hand Vein Enhancement Feature Extraction SIFT Biometrics Hand Vein Recognition

来源：评论

学校读者我要写书评

暂无评论

Analysis of asymptotic approximation SER for Alamouti code transmission protocol in cooperative communication networks

引用

Journal of Information and Computational Science 2011年第14期8卷 3003-3010页

作者： Xu, Lei Zhang, Hongwei Li, Xiaohui Wu, Xianliang Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei 230039 China

Some time division multiple access (TDMA) wireless cooperative relay protocols have recently been developed. The works about their symbol error rate (SER) performance, however, are limited to SER upper bounds or SER formulas with complex structures. For SER performance analysis of wireless cooperative communication system with multiple relays, the tightly approximated SER formula, which has a simple structure, is gotten by using the simplified calculation method of moment generating function (MGF). In high signal-to-noise ratio (SNR) conditions, this formula not only can describe the SER performance accurately, but also is convenient for the research of network topology and optimum power allocation. 1548-7741/Copyright © 2011 Binary Information Press December 2011.

关键词： Cooperative communication

来源：评论

学校读者我要写书评

暂无评论

Analysis of asymptotic approximation SER for TDMA relay protocol in cooperative communication networks

引用

Journal of Information and Computational Science 2011年第12期8卷 2367-2374页

作者： Xu, Lei Zhang, Hongwei Li, Xiaohui Wu, Xianliang Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei 230039 China

Some Time Division Multiple Access (TDMA) wireless cooperative relay protocols and their Symbol Error Rate (SER) performance have recently been developed. These works, however, are limited to SER upper bounds or SER formulas with complex structures. For SER performance analysis of wireless cooperative communication system with multiple relays, the tightly approximated SER formula, which has a simple structure, is gotten by using the simplified calculation method of Moment Generating Function (MGF). In high signal-to-noise Ratio (SNR) conditions, this formula not only can describe the SER performance accurately, but also is convenient for the research of network topology and optimum power allocation. 1548-7741/Copyright © 2011 Binary Information Press.

关键词： Cooperative communication

来源：评论

学校读者我要写书评

暂无评论

Posterior Probability Support Vector Machine Applied in Motor Imagery Classification

Posterior Probability Support Vector Machine Applied in Moto...

引用

International Conference on Bioinformatics and Biomedical Engineering (ICBBE)

作者： Ying-ying Jiao Xiao-pei Wu Key Laboratory of Intelligent Computing &Signal Processing of MOE Anhui University Hehui China

Abstract-Brain-computer interface (BCI) which transforms signals from the brain into control signals can help people with disabilities communicate with others. In this paper, posteriori probability support vector machine (PPSVM) for patterns recognition was developed. For the classification of the left or right hand motor imagery, this method was used to expend the training set by adding samples with great probability output. For the dataset from 2003 BCI Competition, AR model was adopted to extract feature vectors and SVM with posteriori probabilistic output was used to classify the dataset. The results proved that, by adding samples with big probability, the performance of BCI was improved and higher accuracy was achieved.

关键词： Training Support vector machines Feature extraction Brain modeling Testing Accuracy Kernel

来源：评论

学校读者我要写书评

暂无评论

Study of hybrid strategy for ambulatory ECG waveform clustering

Journal of Software

引用

Journal of Software 2011年第7期6卷 1257-1264页

作者： Zheng, Gang Yu, Tian Laboratory of Biological signal and Intelligent Processing Tianjin University of Technology Tianjin China Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin University of Technology Tianjin China School of Computer and Communication Engineering Tianjin University of Technology Tianjin China Laboratory of Biological signal and Intelligent Processing Tianjin University of Technology Tianjin China Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin University of Technology Tianjin China

A hybrid strategy has been proposed to reduce the wrong clustering on Ambulatory ECG (electrocardiogram). Since Ambulatory ECG is usually composed by 24 hours data, the number of individual ECG waveform can reach to 100,000, the request for accurate clustering result is highly required. The proposed strategy adopted some intelligent algorithms to solve the above problem. It clusters ECG waveform sample (selected from Ambulatory ECG) synchronously by Max-Min distance clustering algorithm, K-means algorithm and Simulated annealing algorithm first. And then, it adopted all three outputs from the above three algorithms as input on Back Propagation Artificial Neural Network (BP ANN). In the end, we got more accurate clustering result from the output of ANN. For testing the results, data of MIT/BIH arrhythmia database were used for experiments. After the controlled trial on MIT/BIH data, it can be safely concluded that the clustering result achieved by improved strategy can got more accurate than that by the traditional clustering algorithm. An average accuracy ratio is about 94.6%, 1.6% higher than k-means algorithm averagely and 1.3% higher than Simulated Annealing algorithm averagely. © 2011 ACADEMY PUBLISHER.

关键词： Electrocardiograms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：