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

2024 International Conference on Intelligent Computing and Robotics, ICICR 2024

作者： Tan, Yayue Zhang, Yaqi Liu, Hui Tang, Yongqing College of Computer and Information Science School of Software Southwest University Chongqing China School of Information and Software Engineering University of Electronic Science and Technology of China Chengdu China

ISBN: (纸本)9798350372274

Anomaly detection stands as a critical element in securing space information networks (SINs). This paper delves into the realm of anomaly detection within dynamic networks, shedding light on established methodologies. The focus lies on scrutinizing various anomaly detection strategies in space information networks, conducting a comprehensive assessment of their practical applications, advantages, and drawbacks. Moreover, it introduces a novel anomaly detection approach driven by deep learning principles. This innovative method merges graph convolution techniques with a network securityoriented knowledge graph, presenting a cutting-edge solution. As a final contribution, the paper extends its purview to the future landscape of anomaly detection within space information networks, offering valuable insights into potential advancements and forthcoming trends in this domain. This holistic investigation seeks to enhance the understanding of anomaly detection paradigms within the unique context of space information networks, aiming to fortify their security measures and operational resilience. ©2024 IEEE.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Group Signature with Time-Bound Keys for Secure E-health Record Sharing

Group Signature with Time-Bound Keys for Secure E-health Rec...

引用

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Lu, Junze Hu, Chunqiang Ruan, Conghao Cai, Bin Xiang, Tao Chongqing University School of Big Data & Software Engineering China Chongqing University College of Computer Science China

ISBN: (纸本)9798350386226

With the advent of various mobile IoT devices, a large amount of e-health record (EHR) data has been generated. This data has great potential to improve medical research. However, there are many challenges regarding the sharing of medical data. Firstly, users are more inclined to interact anonymously. Secondly, verifying the validity of certificates in the case of anonymous interactions is challenging. In addition, it is necessary to uncover the identities of the actual interacting parties in the event of malicious behavior. Therefore, we address the above challenges and propose group signatures with time constraints to support anonymous and traceable EHR data sharing. First, we propose a group signature scheme that supports traceability. Second, to address the issue of validating anonymous certificates, we propose group signatures with time constraints that enable dynamic updates to validity. Through this, we can dynamically revoke group members. Lastly, security proofs and efficiency analyses demonstrate that our scheme is both secure and efficient. © 2024 IEEE.

关键词： Electronic health record

来源：评论

学校读者我要写书评

暂无评论

SFPL: Improving CRS via Prompt Learning based Semantic Fusion Module 4

SFPL: Improving CRS via Prompt Learning based Semantic Fusio...

引用

4th IEEE International Conference on Information Technology, Big Data and Artificial Intelligence, ICIBA 2024

作者： Song, Ao Lei, Zhou Chen, Shengbo Shanghai University College of Computer Engineering and Science Shanghai China Shanghai Key Laboratory of Computer Software Testing and Evaluating Shanghai China

ISBN: (纸本)9798350363586

With the popularity of the Internet and the massive increase of content production, users are faced with massive information and content, and it is often difficult to accurately and efficiently find the content that meets their needs. This information overload motivates the emergence of recommendation systems that help users filter and recommend relevant content. Dialogue recommendation systems (CRS) aim to dynamically recommend high-quality items to users while eliciting user preferences by means of dialogue. CRS mainly consists of two parts, namely, the dialogue module and the recommendation module. An efficient CRS is to solve the problems existing in the two sub-tasks of dialogue and recommendation, namely, generating appropriate responses in dialogue and predicting user favorite items in recommendation. In addition, it is necessary to adopt a suitable method to integrate these two modules to ensure the accuracy of CRS recommendation. This paper proposes an efficient way of semantic fusion module to solve the integration problem of two modules, and proves the effectiveness of our method through experiments © 2024 IEEE.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Efficient Bit-Plane Based Medical Image Cryptosystem Using Novel and Robust Sine-Cosine Chaotic Map

