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

SSRN 2022年

作者： Li, Xun Liu, Lei Liu, Yuzhou Liu, Huaxiao College of Computer Science and Technology Jilin University Jilin130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun Jilin University Jilin130012 China

Context: API is important in daily programming activities during app development, but finding appropriate APIs is time-consuming for developers. To simplify this process, many researchers pay attention to overcoming the task-API knowledge gap using semantic information mined from the large-scale dataset for API recommendation. However, only semantic information is not enough since API descriptions and developer's query may not share similar words, meanwhile, large-scale data mining brings huge time cost and causes knowledge fixed problem (i.e. data cannot be timely updated). This limits the efficiency of existing API commendation methods. Objective: In this work, we aim at proposing a lightweight API recommendation method for app development based on the data in app store. Method: We model API recommendation as a multi-objective optimization problem by considering both structural and semantic information of API, and use the genetic algorithm to gain optimal solutions for overcoming limitations of the small-scale dataset. Specially, we collect APK files of related apps and API descriptions to establish a lightweight dataset, and extract the structural and semantic information of API from them with graph embedding and NLP techniques respectively. Then, we get the recommended APIs satisfying structural and semantic objectives according to the developers’ target functionality with a genetic algorithm. Finally, we give the interpretation of our recommendation information to help developers understand the results easily. Results and Conclusion: We conduct a series of experiments based on apps in Google Play and Q&As in Stack Overflow. The results show that Precision@N of our recommendation can be up to 0.89, MAP@N is up to 0.50, and MRR reaches 0.69, and our method achieves such good performance only utilizing less than 1/19 of the project number of our compared machine learning method. Besides, we conduct a survey and most of the participants confirm the understandabilit

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Label-aware Multi-level Contrastive Learning for Cross-lingual Spoken Language Understanding

arXiv

引用

arXiv 2022年

作者： Liang, Shining Shou, Linjun Pei, Jian Gong, Ming Zuo, Wanli Zuo, Xianglin Jiang, Daxin College of Computer Science and Technology Jilin University China Key Laboratory of Symbolic Computation and Knowledge Engineering MOE China STCA Microsoft Department of Electrical & Computer Engineering Duke University United States

Despite the great success of spoken language understanding (SLU) in high-resource languages, it remains challenging in low-resource languages mainly due to the lack of labeled training data. The recent multilingual code-switching approach achieves better alignments of model representations across languages by constructing a mixed-language context in zero-shot cross-lingual SLU. However, current code-switching methods are limited to implicit alignment and disregard the inherent semantic structure in SLU, i.e., the hierarchical inclusion of utterances, slots, and words. In this paper, we propose to model the utterance-slot-word structure by a multi-level contrastive learning framework at the utterance, slot, and word levels to facilitate explicit alignment. Novel code-switching schemes are introduced to generate hard negative examples for our contrastive learning framework. Furthermore, we develop a label-aware joint model leveraging label semantics to enhance the implicit alignment and feed to contrastive learning. Our experimental results show that our proposed methods significantly improve the performance compared with the strong baselines on two zero-shot cross-lingual SLU benchmark datasets. © 2022, CC BY-NC-ND.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Robustifying Vision Transformer for Image Forgery Localization with Multi-Exit Architectures

SSRN

引用

SSRN 2023年

作者： Shi, Zenan Chen, Haipeng Dong, Zhang 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 Department of Electronic and Computer Engineering The Hong Kong University of Science and Technology 999077 Hong Kong

The proliferation of image manipulation tools has led to an increase in the number of manipulated images being disseminated online, posing risks like the propagation of fake news and telecom fraud. Thus, there is an increasing demand for precise, generic, and robust methods for detecting and locating manipulated images. In this paper, we propose a simple and clean model, named MEAFormer, for image forgery localization that does not heavily rely on pre-training models. MEAFormer comprises three main components: encoder network, neck network, and decoder network. Specifically, the transformer-based encoder network extracts hierarchical feature representations from the input image, providing rich contextual information in each layer. The neck network, incorporating our proposed cross-layer feature aggregation (CFA), aggregates these hierarchical features. To achieve better spatial feature co-occurrence, instead of using noise or edge artifacts, we introduce a multi-scale graph reasoning (MGR) module within the decoder network via bipartite graphs over the encoder and decoder features in a multi-scale fashion. The cross-level enhancement (CLE) further performs adjacent-level feature fusion to amplify the region-of-interests in aggregated manipulation features. Finally, the multi-exit architecture (MEA) guides the model to learn fine-grained features and segment out the manipulated region. Extensive experiments across diverse and challenging datasets conclusively establish MEAFormer’s superiority over existing state-of-the-art methods, excelling in accuracy, generalization, and robustness. © 2023, The Authors. All rights reserved.

