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

SSRN 2024年

作者： Han, Ridong Peng, Tao Zhu, BeiBei Bi, Haijia Han, Jiayu Liu, Lu College of Computer Science and Technology Jilin University Jilin Changchun130012 China College of Software Jilin University Jilin Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin Changchun130012 China College of Computer and Artificial Intelligence Liaoning Normal University Liaoning Dalian116081 China Department of Linguistics University of Washington SeattleWA98195 United States

Long-tail problem and multi-label problem are two commonly encountered challenges in document-level relation extraction task. Current efforts are concerned with enhancing the representations of entity pairs through Transformer or document graphs, which cannot tackle the above challenges well. Relation correlations are a potential solution, which allows head relations to assist in the training of tail ones by transferring correlation knowledge between them, and can measure the semantic distance between relations to assist the classifier in assigning multiple semantically similar relations to multi-label instances. This paper proposes to learn relation correlations from both global and local views using entity type constraints, which means that the subject-object entity types limit the scope of possible relations. Globally, we statistically construct the Type-constrained Graph between entity types and relations, which formulates all possible subject/object types for each relation. Different relations are connected by common entity types, reflecting the desired correlations. Locally, given an entity pair, the classification probability of relations matching its entity types should be greater than those unmatched. Therefore, the Type-constrained Loss is proposed to make the matched relations have greater probabilities. Detailed experiments are conducted on DocRED and DWIE datasets, and our model significantly outperforms baselines under long-tail and multi-label setups. © 2024, The Authors. All rights reserved.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

JC5A: Service Delay Minimization for Aerial MEC-assisted Industrial Cyber-Physical Systems

arXiv

引用

arXiv 2024年

作者： Sun, Geng Wu, Jiaxu Sun, Zemin He, Long Wang, Jiacheng Niyato, Dusit Jamalipour, Abbas Mao, Shiwen College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore School of Computer Science and Engineering Nanyang Technological University Singapore639798 Singapore School of Electrical and Computer Engineering The University of Sydney SydneyNSW2006 Australia Department of Electrical and Computer Engineering Auburn University Auburn United States

In the era of the sixth generation (6G) and industrial Internet of Things (IIoT), an industrial cyber-physical system (ICPS) drives the proliferation of sensor devices and computing-intensive tasks. To address the limited resources of IIoT sensor devices, unmanned aerial vehicle (UAV)-assisted mobile edge computing (MEC) has emerged as a promising solution, providing flexible and cost-effective services in close proximity of IIoT sensor devices (ISDs). However, leveraging aerial MEC to meet the delay-sensitive and computation-intensive requirements of the ISDs could face several challenges, including the limited communication, computation and caching (3C) resources, stringent offloading requirements for 3C services, and constrained on-board energy of UAVs. To address these issues, we first present a collaborative aerial MEC-assisted ICPS architecture by incorporating the computing capabilities of the macro base station (MBS) and UAVs. We then formulate a service delay minimization optimization problem (SDMOP). Since the SDMOP is proved to be an NP-hard problem, we propose a joint computation offloading, caching, communication resource allocation, computation resource allocation, and UAV trajectory control approach (JC5A). Specifically, JC5A consists of a block successive upper bound minimization method of multipliers (BSUMM) for computation offloading and service caching, a convex optimization-based method for communication and computation resource allocation, and a successive convex approximation (SCA)-based method for UAV trajectory control. Moreover, we theoretically prove the convergence and polynomial complexity of JC5A. Simulation results demonstrate that the proposed approach can achieve superior system performance compared to the benchmark approaches and algorithms. Copyright © 2024, The Authors. All rights reserved.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Bounding-box deep calibration for high performance face detection

arXiv

引用

arXiv 2021年

作者： Luo, Shi Li, Xiongfei Zhang, Xiaoli College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China

