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

X-ray Security Inspection Prohibited Items Detection Model based on Improved YOLOv7-tiny

IAENG International Journal of Applied Mathematics 2024年第7期54卷 1279-1287页

作者： Teng, Wenzhao Zhang, Haigang Zhang, Yujun School of Computer Science and Software Engineering University of Science and Technology Liaoning Anshan114051 China Shenzhen Polytechnic University Shenzhen China Computer Science and Software Engineering University of Science and Technology Liaoning Anshan114051 China

X-ray security inspection for detecting prohibited items is widely used to maintain social order and ensure the safety of people’s lives and property. Due to the large number of parameters and high computational complexity, most current object detection models are challenging to deploy on portable mobile security inspection devices. Therefore, this paper proposes an improved YOLOv7-tiny model for application in prohibited item detection tasks. Firstly, the feature extraction backbone network is replaced with the lightweight GhostNet network to reduce computational complexity and improve detection speed. Secondly, the FPN in the Neck is replaced with BiFPN, further reducing computational complexity and memory access through skip connections. Finally, a lightweight CA attention mechanism is embedded between the Backbone and Neck layers, and the Focal-EIoU Loss function is employed to enhance the detection capability for small-sized items. Experimental results on the SIXray public dataset show a 14.8% reduction in model parameters, a 19.7% reduction in computational complexity, and a 15.9% reduction in volume after the improvements. The detection speed increases from 82.4 to 90.2, and the detection accuracy for prohibited items reaches 90.3%. The experimental results demonstrate that the improved model achieves overall lightweighting while maintaining a high detection rate and improving detection speed. © (2024), (International Association of Engineers). All Rights Reserved.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

Query-Efficient Textual Adversarial Example Generation for Black-Box Attacks

Query-Efficient Textual Adversarial Example Generation for B...

引用

2024 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, NAACL 2024

作者： Yu, Zhen Chen, Zhenhua He, Kun School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9798891761148

Deep neural networks for Natural Language Processing (NLP) have been demonstrated to be vulnerable to textual adversarial examples. Existing black-box attacks typically require thousands of queries on the target model, making them expensive in real-world applications. In this paper, we propose a new approach that guides the word substitutions using prior knowledge from the training set to improve the attack efficiency. Specifically, we introduce Adversarial Boosting Preference (ABP), a metric that quantifies the importance of words and guides adversarial word substitutions. We then propose two query-efficient attack strategies based on ABP: query-free attack (ABPfree) and guided search attack (ABPguide). Extensive evaluations for text classification demonstrate that ABPfree generates more natural adversarial examples than existing universal attacks, ABPguide significantly reduces the number of queries by a factor of 10 ∼ 500 while achieving comparable or even better performance than black-box attack baselines. Furthermore, we introduce the first ensemble attack ABPens in NLP, which gains further performance improvements and achieves better transferability and generalization by the ensemble of the ABP across different models and domains. Code is available at https://***/BaiDingHub/ABP. © 2024 Association for Computational Linguistics.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Resilient TCP Variant Enabling Smooth Network Updates for Software-Defined Data Center Networks

引用

Tsinghua science and technology 2024年第5期29卷 1615-1632页

作者： Abdul Basit Dogar Sami Ullah Yiran Zhang Hisham Alasmary Muhammad Waqas Sheng Chen Department of Computer Science and Technology Tsinghua UniversityBeijing 100084China and also with Department of Informatics and SystemsUniversity of Management and TechnologyLahore 54660Pakistan Department of Computer Science Shaheed Benazir Bhutto UniversitySheringalUpper Dir 18050Pakistan School of Computer Science Beijing University of Posts and TelecommunicationsBeijing 100876China Department of Computer Science College of Computer ScienceKing Khalid UniversityAbha 61421Saudi Arabia Department of Computer Engineering Faculty of Information TechnologyUniversity of BahrainSakheer 32038Bahrainand also with School of EngineeringEdith Cowan UniversityPerth WA 6027Australia School of Electronics and Computer Science University of SouthamptonSouthamptonSO171BJUK

