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

L-priorities Bloom Filter: A New Member of the Bloom Filter Family

International Journal of Automation and computing 2012年第2期9卷 171-176页

作者： Huang-Shui Hu Hong-Wei Zhao Fei Mi College of Computer Science and Technology Jilin University Changchun 130012 PRC Key Laboratory of Symbolic Computation and Knowledge Engineering for Ministry of Education Jilin University Changchun 130012 PRC

A Bloom filter is a space-efficient data structure used for concisely representing a set as well as membership queries at the expense of introducing false positive. In this paper, we propose the L-priorities Bloom filter （LPBF） as a new member of the Bloom filter （BF） family, it uses a limited multidimensional bit space matrix to replace the bit vector of standard bloom filters in order to support different priorities for the elements of a set. We demonstrate the time and space complexity, especially the false positive rate of LPBF. Furthermore, we also present a detailed practical evaluation of the false positive rate achieved by LPBF. The results show that LPBF performs better than standard BFs with respect to false positive rate.

关键词： Bloom filter bit space matrix false positive L-priorities time and space complexity.

来源：评论

学校读者我要写书评

暂无评论

A Generic Construction of Proxy Signatures from Certificateless Signatures

A Generic Construction of Proxy Signatures from Certificatel...

引用

International Conference on Advanced Information Networking and Applications (AINA)

作者： Lei Zhang Qianhong Wu Bo Qin Josep Domingo-Ferrer Peng Zeng Jianwei Liu Ruiying Du Shanghai Key Laboratory of Trustworthy Computing Software Engineering Institute East China Normal University Shanghai China UNESCO Chair in Data Privacy Department of Computer Engineering and Mathematics Universitat Rovira i Virgili Tarragona Spain Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education School of Computer Wuhan University China Department of Maths School of Science Xi'an University of Technology China School of Electronic and Information Engineering Beijing University of Aeronautics and Astronautics China

The primitive of proxy signatures allows the original signer to delegate proxy signers to sign on messages on behalf of the original signer. It has found numerous applications in distributed computing scenarios where delegation of signing rights is common. Certificate less public key cryptography eliminates the complicated certificates in traditional public key cryptosystems without suffering from the key escrow problem in identity-based public key cryptography. In this paper, we reveal the relationship between the two important primitives of proxy signatures and certificate less signatures and present a generic conversion from the latter to the former. Following the generic transformation, we propose an efficient proxy signature scheme with a recent certificate less signature scheme.

关键词： Artificial intelligence Bismuth Games Public key cryptography educational institutions

来源：评论

学校读者我要写书评

暂无评论

Combining spatial cloaking and dummy generation for location privacy preserving

Combining spatial cloaking and dummy generation for location...

引用

8th International Conference on Advanced data Mining and Applications, ADMA 2012

作者： Xu, Nana Zhu, Dan Liu, Hongyan He, Jun Du, Xiaoyong Liu, Tao Key Labs. of Data Engineering and Knowledge Engineering Ministry of Education China School of Information Renmin University of China China Department of Management Science and Engineering Tsinghua University China

ISBN: (纸本)9783642355264

Location privacy preserving is attracting more and more attentions with the wide use of accurate positioning devices. Two kinds of methods based on k-anonymity have been proposed for location privacy preserving. One is spatial cloaking and the other is dummy generation. However, simple cloaking may result in large cloaking region, especially when user distribution is sparse. Large cloaking region means low efficiency and high time cost. Dummy generation will also arouse great extra system cost. In this paper, we propose an approach that combines the two techniques to achieve an ideal complement. On one hand, cloaking algorithm is used to blur precise location into a region so that location privacy can be well protected. On the other hand, to those users whose cloaking region is large, generating limited number of dummies can help decrease the size of region. The effectiveness of our methods has been demonstrated by comprehensive experiments. © Springer-Verlag 2012.

关键词： Location

来源：评论

学校读者我要写书评

暂无评论

A parallel scheduling algorithm for reinforcement learning in large state space

引用

Frontiers of Computer Science 2012年第6期6卷 631-646页

作者： Quan LIU Xudong YANG Ling JING Jin LI Jiao LI Institute of Computer Science and Technology Soochow UniversitySuzhou 215006China Department of Computer Science and Technology Nanjing UniversityNanjing 210093China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin UniversityChangchun 130012China

