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

32nd ACM World Wide Web Conference, WWW 2023

作者： Zhu, Zhihao Wu, Chenwang Fan, Rui Lian, Defu Chen, Enhong School of Data Science University of Science and Technology of China Hefei China School of Computer Science University of Science and Technology of China Hefei China State Key Laboratory of Cognitive Intelligence Hefei China

ISBN: (纸本)9781450394161

Recent studies have demonstrated the vulnerability of recommender systems to membership inference attacks, which determine whether a user's historical data was utilized for model training, posing serious privacy leakage issues. Existing works assumed that member and non-member users follow different recommendation modes, and then infer membership based on the difference vector between the user's historical behaviors and the recommendation list. The previous frameworks are invalid against inductive recommendations, such as sequential recommendations, since the disparities of difference vectors constructed by the recommendations between members and non-members become imperceptible. This motivates us to dig deeper into the target model. In addition, most MIA frameworks assume that they can obtain some in-distribution data from the same distribution of the target data, which is hard to gain in recommender system. To address these difficulties, we propose a Membership Inference Attack framework against sequential recommenders based on Model Extraction(ME-MIA). Specifically, we train a surrogate model to simulate the target model based on two universal loss functions. For a given behavior sequence, the loss functions ensure the recommended items and corresponding rank of the surrogate model are consistent with the target model's recommendation. Due to the special training mode of the surrogate model, it is hard to judge which user is its member(non-member). Therefore, we establish a shadow model and use shadow model's members(non-members) to train the attack model later. Next, we build a user feature generator to construct representative feature vectors from the shadow(surrogate) model. The crafting feature vectors are finally input into the attack model to identify users' membership. Furthermore, to tackle the high cost of obtaining in-distribution data, we develop two variants of ME-MIA, realizing data-efficient and even data-free MIA by fabricating authentic in-distrib

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Pseudorandom number generator based on supersingular elliptic curve isogenies

引用

science China(Information sciences) 2022年第5期65卷 267-269页

作者： Yan HUANG Fangguo ZHANG Zhijie LIU Haibo TIAN School of Electronic and Information Engineering Sun Yat-sen University School of Data and Computer Science Sun Yat-sen University Guangdong Key Laboratory of Information Security

Dear editor,Pseudorandom number generator(PRNG) is very important for the randomness study in some cryptographic algorithms.A PRNG is a deterministic function that takes a uniform random bit string as input and output... 详细信息

关键词： Post-quantum cryptography Pseudorandom generator Supersingular elliptic curve isogenies Decisional Supersingular Product Indistinguishability

来源：评论

学校读者我要写书评

暂无评论

CA-DTS:A Distributed and Collaborative Task Scheduling Algorithm for Edge Computing Enabled Intelligent Road Network

引用

Journal of computer science & Technology 2023年第5期38卷 1113-1131页

作者：胡世红罗渠元李光辉施巍松叶保留 Key Laboratory of Water Big Data Technology of Ministry of Water Resources Houhai UniversityNanjing 210098China School of Computer and Information Houhai UniversityNanjing 210098China School of Information Science and Technology Southwest Jiaotong UniversityChengdu 611756China School of Artificial Intelligence and Computer Science Jiangnan UniversityWuci 214122China Department of Computer and Information Sciences University of DelawareNewarkDE 19716U.S.A National Key Laboratory for Novel Software Technology Nanjing UniversityNanjing 210093China

Edge computing enabled Intelligent Road Network(EC-IRN)provides powerful and convenient computing services for vehicles and roadside sensing *** continuous emergence of transportation applications has caused a huge burden on roadside units(RSUs)equipped with edge servers in the Intelligent Road Network(IRN).Collaborative task scheduling among RSUs is an effective way to solve this ***,it is challenging to achieve collaborative scheduling among different RSUs in a completely decentralized *** this paper,we first model the interactions involved in task scheduling among distributed RSUs as a Markov *** that multi-agent deep reinforcement learning(MADRL)is a promising approach for the Markov game in decision optimization,we propose a collaborative task scheduling algorithm based on MADRL for EC-IRN,named CA-DTS,aiming to minimize the long-term average delay of *** reduce the training costs caused by trial-and-error,CA-DTS specially designs a reward function and utilizes the distributed deployment and collective training architecture of counterfactual multi-agent policy gradient(COMA).To improve the stability of performance in large-scale environments,CA-DTS takes advantage of the action semantics network(ASN)to facilitate cooperation among multiple *** evaluation results of both the testbed and simulation demonstrate the effectiveness of our proposed *** with the baselines,CA-DTS can achieve convergence about 35%faster,and obtain average task delay that is lower by approximately 9.4%,9.8%,and 6.7%,in different scenarios with varying numbers of RSUs,service types,and task arrival rates,respectively.