Network updates have become increasingly prevalent since the broad adoption of software-defined networks(SDNs)in data *** TCP designs,including cutting-edge TCP variants DCTCP,CUBIC,and BBR,however,are not resilient to network updates that provoke flow *** this paper,we first demonstrate that popular TCP implementations perform inadequately in the presence of frequent and inconsistent network updates,because inconsistent and frequent network updates result in out-of-order packets and packet drops induced via transitory congestion and lead to serious performance *** look into the causes and propose a network update-friendly TCP(NUFTCP),which is an extension of the DCTCP variant,as a *** are used to assess the proposed *** findings reveal that NUFTCP can more effectively manage the problems of out-of-order packets and packet drops triggered in network updates,and it outperforms DCTCP considerably.

关键词： software defined data center networks network updates DCTCP out-of-order packets packet drop SDN

来源：评论

学校读者我要写书评

暂无评论

Modern Standard Arabic speech disorders corpus for digital speech processing applications

引用

International Journal of Speech technology 2024年第1期27卷 157-170页

作者： Alqudah, Assal A. M. Alshraideh, Mohammad A. M. Abushariah, Mohammad A. M. Sharieh, Ahmad A. S. Department of Computer Science King Abdullah II School of Information Technology The University of Jordan Amman Jordan Department of Computer Information Systems King Abdullah II School of Information Technology The University of Jordan Amman Jordan Department of Computer Science Faculty of Science and Information Technology Al-Zaytoonah University of Jordan Amman Jordan

Digital speech processing applications including automatic speech recognition (ASR), speaker recognition, speech translation, and others, essentially require large volumes of speech data for training and testing purposes. Although there are available speech corpora, speech data for speakers suffering speech disorders are hardly available for many languages including Arabic language. Consequently, developing digital speech processing applications that target the entire society becomes hard due to the unavailability of speech corpora that contain sufficient speakers’ variations including healthy and disordered speech. This research presents our work towards developing a Modern Standard Arabic (MSA) speech corpus for speakers suffering distortion and substitution articulation disorders. The speech corpus was recorded by 40 (20 male and 20 female) Jordanian speakers who suffer either distortion or/and substitution articulation disorders. This speech corpus can be used for various applications including ASR, speech and hearing, and others. Part of this speech corpus is used for developing and evaluating an ASR for MSA using the Carnegie Mellon University (CMU) Pocketsphinx tools based on Mel-Frequency Cepstral Coefficients (MFCC) and Hidden Markov Model (HMM) techniques. Furthermore, Linear Discriminant Analysis (LDA) and Maximum Likelihood Linear Transform (MLLT) optimization techniques were applied. Using three different testing data sets, this work obtained 98.38% and 1.76% average word recognition correctness rate (WRCR) and average Word Error Rate (WER), respectively, for speaker-dependent and text-independent. For speaker-independent and text-dependent, this work obtained 99.37% and 0.68% average WRCR and average WER, respectively, whereas for speaker-independent and text-independent this work obtained 96.53% and 4.00% average WRCR and average WER, respectively. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Natur

关键词： Hidden Markov models

来源：评论

学校读者我要写书评

暂无评论

Breaking the Boundaries: A Unified Framework for Chinese Named Entity Recognition Across Text and Speech

Breaking the Boundaries: A Unified Framework for Chinese Nam...

引用

2024 Findings of the Association for Computational Linguistics, EMNLP 2024

作者： Ning, Jinzhong Sun, Yuanyuan Xu, Bo Yang, Zhihao Luo, Ling Lin, Hongfei School of Computer Science and Technology Dalian University of Technology China

ISBN: (纸本)9798891761681

In recent years, with the vast and rapidly increasing amounts of spoken and textual data, Named Entity Recognition (NER) tasks have evolved into three distinct categories, i.e., text-based NER (TNER), Speech NER (SNER) and Multimodal NER (MNER). However, existing approaches typically require designing separate models for each task, overlooking the potential connections between tasks and limiting the versatility of NER methods. To mitigate these limitations, we introduce a new task named Integrated Multimodal NER (IMNER) to break the boundaries between different modal NER tasks, enabling a unified implementation of them. To achieve this, we first design a unified data format for inputs from different modalities. Then, leveraging the pre-trained MMSpeech model as the backbone, we propose an Integrated Multimodal Generation Framework (IMAGE), formulating the Chinese IMNER task as an entity-aware text generation task. Experimental results demonstrate the feasibility of our proposed IMAGE framework in the IMNER task. Our work in integrated multimodal learning in advancing the performance of NER may set up a new direction for future research in the field. Our source code is available at https://***/NingJinzhong/IMAGE4IMNER. © 2024 Association for Computational Linguistics.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

JPEG Reversible Data Hiding via Block Sorting Optimization and Dynamic Iterative Histogram Modification