引用

computers, Materials & Continua 2025年第4期83卷 917-933页

作者： Zeric Tabekoueng Njitacke Louai A.Maghrabi Musheer Ahmad Turki Althaqafi Department of Electrical and Electronic Engineering College of Technology(COT)University of BueaBueaP.O.Box 63Cameroon Department of Software Engineering College of EngineeringUniversity of Business and TechnologyJeddah22246Saudi Arabia Department of Computer Engineering Jamia Millia IslamiaNew Delhi110025India Department of Computer Science School of EngineeringComputing and DesignDar Al-Hekma UniversityJeddah22246Saudi Arabia

This paper presents a high-security medical image encryption method that leverages a novel and robust sine-cosine *** map demonstrates remarkable chaotic dynamics over a wide range of *** employ nonlinear analytical tools to thoroughly investigate the dynamics of the chaotic map,which allows us to select optimal parameter configurations for the encryption *** findings indicate that the proposed sine-cosine map is capable of generating a rich variety of chaotic attractors,an essential characteristic for effective *** encryption technique is based on bit-plane decomposition,wherein a plain image is divided into distinct bit *** planes are organized into two matrices:one containing the most significant bit planes and the other housing the least significant *** subsequent phases of chaotic confusion and diffusion utilize these matrices to enhance *** auxiliary matrix is then generated,comprising the combined bit planes that yield the final encrypted *** results demonstrate that our proposed technique achieves a commendable level of security for safeguarding sensitive patient information in medical *** a result,image quality is evaluated using the Structural Similarity Index(SSIM),yielding values close to zero for encrypted images and approaching one for decrypted ***,the entropy values of the encrypted images are near 8,with a Number of Pixel Change Rate(NPCR)and Unified Average Change Intensity(UACI)exceeding 99.50%and 33%,***,quantitative assessments of occlusion attacks,along with comparisons to leading algorithms,validate the integrity and efficacy of our medical image encryption approach.

关键词： Image cryptosystem robust chaos sine-cosine map nonlinear analysis tools medical images

来源：评论

学校读者我要写书评

暂无评论

DLICA: Deep Learning based novel Strategy for Intelligent Channel Adaption in Wireless SDN-IoT Environment 3

DLICA: Deep Learning based novel Strategy for Intelligent Ch...

引用

3rd International Conference on Communication, Computing and Digital Systems, C-CODE 2023

作者： Zabeehullah Arif, Fahim Abbas, Yawar Ahmad, Shahbaz Waseem, Muhammad Computer Software Engineering Military College of Signals Rawalpindi Pakistan Computer Science University of Engineering and Technology Lahore Pakistan

ISBN: (纸本)9798350332391

software-Defined Network (SDN) is an emerging networking paradigm and provides the cost-effective scalability and flexibility required for an IoT environment. Here, wireless SDN is supposed to efficiently use limited network resources as well as provide smart traffic routing in order to deliver a bunch of IoT-generated data to the remote destination (Cloud). As, with the increasing number of IoT nodes and a huge amount of data generation, there is an immense load on SDN-IoT channels. This paper will mainly focus on appropriate channels assignment to each SDN-IoT enabled switch in order to prevent network congestion and improve network performance. Traditional fixed channel assignment algorithms in the SDN-IoT environments have failed because of large-scale and unpredictable dynamic traffic flows. In this paper, we have proposed a novel deep learning-based model called DLICA for intelligent channel assignment in wireless SDN-IoT. Moreover, a deep learning-based future traffic load prediction model has also been proposed to adaptively assign channels according to the traffic load prediction. Simulations show that proposed deep learning models achieve excellent accuracy while predicting traffic load and appropriate channel assignment. Apart from high accuracy, the proposed models also improve network performance significantly as compared to traditional channel assignment algorithms. © 2023 IEEE.

关键词： Cost effectiveness

来源：评论

