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

IEEE International Conference on Computer science and Automation Engineering (CSAE)

作者： Chen, Shengbing Wang, Xiaofeng Wang, Xiaofang Key Lab of Network and Intelligent Information Processing Hefei University Hefei 230601 China Department of Computer Science and Technology Hefei University Hefei 230601 China Intelligent Computing Lab Institute of Intelligent Machines Chinese Academy of Sciences Hefei 230031 China Department of Computer Artillery Academy Hefei 230031 China

ISBN: (纸本)9781424487257

Mining frequent itemsets is a core problem in many data mining tasks, most existing works on mining frequent itemsets can only capture the long-term and static frequency itemsets, they do not suit the task whose frequent itemsets often change. Using the theory of ant colony algorithm, we proposed a new method for mining dynamical frequent itemset(called AC-MFI). The method considers the item of transaction as a node in the path, takes the itemset as a path, and takes each transaction as a foraging behavior. According to the pheromone updating policy of ant colony algorithm, AC-MFI mines dynamical frequent itemsets from transaction data stream. Experiment results show that the method is valid and practicable. © 2011 IEEE.

关键词： data mining

来源：评论

学校读者我要写书评

暂无评论

Research on K-means median filter

引用

Journal of Information and Computational science 2011年第6期8卷 961-968页

作者： Huang, Ying Xie, Mei Li, Weisheng Zhou, Lifang School of Electronic Engineering University of Electronic Science and Technology of China Chengdu 610054 China Chongqing Key Lab. of Computer Network and Communication Technology Chongqing 400065 China Institute of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongqing 400065 China

K-means median filter algorithm and recursive K-means median filter algorithm are designed to solve the defects of standard median filter. At first, the sample composed by the current pixel and its neighbors are divided into two classes, and the median of the class which includes the current pixel is computed as the result. The parameters TL and TH are used for the consideration of speed and accuracy, and they are analyzed to reach an optimal result. The standard K-means algorithm is a time-consuming procedure, so the optimization is proposed in this paper. And through the experimental analysis, the algorithm is suitable to the images with obvious foreground and background, especially to binary image. Some examples are given to prove the new algorithm can get better noise reduction effect. © 2011 Binary Information Press.

关键词： Median filters

来源：评论

学校读者我要写书评

暂无评论

Probing Into Design Of Refuge Chamber System In Coal Mine

引用

Procedia Engineering 2011年 26卷 2334-2341页

作者： Lei Meng YaoDong Jiang Yixin Zhao Ruyue Shan Yimeng Song China University of Mining & Technology Beijing 100083 China State key lab of Coal Resources and Safe Mining Beijing 100083 China China Tax Sky Network Science and Technology Co Ltd. Beijing 100027 China

Put forward the refuge chamber system composed by permanent refuge chamber, temporary refuge chamber and rescue capsule, which are mutually independent and tightly-coupled, to cost-effectively radiate all the areas with mining activities and protect personnel in mine. In addition, in order to promote the development of refuge chamber system in Chinese coal mine, propose some basically design principles of refuge chamber system and describe the arrangement principles and structure characteristics of three kinds of refuge space in the process of underground refuge chamber system design and construction. It is a significant reference for coal mine refuge chamber system construction in China.

关键词： refuge chamber system rescue capsule coal mine refuge chamber

来源：评论

学校读者我要写书评

暂无评论

Comments on a threshold authenticated encryption scheme

引用

International Journal of Computers and Applications 2011年第2期33卷 132-136页

作者： Tan, Zuowen Department of Computer Science and Technology School of Information Technology Jiangxi University of Finance and Economics Nanchang 330032 Jiangxi Province China Key Lab. of Network Security and Cryptology School of Mathematics and Computer Science Fujian Normal University Fuzhou 350007 China

