突发事件网络谣言危机预警及模拟仿真研究

[目的/意义] 提前进行网络谣言监控和预警是立体化防控网络谣言、增强社会稳定、提高政府执政能力的关键。移动互联网时代,突发事件发生后极易在网络上引起热点舆情、网络危机信息的传播同时为网络谣言的扩散提供良好的土壤,无形中增大了政府部门应对谣言的挑战。[方法/过程] 本文采用遗传算法优化BP神经网络构建网络谣言危机预警模型,拟实现对突发事件网络谣言的监控、预警仿真及风险的量化评估。实证分析案例选取天津"8·12"爆炸事故与"和颐酒店女生遇袭事件",通过计算机对这两起突发事件衍生的网络谣言建立预警模型,并对模拟仿真结果进行验证。[结果/结论] 结果表明,遗传算法优化BP神经网络模型在突发事件网络谣言危机预警方面具有较好的适用性,与仅采用BP神经网络模型相比预警的准确性更好。     

不正常航班恢复模型的贪婪模拟退火算法研究

为解决不正常航班恢复对航空公司带来的严重影响,研究了不正常航班恢复模型及其优化算法,对现有不正常航班恢复优化模型提出适当改进,重点设计了一种贪婪模拟退火算法。算法融合了GRASP和模拟退火算法的特点,提高了领域解的选择效率并且降低了陷入局部最优解的概率。实例证明这种算法可以处理大规模的不正常航班恢复问题,并且能够达到时间代价与结果质量的均衡。     

On the task assignment with group fairness for spatial crowdsourcing

Task assignment, the core problem of Spatial Crowdsourcing (SC), is often modeled as an optimization problem with multiple constraints, and the quality and efficiency of its solution determines how well the SC system works. Fairness is a critical aspect of task assignment that affects worker participation and satisfaction. Although the existing studies on SC have noticed the fairness problem, they mainly focus on fairness at the individual level rather than at the group level. However, differences among groups in certain attributes (e.g. race, gender, age) can easily lead to discrimination in task assignment, which triggers ethical issues and even deteriorates the quality of the SC system. Therefore, we study the problem of task assignment with group fairness for SC. According to the principle of fair budget allocation, we define a well-designed constraint that can be considered in the task assignment problem of SC systems, resulting in assignment with group fairness. We mainly consider the task assignment problem in a common One-to-One SC system (O2-SC), and our goal is to maximize the quality of the task assignment while satisfying group fairness and other constraints such as budget and spatial constraints. Specifically, we first give the formal definition of task assignment with group fairness constraint for O2-SC. Then, we prove that it is essentially an NP-hard combinatorial optimization problem. Next, we provide a novel fast algorithm with theoretical guarantees to solve it. Finally, we conduct extensive experiments using both synthetic and real datasets. The experimental results show that the proposed constraint can significantly improve the group fairness level of algorithms, even for a completely random algorithm. The results also show that our algorithm can efficiently and effectively complete the task assignment of SC systems while ensuring group fairness.     

Reviewer assignment algorithms for peer review automation: A survey

Assigning paper to suitable reviewers is of great significance to ensure the accuracy and fairness of peer review results. In the past three decades, many researchers have made a wealth of achievements on the reviewer assignment problem (RAP). In this survey, we provide a comprehensive review of the primary research achievements on reviewer assignment algorithm from 1992 to 2022. Specially, this survey first discusses the background and necessity of automatic reviewer assignment, and then systematically summarize the existing research work from three aspects, i.e., construction of candidate reviewer database, computation of matching degree between reviewers and papers, and reviewer assignment optimization algorithm, with objective comments on the advantages and disadvantages of the current algorithms. Afterwards, the evaluation metrics and datasets of reviewer assignment algorithm are summarized. To conclude, we prospect the potential research directions of RAP. Since there are few comprehensive survey papers on reviewer assignment algorithm in the past ten years, this survey can serve as a valuable reference for the related researchers and peer review organizers.     

北京高校馆际文献传递服务用户兴趣关联研究

[目的/意义]关联数据分析和个性化信息推送是图书馆联盟建设的重要内容。文章引入关联分析挖掘技术为北京地区高校图书馆联盟馆际文献传递中的个性化推送服务提出建议。[方法/过程]以2018年BALIS北京地区高校图书馆文献传递服务数据为基础,对不同专业用户群体和不同高校用户群体文献传递申请单数据进行分析,并利用FP-growth关联分析算法技术对数据进行相关系数分析。[结果/结论]数据挖掘结果较好地挖掘出北京地区各高校图书馆用户的跨校、跨专业文献借阅偏好,可实现有效和有针对性的文献推荐服务,同时能够为区域图书馆联盟的资源共建共享提供数据参考。     

MINRES法和有限元法解奇摄动反应扩散方程

讨论奇摄动反应扩散方程 的数值逼近求解问题, 及 均为正实数. 利用有限元方法并结合最小残量法, 给出求解该问题的一个新方 法, 该方法修正了单纯采用有限元方法求解时在边界附近呈现出的非正常扰动的 现象, 避免了因为 过小所引起的解的变异, 从而得到更加精确的数值结果.     

基于演化算法的高校课程排课系统的研究与实现

提出了基于演化算法高校课程排课系统的方法,以课程为排课核心,以授课计划为排课依据,利用演化算法建立起有效地数据模型.通过实验验证,该算法能够结合高校实际情况,自动地找到了解决排课问题的模型,具有一定的通用性.     

基于遗传算法的高校排课系统设计与实现

随着高等教育的发展,学生人数不断增加,而教室资源和教师资源有可能相对有限,排课就成为教学管理中十分重要且又相当繁重的工作之一。文章根据高校排课特点,在对排课系统及遗传算法基本理论分析的基础上,使用基本遗传算法SGA,设计并开发出了一个基于B/S模式的排课系统CAS,以满足高校教学管理工作不断发展的需要。     

非结构化数据分类整合在贵州项目网中的设计与实现

针对贵州项目网中非结构数据量大的特点和不易管理的问题,文章采用了基于遗传算法分类的方法和数据库管理的方法对贵州项目网进行了数据管理的重构设计并在贵州项目网建设中得以实践。结果表明基于遗传算法分类与数据库管理适用于整合管理大量的非结构数据。     

八数码问题的搜索算法比较

搜索策略是人工智能研究的主攻方向之一,采用不同的搜索策略在求解问题的过程中也会存在差异.通过对于八数码的搜索求解分析,采用盲目搜索中的广度优先搜索算法和启发式搜索中的A*算法进行实现,将广度优先搜索算法与A*算法进行比较,从而评价这两种搜索算法的优劣性.