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

36th International Conference on Software Engineering Education and Training, CSEE and T 2024

作者： Deslauriers, James Michalickova, Katerina Pinney, John Gao, Liam Cooling, Chris Research Computing & Data Science Graduate School. Imperial College London London United Kingdom

ISBN: (纸本)9798350378979

In June 2023, the Imperial College London Graduate School's Research computing and data science group invited thirty PhD students for a one-day Hackathon on AI-assisted programming. This poster abstract presents our experiences in planning and running the event, and shares student and organiser reflections on the event and where it might lead. © 2024 IEEE.

关键词： ai-assisted programming generative ai training

来源：评论

学校读者我要写书评

暂无评论

An Efficient Technique for Feature Selection in Learning to Rank Using NSGA-II

An Efficient Technique for Feature Selection in Learning to ...

引用

2024 International Conference on Innovative computing, Intelligent Communication and Smart Electrical Systems, ICSES 2024

作者： Amala, K.J. Rajeswari, D. School of Computing College of Engineering and Technology Srm Institute of Science and Technology Department of Data Science and Business Systems Kattankulathur India

ISBN: (数字)9798331543624

ISBN: (纸本)9798331543617

Feature Selection (FS) is essential for optimizing Learning to Rank (LTR) models by determining the vital choice of attributes from a complex dataset. This study examines feature selection strategies within the framework of learning to rank, specifically emphasizing a multi-objective evolutionary algorithm utilizing the listwise approach. Conventional ranking algorithms frequently experience issues with superfluous or unnecessary features, undermining their efficacy. The suggested method employs a combination of instance selection, evolutionary optimization, and ensemble techniques to choose feature subsets. The methodology seeks to reduce the feature count while enhancing ranking precision, assessed via the Normalized Discounted Cumulative Gain (NDCG) metric. Experiments were performed using LETOR 4.0 dataset (MQ2007-list and MQ2008-list), evaluating proposed method against established listwise ranking algorithms like ListMLE, ListNet, RankCosine and p-ListMLE. The findings indicate that, although there are performance discrepancies relative to current algorithms, the suggested method attains substantial feature reduction up to 60 percent while maintaining competitive ranking accuracy. © 2024 IEEE.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

SMMGCL: A novel multi-level graph contrastive learning framework for integrating spatial multi-omics data

SMMGCL: A novel multi-level graph contrastive learning frame...

引用

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Wang, Bo Liu, Wei Luo, Jiawei Chen, Xiangtao Kwoh, Chee Keong Hunan University College of Computer Science and Electronic Engineering China Nanyang Technological University College of Computing and Data Science Singapore

ISBN: (纸本)9798350386226

Recent advances in spatial omics technologies have allowed various omics data to be obtained from a single tissue section. To fully explore the relationships among these different types of omics data, it is urgent to develop more effective methods for spatial multi-omics data integration. In this work, we propose a novel Multi-level Graph Contrastive Learning framework, named SMMGCL, to simultaneously mine complementary information at both spot and graph levels for integrating Spatial Multi-omics data. Specifically, to adaptively fuse multi-omics modalities, we first design a multi-modality autoencoder that integrates spatial locations with spot omic expressions to extract modality-specific embeddings. These embeddings are then fused into a consensus representation using an attention mechanism to capture spot-level cross-omics representations. Next, to explore the complex inter-omic structural information, we connect corresponding spots across different omics adjacency graphs into a heterogeneous graph. We then employ a graph convolutional network (GCN) to extract spatial correlations across the omics, learning a graph-level cross-omics global representation. Finally, SMMGCL aligns feature similarity matrixes between spot-level and graph-level representations with their pseudo-label similarity matrix, ensuring multi-level clustering consistency and leading to more accurate spatial multi-omics integration. Experimental results on simulated and real datasets from across tissues show that SMMGCL consistently outperforms other state-of-the-art methods in spatial multi-omics integration performance. The code for SMMGCL is available for download from the GitHub repository at https://***/cs-wangbo/SMMGCL. © 2024 IEEE.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Non-reciprocity in the elastic chain 1

Non-reciprocity in the elastic chain

引用

IEEE AITU: 1st International Student Conference: "Digital Generation", AITU 2024

作者： Sultan, Aubakirov Rakhimzhanova, Anar Software Engeneering Astana IT University Astana Kazakhstan Computing and Data Science Astana IT University Astana Kazakhstan

ISBN: (纸本)9798350364378

We consider a microstructural lattice model consisting of two springs of different stiffness and identical mass. The dynamic behavior of the elastic system is investigated analytically and compared with numerical solutions. The results for the dispersion relation of the model have demonstrated obvious advantages associated with the manipulation of elastic wave propagation. Based on the model, a non-reciprocal device design is introduced by incorporating a gyroscopic spinner into one of the isolated masses. A particular non-reciprocal effect for transmitted waves due to the coupling effect is verified based on the theoretical concept supported by the computation of two mutual work between the applied forces. ©2024 IEEE.

关键词： Wave propagation

来源：评论

学校读者我要写书评

暂无评论

Fast Bipartitioned Hybrid Adder Utilizing Carry Select and Carry Lookahead Logic 9

