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

IEEE International Conference on Computer Science and Automation engineering

作者： Han, Hong-Qi An, Xiaomi Zhu, Donghua Wang, Xuefeng Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China Ministry of Education Beijing 100872 China School of Management and Economics Beijing Institute of Technology Beijing 100872 China

ISBN: (纸本)9781424487257

Visualization technique is a powerful method used by science and technology intelligence analysis experts to identify technical competitor groups. Common visualization methods tend to create graphs meeting the aesthetic criteria instead of finding better clusters, and their analysis results may provide misleading information. A process model of technical group identification method was presented using LinLog graph clustering algorithm to find better competitor groups. In the model, technical similarity value of each pair of competitors is measured based on their R&D output in sub-fields, and two competitors have a link when they have high similarity value;LinLog algorithm, which is aimed at producing better clusters, was employed to layout graph with competitors as nodes, their links as edges and technology similarity values as weights of edges. Experiment results show the efficiency of presented method. © 2011 IEEE.

关键词： Visualization

来源：评论

学校读者我要写书评

暂无评论

Formal analysis of trusted computing: One case study

Formal analysis of trusted computing: One case study

引用

International Conference on Communications and Mobile Computing

作者： Zhou, HongWei Yuan, JinHui Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education Beijing China School of Information Renmin University of China Beijing China Institute of Electronic Technology Zhengzhou Information Engineering University of China Zhengzhou China

ISBN: (纸本)9780769543574

LS2 is the logic to reason about the property of trusted computing. However, it lacks the capability of modeling the isolation provided by virtualization which is often involved in previous trusted computing system. With the support of changed LS2, we model three types of isolation. Moreover, we formally analyze the integrity measurement property of Trust Visor proposed recently which provides the isolated execution environment for security-sensitive code. © 2011 IEEE.

关键词： Virtualization

来源：评论

学校读者我要写书评

暂无评论

B-IRP: An improving integrity report protocol for remote attestation

B-IRP: An improving integrity report protocol for remote att...

引用

International Conference on Communications and Mobile Computing

ISBN: (纸本)9780769543574

Trusted platform module (TPM) has little computation capability, and it is the performance bottleneck of remote attestation. In the scenario where the server is the attestation-busy entity which answers attestation requirement frequently, the massive delay is inevitable. Without the modification to TPM, we propose Batch Integrity Report Protocol (BIRP) to overcome the performance bottleneck. B-IRP bundles these requirements in interval as a batch requirement, and creates the response messages for these requirements with one expensive TPM operation. Discussion shows that B-IRP has improved the performance without loss of security. © 2011 IEEE.

关键词： Trusted computing

来源：评论

学校读者我要写书评

暂无评论

Clustering XML search results based on content and structure similarity

Clustering XML search results based on content and structure...

引用

2011 International Conference on Management of e-Commerce and e-Government, ICMeCG 2011

作者： Min-Juan, Zhong Chang-Xuan, Wan De-Xi, Liu Xian-Pei, Jiao School of Information and Technology Jiangxi University of Finance and Economics Nanchang China Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economics Nanchang China

ISBN: (纸本)9780769545448

Clustering XML search results is an effective way to improve performance. However, the key problem is how to measure similarity between XML documents. In this paper, we propose a semantic similarity measure method combining content with structure, in which a variety of XML document features, including term element frequency, term inverse element frequency, semantic weight of tag label and level information of the term, are analyzed and applied for computing the similarity between XML documents. In addition, two new performance evaluation methodology, namely Cluster Ratio Relevant and Docu Ratio Relevant, for clustering quality are introduced motivated by the observations of relevant documents distribution and the fact that collection has no classification information. Experiment results show that proposed similarity method(CAS measure)outperforms traditional document clustering(CO measure) in Cluster Ratio Relevant and Docu Ratio Relevant and produces better clustering quality. © 2011 IEEE.

关键词： XML

来源：评论

学校读者我要写书评

暂无评论

Effect factors on secondary structure of protein sequence pattern

Effect factors on secondary structure of protein sequence pa...

引用