Modern convolutional neural networks (CNNs)‐based face detectors have achieved tremendous strides due to large annotated datasets. However, misaligned results with high detection confidence but low localization accuracy restrict the further improvement of detection performance. In this paper, the authors first predict high confidence detection results on the training set itself. Surprisingly, a considerable part of them exist in the same misalignment problem. Then, the authors carefully examine these cases and point out that annotation misalignment is the main reason. Later, a comprehensive discussion is given for the replacement rationality between predicted and annotated bounding‐boxes. Finally, the authors propose a novel Bounding‐Box Deep Calibration (BDC) method to reasonably replace misaligned annotations with model predicted bounding‐boxes and offer calibrated annotations for the training set. Extensive experiments on multiple detectors and two popular benchmark datasets show the effectiveness of BDC on improving models' precision and recall rate, without adding extra inference time and memory consumption. Our simple and effective method provides a general strategy for improving face detection, especially for light‐weight detectors in real‐time situations. © 2021, CC BY.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

When Federated Recommendation Meets Cold-Start Problem: Separating Item Attributes and User Interactions

arXiv

引用

arXiv 2023年

作者： Zhang, Chunxu Zhang, Zijian Long, Guodong Yan, Peng Zhou, Tianyi Yang, Bo College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Changchun China College of Computer Science and Technology Jilin University City University of Hong Kong China Australian Artificial Intelligence Institute FEIT University of Technology Sydney Sydney Australia Computer Science and UMIACS University of Maryland Maryland United States

Federated recommendation systems usually trains a global model on the server without direct access to users’ private data on their own devices. However, this separation of the recommendation model and users’ private data poses a challenge in providing quality service, particularly when it comes to new items, namely cold-start recommendations in federated settings. This paper introduces a novel method called Item-aligned Federated Aggregation (IFedRec) to address this challenge. It is the first research work in federated recommendation to specifically study the cold-start scenario. The proposed method learns two sets of item representations by leveraging item attributes and interaction records simultaneously. Additionally, an item representation alignment mechanism is designed to align two item representations and learn the meta attribute network at the server within a federated learning framework. Experiments on four benchmark datasets demonstrate IFedRec’s superior performance for cold-start scenarios. Furthermore, we also verify IFedRec owns good robustness when the system faces limited client participation and noise injection, which brings promising practical application potential in privacy-protection enhanced federated recommendation systems. The implementation code is available1 Copyright © 2023, The Authors. All rights reserved.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Practical two-party privacy-preserving neural network based on secret sharing

arXiv

引用

arXiv 2021年

作者： Ge, Zhengqiang Zhou, Zhipeng Guo, Dong Li, Qiang College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation Knowledge Engineering of Ministry of Education Jilin University Changchun China

Neural networks, with the capability to provide efficient predictive models, have been widely used in medical, financial, and other fields, bringing great convenience to our lives. However, the high accuracy of the model requires a large amount of data from multiple parties, raising public concerns about privacy. Privacy-preserving neural network based on multi-party computation is one of the current methods used to provide model training and inference under the premise of solving data privacy. In this study, we propose a new two-party privacy-preserving neural network training and inference framework in which privacy data is distributed to two non-colluding servers. We construct a preprocessing protocol for mask generation, support and realize secret sharing comparison on 2PC, and propose a new method to further reduce the communication rounds. Based on the comparison protocol, we construct building blocks such as division and exponential, and realize the process of training and inference that no longer needs to convert between different types of secret sharings and is entirely based on arithmetic secret sharing. Compared with the previous works, our work obtains higher accuracy, which is very close to that of plaintext training. While the accuracy has been improved, the runtime is reduced, considering the online phase, our work is 5× faster than SecureML, 4.32-5.75× faster than SecureNN, and is very close to the current optimal 3PC implementation, FALCON. For secure inference, as far as known knowledge is concerned, we should be the current optimal 2PC implementation, which is 4-358× faster than other works. © 2021, CC BY.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

A Task Processing Efficiency Improvement Scheme Based on Cloud-Edge Architecture in Dense Computing Environments

SSRN