学校读者我要写书评

暂无评论

Combatting the TrickBot Threat: Analysis, Impact, and Defensive Strategies in Cybersecurity 17

Combatting the TrickBot Threat: Analysis, Impact, and Defens...

引用

IEEE Congress on Cybermatics: 17th IEEE International Conference on Internet of Things, iThings 2024, 20th IEEE International Conference on Green Computing and Communications, GreenCom 2024, 17th IEEE International Conference on Cyber, Physical and Social Computing, CPSCom 2024, 10th IEEE International Conference on Smart Data, SmartData 2024

作者： Cao, Jintao Null, Allie Stewart, Marissa Bhunia, Suman Salman, Mohammad Miami University Department of Computer Science and Software Engineering OxfordOH United States University of Anbar College of Computer Anbar Iraq

ISBN: (纸本)9798350351637

The TrickBot Botnet, emerging in late 2016, has been a significant cybersecurity threat, leveraging sophisticated attack vectors such as phishing emails, network vulnerabilities, and secondary payloads. This paper provides a comprehensive analysis of TrickBot's evolution, attack methodologies, and widespread impact on individual users, businesses, and government entities. Despite some disruptions to its infrastructure, TrickBot has demonstrated remarkable resilience, continually adapting its tactics to evade detection and enhance its malicious capabilities. Our research offers detailed insights into the operational mechanisms of TrickBot, supported by extensive data on its propagation and impact. Furthermore, we evaluate various defense strategies, including advanced technical measures and human-centric approaches, to mitigate the ongoing threat posed by TrickBot and similar botnets. The findings underscore the critical need for continuous vigilance and innovation in cybersecurity practices to effectively counter such persistent threats. © 2024 IEEE.

关键词： Bot (Internet)

来源：评论

学校读者我要写书评

暂无评论

AoI Analysis for Automatic Repeat-Request in Vehicular Cooperative Perception Networks 100

AoI Analysis for Automatic Repeat-Request in Vehicular Coope...

引用

100th IEEE Vehicular Technology Conference, VTC 2024-Fall

作者： Huang, Qinan Zeng, Jianhua Guo, Chongtao Liu, Jing Pan, Haoyuan Shenzhen University College of Electronics and Information Engineering Shenzhen518060 China Shenzhen University College of Computer Science and Software Engineering Shenzhen518060 China

ISBN: (纸本)9798331517786

Cooperative perception has been shown an effective approach to address the perception limitation problem faced by the individual perception in the era of autonomous driving. Considering a two-source two-hop cooperative perception vehicular network, we investigate the average age of information (AoI) with different automatic repeat-request (ARQ) strategies in this paper. We formulate the packet transmission process as a Markov chain, which allows us to establish linear equations about the first and second moments of all states' residual waiting time for the destination to receive a new update packet. Then, we derive the average AoI based on the analytical solution to the equations. Furthermore, the analysis is applied to a special case of the single-source two-hop cooperative perception system. Simulation results show that the optimal strategy is neither non-ARQ nor infinite-ARQ, but truncated ARQ, which means that there exists a finite retransmission limit to minimize the average AoI, implying that better cooperative perception can be achieved by optimizing the retransmission limit, especially in the single-source two-hop situation. © 2024 IEEE.

关键词： Markov chains

来源：评论

学校读者我要写书评

暂无评论

Framework for Effective Utilization of Distributed Scrum in software Projects

引用

computer Systems science & engineering 2023年第1期44卷 407-422页

作者： Basit Shahzad Wardah Naeem Awan Fazal-e-Amin Ahsanullah Abro Muhammad Shoaib Sultan Alyahya Department of Software Engineering National University of Modern LanguagesIslamabad44000Pakistan Department of Software Engineering College of Computer and Information SciencesKing Saud UniversityRiyadh11543Saudi Arabia Department of Computer Science Sukkur IBA UniversitySindh65200Pakistan Department of Information Systems College of Computer and Information SciencesKing Saud UniversityRiyadh11543Saudi Arabia

