Group dynamics and record signals in the ant Temnothorax albipennis

Many purely physical complex systems, in which there are both stochasticity and local interactions between the components, exhibit record dynamics. The temporal statistics of record dynamics is a Poisson process operating on a logarithmic rather than a linear time scale (i.e. a log-Poisson process). Record dynamics often drive substantial changes in complex systems when new high water marks in partially stochastic processes trigger new events. Social insect colonies are exemplary complex biological systems in which many of the local interactions of the components have been moulded by natural selection for the common good. Here, we combine experimental manipulation of ant colony demography with modelling to test the hypothesis that social interactions are the mechanism underlying the record dynamics. We found that compared with the control, log-Poisson statistics were disrupted in colonies in which the pattern of interactions was modified by the removal of the brood, and disappeared completely in ‘callow’ colonies composed entirely of very young workers from the same age cohort. We conclude that a subtle interplay between the demography of the society and the pattern of the interactions between the ants is crucial for the emergence of record dynamics. This could help identify what makes an ant colony a cohesive society.     

廉租房建设的管理体系研究

利用房地产市场运作过程中的理论、规律和社会保障体系的理论观点,对廉租房建设的管理体系进行全面系统的研究,提出了管理体系构成的设想;并对构成这一体系的每一部分进行详细分析,设计出多种可供选择的方案,对廉租房建设开展的实施程序和策略提出了建设性的意见。     

Cooperative caching game based on social trust for D2D communication networks

Content sharing via device‐to‐device (D2D) communications has become a promising method to increase system throughput and reduce traffic load. Due to the characteristic of spectrum sharing in D2D network, confidentiality is becoming a key issue in content transmission. Secure communication in D2D networks is generally guaranteed by a physical‐layer security mechanism. However, this method sacrifices the system transmission rate while ensuring security. Since mobile devices are carried by humans, we can leverage their trust relations to enhance the security of communications. As much, considering the psychology structure and social attributes of mobile users, we build a multidimensional trust evaluation mechanism to evaluate the trust relationship between users, and we pick out the trusted users based on the decision‐theoretic rough sets. By sharing content only between trust users, we can enhance the security of content transmissions without relying on physical‐layer security measures. Meanwhile, content caching is now widely used to improve accessing efficiency and reduce traffic load on cellular networks. However, caching content for other users incurs additional cost, which results in selfish and noncooperative behavior in users. Considering such selfishness, we introduce a cooperative caching game based on multidimensional trust relations to motivate users to cache contents for other devices. In this game, the trust relations and physical distance between two users are considered to formulate the cost function. Furthermore, we introduce an incentive caching algorithm based on social trust to minimize the total cost in the D2D network.     

基于"互联网+"模式的电网企业沟通协作研究与应用

传统的电网企业在业务处理过程中,多以流程式为主,往往存在沟通协作不充分的问题.在分析南方电网信息化建设现状的基础上,提出建立"互联网+"模式的沟通协同工作平台的设想,用户通过"互联网+"工作平台,集成各项社交功能,变单线式的沟通协作为网状式,快捷高效完成工作.详细介绍了"互联网+"协同沟通平台的设计方案,实践应用和应用效果.     

基于贪心扰动的社交网络隐私保护研究

在社交网络的数据挖掘隐私保护问题中,连接边的权重和权重的隐私保护问题是非常重要的.为此,提出一种贪心扰动的隐私保护算法,以保证社交网络初始的最短路径不变并使其长度与扰动后相接近.仿真模拟计算结果表明,这种扰乱策略符合预期的理论分析结果.     

A novel organizing scheme of single topic user group based on trust chain model in social network

Social network sites (SNS) presently face the task of grouping users into small subsets within themselves. In this study, an organizing scheme for single‐topic user groups is proposed for facilitating user sharing and communicating under common interests. The main rationales of the proposed scheme are (1) only an influential single topic is selected through its impact evaluation to attract users; (2) only the users having high degree of interest, explicit or implicit, on the topic should be grouped; and (3) trustworthy relationships among users are taken into consideration to enlarge the scale of user group. The proposed organizing scheme comprises 3 features: topic impact evaluation, interest degree measurement, and trust chain‐based organizing. The main structure of our proposed scheme is (1) an overview of the proposed scheme and its formal related definitions; (2) a topic impact evaluation method, ie, an importance evaluation and a popularity calculation; (3) a user interest degree measurement method, ie, explicit and implicit interest evaluation with dynamic factors included; (4) a trust chain calculation method based on the topology features of the trust chain; (5) an organizing algorithm for single topic user group, and finally, some experimental results and discussions to illustrate the effectiveness and feasibility of our scheme.     

基于协同矩阵分解的评分与信任联合预测

信息评分预测和信任预测是社交评价网络中的两大基本问题.为应对在提高两类基本问题预测准确性过程中遇到的评分数据与信任关系数据稀疏问题,本文提出了一种基于协同矩阵分解的信息评分与信任预测联合模型.该模型在将评分矩阵与信任关系矩阵进行协同分解时,既能保证被分解的两个矩阵分解过程共享用户潜在变量,又能兼顾两个矩阵分解过程中能够各自获得反映本领域知识相关性的表达.使用分解得到的多个相关低维潜在变量矩阵乘积即可做出评分与信任两个问题的预测.两个真实网络数据集上的实验验证了提出模型有效性和先进性.     

基于迁移学习的唐诗宋词情感分析

随着计算社会学的兴起,利用数据挖掘分析社会情感是近期的研究重点.当前的研究主要针对现代文本,对于古代诗歌这类短文本的情感分析相对较少.本文提出了一个基于短文本特征扩展的迁移学习模型CATL-PCO,通过分析诗歌情感对当时社会及文化进行进一步了解.该模型首先基于频繁词对对古文特征向量进行扩展,再通过迁移学习方式,建立三个分类器并投票得出最后的情感分析结果.CATL-PCO模型首先能够解决古文短文本特征稀疏的问题,在此基础上进一步解决由于现代译文信息匮乏所导致的古代诗歌情感分析困难问题,从而准确的分析古诗词情感倾向,从计算社会学的角度,增进对中国历史的认识.实验表明,当训练集为中国唐诗时,本文提出方法能够准确的对唐代诗歌进行情感分类,并能应用于唐代和宋代各个时期情感分析及代表流派分析.     

基于SEIR的社交网络信息传播模型

结合传染病动力学的SEIR模型,本文建立了适用于社交网络的信息传播模型。该模型基于社交网络用户的行为特征,分析了社交网络的传播机理和网络参数对信息传播过程的影响,得出了动力学演化方程组,刻画了信息传播过程随时间的演化规律。仿真实验的结果表明,本文提出的模型能正确地反映社交网络上的信息传播的趋势,较为准确地描述信息传播过程。     

位置社交网络的潜在好友推荐模型研究

为了提高位置社交网络的服务便捷性和用户感受度,与位置相关的推荐服务越来越具有重要意义和应用需求.提出的潜在好友推荐模型主要是根据签到位置的相似度及好友相似度进行潜在用户推荐.通过用户的好友关系、签到特性及签到历史记录,计算用户在各个位置兴趣点的位置权重,再分别利用位置权重及好友关系计算用户的位置相似度和好友相似度,最后根据用户位置和好友关系的综合相似度进行潜在用户推荐.实验结果表明,提出的潜在好友推荐模型是切实有效的.