An authenticated encryption scheme (AE scheme) allows the signer to generate a valid authenticated ciphertext on a message such that the designated recipient can recover the message. AE schemes can achieve confidentiality and authenticity when message is transmitted over an insecure channel. The previous AE scheme only can allow one signer to generate the authenticated ciphertext. Recently, Chung et al. proposed a (t, n) threshold authenticated encryption scheme (TAE scheme) in which any t or more signers cooperate to produce a signature for a message and no one except the designated verifier can obtain the message from the ciphertext and verify the authenticity and integrity of the message. The scheme is based on elliptic curve cryptosystem. Moreover, the scheme applies a division-of-labour signature technique to reduce the load of every signer. In other words, every signer only needs to sign a message block assigned to it. Therefore, the (t, n) TAE scheme is more efficient than other AE schemes. However, some flaws of the scheme are found in this paper. Several security defects of the scheme are elaborated: (i) It suffers from conspiracy attack. (ii) It does not hold robustness. (iii) It is insecure against insider attacks. In addition, there exist some design defects in the TAE scheme. Some measures to remove these weaknesses are given in this paper.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

Image edge detection using variation-adaptive ant colony optimization

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in Computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2011年 6910卷 27-40页

作者： Tian, Jing Yu, Weiyu Chen, Li Ma, Lihong School of Computer Science and Technology Wuhan University of Science and Technology 430081 China School of Electronic and Information Engineering South China University of Technology Guangzhou 510641 China Guangdong Key Lab of Wireless Network and Terminal School of Electronic and Information Engineering South China University of Technology Guangzhou 510641 China

ISBN: (纸本)9783642240157

Ant colony optimization (ACO) is an optimization algorithm inspired by the natural collective behavior of ant species. The ACO technique is exploited in this paper to develop a novel image edge detection approach. The proposed approach is able to establish a pheromone matrix that represents the edge presented at each pixel position of the image, according to the movements of a number of ants which are dispatched to move on the image. Furthermore, the movements of ants are driven by the local variation of the image's intensity values. Extensive experimental results are provided to demonstrate the superior performance of the proposed approach. © 2011 Springer-Verlag Berlin Heidelberg.

关键词： Ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

Secret and reliable coding mechanism for noncoherent multisource network coding

Secret and reliable coding mechanism for noncoherent multiso...

引用

IEEE International Conference on Communication Software and networks

作者： Chen, Siguang Wu, Meng Lu, Weifeng Jin, Yi College of Computer Science Nanjing University of Posts and Telecommunications Nanjing China College of Telecommunications and Information Engineering Nanjing Univ. of Posts and Telecommunications Nanjing China Key Lab of Broadband Wireless Communication and Sensor Network Technology Ministry of Education China College of Informatics and Electronics Zhejiang Sci-Tech University Hangzhou China

ISBN: (纸本)9781612844855

This work considers the communication scenario where multiple sources transmit information to one or more receivers and these receivers request the information from all the sources. We construct a secret and reliable coding mechanism for noncoherent multisource network coding by extending the work [9, 10] to multisource case. Although the network scenario suffers from an adversary that can re-select the tapping links in different time slot and inject z erroneous packets into network, and the transmission links suffer from a packet erasures, our scheme can retrieve the original information secretly and accurately from the corrupt and deficient information. Meanwhile, the secret and reliable multisource network coding scheme can obtain an asymptotic achievable rate of k2z3. © 2011 IEEE.

关键词： network coding

来源：评论

学校读者我要写书评

暂无评论

Adaptive multi-sensor background noise estimation method based on spatial-temporal correlation

引用

Journal of Convergence Information technology 2011年第12期6卷 154-162页

作者： Sun, Yuxuan Lou, Xiaojun Liu, Haitao Key Lab of Wireless Sensor Network and Communications Shanghai Institute of Microsystem and Information Technology Chinese Academy of Science Shanghai 200050 China Wuxi SensingNet Industrialization Research Institute Wuxi 214135 China

In the multi-sensor measurement system, background subtraction is very important to improve both the accuracy and the sensitivity of the system. As the prerequisite, the performance of background noise estimation is considered as the foundation and also a hot topic. In this paper, a novel adaptive background noise estimation method based on spatial-temporal correlation is proposed. Firstly, a feature zero-crossing rate extracted from the raw data is chosen to describe the background noise degree, and then the model of background noise estimation based on the correlation of the space and the time in multi-sensor measurement system is proposed. Applying the model, using zero-crossing rate as the input, we can get the real-time weight of each sensor, which is used for estimating the adaptive background noise. Finally, seismic background noise estimation experiments are operated. The comparison between several other methods in the sensor failure situation shows that, the proposed method is more effective and more stable.