关键词： edge computing deep reinforcement learning task scheduling vehicular edge computing

来源：评论

学校读者我要写书评

暂无评论

Efficient Relaxed Functional Dependency Discovery with Minimal Set Cover 40

Efficient Relaxed Functional Dependency Discovery with Minim...

引用

40th IEEE International Conference on data Engineering, ICDE 2024

作者： Ding, Xiaoou Liu, Yida Wang, Hongzhi Wang, Chen Song, Yichen Yang, Donghua Wang, Jianmin School of Computer Science and Technology Harbin Institute of Technology China National Engineering Research Center for Big Data Software EIRI Tsinghua University China

ISBN: (纸本)9798350317152

Assessing data quality through Functional Depen-dencies (FDs) is a crucial aspect of data governance. However, with the diverse range of data sources and the exponential growth in data volume, exact FDs can sometimes be impractical for real-world applications. In contrast, relaxed functional dependencies (RFDs), which allows for some flexibility in attribute value comparisons, demonstrates greater adaptability and flexibility for big data scenarios. To address the efficient discovery of RFDs, this paper proposes a novel mining method to supplement the current research gaps. By establishing a difference table for tuples, we transform the problem into a specialized minimal set covering problem. Additionally, we introduce two optimization strategies: reducing the time complexity of enumerating the left-hand side of the base RFDs to 0 (1) and decreasing the search complexity for feasible LHS attributes and threshold candidates from O(2m-l) to O(1.5m-1). We rigorously proof that our mining approach guarantees the identification of validity and minimal RFDs. Experiments on nine real-world datasets reveal that our method significantly improves efficiency compared to existing techniques. Furthermore, it uncovers more concise and higher-quality RFDs. Importantly, the RFDs extracted through our methodology exhibit better performance in downstream cleaning tasks. © 2024 IEEE.

关键词： Quality management

来源：评论

学校读者我要写书评

暂无评论

LECF: recommendation via learnable edge collaborative filtering

引用

science China(Information sciences) 2022年第1期65卷 116-130页

作者： Shitao XIAO Yingxia SHAO Yawen LI Hongzhi YIN Yanyan SHEN Bin CUI School of Computer Science (National Pilot Software Engineering School) Beijing University of Posts and Telecommunications Beijing Key Lab of Intelligent Telecommunications Software and Multimedia Beijing University of Posts and Telecommunications School of Information Technology and Electrical Engineering The University of Queensland Department of Computer Science and Engineering Shanghai Jiao Tong University Department of Computer Science and Technology Peking University National Engineering Laboratory for Big Data Analysis and Applications Peking University

The core of recommendation models is estimating the probability that a user will like an item based on historical interactions. Existing collaborative filtering(CF) algorithms compute the likelihood by utilizing simple relationships between objects, e.g., user-item, item-item, or user-user. They always rely on a single type of object-object relationship, ignoring other useful relationship information in data. In this paper, we model an interaction between user and item as an edge and propose a novel CF framework, called learnable edge collaborative filtering(LECF). LECF predicts the existence probability of an edge based on the connections among edges and is able to capture the complex relationship in data. Specifically, we first adopt the concept of line graph where each node represents an interaction edge; then calculate a weighted sum of similarity between the query edge and the observed edges(i.e., historical interactions) that are selected from the neighborhood of query edge in the line graph for a recommendation. In addition, we design an efficient propagation algorithm to speed up the training and inference of LECF. Extensive experiments on four public datasets demonstrate LECF can achieve better performance than the state-of-the-art methods.

关键词： collaborative filtering recommender system implicit feedback edge-edge similarity line graph

来源：评论

学校读者我要写书评

暂无评论

Cost-Effective Authenticated Solution (CAS) for 6G-Enabled Artificial Intelligence of Medical Things (AIoMT)

引用

IEEE Internet of Things Journal 2024年第13期11卷 23977-23984页

