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

International Symposium on Parallel and Distributed Processing with Applications, ISPA

作者： Zhengping Ni Xiaoqiang Di Xu Liu Lianjie Chang Jinqing Li Qiyue Tang School of Computer Science and Technology Changchun University of Science and Technology Changchun China Jilin Province Key Laboratory of Network and Information Security Changchun University of Science and Technology Changchun China Information Center Changchun University of Science and Technology Changchun China

ISBN: (数字)9798331509712

ISBN: (纸本)9798331509729

Logs are valuable data for detecting anomalous network behavior. Accurate feature extraction from logs is essential for anomaly detection. However, statistical-based feature extraction methods consider the statistical features of logs over a period of time, while ignoring the semantic information in each log. Most semantic-based feature extraction methods only embed the token semantics into high-dimensional vectors for semantic representation, which may lead to the lack of positional information between tokens, so that the uniqueness of the log template semantics cannot be maintained. At the same time, it also causes time-consuming problems due to high-dimensional data. To address the above challenges, we propose a novel log anomaly detection method called LogESP, which enhances the semantic representation of logs with positional information. Lo-gESP aims to effectively capture the semantic differences between normal and abnormal logs, thereby providing a new perspective for accurate detection of abnormal network behavior. First, we select representative words to summarize the semantics of log templates, then use structured tuples to enhance the semantic representation of the templates, and finally, construct LSTM model to extract the temporal features of the log sequences. Experimental results on two public log datasets (BGL and HDFS) show better performance compared to other state-of-the-art methods.

关键词： Distributed processing Accuracy High dimensional data Semantics Feature extraction Vectors Anomaly detection Long short term memory

来源：评论

学校读者我要写书评

暂无评论

Intelligent Energy-Efficient and Fair Resource Scheduling for UAV-Assisted Space-Air-Ground Integrated networks Under Jamming Attacks

Intelligent Energy-Efficient and Fair Resource Scheduling fo...

引用

IEEE Conference on Vehicular Technology (VTC)

作者： Shihao Chen Helin Yang Liang Xiao Changyuan Xu Xianzhong Xie Wanting Yang Zehui Xiong Department of Information & Communication Engineering Xiamen University Xiamen China Chongqing Key Laboratory of Computer Network and Communication Technology Chongqing University of Posts and Telecommunications Chongqing China Pillar of Information System Technology & Design Singapore University of Technology and Design Singapore

ISBN: (数字)9798350387414

ISBN: (纸本)9798350387421

The space-air-ground integrated network (SAGIN) is a crucial technology for sixth-generation (6G) wireless communication networks to achieve seamless coverage and high throughput. In this paper, we propose an unmanned aerial vehicle (UAV)-assisted SAGIN structure, where the UAV is responsible for collecting data from ground users (GUs) and transmitting it to low-earth orbit (LEO) satellites. This paper also formulates a joint energy-efficient and fair resource scheduling optimization problem under jamming attacks and limited energy constraints, where the line-of-sight (LoS) links between the UAV and GUs are susceptible to being jammed. Due to the non-convex problem and dynamic environments, a deep reinforcement learning (DRL)-based twin delayed deep deterministic policy gradient (TD3) is developed to search optimal UAV trajectory to maximize energy efficiency (EE) and fairness against jamming. Simulation results verify that the proposed intelligent resource scheduling algorithm outperforms the baseline algorithms in terms of EE and fairness index in different settings.

关键词： Wireless communication Vehicular and wireless technologies Simulation Autonomous aerial vehicles Space-air-ground integrated networks Energy efficiency Trajectory

来源：评论

学校读者我要写书评

暂无评论

Once-for-All: Controllable Generative Image Compression with Dynamic Granularity Adaption

arXiv

引用

arXiv 2024年

作者： Li, Anqi Li, Feng Liu, Yuxi Cong, Runmin Zhao, Yao Bai, Huihui Institute of Information Science Beijing Jiaotong University China Beijing Key Laboratory of Advanced Information Science and Network Technology China School of Computer Science and Engineering Hefei University of Technology China School of Control Science and Engineering Shandong University China

Although recent generative image compression methods have demonstrated impressive potential in optimizing the rate-distortion-perception trade-off, they still face the critical challenge of flexible rate adaption to diverse compression necessities and scenarios. To overcome this challenge, this paper proposes a Controllable Generative Image Compression framework, termed Control-GIC, the first capable of fine-grained bitrate adaption across a broad spectrum while ensuring high-fidelity and generality compression. Control-GIC is grounded in a VQGAN framework that encodes an image as a sequence of variable-length codes (i.e. VQ-indices), which can be losslessly compressed and exhibits a direct positive correlation with the bitrates. Drawing inspiration from the classical coding principle, we correlate the information density of local image patches with their granular representations. Hence, we can flexibly determine a proper allocation of granularity for the patches to achieve dynamic adjustment for VQ-indices, resulting in desirable compression rates. We further develop a probabilistic conditional decoder capable of retrieving historic encoded multi-granularity representations according to transmitted codes, and then reconstruct hierarchical granular features in the formalization of conditional probability, enabling more informative aggregation to improve reconstruction realism. Our experiments show that Control-GIC allows highly flexible and controllable bitrate adaption where the results demonstrate its superior performance over recent state-of-the-art methods. © 2024, CC BY-NC-SA.