International Workshop on Intelligent Systems and Applications

作者： Liu, Tao Li, Minghui Key Laboratory of Data Engineering and Knowledge Engineering MOE Beijing 100872 China School of Information Renmin University of China Beijing 100872 China School of Computer Science and Technology Harbin Institute of Technology Harbin 150001 China

ISBN: (纸本)9781424498574

Discovering the relationship between protein sequence pattern and protein secondary structure is important for accurately predicting secondary structure of protein sequence. A protein secondary structure pattern dictionary is constructed using protein sequence pattern and its corresponding secondary structure in this paper. Based on the constructed dictionary, we propose four effect factors on secondary structure of protein sequence pattern, including 1) the core pattern itself;2) patterns or amino acid residues that neighbor with the core pattern;3) patterns or amino acid residues that are far away from the core pattern;and 4) amino acid sequence segment that match the core pattern. Statistical measures are adopted to analyze these factors. The experimental result shows the reliability of these factors. The recognition of these effect factors presents new directions to predict protein secondary structure based on protein pattern dictionary. © 2011 IEEE.

关键词： Amino acids

来源：评论

学校读者我要写书评

暂无评论

Selection of multimedia data source based on user feedback

Selection of multimedia data source based on user feedback

引用

2011 International Conference on Management of e-Commerce and e-Government, ICMeCG 2011

作者： Deng, Song Wan, Changxuan Liu, Xiping School of Information Technology Jiangxi University of Finance and Ecomomics Nanchang China School of Software Jiangxi Agricultural University Nanchang China Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economics Nanchang China

ISBN: (纸本)9780769545448

There are hundreds or thousands of web data sources providing data of relevance to a particular domain on the Web, so how to find a suitable set of sources quickly to integrate from a number of sources is becoming more and more important. Traditional data sources selection methods that are based on data quality do not consider quality characteristics of data sources under the different domains, but select the same quality dimensions for quality evaluation models. As a result, accuracies of a traditional method under different domains are quite different. In light of this, we propose a Web multimedia source selection method based on user feedback. We gain accurate core quality dimensions of data sources under the multimedia domain based on user feedback, and then achieve a quality estimation model of the multimedia data sources. The experiments on hundreds of real-world multimedia data sources have proved that our approach is efficient and accurate. © 2011 IEEE.

关键词： Accuracy Computers data Source data models databases Equations Mathematical model Multimedia Multimedia communication Quality Dimensions User Feedback Web data source data quality estimation model quality evaluation model quality multimedia computing mult

来源：评论

学校读者我要写书评

暂无评论

Sentiment classification via L2-norm deep belief network 11

Sentiment classification via L2-norm deep belief network

引用

20th ACM Conference on Information and knowledge Management, CIKM'11

作者： Liu, Tao Li, Minghui Zhou, Shusen Du, Xiaoyong Key Laboratory of Data Engineering and Knowledge Engineering MOE 100872 Beijing China School of Information Renmin University of China 100872 Beijing China Microsoft Asian Research and Development Group 100080 Beijing China Shenzhen Graduate School Harbin Institute of Technology 518055 Shenzhen China

ISBN: (纸本)9781450307178

Automatic analysis of sentiments expressed in large scale online reviews is very important for intelligent business applications. Sentiment classification is the most popular task of sentiment analysis, which is more challenging than traditional topic-based text classification. Basic features, such as vocabulary words, are not enough to classify sentiments well. Deep Belief Network (DBN) is introduced to discover more abstract features of sentiments. To capture full information of the features, large-size network can be constructed, but at the same time, large-size network tends to over fit the training data and even noise, which will reduce the generalization ability of the network. In this paper, L2-norm Deep Belief Network (L2DBN) is proposed, which uses L2-norm regularization to optimize the network parameters of DBN. L2DBN is first initialized by an unsupervised layer-wise training algorithm, and then fine-tuned by a supervised procedure. Network parameters are optimized using both classification loss and network complexity. Experimental results show that the proposed L2DBN outperforms the state-of-the-art method and the basic DBN on golden, noisy and heterogeneous datasets. © 2011 ACM.

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