关键词： Network architecture

来源：评论

学校读者我要写书评

暂无评论

Efficient and Privacy-Preserving Weighted Nearby-Fit Spatial keyword Query in Cloud

引用

IEEE Internet of Things Journal 2025年

作者： Sun, Lili Lu, Rongxing Zheng, Yandong Zhang, Yonggang Tao, Yi Jilin University College of Computer Science and Technology Changchun130012 China Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Changchun130012 China University of New Brunswick Faculty of Computer Science FrederictonNBE3B 5A3 Canada Xidian University State Key Laboratory of Integrated Services Networks Xi'an710071 China Jilin University College of Software Changchun130012 China

In the modern digital landscape, integrating geographic locations and textual descriptions within a geo-textual dataset enhances location-based services (LBS) via spatial keyword queries, as these queries combine spatial and textual information to deliver more precise and personalized results. Additionally, the advent of cloud computing allows data owners to outsource data management and services to the cloud, boosting scalability but introducing efficiency challenges due to complex encryption. Although many schemes have been proposed for spatial keyword queries on encrypted geo-textual data, none supports matching a query keyword set with the keyword sets of multiple objects, a common query type in LBS. Imagine a user seeking to rent a house close to his/her workplace, with easy access to conveniences like supermarkets. By using nearby-fit spatial keyword queries, we can match the desired house with a house-type target object and its nearby amenities, offering more practical and flexible recommendations than traditional spatial keyword queries. Hence, in this paper, we introduce an efficient and privacy-preserving scheme called the Privacy-preserving Weighted Nearby-fit Spatial keyword (PWNSK) query scheme. First, we design a target-oriented spatial keyword (TOSK) tree for data organization and a TOSK tree based WNSK query algorithm for efficient pruning by simultaneously utilizing locations, keywords, and distances from nearby objects to target objects. For privacy, we develop several protocols, including one for polynomial coefficient re-encoding, based on polynomial coefficient encoding and fully homomorphic encryption. Building on these protocols, we introduce our PWNSK scheme. A thorough security analysis confirms its robustness, while extensive experiments also showcase its effectiveness. © 2014 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Dual Personalization on Federated Recommendation

arXiv

引用

arXiv 2023年

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

Federated recommendation is a new Internet service architecture that aims to provide privacy-preserving recommendation services in federated settings. Existing solutions are used to combine distributed recommendation algorithms and privacy-preserving mechanisms. Thus it inherently takes the form of heavyweight models at the server and hinders the deployment of on-device intelligent models to end-users. This paper proposes a novel Personalized Federated Recommendation (PFedRec) framework to learn many user-specific lightweight models to be deployed on smart devices rather than a heavyweight model on a server. Moreover, we propose a new dual personalization mechanism to effectively learn fine-grained personalization on both users and items. The overall learning process is formulated into a unified federated optimization framework. Specifically, unlike previous methods that share exactly the same item embeddings across users in a federated system, dual personalization allows mild finetuning of item embeddings for each user to generate user-specific views for item representations which can be integrated into existing federated recommendation methods to gain improvements immediately. Experiments on multiple benchmark datasets have demonstrated the effectiveness of PFedRec and the dual personalization mechanism. Moreover, we provide visualizations and in-depth analysis of the personalization techniques in item embedding, which shed novel insights on the design of recommender systems in federated settings. The code is available. Copyright © 2023, The Authors. All rights reserved.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Efficient and Privacy-Preserving Eclipse Query Over Encrypted Data

Efficient and Privacy-Preserving Eclipse Query Over Encrypte...

引用

IEEE Conference on Global Communications (GLOBECOM)