Fast Bipartitioned Hybrid Adder Utilizing Carry Select and C...

引用

9th International Conference on Mathematics and Computers in sciences and Industry, MCSI 2024

作者： Balasubramanian, Padmanabhan Maskell, Douglas L. Nanyang Technological University College of Computing and Data Science 50 Nanyang Avenue Singapore639798 Singapore

ISBN: (纸本)9798350377224

We present a novel fast bipartitioned hybrid adder (FBHA) that utilizes carry-select and carry-lookahead logic. The proposed FBHA is an accurate adder with a significant part and a less significant part joined together by a carry signal. In an N-bit FBHA, the K-bit less significant part is realized using carry-lookahead adder logic, and the (N - K)-bit significant part is realized using carry-select adder logic. The 32-bit addition was considered as an example operation for this work. Many 32-bit adders ranging from the slow ripple carry adder to the fast parallel-prefix Kogge-Stone adder and the proposed adder were synthesized using a 28-nm CMOS standard cell library and their design metrics were compared. A well-optimized FBHA achieved significant optimizations in design metrics compared to its high-speed adder counterparts and some examples are mentioned as follows: (a) 19.8% reduction in delay compared to a carry-lookahead adder;(b) 19.8% reduction in delay, 24.4% reduction in area, and 19.4% reduction in power compared to a carry-select adder;(c) 45.6% reduction in delay, and 13.5% reduction in power compared to a conditional sum adder;and (d) 46.5% reduction in area, and 29.3% reduction in power compared to the Kogge-Stone adder © 2024 IEEE.

关键词： CMOS integrated circuits

来源：评论

学校读者我要写书评

暂无评论

Underwater target recognition based on adaptive multi-feature fusion network

引用

Multimedia Tools and Applications 2025年第10期84卷 7297-7317页

作者： Pan, Xiaoying Sun, Jia Feng, TianHao Lei, MingZhu Wang, Hao Zhang, WuXia Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi’an710121 China Xi’an Key Laboratory of Big Data and Intelligent Computing Xi’an710121 China School of Computer Science and Technology Xi’an University of Post & Telecommunications Xi’an710121 China

Due to the complexity of the underwater environment, underwater acoustic target recognition is more challenging than ordinary target recognition, and has become a hot topic in the field of underwater acoustics research. In recent years, deep learning has been widely used in underwater recognition due to its powerful feature learning capabilities. However, most deep learning-based underwater target recognition methods use only the time-frequency domain features of signals, ignoring the frequency domain image features of signals. Additionally, they only use simple summation or splicing strategies to fuse and discriminate the extracted features, which leads to limited improvement in the accuracy of underwater target recognition. To address these issues, this paper proposes an underwater target recognition method based on an adaptive multi-feature fusion network. The method consists of a data pre-processing module, a multi-dimensional feature extraction module, and an adaptive multi-feature fusion module. In the multi-dimensional feature extraction module, the long short time memory network (LSTM) and the one-dimensional convolutional neural network (1DCNN) are used to extract the time-frequency features of the underwater signal. Furthermore, the two-dimensional convolutional neural network (2DCNN) is used to extract the image features in the frequency domain. The adaptive multi-feature fusion module uses an attention mechanism for adaptive weighted fusion to make full use of the learned features. The effectiveness of the proposed method is validated on the ShipEar dataset, and the recognition accuracy reaches 94.92%, which is higher than other existing methods. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Delay-CJ:A novel cryptojacking covert attack method based on delayed strategy and its detection

引用

Digital Communications and Networks 2023年第5期9卷 1169-1179页

作者： Guangquan Xu Wenyu Dong Jun Xing Wenqing Lei Jian Liu Lixiao Gong Meiqi Feng Xi Zheng Shaoying Liu Big Data School Qingdao Huanghai UniversityQingdao266427China College of Intelligence and Computing Tianjin UniversityTianjin300350China School of Computing Macquarie UniversityNSW2109Australia Graduate School of Advanced Science and Engineering Hiroshima UniversityJapan

Cryptojacking is a type of resource embezzlement attack,wherein an attacker secretly executes the cryptocurrency mining program in the target host to gain *** has been common since 2017,and in fact,it once became the greatest threat to network *** better prove the attack ability the harm caused by cryptojacking,this paper proposes a new covert browser-based mining attack model named Delay-CJ,this model was deployed in a simulation environment for *** on the general framework of cryptojacking,Delay-CJ adds hybrid evasion detection techniques and applies the delayed execution strategy specifically for video websites in the prototype *** results show that the existing detection methods used for testing may become invalid as result of this *** view of this situation,to achieve a more general and robust detection scheme,we built a cryptojacking detection system named CJDetector,which is based on cryptojacking process ***,it identifies malicious mining by monitoring CPU usage and analyzing the function call *** system not only effectively detects the attack in our example but also has universal *** recognition accuracy of CJDetector reaches 99.33%.Finally,we tested the web pages in Alexa 50K websites to investigate cryptojacking activity in the real *** found that although cryptojacking is indeed on the decline,it remains a part of network security threats that cannot be ignored.