引用

IEEE Transactions on Multimedia 2025年 27卷 3729-3743页

作者： Li, Fengyong Wang, Qiankuan Cheng, Hang Zhang, Xinpeng Qin, Chuan Shanghai University of Electric Power College of Computer Science and Technology Shanghai201306 China Fuzhou University School of Mathematics and Statistics Fujian Fuzhou350108 China Fudan University School of Computer Science Shanghai200433 China University of Shanghai for Science and Technology School of Optical-Electrical and Computer Engineering Shanghai200093 China

JPEG reversible data hiding (RDH) refers to covert communication technology to accurately extract secret data while also perfectly recovering the original JPEG image. With the development of cloud services, a large number of private JPEG images can be efficiently managed in cloud platforms by embedding user ID or authentication labels. Nevertheless, data embedding operations may inadvertently disrupt the encoding sequence of the original JPEG image, resulting in severe distortion of the host image when it is re-compressed to JPEG format. To address this problem, this paper proposes a new JPEG RDH scheme based on block sorting optimization and dynamic iterative histogram modification. We firstly design a block ordering optimization strategy by combining the number of zero coefficients and the quantization table values of non-zero coefficients in a DCT block. Subsequently, a dynamic iterative histogram modification scheme is proposed by considering the local features and embedding capability of histograms generated from different texture images. According to the given payloads, we introduce different parameters to control the iterations of two-dimensional histogram and then adaptively generate the optimal histogram modification mapping, which can realize low JPEG file size increments by guaranteeing most of the AC coefficients unchanged as much as possible. Numerous experiments have shown that our scheme can achieve an effective balance among embedding capacity, visual quality, file size increment, computational complexity, and outperforms the state-of-the-arts in terms of the above metrics. © 1999-2012 IEEE.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Overlapping community‐based particle swarm optimization algorithm for influence maximization in social networks

引用

CAAI Transactions on Intelligence technology 2023年第3期8卷 893-913页

作者： Lei Zhang Yutong Liu Haipeng Yang Fan Cheng Qi Liu Xingyi Zhang Information Materials and Intelligent Sensing Laboratory of Anhui Province Key Laboratory of Intelligent Computing and Signal Processing of Ministry of EducationSchool of Computer Science and TechnologyAnhui UniversityHefeiChina School of Computer Science and Technology University of Science and Technology of ChinaHefeiChina

Influence maximization,whose aim is to maximise the expected number of influenced nodes by selecting a seed set of k influential nodes from a social network,has many applications such as goods advertising and rumour *** the existing influence maximization methods,the community‐based ones can achieve a good balance between effectiveness and ***,this kind of algorithm usually utilise the network community structures by viewing each node as a non‐overlapping *** fact,many nodes in social networks are overlapping ones,which play more important role in influence *** this end,an overlapping community‐based particle swarm opti-mization algorithm named OCPSO for influence maximization in social networks,which can make full use of overlapping nodes,non‐overlapping nodes,and their interactive information is ***,an overlapping community detection algorithm is used to obtain the information of overlapping community structures,based on which three novel evolutionary strategies,such as initialisation,mutation,and local search are designed in OCPSO for better finding influential *** results in terms of influence spread and running time on nine real‐world social networks demonstrate that the proposed OCPSO is competitive and promising comparing to several state‐of‐the‐arts(***,CMA‐IM,CIM,CDH‐SHRINK,CNCG,and CFIN).

关键词： computational intelligence data mining social network

来源：评论

学校读者我要写书评

暂无评论

Student Performance Prediction Using Stacking Ensemble Learning 4

Student Performance Prediction Using Stacking Ensemble Learn...

引用

4th International Conference on Electronic Information Engineering and computer Communication, EIECC 2024

作者： Tao, Yibo Yang, Yong Qu, Fuheng Liu, Yuyao Changchun University of Science and Technology School of Computer Science and Technology Changchun China

ISBN: (纸本)9798331534622

Student grade prediction is an important research topic in educational data mining. To address the issues of low prediction accuracy and poor generalization encountered by single models in predicting student grades, this paper proposes a Stacking ensemble learning model that integrates multiple individual models. The proposed model uses Support Vector Machine (SVM), Decision Tree, and Random Forest as base learners, with Logistic Regression (LR) serving as the metalearner, forming a two-layer Stacking ensemble learning framework. The results demonstrate that the Stacking ensemble learning model achieves an accuracy of 91.6%, precision of 92.1%, recall of 93.8%, and an F1-score of 93.0%. These performance metrics are significantly better than those of individual learning models, indicating that the proposed Stacking model can effectively predict students' academic performance. © 2024 IEEE.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