The main challenge in the area of reinforcement learning is scaling up to larger and more complex problems. Aiming at the scaling problem of reinforcement learning, a scalable reinforcement learning method, DCS-SRL, is proposed on the basis of divide-and-conquer strategy, and its convergence is proved. In this method, the learning problem in large state space or continuous state space is decomposed into multiple smaller subproblems. Given a specific learning algorithm, each subproblem can be solved independently with limited available resources. In the end, component solutions can be recombined to obtain the desired result. To ad- dress the question of prioritizing subproblems in the scheduler, a weighted priority scheduling algorithm is proposed. This scheduling algorithm ensures that computation is focused on regions of the problem space which are expected to be maximally productive. To expedite the learning process, a new parallel method, called DCS-SPRL, is derived from combining DCS-SRL with a parallel scheduling architecture. In the DCS-SPRL method, the subproblems will be distributed among processors that have the capacity to work in parallel. The experimental results show that learning based on DCS-SPRL has fast convergence speed and good scalability.

关键词： divide-and-conquer strategy parallel schedule scalability large state space continuous state space

来源：评论

学校读者我要写书评

暂无评论

Predicting retweet behavior in Weibo social network

Predicting retweet behavior in Weibo social network

引用

13th International Conference on Web Information Systems engineering, WISE 2012

作者： Zhang, Hongbo Zhao, Qun Liu, Hongyan Xiao, Ke He, Jun Du, Xiaoyong Chen, Hong Key Labs. of Data Engineering and Knowledge Engineering Ministry of Education China School of Information Renmin University of China China School of Economics and Management Tsinghua University China

ISBN: (纸本)9783642350627

Retweeting ensures the information diffusion in micro-blog services. By this simple way, it is convenient for a user to share and spread interesting information in the whole network. In this paper, we consider many features to compute the probability that a user retweets a tweet. With the probability, we build a retweet model to predict the number of possible-views of a tweet. The model is based on the theory of random walks. Experiments conducted on real dataset show that the proposed method has a good performance than the traditional prediction methods. © 2012 Springer-Verlag.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Learning the structure of dynamic bayesian network with domain knowledge

Learning the structure of dynamic bayesian network with doma...

引用

2012 International Conference on Machine Learning and Cybernetics, ICMLC 2012

作者： Chen, Juan Jia, Haiyang Huang, Yuxiao Liu, Dayou College of Computer Science and Technology Key Laboratory for Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China

ISBN: (纸本)9781467314855

Dynamic Bayesian Network (DBN) is a graphical model for representing temporal stochastic processes. Learning the structure of DBN is a fundamental step for parameter learning, inference and application. For large scale problem, the structure learning is intractable. In some domains the training data is very limited and noisy, so learning the DBN structure only with training data is impractical. Domain knowledge may improve both the efficiency and the accuracy of the learning algorithm. But usually, the domain knowledge is uncertainty, unclear and even with conflict. This paper presents a novel algorithm for learning the structure of DBN, which consider the data and domain knowledge simultaneously, empirical experiment shows that the proposed algorithm improved the efficiency and the accuracy of the DBN structure learning. © 2012 IEEE.

关键词： Bayesian networks

来源：评论

学校读者我要写书评

暂无评论

Information propagation in online social networks based on user behavior

Information propagation in online social networks based on u...

引用

3rd International Conference on Information Computing and Applications, ICICA 2012

作者： Li, Niu Han, Xiaoting Key Laboratory of Ministry of Education for Data Engineering and Knowledge Engineering Renmin University of China Beijing China School of Information Resource Management Renmin University of China Beijing China School of Economics and Management Beihang University Beijing China

ISBN: (纸本)9783642340611

Along with the development of Internet and Web2.0, online social networks (OSNs) are becoming an important information propagation platform. Therefore, it is of great significance to study the information propagation rules in OSNs. An information propagation model named IP-OSN is proposed in this paper, and some simulation experiments are carried out to investigate the mechanism of information propagation. From the experimental results, we can see that along with the information propagation, the number of known nodes increases and reaches its maximum, then keep an unchanging status. Moreover, from the user behavior aspect, we find that different user behavior in OSNs causes different information propagation results, the more users who are willing to diffuse information, the more scope the information can propagate and the faster the information diffuses. Findings in this paper are meaningful for theory of information propagation and complex networks. © 2012 Springer-Verlag.