作者： Weiyu Song Yonggang Zhang Lili Sun Yandong Zheng Rongxing Lu College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China State Key Laboratory of Integrated Services Networks Xidian University Xi'an China Faculty of Computer Science University of New Brunswick Fredericton Canada

As the mobile Internet grows rapidly, location-based services (LBSs) are widely applied in the tourism and transportation fields. To fully mine the data collected, location service providers (LSPs) intend to offer various query services to users, which include eclipse query. The eclipse query can generalize nearest neighbor queries and skyline queries and allow users to set more rough and customizable preference ranges. In addition, with the boom of cloud computing, more and more LSPs hope to leverage the cloud to offer better query services. Given that the data could potentially contain confidential information, the data are required to be encrypted prior to outsourcing them. Therefore, eclipse queries need to be executed on the ciphertext. Although several schemes for eclipse queries have been proposed in existing works, they have little focus on privacy issues. To address this issue, we propose an efficient and privacy-preserving scheme for eclipse queries (EPEQ) in this paper. First, we develop a MinValue tree to construct an index for the dataset. Then, by utilizing the MinValue tree and a symmetric homomorphic encryption technique, we design a secure minimum value comparison protocol to obtain a skyline data and a secure undominated data acquisition protocol to obtain the data not skyline dominated by the skyline data. After that, we present our scheme. We analyze the security of the EPEQ scheme and perform experimental evaluations, demonstrating the security and efficiency of our EPEQ scheme.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Short Tail:taming tail latency for erasure-code-based in-memory systems

引用

Frontiers of Information Technology & Electronic engineering 2022年第11期23卷 1646-1657页

作者： Yun TENG Zhiyue LI Jing HUANG Guangyan ZHANG College of Computer Science and Technology Jilin UniversityChangchun 130012China Department of Computer Science and Technology Tsinghua UniversityBeijing 100084China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin UniversityChangchun 130012China Beijing National Research Center for Information Science and Technology(Tsinghua University) Beijing 100084China

In-memory systems with erasure coding(EC)enabled are widely used to achieve high performance and data ***,as the scale of clusters grows,the server-level fail-slow problem is becoming increasingly frequent,which can create long tail *** influence of long tail latency is further amplified in EC-based systems due to the synchronous nature of multiple EC *** this paper,we propose an EC-enabled in-memory storage system called ShortTail,which can achieve consistent performance and low latency for both reads and ***,ShortTail uses a lightweight request monitor to track the performance of each memory node and identify any fail-slow ***,ShortTail selectively performs degraded reads and redirected writes to avoid accessing fail-slow ***,ShortTail posts an adaptive write strategy to reduce write amplification of small *** implement ShortTail on top of Memcached and compare it with two baseline *** experimental results show that ShortTail can reduce the P99 tail latency by up to 63.77%;it also brings significant improvements in the median latency and average latency.

关键词： Erasure code In-memory system Node fail-slow Small write Tail latency

来源：评论

学校读者我要写书评

暂无评论

Dual UAV Cluster-Assisted Maritime Physical Layer Secure Communications via Collaborative Beamforming

arXiv

引用

arXiv 2024年

作者： Huang, Jiawei Wang, Aimin Sun, Geng Li, Jiahui Wang, Jiacheng Du, Hongyang Niyato, Dusit 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 Department of Electrical and Electronic Engineering Hong Kong University 999077 Hong Kong

Unmanned aerial vehicles (UAVs) can be utilized as relay platforms to assist maritime wireless communications. However, complex channels and multipath effects at sea can adversely affect the quality of UAV transmitted signals. Collaborative beamforming (CB) can enhance the signal strength and range to assist the UAV relay for remote maritime communications. However, due to the open nature of UAV channels, security issue requires special consideration. This paper proposes a dual UAV cluster-assisted system via CB to achieve physical layer security in maritime wireless communications. Specifically, one UAV cluster forms a maritime UAV-enabled virtual antenna array (MUVAA) relay to forward data signals to the remote legitimate vessel, and the other UAV cluster forms an MUVAA jammer to send jamming signals to the remote eavesdropper. In this system, we formulate a secure and energy-efficient maritime communication multi-objective optimization problem (SEMCMOP) to maximize the signal-to-interference-plus-noise ratio (SINR) of the legitimate vessel, minimize the SINR of the eavesdropping vessel and minimize the total flight energy consumption of UAVs. Since the SEMCMOP is an NP-hard and large-scale optimization problem, we propose an improved swarm intelligence optimization algorithm with chaotic solution initialization and hybrid solution update strategies to solve the problem. Simulation results indicate that the proposed algorithm outperforms other comparison algorithms, and it can achieve more efficient signal transmission by using the CB-based method. Copyright © 2024, The Authors. All rights reserved.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Convergence-Aware Optimal Checkpointing for Exploratory Deep Learning Training Jobs