There is an emerging interest in using agile methodologies in Global software Development(GSD)to get the mutual benefits of both *** is currently admired by many development teams as an agile most known meth-odology and considered adequate for collocated *** the same time,stake-holders in GSD are dispersed by geographical,temporal,and socio-cultural *** to the controversial nature of Scrum and GSD,many significant challenges arise that might restrict the use of Scrum in *** conducted a Sys-tematic Literature Review(SLR)by following Kitchenham guidelines to identify the challenges that limit the use of Scrum in GSD and to explore the mitigation strategies adopted by practitioners to resolve the *** validate our reviewfindings,we conducted an industrial survey of 305 *** results of our study are consolidated into a research *** framework represents current best practices and recommendations to mitigate the identified distributed scrum challenges and is validated byfive experts of distributed *** of the expert review were found supportive,reflecting that the framework will help the stakeholders deliver sustainable products by effectively mitigating the identified challenges.

关键词： Global software development distributed Scrum sustainable development challenges mitigation strategies

来源：评论

学校读者我要写书评

暂无评论

A Space-Efficient One-Pass Online SVM Algorithm

引用

International Journal of Computational Geometry and Applications 2024年第1-2期34卷 63-79页

作者： Liu, Yangwei Huang, Ziyun Xu, Jinhui Department of Computer Science and Engineering State University of New York at Buffalo Buffalo NY United States Department of Computer Science and Software Engineering Penn State Erie The Behrend College Erie PA United States

In this paper we consider the problem of training a Support Vector Machine (SVM) online using a stream of data in random order. We provide a fast online training algorithm for general SVM on very large datasets. Based on the geometric interpretation of SVM known as the polytope distance, our algorithm uses a gradient descent procedure to solve the problem. With high probability our algorithm outputs an (ϵ, δ)-approximation result in constant time and space, which is independent of the size of the dataset, where (ϵ, δ)-approximation means that the separating margin of the classifier is almost optimal (with error ≤ ϵ), and the number of misclassified training points is very small (with error ≤ δ). Experimental results show that our algorithm outperforms most of existing online algorithms, especially in the space requirement aspect, while maintaining high accuracy. © 2024 World Scientific Publishing Company.

关键词： online algorithm SVM

来源：评论

学校读者我要写书评

暂无评论

An Efficient Algorithm for the 2-Central Path Problem

引用

International Journal of Computational Geometry and Applications 2024年第1-2期34卷 43-61页

作者： Huang, Ziyun Zhu, Yongding Xu, Jinhui Department of Computer Science and Software Engineering Penn State Erie The Behrend College Erie PA United States Department of Computer Science and Engineering State University of New York at Buffalo Buffalo NY United States

In this paper we consider the following 2-Central Path Problem (2CPP): Given a set of m polygonal curves = {P1,P2,...,Pm} in the plane, find two curves Pu and Pl, called 2-central paths, that best represent all curves in . Despite its theoretical interest and a wide range of practical applications, 2CPP has not been well studied. In this paper, we first establish criteria that Pu and Pl ought to meet in order for them to best represent . In particular, we require that there exists parametrizations fu(t) and fl(t) (t [a,b]) of Pu and Pl respectively such that the maximum distance from {fu(t),fl(t)} to curves in is minimized. Then an efficient algorithm is presented to solve 2CPP under certain realistic assumptions. Our algorithm constructs Pu and Pl in O(nmlog4n2α(n)α(n)) time, where n is the total complexity of (i.e., the total number of vertices and edges), m is the number of curves in , and α(n) is the inverse Ackermann function. Our algorithm uses parametric search technique and is considerably faster than arrangement-related algorithms (i.e. ω(n2)) when m ≪ n as in most real applications. © 2024 World Scientific Publishing Company.

关键词： 2-central path Minkowski sum parametric search

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：