关键词： Image compression

来源：评论

学校读者我要写书评

暂无评论

Context Perturbation: A Simple Consistent Alignment Approach for Domain Adaptive Semantic Segmentation

SSRN

引用

SSRN 2024年

作者： Wang, Zilin Liu, Meiqin Yao, Chao Zhao, Yao Wang, Wei Wei, Yunchao Institute of Information Science Beijing Jiaotong University Beijing100044 China Beijing Key Laboratory of Advanced Information Science and Network Technology Beijing100044 China School of Computer and Communication Engineering University of Science and Technology Beijing Beijing100083 China

Domain Adaptive Semantic Segmentation (DASS) aims to adapt a pre-trained segmentation model from a labeled source domain to an unlabeled target domain. Previous approaches usually address the domain gap by consistency regularization which is implemented based on the augmented data. However, as the augmentations are often performed at the input level with simple linear transformations, the feature representations suffer limited perturbation from these augmented views. As a result, they are not effective for cross-domain consistency learning. In this work, we propose a new augmentation method, namely contextual augmentation, and combine it with contrastive learning approaches from both the pixel and class levels to achieve consistency regularization. We term this methodology as Context Perturbation for DASS (CoPDASeg). Specifically, contextual augmentation first combines domain information by class mix and then randomly crops two patches with an overlapping region. To achieve consistency regularization with the two augmented patches, we focus on both pixel and class perspectives and propose two parallel contrastive learning paradigms (i.e., pixel-level contrastive learning and class-level contrastive learning). The former aligns the pixel-to-pixel feature representations, and later aligns class prototypes across domains. Experimental results on representative benchmarks (i.e., GTA5 → Cityscapes and SYNTHIA → Cityscapes) demonstrate that CoPDASeg improves the segmentation performance over state-of-the-arts by a large margin. © 2024, The Authors. All rights reserved.

关键词： Pixels

来源：评论

学校读者我要写书评

暂无评论

PIOD: An Efficient Parallel Iterative Algorithm for Solving Over-determined Equations

PIOD: An Efficient Parallel Iterative Algorithm for Solving ...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Min Tian Zhenguo Wei Yanlong Li Wei Du Lei Xiao Chaoshuai Xu Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan Key Laboratory of High Performance Computing Jinan Institute of Supercomputing Technology

The solution of over-determined equations plays a very important role in fields such as data fitting, signal processing, and machine learning. It is of great significance in predicting natural phenomena, optimizing engineering design, and other fields. However, there is currently no efficient method to solve over-determined equations, either being not accurate enough or consuming a lot of time. In this article, we propose a parallel iterative method for solving over-determined equations, called the PIOD algorithm. By using a sub-convergence condition to terminate the iterative calculation, we have developed a task partitioning strategy for the algorithm and implemented parallelization of the solution of over-determined equations on a distributed memory system. Our proposed algorithm achieves an average speedup of 152 ×times compared to the open-source Eigen solver. Additionally, it also achieves a parallel efficiency of over 30%.

关键词：

来源：评论

学校读者我要写书评

暂无评论

AH-TDMA: An Adaptive Heterogeneous Tridiagonal Matrix Algorithm on the New Sunway Supercomputer

AH-TDMA: An Adaptive Heterogeneous Tridiagonal Matrix Algori...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Min Tian Qi Liu Yanlong Li Wei Du Zenghui Ren Yue Liu Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan Key Laboratory of High Performance Computing Jinan Institute of Supercomputing Technology

The solution of tridiagonal linear systems is used in in various fields and plays a crucial role in numerical simulations. However, there is few efficient solver for tridiagonal linear systems on the new Sunway supercomputer. Based on a three-dimensional heat conduction problem, we propose an adaptive heterogeneous tridiagonal matrix algorithm (AH-TDMA). Our major innovations include: (1) To address computational hotspots within AH-TDMA, a multi-level parallel approach involving MPI+Athread has been adopted. (2) An adaptive data partitioning scheme has been set up to achieve load balance. (3) Employing direct memory access and establishing shared space between registers and main memory, instead of employing discrete memory access, is done to enhance memory access efficiency. (4) The optimization of the loop structure has been made in adjusting the sequencing of the dual-layered loops to reduce communication overhead. The experimental results show that, with one core group, the AH-TDMA achieves a speedup of 99.6 times for hotspot and total time speedup up to 59.4 times compared to the Parallel and Scalable Library for Tridiagonal Matrix Algorithm (PaScal TDMA). The AH-TDMA is scalable up to 2048 core groups, with a parallel efficiency of 69.2%.

关键词：

来源：评论

学校读者我要写书评

暂无评论

hcaPCG: A Heterogeneous and communication-avoid PCG with Jacobi preconditioner on SW26010-Pro architecture