作者： Mahmood, Khalid Obaidat, Mohammad S. Shamshad, Salman Alenazi, Mohammed J. F. Kumar, Gulshan Anisi, Mohammad Hossein Conti, Mauro National Yunlin University of Science and Technology Graduate School of Intelligent Data Science Douliu64002 Taiwan The University of Jordan King Abdullah II School of Information Technology Amman11942 Jordan University of Science and Technology Beijing School of Communication and Computing Engineering Beijing100083 China Amity University Amity School of Engineering and Technology Noida201301 India University of Lahore Department of Software Engineering Lahore54590 Pakistan King Saud University College of Computer and Information Sciences Department of Computer Engineering Riyadh12311 Saudi Arabia University of Padua Department of Mathematics Padua35131 Italy Lovely Professional University Department of Computer Science and Engineering Phagwara144411 India University of Essex School of Computer Science and Electronic Engineering ColchesterCO4 3SQ United Kingdom

The Internet of Things (IoT) is a network of interconnected objects, which congregate and exchange gigantic amounts of data. Usually, predeployed embedded sensors sense this massive data. Soon, several applications of IoT are anticipated to exploit emerging 6G technology. Healthcare is one of them, where the 6G-inspired paradigm may facilitate the users to exchange information through hundreds of sensors under the assumption of Artificial Intelligence of Things (AIoT). Integration of medical sensors with AIoT is known as Artificial Intelligence of Medical Things (AIoMT). The secure and seamless interactions among 6G-enabled AIoMT users should be the primary challenge. Furthermore, resource-constrained wearable sensing devices, with their inability to execute complex security solutions, provide an ideal attraction for malicious entities to launch diverse attacks. These challenges have motivated us to design a cost-effective authenticated solution (CAS) for 6G-enabled AIoMT healthcare applications. Our CAS protocol not only prevents cyber threats like impersonation session key secrecy but it can also prevent physical threats like hardware tampering. We observe formal and informal security validations to endorse its robustness and effectiveness. Performance comparison reveals that the CAS protocol offers maximum security enrichment. Moreover, CAS is cost-effective as it has achieved 33% and 60% reduction in computation and communication overheads, respectively, compared to contemporary competing related protocols. © 2014 IEEE.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

On-Line System of Garbage Image-Orientated Intelligent Classification, Submission and Examination 20

On-Line System of Garbage Image-Orientated Intelligent Class...

引用

20th IEEE International Conference on e-Business Engineering, ICEBE 2024

作者： Tian, Jiayin Wang, Yaozhi Liu, Jiaxin Chen, Yan School of Computer Science and Technology Xi'an Jiaotong University Shaanxi Xi'an China Xi'an Jiaotong University Shaanxi Key Lab of Big Data Knowledge Engineering Shaanxi Xi'an China School of Computer Science and Technology Xi'an Jiaotong University Xi'an Jiaotong University Shaanxi Key Lab of Big Data Knowledge Engineering Shaanxi Xi'an China

ISBN: (纸本)9798350365856

In a world brimming with new products continually, novel waste types are ubiquitous. This makes current image-based garbage classification systems difficult to perform well due to the long-tailed effects of distribution of garbage types, and necessitates an urgent and efficient garbage classification with abilities of detecting new and rare wastes and class-incremental learning for environmental sustainability. Therefore, we propose a framework of Online System of Garbage Image-Oriented Intelligent Classification, Submission, and Examination, facilitating the incremental garbage classification efforts. In which, to identify novel garbage effectively, we also introduced few-shot object detection method with two key algorithms: Two-Stage Object Detection Learning Algorithm and Dynamic Query-based Incremental Few-shot Learning Algorithm. Our experiment results show that Both outperform the current existing ones in dataset, MS COCO. Then, a strategy of Class-Incremental learning based Residual Network is proposed to meet the need of new waste class-incremental learning. The experimental results support our strategy. Finally, a prototype system employed the above algorithms and the strategy is described. © 2024 IEEE.

关键词： Zero-shot learning

来源：评论

学校读者我要写书评

暂无评论

Dual-Modeling Decouple Distillation for Unsupervised Anomaly Detection 24

Dual-Modeling Decouple Distillation for Unsupervised Anomaly...

引用

32nd ACM International Conference on Multimedia, MM 2024

作者： Liu, Xinyue Wang, Jianyuan Leng, Biao Zhang, Shuo School of Computer Science and Engineering Beihang University Beijing China Key Laboratory of Intelligent Bionic Unmanned Systems Ministry of Education School of Intelligence Science and Technology University of Science and Technology Beijing Beijing China Beijing Key Lab of Traffic Data Analysis and Mining School of Computer & Technology Beijing Jiaotong University Beijing China

