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

12th International Conference on Autonomous Agents and Multiagent Systems 2013, AAMAS 2013

作者： Yu, Han Shen, Zhiqi Miao, Chunyan An, Bo School of Computer Engineering Nanyang Technological University Singapore 639798 Singapore Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China

ISBN: (纸本)9781627487665

A crowdsourcing system is a useful platform for utilizing the intelligence and skills of the mass. Nevertheless, like any open system that involves the exchange of things of value, selfish and malicious behaviors exist in crowdsourcing systems and need to be mitigated. Trust management has been proven to be a viable solution in many systems. However, a major difference between crowdsourcing systems and existing trust models designed for multi-agent systems is that human trustees have limited task processing capacity per unit time compared to an intelligent agent program. This paper recognizes a problem in current trust-aware decision-making methods for task assignment in crowdsourcing platforms. On the one hand, trust-based methods over-assign tasks to trusted workers, while on the other hand, workload-based solutions do not give sufficient guarantees on the quality of work. The proposed solution, the social welfare optimizing reputation-aware decision-making (SWORD) approach, strikes a balance between the two and is shown through extensive simulations to significantly improve social welfare of crowdsourcing platforms compared to related work. Copyright © 2013, International Foundation for Autonomous Agents and Multiagent Systems (***). All rights reserved.

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

The maximal relation based on a given relation schema and its concept lattice

Journal of Software

引用

Journal of Software 2013年第6期8卷 1308-1315页

作者： Lei, Yuxia Sui, Yuefei Tian, Jingying School of Computer Science Qufu Normal University Yantai Street 80 Rizhao 276826 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China School of Architectual Engineering Rizhao Politechnic Rizhao 276826 China

Formal concept analysis (FCA) is a valid tool for data mining and knowledge discovery, which identifies concept lattices from binary relations. Given a nonempty finite set A of binary attributes, one obtains a maximal binary relation Rmax based on a relation schema S(A). Firstly, we analyze concepts in Rmax and the concept lattice L(Rmax), and there are some important results as follows: for any two concepts in Rmax, the union of their intents is an intent of some concept in Rmax, and further the intent of their supremum is the union of their intents;for any two concepts in Rmax, if one of them is not a sub-concept or super-concept of the other one, then the union of their extents is not an extent of any concept in Rmax;L(Rmax) is a complemented distributive lattice. Secondly, we provide the structural connection between L(R) and L(Rmax): for any relation R based on S(A), there is a supremum-preserving order-embedding map from L(R) to L(Rmax), and conversely, there is an infimum-preserving order-preserving map from L(Rmax) to L(R), which is generally not a surjective homomorphism. Thirdly, we propose two algorithms to extract concepts in R from L(Rmax), which are respectively based on intents and extents of concepts, and prove their soundness. These results have already been used to analyze the data in architectual engineering and medical science. © 2013 ACADEMY PUBLISHER.

关键词： Formal concept analysis

来源：评论

学校读者我要写书评

暂无评论

Bilingual lexical cohesion trigger model for document-level machine translation

Bilingual lexical cohesion trigger model for document-level ...

引用

51st Annual Meeting of the Association for Computational Linguistics, ACL 2013

作者： Ben, Guosheng Xiong, Deyi Teng, Zhiyang Lü, Yajuan Liu, Qun Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences China School of Computer Science and Technology Soochow University China Centre for Next Generation Localisation Dublin City University Ireland

ISBN: (纸本)9781937284510

In this paper, we propose a bilingual lexical cohesion trigger model to capture lexical cohesion for document-level machine translation. We integrate the model into hierarchical phrase-based machine translation and achieve an absolute improvement of 0.85 BLEU points on average over the baseline on NIST Chinese-English test sets. © 2013 Association for Computational Linguistics.

关键词： Machine translation

来源：评论

学校读者我要写书评

暂无评论

A novel method for geographical social event detection in social media 13

A novel method for geographical social event detection in so...

引用

5th International Conference on Internet Multimedia computing and Service, ICIMCS 2013

作者： Gao, Xingyu Cao, Juan He, Qin Li, Jintao Institute of Computing Technology Chinese Academy of Sciences Beijing China Key Laboratory of Intelligent Information Processing Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9781450322522