A practice probability frequent pattern mining method over transactional uncertain data streams

A practice probability frequent pattern mining method over t...

引用

Lecture Notes in Computer Science

作者： Liao, Guoqiong Wu, Linqing Wan, Changxuan Xiong, Naixue School of Information Technology Jiangxi University of Finance and Economics Nanchang 330013 China Jiangxi Key Laboratory of Data and Knowledge Engineering Nanchang 330013 China Department of Computer Science Georgia State University United States

ISBN: (纸本)9783642236402

In recent years, large amounts of uncertain data are emerged with the widespread employment of the new technologies, such as wireless sensor networks, RFID and privacy protection. According to the features of the uncertain data streams such as incomplete, full of noisy, non-uniform and mutable, this paper presents a probability frequent pattern tree called PFP-tree and a method called PFP-growth, to mine probability frequent patterns based on probability damped windows. The main characteristics of the suggested method include: (1) adopting time-based probability damped window model to enhance the accuracy of mined frequent patterns;(2) setting an item index table and a transaction index table to speed up retrieval on the PFP-tree;and (3) pruning the tree to remove the items that cannot become frequent patterns;. The experimental results demonstrate that PFP-growth method has better performance than the main existing schemes in terms of accuracy, processing time and storage space. © 2011 Springer-Verlag.

关键词： Probability

来源：评论

学校读者我要写书评

暂无评论

K-nearest neighbors in uncertain graph

引用

Jisuanji Yanjiu yu Fazhan/Computer Research and Development 2011年第10期48卷 1850-1858页

作者： Zhang, Yinglong Li, Cuiping Chen, Hong Du, Lingxia Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China Ministry of Education Beijing 100872 China School of Computer and Information Engineer Jiangxi Agriculture University Nanchang 330045 China

In many areas, a lot of data have been modeled by graphs which are subject to uncertainties, such as molecular compounds and protein interaction networks. While many real applications, for example, collaborative filtering, fraud detection, and link prediction in social networks etc, rely on efficiently answering k-nearest neighbor queries (kNN), which is the problem of computing the most "similar" k nodes to a given query node. To solve the problem, in this paper a novel method based on measurement of SimRank is proposed. However, because graphs evolve over time and are uncertainly, the computing cost can be very high in practice to solve the problem using the existing algorithms of SimRank. So the paper presents an optimization algorithm. Introducing path threshold, which is suitable in both determined graph and uncertain graph, the algorithm merely considers the local neighborhood of a given query node instead of whole graph to prune the search space. To further improving efficiency, the algorithm adopts sample technology in uncertain graph. At the same time, theory and experiments interpret and verify that the optimization algorithm is efficient and effective.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

On Mutual Support of Modern and Traditional Access Control Models with UCON and BLP as Case Study

On Mutual Support of Modern and Traditional Access Control M...

引用

WRI International Conference on Communications and Mobile Computing, CMC

作者： Hui Feng Wenchang Shi Zhaohui Liang Bin Liang School of Information Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education Renmin University of China Beijing China

Access control is essential to computer security, especially in an open, distributed, networked communication environment. Modern access control model such as UCON aims at accommodating general requirements. Traditional one such as BLP focuses on specific properties, e.g. confidentiality. Both of these two realms have their limitations. Taking UCON and BLP as case study, this paper explores mutual support of modern and traditional access control models. It investigates BLP's adaptable characteristic in the UCON perspective. First, it constructs properties in the UCON language to manifest the BLP adaptability, which shows that the BLP adaptability can be ensured to function correctly by the UCON framework. Further, it proposes a formal specification for the BLP adaptability under the UCON framework with the Temporal Logic of Actions, which demonstrates that the BLP adaptability is in good consistency with the UCON model. The significance of the paper is twofold. On the one hand, it exhibits that adaptable quality of the traditional BLP model may be ensured theoretically by the philosophy of modern access control. On the other hand, it enriches the real sense of modern access control models by strengthening the power of traditional access control models.

关键词： Adaptation model Sensitivity Authorization Permission Computational modeling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：