ResilioMate: A Resilient Multi-Agent Task Executing Framework for Enhancing Small Language Models

引用

IEEE Access 2025年 13卷 86892-86911页

作者： Xiong, Yubing Huang, Mingrui Liang, Xuechen Tao, Meiling East China Jiaotong University School of Transportation Engineering Jiangxi Nanchang330013 China Guangdong University of Technology School of Computer Science and Technology Guangzhou510006 China

Recent advances in large language models (LLMs) have been limited by their processing requirements and vulnerability to adversarial assaults, whilst short language models (SLMs) struggle with performance consistency in complex tasks. This research introduces ResilioMate, a resilient multi-agent framework that enhances SLMs by utilizing distributed cognitive burden distribution, dual-scale memory systems, and collaborative bias prevention strategies. The method employs dynamic task decomposition across specialized agents (e.g., Assistant, Checker) to minimize computational costs and combines short-term trajectory tracking with long-term self-reflective optimization for adaptive execution. At its core, the LeptoConnect model series (1.8B/7B parameters) is created using hybrid attention distillation and dynamic curriculum learning to enable cross-domain competence while retaining SLM efficiency. ResilioMate accomplishes three critical improvements: 1) The 1.8B LeptoConnect model attains 81.6% of GPT-4’s performance in knowledge graph construction through parameter-efficient fine-tuning with structured weight matrices;2) LeptoConnect-7B achieves a score of 41.3 in database operations, compared to GPT-4’s 32.0, through collaborative cognitive load allocation;and 3) A bias-interception network effectively suppresses adversarial propagation while achieving code correction performance of ROUGE-L’s 42.86. The framework’s dual-scale memory architecture reduces computational redundancy by 26.4% through real-time task tracking and multi-agent knowledge refinement. These developments illustrate ResilioMate’s efficacy in bridging the performance gap between SLMs and LLMs, offering a scalable solution for the deployment of efficient language agents in real-time and peripheral computing environments. © 2013 IEEE.

关键词： Computational grammars

来源：评论

学校读者我要写书评

暂无评论

Neighborhood Combination Search for Single-Machine Scheduling with Sequence-Dependent Setup Time

引用

Journal of computer science & technology 2024年第3期39卷 737-752页

作者：刘晓路徐宏云陈嘉铭苏宙行吕志鹏丁俊文 College of System Engineering National University of Defense TechnologyChangsha 410015China School of Artificial Intelligence Jianghan UniversityWuhan 430056China Xi’an Satellite Control Center Xi’an 710043China School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China CCF

In a local search algorithm,one of its most important features is the definition of its neighborhood which is crucial to the algorithm's *** this paper,we present an analysis of neighborhood combination search for solv-ing the single-machine scheduling problem with sequence-dependent setup time with the objective of minimizing total weighted tardiness(SMSWT).First,We propose a new neighborhood structure named Block Swap(B1)which can be con-sidered as an extension of the previously widely used Block Move(B2)neighborhood,and a fast incremental evaluation technique to enhance its evaluation ***,based on the Block Swap and Block Move neighborhoods,we present two kinds of neighborhood structures:neighborhood union(denoted by B1UB2)and token-ring search(denoted by B1→B2),both of which are combinations of B1 and ***,we incorporate the neighborhood union and token-ring search into two representative metaheuristic algorithms:the Iterated Local Search Algorithm(ILSnew)and the Hybrid Evolutionary Algorithm(HEA_(new))to investigate the performance of the neighborhood union and token-ring ***-sive experiments show the competitiveness of the token-ring search combination mechanism of the two *** on the 120 public benchmark instances,our HEA_(new)has a highly competitive performance in solution quality and computational time compared with both the exact algorithms and recent *** have also tested the HEA,new algorithm with the selected neighborhood combination search to deal with the 64 public benchmark instances of the single-machine scheduling problem with sequence-dependent setup *** is able to match the optimal or the best known results for all the 64 *** particular,the computational time for reaching the best well-known results for five chal-lenging instances is reduced by at least 61.25%.

关键词： single-machine scheduling sequence-dependent setup time neighborhood combination search token-ring search hybrid evolutionary algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：