Popular microblogging service has attracted much attention around the world recently. With tremendous amount of tweets published each day, social event detection is becoming one of the most challenging research topics, especially for geographical social event. This paper proposes a novel geographical social event detection approach by mining geographical temporal pattern and analyzing the content of tweets. For the tweets published by users in the geographical area at each time unit, we first estimate its geographical temporal pattern based on the alternation regularity of tweets. Furthermore, we discovery the unusual geographical area by more frequent alternation of tweet count, and adopt adaptive K-means clustering algorithm for the tweets published in the geographical area. Finally, the geographical social event is detected by the number of the tweets in the cluster. We implement and validate our approach on realistic data collected from real-world social media websites. Experimental results show that our method can detect geographical social event with better performance than traditional methods. In addition, vivid demonstration of geographical social event can be effectively performed by our method. © 2013 ACM.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Stem translation with affix-based rule selection for agglutinative languages

Stem translation with affix-based rule selection for aggluti...

引用

51st Annual Meeting of the Association for Computational Linguistics, ACL 2013

作者： Wangt, Zhiyang Lü, Yajuan Sun, Meng Liu, Qun Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences P.O. Box 2704 Beijing 100190 China Centre for Next Generation Localisation Faculty of Engineering and Computing Dublin City University Ireland

ISBN: (纸本)9781937284510

Current translation models are mainly designed for languages with limited morphology, which are not readily applicable to agglutinative languages as the difference in the way lexical forms are generated. In this paper, we propose a novel approach for translating agglutinative languages by treating stems and affixes differently. We employ stem as the atomic translation unit to alleviate data spare-ness. In addition, we associate each stem-granularity translation rule with a distribution of related affixes, and select desirable rules according to the similarity of their affix distributions with given spans to be translated. Experimental results show that our approach significantly improves the translation performance on tasks of translating from three Turkic languages to Chinese. © 2013 Association for Computational Linguistics.

关键词： Translation (languages)

来源：评论

学校读者我要写书评

暂无评论

Granular computing in visual haze-free task

Granular computing in visual haze-free task

引用

IEEE International Conference on Granular computing (GRC)

作者： Hong Hu Liang Pang Dongping Tian Zhongzhi Shi Key Laboratory of Intelligent Information Processing Institute of Computing Technology Beijing China

ISBN: (纸本)9781479912803

In the past decade, granular computing (GrC) has been an active topic of research in machine learning and computer vision. However, the granularity division is itself an open and complex problem. Deep learning, at the same time, has been proposed by Geoffrey Hinton, which simulates the hierarchical structure of human brain, processes data from lower level to higher level and gradually composes more and more semantic concepts. The information similarity, proximity and functionality constitute the key points in the original insight of granular computing proposed by Zadeh. Many GrC researches are based on the equivalence relation or the more general tolerance relation, either of which can be described by some distance functions. The information similarity and proximity depended on the samples distribution can be easily described by the fuzzy logic. From this point of view, GrC can be considered as a set of fuzzy logical formulas, which is geometrically defined as a layered framework in a multi-scale granular system. The necessity of such kind multi-scale layered granular system can be supported by the columnar organization of the neocortex. So the granular system proposed in this paper can be viewed as a new explanation of deep learning that simulates the hierarchical structure of human brain. In view of this, a novel learning approach, which combines fuzzy logical designing with machine learning, is proposed in this paper to construct a GrC system to explore a novel direction for deep learning. Unlike those previous works on the theoretical framework of GrC, our granular system is abstracted from brain science and information science, so it can be used to guide the research of image processing and pattern recognition. Finally, we take the task of haze-free as an example to demonstrate that our multi-scale GrC has high ability to increase the texture information entropy and improve the effect of haze-removing.

关键词： Visualization Organizations Fuzzy logic information entropy Pattern recognition Vectors Entropy

来源：评论

学校读者我要写书评

暂无评论

Triplex transfer learning: Exploiting both shared and distinct concepts for text classification 13

Triplex transfer learning: Exploiting both shared and distin...

引用

6th ACM International Conference on Web Search and Data Mining, WSDM 2013

作者： Zhuang, Fuzhen Luo, Ping Du, Changying He, Qing Shi, Zhongzhi Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China Hewlett-Packard Labs. Beijing China Graduate University Chinese Academy of Sciences China

ISBN: (纸本)9781450318693