关键词： Cryptojacking Evasion techniques Delayed strategy Cryptocurrency mining Behavior-based detection

来源：评论

学校读者我要写书评

暂无评论

Expanding the Vocabulary of BERT for Knowledge Base Construction 1

Expanding the Vocabulary of BERT for Knowledge Base Construc...

引用

1st Workshop on Knowledge Base Construction from Pre-Trained Language Models and the 2nd Challenge on Language Models for Knowledge Base Construction, KBC-LM + LM-KBC 2023

作者： Yang, Dong Wang, Xu Celebi, Remzi Institute of Data Science Department of Advanced Computing Sciences Maastricht University Netherlands

Knowledge base construction entails acquiring structured information to create a knowledge base of factual and relational data, facilitating question answering, information retrieval, and semantic understanding. The challenge called"Knowledge Base Construction from Pretrained Language Models" at International Semantic Web Conference 2023 defines tasks focused on constructing knowledge base using language model. Our focus was on Track 1 of the challenge, where the parameters are constrained to a maximum of 1 billion, and the inclusion of entity descriptions within the prompt is prohibited. Although the masked language model offers sufficient flexibility to extend its vocabulary, it is not inherently designed for multi-token prediction. To address this, we present Vocabulary Expandable BERT for knowledge base construction, which expand the language model’s vocabulary while preserving semantic embeddings for newly added words. We adopt task-specific re-pre-training on masked language model to further enhance the language model. Through experimentation, the results show the effectiveness of our approaches. Our framework achieves F1 score of 0.323 on the hidden test set and 0.362 on the validation set, both data set is provided by the challenge. Notably, our framework adopts a lightweight language model (BERT-base, 0.13 billion parameters) and surpasses the model using prompts directly on large language model (Chatgpt-3, 175 billion parameters). Besides, Token-Recode achieves comparable performances as Re-pretrain. This research advances language understanding models by enabling the direct embedding of multi-token entities, signifying a substantial step forward in link prediction task in knowledge graph and metadata completion in data management. 1 © 2023 CEUR-WS. All rights reserved.

关键词： Information management

来源：评论

学校读者我要写书评

暂无评论

Massively parallel algorithms for fully dynamic all-pairs shortest paths

引用

Frontiers of Computer science 2024年第4期18卷 201-203页

作者： Chilei WANG Qiang-Sheng HUA Hai JIN Chaodong ZHENG National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabCluster and Grid Computing LabSchool of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China State Key Laboratory for Novel Software Technology Nanjing UniversityNanjing 210023China

1 Introduction In recent years,the Massively Parallel Computation(MPC)model has gained significant ***,most of distributed and parallel graph algorithms in the MPC model are designed for static graphs[1].In fact,the graphs in the real world are constantly *** size of the real-time changes in these graphs is smaller and more *** graph algorithms[2,3]can deal with graph changes more efficiently[4]than the corresponding static graph ***,most studies on dynamic graph algorithms are limited to the single machine ***,a few parallel dynamic graph algorithms(such as the graph connectivity)in the MPC model[5]have been proposed and shown superiority over their parallel static counterparts.

关键词： dynamic shortest gained

来源：评论

学校读者我要写书评

暂无评论

A Progressive Skip Reasoning Fusion Method for Multi-Modal Classification 24

A Progressive Skip Reasoning Fusion Method for Multi-Modal C...

引用

32nd ACM International Conference on Multimedia, MM 2024

作者： Guo, Qian Liang, Xinyan Qian, Yuhua Cui, Zhihua Wen, Jie Shanxi Key Laboratory of Big Data Analysis and Parallel Computing Taiyuan University of Science and Technology Taiyuan China Institute of Big Data Science and Industry Shanxi University Taiyuan China

ISBN: (纸本)9798400706868

In multi-modal classification tasks, a good fusion algorithm can effectively integrate and process multi-modal data, thereby significantly improving its performance. Researchers often focus on the design of complex fusion operators and have proposed numerous fusion operators, while paying less attention to the design of feature fusion usage, specifically how features should be fused to better facilitate multi-modal classification tasks. In this article, we propose a progressive skip reasoning fusion network (PSRFN) to make some attempts to address this issue. Firstly, unlike most existing multi-modal fusion methods that only use one fusion operator in a single stage to fuse all view features, PSRFN utilizes the progressive skip reasoning (PSR) block to fuse all views with a fusion operator at each layer. Specifically, each PSR block utilizes all view features and the fused features from the previous layer to jointly obtain the fused features for the current layer. Secondly, each PSR block utilizes a dual-weighted fusion strategy with learnable parameters to adaptively allocate weights during the fusion process. The first level of weighting assigns weights to each view feature, while the second level assigns weights to the fused features from the previous layer and the fused features obtained from the first level of weighting in the current layer. This strategy ensures that the PSR block can dynamically adjust the weights based on the actual contribution of features. Finally, to enable the model to fully utilize feature information from different levels for feature fusion, the skip connections are adopted between PSR blocks. Extensive experiment results on six real multi-modal datasets show that a better usage for fusion operator is indeed able to improve performance. © 2024 ACM.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：