hcaPCG: A Heterogeneous and communication-avoid PCG with Jac...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Min Tian Yue Liu Li Wang Yanyan Chen Qi Liu Jingshan Pan Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan Key Laboratory of High Performance Computing Jinan Institute of Supercomputing Technology

Due to its efficiency and versatility, the preconditioned conjugate gradient algorithm has long been a staple in the realm of iterative linear system solvers. In this paper, we proposed an optimized preconditioned conjugate gradient algorithm tailored for the SW26010-Pro manycore processor, The main work includes: Optimizing data block sizes based on the processor’s storage structure; combining thread-level and data-level parallelism, utilizing manual SIMD to improve efficiency; optimizing the memory access pattern by employing direct memory access and overlapping of computation and communication; employing a shared-memory approach to store long vectors across all cores. Furthermore, we design an accelerated algorithm for reduction operations, to avoid data communication. Experimental results show that the hcaPCG yields up to 28.1× speedups on average compared to the original implementation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Learning Common and Label-Specific Features for Label Distribution Learning with Correlation information

SSRN

引用

SSRN 2024年

作者： Wu, Yilin Lin, Yaojin Guo, Wenzhong College of Computer and Data Science Fuzhou University Fuzhou350116 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350116 China Key Laboratory of Data Science and Intelligence Application Minnan Normal University Zhangzhou363000 China

Label distribution learning quantifies the label space for each instance and has wide applicability in different fields. However, most existing work primarily focuses on common features, ignores the significance of label-specific features. Meanwhile, label correlation is well used in these work, but they still have limitations in capturing instance correlation. Therefore, in this paper, we propose a novel approach for label distribution learning to learn common and label-specific features with correlation information i.e. instance correlation and label correlation. First, we conduct $\ell_{2,1}-$norm regularization to select common and label-specific features, simultaneously. Then, we implement an optimization function to identify instance correlation in feature space. In addition, label correlation is collected with Pearson correlation coefficient. Finally, we design an objective function that enables the joint learning of common and label-specific features while leveraging correlation information. Comprehensive experiments manifest the superiority of our proposed approach against other well-established label distribution learning algorithms. © 2024, The Authors. All rights reserved.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

Intelligent Contract Vulnerability Detection Method Based on Bic-RL

Intelligent Contract Vulnerability Detection Method Based on...

引用

Data Security and Privacy Protection (DSPP), International Conference on

作者： Shuhui Zhang Changdong Hu Tian Lan LianHai Wang Shujiang Xu Wei Shao Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

Blockchain technology is praised for its decentralization, anonymity, and tamper-proof nature, but its complex architecture has led to numerous attacks, particularly against smart contracts. These attacks have caused significant economic losses and hindered the development of blockchain technology. Therefore, research on smart contract vulnerability detection methods has significant practical and application value. Existing detection technologies (such as symbolic execution, formal verification, and so on) have limitations, including heavy reliance on contract source code and incomplete feature extraction. This paper proposes a fully automated smart contract vulnerability detection method based on Bic-RL(Smart contracts Detection Based on Bicubic interpolation and Deep Residual Neural networks - Long short-term memory) to address these issues. This method not only simplifies the data processing process but also realizes the complete feature extraction and ensures the high efficiency of detection performance. Performance evaluation shows this method has higher detection accuracy and generalization ability, with an accuracy rate of 84.5%.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SCREADER: Prompting Large Language Models to Interpret scRNA-seq Data

arXiv

引用

arXiv 2024年

作者： Li, Cong Long, Qingqing Zhou, Yuanchun Xiao, Meng Computer Network Information Center Chinese Academy of Sciences China State Key Laboratory of Stem Cell and Reproductive Biology Institute of Zoology Chinese Academy of Sciences China University of Chinese Academy of Sciences China

Large language models (LLMs) have demonstrated remarkable advancements, primarily due to their capabilities in modeling the hidden relationships within text sequences. This innovation presents a unique opportunity in the field of life sciences, where vast collections of single-cell omics data from multiple species provide a foundation for training foundational models. However, the challenge lies in the disparity of data scales across different species, hindering the development of a comprehensive model for interpreting genetic data across diverse organisms. In this study, we propose an innovative hybrid approach that integrates the general knowledge capabilities of LLMs with domain-specific representation models for single-cell omics data interpretation. We begin by focusing on genes as the fundamental unit of representation. Gene representations are initialized using functional descriptions, leveraging the strengths of mature language models such as LLaMA-2. By inputting single-cell gene-level expression data with prompts, we effectively model cellular representations based on the differential expression levels of genes across various species and cell types. In the experiments, we constructed developmental cells from humans and mice, specifically targeting cells that are challenging to annotate. We evaluated our methodology through basic tasks such as cell annotation and visualization analysis. The results demonstrate the efficacy of our approach compared to other methods using LLMs, highlighting significant improvements in accuracy and interoperability. Our hybrid approach enhances the representation of single-cell data and offers a robust framework for future research in cross-species genetic analysis. Copyright © 2024, The Authors. All rights reserved.

关键词： Gene expression

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：