Transfer learning focuses on the learning scenarios when the test data from target domains and the training data from source domains are drawn from similar but different data distribution with respect to the raw features. Some recent studies argued that the high-level concepts (e.g. word clusters) can help model the data distribution difference, and thus are more appropriate for classification. Specifically, these methods assume that all the data domains have the same set of shared concepts, which are used as the bridge for knowledge transfer. However, besides these shared concepts each domain may have its own distinct concepts. To address this point, we propose a general transfer learning framework based on non-negative matrix tri-factorization which allows to explore both shared and distinct concepts among all the domains simultaneously. Since this model provides more flexibility in fitting the data it may lead to better classification accuracy. To solve the proposed optimization problem we develop an iterative algorithm and also theoretically analyze its convergence. Finally, extensive experiments show the significant superiority of our model over the baseline methods. In particular, we show that our method works much better in the more challenging tasks when distinct concepts may exist. © 2013 ACM.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Enhancing ability of fault detection for component systems based on object interactions graph

Enhancing ability of fault detection for component systems b...

引用

2012 International Conference on Emerging Technologies for information Systems, computing, and Management, ICM 2012

作者： Sun, Fuzhen Liao, Lejian Du, Jianguang Li, Guoqiang Beijing Eng. Res. Ctr. of High Vol. Language Information Processing and Cloud Computing Applications Beijing Key Laboratory of Intelligent Information Technology School of Computer Science Beijing China School of Computer Science and Technology Shandong University of Technology Zibo China

ISBN: (纸本)9781461470090

Test case prioritization is a technique to schedule the test case in order to maximize some objective function. Early fault detection can provide a faster feedback generating a scope for debuggers to carry out their task at an early stage. In this paper, a method is proposed to prioritize the test cases for testing component dependency in a Component Based Software Development (CBSD) environment using Greedy Approach. The OIG (Object Interaction Graph) is traversed to calculate the total number of inter component object interactions and intra component object interactions. Depending upon the number of interactions, the objective function is calculated and the test cases are ordered accordingly. This technique is applied to the components developed in Java for a software system and found to be very effective in early fault detection as compared with non-prioritize approach. © 2013 Springer Science+Business Media New York.

关键词： Fault detection

来源：评论

学校读者我要写书评

暂无评论

Adaptive Particle Filter with Estimation Windows

Adaptive Particle Filter with Estimation Windows

引用

2013年中国智能自动化学术会议

作者： Peng Li Jian Tang College of Information and Technology Key Laboratory of Intelligent Computing and Information ProcessingMinistry of EducationXiangtan University

Particle filter is well suited to estimate the state of non-linear non-Gaussian dynamic systems,which comes at the cost of higher computational *** in many real time applications,it must deal with constraints imposed by limited computational *** deal with this question,we distribute the samples among the different observations arriving during a filter update, the novel algorithm represents densities over the state space by mixtures of sample *** contribution of this paper is to increasing the efficiency of particle filters by adapting the size of sample sets during the estimation *** to the relative entropy theory and particle number controller idea,we choose the number of samples,decrease computation overhead.A simulation of the classic HARD bearing only tracking problem is presented,the results show that the novel algorithm performs better than generic particle filter.

关键词： Particle filter Estimation window Relative entropy Particle number controller

来源：评论

学校读者我要写书评

暂无评论

Celerity Hardware Implementation of the AES with Data Parallel and Pipelining Architecture inside the Round Function

Celerity Hardware Implementation of the AES with Data Parall...

引用

IEEE International Conference on Trust, Security and Privacy in computing and Communications (TrustCom)

作者： Shouwen Yang Hui Li Xiaotao Zhang Gang Zhao Information Security and Intelligent Computing Laboratory Beijing University of Chemical Technology Beijing China

ISBN: (纸本)9781479914449

Since it was accepted as the replacement of the Data Encryption Standard (DES) and 3 DES by NIST in 2001, the AES has played a major role in various security-constrained applications. Many applications are power-saving, resource constrained and require high-speed. AES is precisely suitable for being implemented in both software and hardware applications. Hardware implementation of AES has the advantage of increased throughput and better security. On the basis of those facts, in this paper, different hardware architectures of AES have been presented and surveyed. And we present a way of data parallel to deal with the bulk data of plaintext or cipertext, which brings lower clock cycles and increased working frequencies. Pipelining architecture inside the round function also contributed a lot to the promotion of data throughput. Moreover, the key schedule algorithm is pipelined to get the speedup, and the S-boxes which are based on look-up tables (LUTs) could be area-efficient. By conducting ALTERA FPGA realization and ModelSim simulation, we analyze the performance relating to the Slice registers, gate-level netlists, memory, Slice LUTs and so on.

关键词： Hardware Clocks Registers Throughput Pipeline processing Encryption

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：