引用

SSRN 2022年

作者： Feng, Jiahui Qi, Jingze Liu, Yuanning Liu, Zhen College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China Graduate School of Engineering Nagasaki Institute of Applied Science 536 Aba-machi Nagasaki851-0193 Japan

As cloud-edge architecture combines low latency and high-performance computing, it has a wider range of application scenarios. Considering that, how to reasonably allocate tasks to the edge cloud or the central cloud and how to select appropriate virtual machines (VMs) for tasks are two key aspects affecting the efficiency of cloud-edge architecture. For the former, the ARDT algorithm is proposed, which dynamically adjusts the optimal threshold by predicting the number of real-time edge-end devices. For the latter, we design the DBMR algorithm based on the Max-Fit algorithm, in which we propose a structure of blocking to reduce the time complexity of the original algorithm from O(n2) to O(n(n-m)). Experimental results show that the ARDT-DBMR algorithm optimizes the average processing time and task failure rate by 30%-40% compared with the baseline algorithms and other advanced algorithms and significantly improves the problem of abnormal fluctuations in VM utilization in dense computing environments. © 2022, The Authors. All rights reserved.

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

SSBM: A Signed Stochastic Block Model for Multiple Structure Discovery in Large-Scale Exploratory Signed Networks

arXiv

引用

arXiv 2023年

作者： Li, Yang Yang, Bo Zhao, Xuehua Yang, Zhejian Chen, Hechang Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Changchun130012 China College of Computer Science and Technology Jilin University Changchun130012 China Aviation University of Air Force Changchun130062 China School of Digital Media Shenzhen Institute of Information Technology Shenzhen518055 China School of Artificial Intelligence Jilin University Changchun130012 China

Signed network structure discovery has received extensive attention and has become a research focus in the field of network science. However, most of the existing studies are focused on the networks with a single structure, e.g., community or bipartite, while ignoring multiple structures, e.g., the coexistence of community and bipartite structures. Furthermore, existing studies were faced with challenge regarding large-scale signed networks due to their high time complexity, especially when determining the number of clusters in the observed network without any prior knowledge. In view of this, we propose a mathematically principled method for signed network multiple structure discovery named the Signed Stochastic Block Model (SSBM). The SSBM can capture the multiple structures contained in signed networks, e.g., community, bipartite, and coexistence of them, by adopting a probabilistic model. Moreover, by integrating the minimum message length (MML) criterion and component-wise EM (CEM) algorithm, a scalable learning algorithm that has the ability of model selection is proposed to handle large-scale signed networks. By comparing state-of-the-art methods on synthetic and realworld signed networks, extensive experimental results demonstrate the effectiveness and efficiency of SSBM in discovering large-scale exploratory signed networks with multiple structures. Copyright © 2023, The Authors. All rights reserved.

关键词： Stochastic models

来源：评论

学校读者我要写书评

暂无评论

PepLand: A large-scale pre-trained peptide representation model for a comprehensive landscape of both canonical and non-canonical amino acids

arXiv

引用

arXiv 2023年

作者： Zhang, Ruochi Wu, Haoran Xiu, Yuting Li, Kewei Chen, Ningning Wang, Yu Wang, Yan Gao, Xin Zhou, Fengfeng Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Jilin Changchun130012 China School of Artificial Intelligence Jilin University Changchun130012 China Syneron Technology Guangzhou510700 China College of Computer Science and Technology Jilin University Jilin Changchun130012 China Thuwal23955 Saudi Arabia Thuwal23955 Saudi Arabia

