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

5th International Conference on Computing Communication and Networking Technologies, ICCCNT 2014

作者： Yu, Xiaomei Wang, Hong Zheng, Xiangwei School of Information Science and Engineering Shandong Provincial Key Laboratory for Distributed Computer Software Novel Technology Shandong Normal University Jinan Shandong China

ISBN: (纸本)9781479926961

Mining frequent itemsets from traditional database is an important research topic in data mining and researchers achieved tremendous progress in this field. However, with the emergence of new applications, the traditional way of mining frequent itemsets is not available in uncertain environment. In the past ten years, researchers proposed different solutions in extending the conventional techniques into uncertainty environment. In this paper, we review the previous algorithms based on the two definitions of frequent itemsets, then we improve the traditional classic algorithm for mining frequent itemsets in uncertain databases under the definition of frequent probability. Finally, we tested our algorithm on a number of uncertain data sets. The experiments on both sythetic and real data have shown that the new adaptation of classic algorithm is efficient and gain better results on accuracy. © 2014 IEEE.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Design of trust model based on behavior in cloud computing environment

Design of trust model based on behavior in cloud computing e...

引用

5th International Symposium on IT in Medicine and Education, ITME 2013

作者： Zhang, Yong Sheng Tian, Ming Lv, Shen Juan Zhang, Yan Dong School of Information Science and Engineering Shandong Provincial Key Laboratory for Novel Distributed Computer Software Technology Shandong Normal University Jinan 250014 China

ISBN: (纸本)9789400776173

This paper studies the characteristics of cloud computing environment, based on the traditional access control management technology, proposes a reference model for access control management in the cloud computing, designs a model based on trust grade of behaviors and role control, its basic thought is through entity behaviors, or the results which entity's behaviors produced, and integrated calculation processing generates the entity of credible value, with this as basis determines or changes entity of trust grade, as to change the entity of role and authority, to reach the purpose of supervision and protection about single entity or even the whole cloud system. © Springer Science+Business Media Dordrecht 2014.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Encoding Spatial Context for Large-Scale Partial-Duplicate Web Image Retrieval

引用

Journal of computer Science & technology 2014年第5期29卷 837-848页

作者：周文罡李厚强卢亦娟田奇 Chinese Academy of Sciences Key Laboratory of Technology in Geo-Spatial Information Processing and Application System University of Science and Technology of China Department of Electronic Engineering and Information Science University of Science and Technology of China Department of Computer Science Texas State UniversitySan Marcos TX 78666 U.S.A. MemberACMIEEE Department of Computer Science University of Texas at San AntonioSan Antonio TX 78249 U.S.A. Senior MemberIEEE

Many recent state-of-the-art image retrieval approaches are based on Bag-of-Visual-Words model and represent an image with a set of visual words by quantizing local SIFT（scale invariant feature transform） features. Feature quantization reduces the discriminative power of local features and unavoidably causes many false local matches between images, which degrades the retrieval accuracy. To filter those false matches, geometric context among visual words has been popularly explored for the verification of geometric consistency. However, existing studies with global or local geometric verification are either computationally expensive or achieve limited accuracy. To address this issue, in this paper, we focus on partialduplicate Web image retrieval, and propose a scheme to encode the spatial context for visual matching verification. An efficient affine enhancement scheme is proposed to refine the verification results. Experiments on partial-duplicate Web image search, using a database of one million images, demonstrate the effectiveness and efficiency of the proposed *** on a 10-million image database further reveals the scalability of our approach.

关键词： large-scale image retrieval spatial context coding spatial verification affine estimation

来源：评论

学校读者我要写书评

暂无评论

Laminated paper counting algorithm based on compressive sensing and hough transform 2

Laminated paper counting algorithm based on compressive sens...

引用

2nd International Conference on information technology and Electronic Commerce, ICITEC 2014

作者： Wang, Hui Chen, Dongfang Wang, Xiaofeng College of Computer Science and Technology Wuhan University of Science and Technology Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System Wuhan China

ISBN: (纸本)9781479952984

