ABSTRACT KATIRA, NEHA ANUPKUMAR. Understanding the Compatibility of Pair Programmers.
- 格式:pdf
- 大小:2.39 MB
- 文档页数:96


第 22卷 第 11期2023年 11月Vol. 22 No. 11Nov. 2023软件导刊Software Guide
一种基于邻域与位置时间感知的会话推荐方法
谭小辉,祁正华,张海桃,何菲菲
(南京邮电大学 计算机学院、软件学院、网络空间安全学院,江苏 南京 210023)
摘要: 针对现有基于邻域的会话推荐方法忽略了整个会话的一般偏好、当前偏好以及匿名用户误点行为等问题,提出一种基于邻域与位置时间感知的会话推荐方法。该推荐方法考虑了3个因素,分别是项目在当前会话中的持续时间及位置、会话之间的时间相关性和邻居会话中候选项目的持续时间及位置。在和Adressa两个公共新闻数据集上将该推荐方法与基准方法进行对比实验,结果表明,与表现最好的基准方法相比,该推荐方法在HR@20和NDCG@20指标上均有所提升。特别是在数据集上,HR@20和NDCG@20指标分别提升了4.3%与7.0%,表明该方法能有效提升推荐效果。关键词: 会话推荐;位置感知推荐;时间相关性;误点行为DOI:10.11907/rjdk.222448开放科学(资源服务)标识码(OSID):
中图分类号:TP311 文献标识码: A文章编号:1672-7800(2023)011-0091-07
A Session Recommendation Method Based on Neighborhood and Position
Time Awareness
TAN Xiaohui, QI Zhenghua, ZHANG Haitao, HE Feifei
(School of Computer Science, Nanjing University of Posts and Telecommunications, Nanjing 210023, China)
Abstract: Aiming at the problem that the existing neighborhood-based session recommendation methods ignore the general preference, cur‑rent preference, and anonymous user misclick behavior of the whole session. A session recommendation method based on neighborhood and po‑sition time awareness is proposed. The proposed recommendation method considers three factors, namely the duration and location of items in the current session, temporal correlation between sessions, and the lasting time and position of candidate items in neighboring sessions. Exper‑imenting with the recommendation method with the benchmark method on two public news datasets, and Adressa, the experimental results show that the recommendation method improves on both HR@20 and NDCG@20 metrics compared to the best-performing benchmark method. Especially on the dataset,theHR@***************************************%and7.0%, respectively, indicat‑ing that the proposed method can effectively improve the recommendation effect.
第 4 期第 183-191 页材料工程Vol.52Apr. 2024Journal of Materials EngineeringNo.4pp.183-191第 52 卷2024 年 4 月
两性离子-阴离子双交联P(AAm-co-
AAc-co-SBMA-co-AMPS)/Fe3+
水凝胶的摩擦学性能研究
Tribological properties of zwitterionic-anionic
dual-crosslinked P(AAm-co-AAc-co-
SBMA-co-AMPS)/Fe3+ hydrogel
李子恒1,王斌斌1,尤德强1,李卫1,王小健1,2*
(1 暨南大学 先进耐磨蚀及功能材料研究院,广州 510632;2 暨南大学 韶关研究院,广东 韶关 512029)LI Ziheng1,WANG Binbin1,YOU Deqiang1,LI Wei1,WANG Xiaojian1,2*
(1 Advanced Wear & Corrosion Resistant and Functional Materials,Jinan University,Guangzhou 510632,China;2 Shaoguan Research
Institute of Jinan University,Shaoguan 512029,Guangdong,China)
摘要:水凝胶是一种理想的软骨修复材料,但目前很难有人工材料能实现软骨的超低摩擦因数。使用两性离子单体 [2-(甲基丙烯酰氧基)乙基]二甲基-(3-磺丙基)(SBMA)和阴离子单体2-丙烯酰氨基-2-甲基丙磺酸(AMPS)合成一种两性离子-阴离子双交联P(AAm-co-AAc-co-SBMA-co-AMPS)/Fe3+水凝胶。在水和PBS中进行摩擦学测试,以评估两性离子和阴离子基团对摩擦因数(CoF)的影响。结果表明:SBMA和AMPS引入的物理交联点可以提高水凝胶的抗压强度,在水中实现了较低CoF(0.04);此外,在PBS中观察到CoF进一步降低至0.015,CoF的降低是由于水凝胶在PBS中浸泡产生的高度水合上层所造成的。关键词:水凝胶;润滑;承重;摩擦;软骨修复doi: 10.11868/j.issn.1001-4381.2023.000158
On the Ubiquity of Logging in Distributed File Systems
M. Satyanarayanan
James J. Kistler
Puneet Kumar
Hank Mashburn
School of Computer Science
Carnegie Mellon University
Pittsburgh, PA 15213
Logging is a simple yet surprisingly versatile and powerful implementation technique. Since its invention and
popularization as a recovery technique for transactional databases [3], it has been used for a variety of other
purposes such as updating meta-data in file systems [4], exploiting write-once media [2, 12], maintaining
authentication audit trails [10], and increasing the write bandwidth of disks [9].
In this position paper we describe how logging in different guises is used in the Coda File System [5, 11]. Coda is a
distributed file system whose goals are to provide highly available, scalable, secure and efficient shared file access
Journal of Computer Applications 计算机应用,2012,32(7):1994—1997 ISSN 10o1.9081 C0DEN JYIIDU 2012..07..01 http://www.joca.cn
文章编号:1001—9081(2012)07—1994—04 doi:10.3724/SP.J.1087.2012.01994
基于双索引的近似子图匹配
黄云 ,洪佳明 ,覃遵跃
(1.吉首大学软件服务外包学院,湖南张家界427000; 2.中山大学信息科学与技术学院,广州510006) ( 通信作者电子邮箱hongjiaming8888@gmail.con)
摘要:越来越多的大型复杂网络使得图结构的研究变得日益重要,其中近似子图查询备受关注。为了提高查
询效率,利用顶点的邻接关系特征为每个顶点建立索引,减少了匹配顶点的数量;并基于结构和标签对大型数据图进
行划分,缩小了匹配时的搜索空间。利用离线时建立的双索引,查询时首先利用顶点间的近邻关系判定公式过滤掉 大量不满足匹配关系的候选顶点,然后在一定的划分空间中进行边的匹配。真实数据集中的实验表明,与单纯的划
分方法或近邻关系索引相比较,双索引机制对于查询的效率和准确率方面均有明显改善。
关键词:图结构;近似匹配;近邻关系;图划分;双索引
中图分类号:TP311 文献标志码:A
Approximate subgraph matching based on dual index
HUANG Yun 一,HONG Jia—ming ,QIN Zun-yue ,
(1.School ofSoftware,Jishou University,Zhangjiafie Hunan 427000,China; 2.School of Information Science and Technology,Sun Yat-sen University,Guangzhou Guangdong 5 10006,China)