ISBN: (纸本)9798400706868

Knowledge distillation based on student-teacher network is one of the mainstream solution paradigms for the challenging unsupervised Anomaly Detection task, utilizing the difference in representation capabilities of the teacher and student networks to implement anomaly localization. However, over-generalization of the student network to the teacher network may lead to negligible differences in representation capabilities of anomaly, thus affecting the detection effectiveness. Existing methods address the possible over-generalization by using differentiated students and teachers from the structural perspective or explicitly expanding distilled information from the content perspective, which inevitably results in an increased likelihood of underfitting of the student network and poor anomaly detection capabilities in anomaly center or edge. In this paper, we propose Dual-Modeling Decouple Distillation (DMDD) for the unsupervised Anomaly Detection. In DMDD, a Decouple Student-Teacher Network is proposed to decouple the initial student features into normality and abnormality features. We further introduce Dual-Modeling Distillation based on normal-anomalous image pairs, fitting normality features of anomalous image and the teacher features of the corresponding normal image, widening the distance between abnormality features and the teacher features in anomalous regions. Synthesizing these two distillation ideas, we achieve anomaly detection which focuses on both edge and center of anomaly. Finally, a Multi-perception Segmentation Network is proposed to achieve focused anomaly map fusion based on multiple attention. Experimental results on MVTec AD show that DMDD surpasses SOTA localization performance of previous knowledge distillation-based methods, reaching 98.85% on pixel-level AUC and 96.13% on PRO. © 2024 ACM.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Self-training through Classifier Disagreement for Cross-Domain Opinion Target Extraction 23

Self-training through Classifier Disagreement for Cross-Doma...

引用

32nd ACM World Wide Web Conference, WWW 2023

作者： Sun, Kai Zhang, Richong Samuel, Mensah Nikolaos, Aletras Mao, Yongyi Liu, Xudong Beijing Advanced Innovation Center for Big Data and Brain Computing School of Computer Science and Engineering Beihang University Beijing China Department of Computer Science University of Sheffield Sheffield United Kingdom School of Electrical Engineering and Computer Science University of Ottawa Ottawa Canada

ISBN: (纸本)9781450394161

Opinion target extraction (OTE) or aspect extraction (AE) is a fundamental task in opinion mining that aims to extract the targets (or aspects) on which opinions have been expressed. Recent work focus on cross-domain OTE, which is typically encountered in real-world scenarios, where the testing and training distributions differ. Most methods use domain adversarial neural networks that aim to reduce the domain gap between the labelled source and unlabelled target domains to improve target domain performance. However, this approach only aligns feature distributions and does not account for class-wise feature alignment, leading to suboptimal results. Semi-supervised learning (SSL) has been explored as a solution, but is limited by the quality of pseudo-labels generated by the model. Inspired by the theoretical foundations in domain adaptation [2], we propose a new SSL approach that opts for selecting target samples whose model output from a domain-specific teacher and student network disagree on the unlabelled target data, in an effort to boost the target domain performance. Extensive experiments on benchmark cross-domain OTE datasets show that this approach is effective and performs consistently well in settings with large domain shifts. © 2023 ACM.

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

Understanding News Background Information Seeking from Readers' Perspective 25

Understanding News Background Information Seeking from Reade...

引用

25th IEEE International Conference on computer Supported Cooperative Work in Design, CSCWD 2022

作者： Feng, Zhenni Ding, Xianghua Jiang, Yanqi Wu, Yiying Zhang, Peng Fudan University School of Computer Science Shanghai Key Laboratory of Data Science Shanghai China University of Glasgow School of Computer Science United Kingdom

ISBN: (纸本)9781665405270

Background information is very important for news reading and understanding, especially with today's rapid new media development for news production and consumption. When researchers actively develop tools to automatically provide back-ground information for people, we still have little understanding of how people, from readers' perspective, engage with news and what background information is needed. To address such a gap, we conducted a study with a news reading platform, observed participants' news reading behaviors using the platform and interviewed them over the process. Our study highlighted that news reading is a learning activity between leisure and study, and their background information searching behavior is part of Gestalt knowing - to make their existing knowledge more complete, by deepening their prior understandings, broadening their horizons, filling the gaps, clearing their confusion, as well as tracking the progress of an event as a whole, so a more holistic understanding could be achieved. We end by discussing implications of our findings. © 2022 IEEE.

关键词： Leisure

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：