According to the problem that conventional laminated paper counting algorithms have some unavoidable shortcomings such as high dependence on the quality of laminated paper and noise sensitivity, we propose a laminated paper counting algorithm based on compressive sensing (CS) and Hough transform (HT). In the proposed algorithm, the over-complete dictionary which is created by dispersing the Hough transform space of straight lines acts as the sparse matrix. Making use of high degree of sparse nature of the laminated paper image, we can obtain the accurate result through using CS theory. Experimental results on simulation images and laminated paper images have shown that our proposed algorithm can effectively restrain noise of the laminated paper image, and will get accurate experimental results with fewer CS measurements. © 2014 IEEE.

关键词： Compressed sensing

来源：评论

学校读者我要写书评

暂无评论

Research and application analysis of feature binding mechanism 8

Research and application analysis of feature binding mechani...

引用

8th IFIP International Conference on Intelligent information processing, IIP 2014

作者： Han, Youzhen Ding, Shifei School of Computer Science and Technology China University of Mining and Technology XuzhouJiangsu221116 China Key Laboratory of Intelligence Information Processing Institute of Computer Technology Academy of Sciences Beijing City100190 China

ISBN: (纸本)9783662449790

In order to recognize the object of the external world, brain need to integrate the information of different cortical areas, then form a complete world. And binding problem study on a process to percept a complete object by integrating information, which scattering on different cortical areas. As a central problem of cognitive science and neuroscience, the concept of feature binding is becoming to the focus of consciousness argument. At the beginning of this paper, we introduced the concept, characteristics and theory source of feature binding. And according to the main theoretical research methods of this mechanism, combining the latest advance at home and abroad, we made a systematical review of the research situation of feature binding problem applying in perceptual learning. At last, we pointed out the key point of the further study, which may be refined research of bundled brain mechanism on different cognition process and systematical study of general bundled brain mechanism. © IFIP International Federation for information processing 2014.

关键词： Brain

来源：评论

学校读者我要写书评

暂无评论

A group key distribution system based on the generalized aryabhata remainder theorem for enterprise digital rights management

引用

Journal of information Hiding and Multimedia Signal processing 2015年第1期6卷 140-153页

作者： Liu, Yanjun Chang, Chin-Chen Chang, Shih-Chang Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University No.111 Jiulong Rd Hefei230601 China Department of Computer Science and Information Engineering Asia University No.500 Lioufeng Rd Wufeng Taichung413 Taiwan Department of Information Engineering and Computer Science Feng Chia University No.100 Wenhwa Rd Seatwen Taichung407 Taiwan Department of Computer Science and Information Engineering National Chung Cheng University No.168 Sec.1 University Rd Min-Hsiung Township Chiayi621 Taiwan

Digital Rights Management (DRM) is a type of access-control technology that is used by diverse content providers to restrict the use of digital content. Enterprise Digital Rights Management (E-DRM) is an application of DRM techniques for managing the control of access to sensitive documents in an enterprise. In this paper, we propose a group key distribution system for E-DRM based on the concept of a secret-sharing mechanism and the generalized Aryabhata remainder theorem (GART). To the best of our knowledge, no previous publications related to E-DRM technologies have presented the group key distribution system that we propose. In our system, different groups of enterprise members within the enterprise obtain different digital content in parallel without collision by using their group’s unique session key;all members within each group share a common session key to decrypt the same digital documents to acquire the correct content. We proved that our system achieves the goal of providing high security, which includes preventing inside and outside attacks and offering forward and backward secrecy. © 2015.

关键词： Copyrights

来源：评论

学校读者我要写书评

暂无评论

Extracting part-whole relations from online encyclopedia 8

Extracting part-whole relations from online encyclopedia

引用

8th IFIP International Conference on Intelligent information processing, IIP 2014

作者： Xia, Fei Cao, Cungen Key Laboratory of Intelligent Information Processing Institute of Computer Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9783662449790

Automatic discovery of part-whole relations is a fundamental problem in the area of information extraction. In this paper, we present an unsupervised approach to learning lexical patterns from online encyclopedia for extracting part-whole relations. The only input is a few part-whole instances. To tackle the term recognition problem, terms from the domain of the seeds are extracted taking use of the semantic information contained in the online encyclopedia. Instead of collecting sentences that contain relation instances from the seeds, we introduce a novel process to select sentences that may indicate part-whole relations. Patterns are produced from these sentences with terms replaced by Part and Whole tags. A similarity measurement based on a new edit distance is used and an algorithm is described to cluster similar patterns. We rank the pattern clusters according to their frequencies, and patterns from the top-k clusters are chosen to be applied to identify the new part-whole relations. Experimental results show that our method can extract abundant part-whole relations and achieve a preferable precision compared to the other state-of-the-art approaches. © IFIP International Federation for information processing 2014.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Latency-aware routing with bandwidth assignment for Software Defined Networks