SSRN

引用

SSRN 2024年

作者： Li, Hongliang Wang, Zichen Zhao, Hairui Zhang, Meng Li, Xiang Xu, Haixiao College of Computer Science and Technology Jilin University Qianjin street 2699 Jilin Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering The Ministry of Education Qianjin street 2699 Jilin Changchun130012 China High Performance Computing Center Qianjin street 2699 Jilin Changchun130012 China

Training Deep Learning (DL) models are becoming more time-consuming, thus interruptions to the training processes are inevitable. Existing fault-tolerant work adopted checkpoint/recovery mechanism from traditional HPC platforms that makes periodical persistent copies of model states to save execution progress. These checkpoints have fixed time intervals that they are evenly placed across the training. We can obtain an optimal checkpointing interval for an HPC job with the precondition that the progress of a job is proportional to its execution time. Unfortunately, it is not the case in DL model training where a DL training job yields diminishing returns across its lifetime. It makes the early progress of a DL training job more valuable than the later ones. Even placement of checkpoints would either increase the risks in the early stages or waste resources overprotecting the latter stages. Meanwhile, the issue can get amplified for exploratory training jobs, where early terminations are common. Moreover, in data parallelism, the state-of-art quality-driven scheduling strategies allocate more resources for the early stages of a job than the later ones to accelerate the training progress which further amplifies the issue. This paper introduces a novel checkpointing interval problem for exploratory DL training jobs based on model convergence progress. We present COCI, an approach to compute optimal checkpointing configuration for a DL training job, minimizing the fault-tolerant overhead, including checkpointing cost and recovery cost. We implement COCI based on state-of-art iteration-level checkpointing mechanism, as a pluggable module compatible with PyTorch. COCI requires no extra user input. We conduct comprehensive evaluations with real DL application setups. The experimental results show that COCI reduces up to 40.18% fault-tolerant overhead compared to existing state-of-the-art DL fault-tolerant methods in serial scenario, 57.26% in data parallel scenario and 63.8

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

TemporalPaD: a reinforcement-learning framework for temporal feature representation and dimension reduction

arXiv

引用

arXiv 2024年

作者： Mu, Xuechen Huang, Zhenyu Li, Kewei Zhang, Haotian Wang, Xiuli Fan, Yusi Zhang, Kai Zhou, Fengfeng Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Jilin Changchun130012 China School of Mathematics Jilin University Jilin Changchun130012 China College of computer Science and Technology Jilin University Jilin Changchun130012 China School of Biology and Engineering Guizhou Medical University Guizhou Guiyang550025 China

Recent advancements in feature representation and dimension reduction have highlighted their crucial role in enhancing the efficacy of predictive modeling. This work introduces TemporalPaD, a novel end-to-end deep learning framework designed for temporal pattern datasets. TemporalPaD integrates reinforcement learning (RL) with neural networks to achieve concurrent feature representation and feature reduction. The framework consists of three cooperative modules: a Policy Module, a Representation Module, and a Classification Module, structured based on the Actor-Critic (AC) framework. The Policy Module, responsible for dimensionality reduction through RL, functions as the actor, while the Representation Module for feature extraction and the Classification Module collectively serve as the critic. We comprehensively evaluate TemporalPaD using 29 UCI datasets, a well-known benchmark for validating feature reduction algorithms, through 10 independent tests and 10-fold cross-validation. Additionally, given that TemporalPaD is specifically designed for time series data, we apply it to a real-world DNA classification problem involving enhancer category and enhancer strength. The results demonstrate that TemporalPaD is an efficient and effective framework for achieving feature reduction, applicable to both structured data and sequence datasets. The source code of the proposed TemporalPaD is freely available as supplementary material to this article and at http://***/supp/. © 2024, CC BY-NC-ND.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：