关键词： Estimation

来源：评论

学校读者我要写书评

暂无评论

A novel approach for event foreground detection based on PSO parameter optimization and region partition based background modeling

引用

Journal of Convergence Information technology 2011年第10期6卷 146-154页

作者： Wu, Jianrong Bao, Bisai Lou, Xiaojun Liu, Haitao Key Lab of Wireless Sensor Network and Communications Shanghai Institute of Microsystem and Information Technology Chinese Academy of Science Shanghai 200050 China Wuxi SensingNet Industrialization Research Institute Wuxi 214135 China

This paper proposes a novel image sequences based approach for event foreground detection in wild scenes with strong environment noises, which bases on PSO parameter optimization and region partition. First of all, base on variance vectors of row and column of difference image, the background model is partitioned into estimated event region covering real event foreground and estimated background region. Then, specific optimal Kalman filters for background modeling are designed for the two regions respectively. At last, event foreground is detected by utilizing adaptive threshold based segmentation method based on the optimal background model. Experimental results demonstrate that the proposed approach could achieve a better performance, while it detects a more accurate event foreground with extremely low false results, by strengthening the event foreground and inhibiting the environment noises.

关键词： Kalman filters

来源：评论

学校读者我要写书评

暂无评论

Identification and extraction of topic elements for Chinese interactive text

Identification and extraction of topic elements for Chinese ...

引用

2nd International Conference on Multimedia technology, ICMT 2011

作者： Zhu, Haiping Yang, Yang Chen, Yan Yu, Xiaolu Department of Computer Science and Technology Xi'an Jiaotong University Min. of Education Key Lab for Intelligent Networks and Network Security of xi'An Jiaotong University Xi'an China

ISBN: (纸本)9781612847740

This paper is based on identification and extraction of topic elements for Chinese interactive text. A topic segmentation method based on time sequence is achieved. Then a novel identification and extraction algorithm of topic elements is proposed. Firstly, noise filtering and Chinese word segmentation on the original corpus are executed. Secondly, the identifying and extracting method in group of mixed turn is used to extract the topic elements, such as time, place and figure. Finally, performance evaluation of identification recall, identification accuracy and extraction accuracy are achieved. The experimental results show the effectiveness of the algorithm. © 2011 IEEE.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

Multi-user private keyword search for cloud computing

Multi-user private keyword search for cloud computing

引用

2011 3rd IEEE International Conference on Cloud Computing technology and science, CloudCom 2011

作者： Yang, Yanjiang Lu, Haibing Weng, Jian Institute for Infocomm Research Singapore Singapore Dept. of Operations Management and Information Systems Leavey School of Business Santa Clara University United States Department of Computer Science Emergency Technology Research Center of Risk Evaluation and Prewarning on Public Network Security Jinan University Guangzhou China State Key Laboratory of Information Security Institute of Software Chinese Academy of Sciences China State Key Lab. of Networking and Switching Technology Beijing University of Posts and Telecommunications China

ISBN: (纸本)9780769546223

Enterprises outsourcing their databases to the cloud and authorizing multiple users for access represents a typical use scenario of cloud storage services. In such a case of database outsourcing, data encryption is a good approach enabling the data owner to retain its control over the outsourced data. Searchable encryption is a cryptographic primitive allowing for private keyword based search over the encrypted database. The above setting of enterprise outsourcing database to the cloud requires multi-user searchable encryption, whereas virtually all of the existing schemes consider the single-user setting. To bridge this gap, we are motivated to propose a practical multi-user searchable encryption scheme, which has a number of advantages over the known approaches. The associated model and security requirements are also formulated. We further discuss to extend our scheme in several ways so as to achieve different search capabilities. © 2011 IEEE.

关键词： Outsourcing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：