Latency-aware routing with bandwidth assignment for Software...

引用

IEEE International Conference on Performance, Computing and Communications (IPCCC)

作者： Qiongyu Zhang Liehuang Zhu Meng Shen Mingzhong Wang Fan Li Beijing Engineering Research Center of High Volume Language Information Processing and Cloud Computing Applications Beijing Institute of Technology P. R. China Key Laboratory of Computer Network and Information Integration (Southeast University) Ministry of Education P. R. China Faculty of Arts and Business University of the Sunshine Coast Queensland Australia

Reducing the flow latency is of great importance in traffic management, which benefits both service providers and end users. Routing design and flow scheduling are typical ways to improve the flow transmission efficiency. However, existing studies usually consider them separately, due to the complexity of joint consideration. Here, we propose a latency-aware routing scheme with bandwidth assignment in the Software Defined Networks, which can efficiently reduce the flow latency with a moderate complexity, to combine the routing and scheduling together.

关键词： Routing Bandwidth Processor scheduling Complexity theory Bismuth Software Mathematical model

来源：评论

学校读者我要写书评

暂无评论

Self-adaptive anonymous communication scheme under SDN architecture

Self-adaptive anonymous communication scheme under SDN archi...

引用

IEEE International Conference on Performance, Computing and Communications (IPCCC)

作者： Tingting Zeng Meng Shen Mingzhong Wang Liehuang Zhu Fan Li Beijing Engineering Research Center of High Volume Language Information Processing and Cloud Computing Applications Beijing Institute of Technology P. R. China Key Laboratory of Computer Network and Information Integration (Southeast University) Ministry of Education P. R. China Faculty of Arts and Business University of the Sunshine Coast Queensland Australia

Communication privacy and latency perceived by users have become great concerns for delay-sensitive Internet services. Existing anonymous communication systems either provide high anonymity at an expense of prolonged latency (e.g., mix-net), or offer better real-time performance by sacrificing the ability against traffic analysis attacks (e.g., Onion Routing). The emerging Software-Defined Networking (SDN) introduces additional challenges to communication anonymity, due to the existence of a centralized controller that has a global view of the entire network traffic. In this paper, we propose a new anonymous communication scheme for delay-sensitive services under SDN scenarios, which can simultaneously protect communication privacy and reduce the end-to-end latency. A self-adaptive method based on the mix-net framework is designed to dynamically modify the waiting threshold of mix nodes, which helps to reduce the communication latency. In order to preserve the degree of anonymity, the self-adaptive method is incorporated with a random walking strategy for packets forwarding. Both theoretical analysis and experimental results prove that our scheme provides a moderate degree of anonymity and effectively reduces the latency derived from mix-net by up to 50%.

关键词： Real-time systems Relays Entropy Lead Distance measurement Annealing Probabilistic logic

来源：评论

学校读者我要写书评

暂无评论

Application and research of improved probability matrix factorization techniques in collaborative filtering

International Journal of Control and Automation

引用

International Journal of Control and Automation 2014年第8期7卷 79-92页

作者： Zhang, Zhijun Liu, Hong School of Information Science and Engineering Shandong Normal University Jinan Shandong 250014 China Shandong Provincial Key Laboratory for Novel Distributed Computer Software Jinan Shandong 250014 China School of Computer Science and Technology Shandong Jianzhu University Jinan Shandong 250101 China

The matrix factorization algorithms such as the matrix factorization technique (MF), singular value decomposition (SVD) and the probability matrix factorization (PMF) and so on, are summarized and compared. Based on the above research work, a kind of improved probability matrix factorization algorithm called MPMF is proposed in this paper. MPMF determines the optimal value of dimension D of both the user feature vector and the item feature vector through experiments. The complexity of the algorithm scales linearly with the number of observations, which can be applied to massive data and has very good scalability. Experimental results show that MPMF can not only achieve higher recommendation accuracy, but also improve the efficiency of the algorithm in sparse and unbalanced data sets compared with other related algorithms. © 2014 SERSC.

关键词： Singular value decomposition

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：