关键词： Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

Conflict-based belief revision operators in possibilistic logic 26

Conflict-based belief revision operators in possibilistic lo...

引用

26th AAAI Conference on Artificial Intelligence and the 24th Innovative Applications of Artificial Intelligence Conference, AAAI-12 / IAAI-12

作者： Qi, Guilin Wang, Kewen Key Laboratory of Computer Network and Information Integration of State Education Ministry School of Computer Science and Engineering Southeast University China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China School of Computing and Information Technology Griffith University Australia

ISBN: (纸本)9781577355687

In this paper, we investigate belief revision in possibilistic logic, which is a weighted logic proposed to deal with incomplete and uncertain information. Existing revision operators in possibilistic logic are restricted in the sense that the input information can only be a formula instead of a possibilistic knowledge base which is a set of weighted formulas. To break this restriction, we consider weighted prime implicants of a possibilistic knowledge base and use them to define novel revision operators in possibilistic logic. Intuitively, a weighted prime implicant of a possibilistic knowledge base is a logically weakest possibilistic term (i.e., a set of weighted literals) that can entail the knowledge base. We first show that the existing definition of a weighted prime implicant is problematic and need a modification. To define a revision operator using weighted prime implicants, we face two problems. The first problem is that we need to define the notion of a conflict set between two weighted prime implicants of two possibilistic knowledge bases to achieve minimal change. The second problem is that we need to define the disjunction of possibilistic terms. We solve these problems and define two conflict-based revision operators in possibilistic logic. We then adapt the well-known postulates for revision proposed by Katsuno and Mendelzon and show that our revision operators satisfy four of the basic adapted postulates and satisfy two others in some special cases. Copyright © 2012, Association for the Advancement of Artificial Intelligence. All rights reserved.

关键词： Problem solving

来源：评论

学校读者我要写书评

暂无评论

A Framework for Personalized Management of Domain Ontologies

A Framework for Personalized Management of Domain Ontologies

引用

International Conference on Computer and Information Science (ACIS)

作者： Runnan Liu Puwei Wang Shixian Zheng Key Laboratory of Data Engineering and Knowledge Engineering of the Ministry of Education Renmin University of China Beijing China

As the sharable and reusable domain knowledge, domain ontology increasingly serves as a foundation for semantic Web. Personalized management of domain ontologies is to provide personalized views of domain ontologies to users during run time according to user preferences. It helps that users can focus on their interested parts, instead of the whole. It increases the efficiency of ontology-based application. This paper proposes a framework for personalized management of domain ontologies. In this framework, a user model firstly is introduced to describe user preferences. Secondly, domain ontologies are decomposed into moderate-scale modules with high cohesion and low coupling. During run time, modules that a user is interested in are selected out based on the user's preferences. Finally, the selected modules are combined to construct personalized views of domain ontologies for the user.

关键词： Ontologies Conferences Cognition Semantics Vectors Semantic Web

来源：评论

学校读者我要写书评

暂无评论

Quasi-periodic Solutions of the General Nonlinear Beam Equations

引用

Communications in Mathematical Research 2012年第1期28卷 51-64页

作者： GAO YI-XIAN College of Mathematics and Statistics Northeast Normal University Changchun 130024 Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012

In this paper, one-dimensional （1D） nonlinear beam equations of the form utt - uxx ＋ uxxxx ＋ mu = f （u） with Dirichlet boundary conditions are considered, where the nonlinearity f is an analytic, odd function and f（u） = O（u3）. It is proved that for all m ∈ （0, M＊]  R （M＊ is a fixed large number）, but a set of small Lebesgue measure, the above equations admit small-amplitude quasi-periodic solutions corresponding to finite dimensional invariant tori for an associated infinite dimensional dynamical system. The proof is based on an infinite dimensional KAM theory and a partial Birkhoff normal form technique.

关键词： beam equation KAM theorem quasi-periodic solution partial Birkhoffnormal form

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：