作者机构：
[阳小华; 刘朝晖; 刘杰] School of Computer Science and Technology, University of South China, Hengyang, 421001, China;[陈智; 吴志强] Science and Technology on Reactor System Design Technology Laboratory, Nuclear Power Institute of China, Chengdu, 610041, China
通讯机构：
School of Computer Science and Technology, University of South China, China
作者：
Lingyun Luo;Xinxin Liu;Xiaohua Yang;Zhiming Liu
期刊：
Journal of Computational Information Systems,2014年10(22):9597-9607 ISSN：1553-9105
通讯作者：
Luo, Lingyun
作者机构：
[Lingyun Luo; Zhiming Liu; Xiaohua Yang] School of Computer Science and Technology, University of South China, Hengyang , China;[Xinxin Liu] Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing , China
通讯机构：
School of Computer Science and Technology, University of South China, Hengyang, China
摘要：
To further explore the up-to techniques for bisimulation in the coalgebra setting, we investigate a special kind of functor, i.e., product functor in this paper. Specifically, when F is the product of n sub-functors, in order to generate an up-to proof for bisimulation, it is sufficient to find n functions, where each one is consistent with its corresponding sub-functor, as well as weakly consistent with other sub-functors. The array formed by the n functions is called jointly consistent with F. We also give the analogue of jointly consistent function in traditional set theory. As for application, examples are given both coalgebraically and set-theoretically.
摘要：
Many Studies has carried on the technology of detecting invariants, for example, Daikon can detect most of invariant by presetting some types of them. But unary polynomial inequality likely invariants are rarely discovered by traditional tools. An effective method to detect unary polynomial inequality likely invariant was proposed in this paper. Through analyzing the property of value ranges of unary polynomial inequality likely invariants, the algorithm set the threshold value and calculates neighbor distances to determine the form of invariants. Finally, experimental results are given to demonstrate the effectiveness of this method.
摘要：
Using the genre perspective, we studied the electronic communication of knowledge users collaborating on a movie community and found that their work and interactions were mediated by the use of genres. Drawing on these findings, we develop the concept of genre repertoire to designate the set of genres enacted by groups, organizations, or communities to accomplish their work. Automatic discourse classification according to genre in social information sharing, transfer and knowledge communication provides a higher level of service quality. By investigating user behavior in movie community, the relationship between intertextuality of discourse genre and user behavior was studied. We denoted genre by using vector, and discourse genre intertextuality intensity is measured with vector distance. And for those discourse which genre is unknown, genre intertextuality is calculated using user behavior. The results show that user various behaviors stickiness in movie community and discourse genre intertextuality intensity have potential common features.
摘要：
We studied the electronic communication of knowledge users collaborating on a community and found that their work and interactions were mediated by the use of tag. Drawing on these, we found social ta
摘要：
Web document clustering is one of the most important research branches of Clustering Analyzing. The objective of web document clustering is to meet the need of retrieving web document efficiently from massive information in Internet. Recently social tagging is the important form of document organization in web 2.0, and the tagging as a document descriptor is used to improve the effectiveness of web searching. But a web document usually belongs to various category of tagging, which may lead to the difficulty of browsing web document based on single tagging. This paper explores the use of Formal Concept Analysis (FCA) as mathematical tool to analyze the social tagging of web document, and presents a model for web document clustering based on tagging semantic. Furthermore, taking community web site Douban as an example, the model is applied to allow users to tag and serendipitously browse web document using Formal Concept Analysis.