In recent years, the scientific community has become increasingly interested on peptides with non-canonical amino acids due to their superior stability and resistance to proteolytic degradation. These peptides present promising modifications to biological, pharmacological, and physiochemical attributes in both endogenous and engineered peptides. Notwithstanding their considerable advantages, the scientific community exhibits a conspicuous absence of an effective pre-trained model adept at distilling feature representations from such complex peptide sequences. We herein propose PepLand, a novel pre-training architecture for representation and property analysis of peptides spanning both canonical and non-canonical amino acids. In essence, PepLand leverages a comprehensive multi-view heterogeneous graph neural network tailored to unveil the subtle structural representations of peptides. Empirical validations underscore PepLand's effectiveness across an array of peptide property predictions, encompassing protein-protein interactions, permeability, solubility, and synthesizability. The rigorous evaluation confirms PepLand's unparalleled capability in capturing salient synthetic peptide features, thereby laying a robust foundation for transformative advances in peptide-centric research domains. We have made all the source code utilized in this study publicly accessible via GitHub at https://***/zhangruochi/pepland. © 2023, CC BY-NC-ND.

关键词： Peptides

来源：评论

学校读者我要写书评

暂无评论

GPFedRec: Graph-Guided Personalization for Federated Recommendation

arXiv

引用

arXiv 2023年

作者： Zhang, Chunxu Long, Guodong Zhou, Tianyi Zhang, Zijian Yan, Peng Yang, Bo College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China Australian Artificial Intelligence Institute FEIT University of Technology Sydney Sydney Australia UMIACS University of Maryland Maryland United States College of Computer Science and Technology Jilin University City University of Hong Kong China

The federated recommendation system is an emerging AI service architecture that provides recommendation services in a privacy-preserving manner. Using user-relation graphs to enhance federated recommendations is a promising topic. However, it is still an open challenge to construct the user-relation graph while preserving data locality-based privacy protection in federated settings. Inspired by a simple motivation, similar users share a similar vision (embeddings) to the same item set, this paper proposes a novel Graph-guided Personalization for Federated Recommendation (GPFedRec). The proposed method constructs a user-relation graph from user-specific personalized item embeddings at the server without accessing the users' interaction records. The personalized item embedding is locally fine-tuned on each device, and then a user-relation graph will be constructed by measuring the similarity among client-specific item embeddings. Without accessing users' historical interactions, we embody the data locality-based privacy protection of vanilla federated learning. Furthermore, a graph-guided aggregation mechanism is designed to leverage the user-relation graph and federated optimization framework simultaneously. Extensive experiments on five benchmark datasets demonstrate GPFedRec's superior performance. The in-depth study validates that GPFedRec can generally improve existing federated recommendation methods as a plugin while keeping user privacy safe. Code is available to ease reproducibility. Copyright © 2023, The Authors. All rights reserved.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

A Novel Drug-Drug Interaction Prediction Model Based on Line Subgraph Generation Strategy

A Novel Drug-Drug Interaction Prediction Model Based on Line...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Tian Bai Chu Li Xinyue Peng Haotian Guan Zefan Zhang Guishen Wang College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun China College of Software Jilin University Changchun China School of Nursing Jilin University Changchun China School of Life Sciences Jilin University Changchun China College of Computer Science and Engineering Changchun University of Technology Changchun China

Drug-Drug Interaction (DDI) prediction task is helpful for better-understanding drugs. In this paper, we propose a novel drug-drug interaction prediction model based on line subgraph generation strategy, named DDI-LSG model. Our DDI-LSG model consists of three main parts which include drug relation graph construction, line subgraph generation strategy, and graph-level classification. To consider more relationships among drugs, we propose a node feature-enhancing method to encode drug features in drug relation graph construction process. To consider drugs and DDI as equivalent factors of our DDI-LSG model, we introduce line graph transformation to integrate DDI with drug feature enhancing vector. Combining Jaccard similarity with cosine similarity, we propose a line subgraph generation strategy to evaluate node relation and extract key structures around target DDI in the line graph. Then, we reformulate the DDI prediction task into a graph-level classification task for the line subgraph of the target DDI. Therefore, in the final part of our DDI-LSG model, we use a graph-level classifier to classify the line subgraphs. Our DDI-LSG model outperforms better experiment results than baselines. Ablation results have validated the node feature enhancing method and line subgraph generation strategy.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：