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

11th International Conference on Electrical Engineering, computer science and Informatics, EECSI 2024

作者： Mulyati Stiawan, Deris Widhiarso, Wijang Budiarto, Rahmat Multi Data Palembang University & Faculty of Engineering Universitas Sriwijaya Department of Information System Palembang Indonesia Sriwijaya University Faculty of Computer Science Palembang Indonesia Multi Data Palembang University Department of Informatics Palembang Indonesia College of Computer Science & IT Albaha University Saudi Arabia

ISBN: (纸本)9798350355314

Effective and efficient cyber incident handling is crucial for maintaining the security of information systems and organizational data. This research aims to develop a priority-based cyber incident handling method by adopting the NIST 2.0 framework and utilizing machine learning classification algorithms. This method enables organizations to quickly and accurately identify and respond to incidents based on threat levels and impact, focusing resources on the most critical incidents. The research employs the Support Vector Machine (SVM) classification algorithm to determine incident priorities. The study is still developing for handling cyber incidents, followed by testing and evaluating the system prototype within organizations. Initial results indicate that the priority-based approach using the SVM classification algorithm achieves a True Positive (TP) Rate of 0.999 and a False Positive (FP) Rate of 0.008, with a correlation of 98.88%, resulting in excellent performance in identifying positive cases and a low error rate. © 2024 IEEE.

关键词： Cyber attacks

来源：评论

学校读者我要写书评

暂无评论

Countering DoS Threats in WSN: Inventive Machine Learning Strategies with a Minimalistic Twist 1

Countering DoS Threats in WSN: Inventive Machine Learning St...

引用

1st IEEE International Conference on Smart Power Control and Renewable Energy, ICSPCRE 2024

作者： Chidambaranathan, Senthilnathan Vanitha Sasireka, C.S. Jose, Naduvathezhath Nessariose Rao, K. Madhusudhana Devi, T. Lakshmi Architecture and Design Virtusa India Sri Sairam Institute of Technolgoy Department of Computer Science and Engineering India Srm Institute of Science and Technology Department of Computer Science and Engineering India Regent Strategic Solutions Rochester United States Kkr&ksr Institute Of Technology & Science A.P Guntur India Department of Data Science Telangana Hyderabad501506 India

ISBN: (纸本)9798350377002

In the era of expanding wireless sensor network (WSN) applications, safeguarding these networks against a spectrum of threats, including Denial-of-Service (DoS) attacks, is paramount. The innate resource limitations of sensor nodes often render conventional security measures ineffective. This study introduces a pioneering approach integrating minimalist machine learning techniques to combat DoS attacks within WSNs. Our methodology adeptly leverages machine learning capabilities while strategically curbing computational and resource demands. By distilling essential features from network traffic patterns, our model adeptly identifies aberrations signaling DoS attacks, all while preserving the efficiency of resource-limited sensor nodes. Its minimalist framework seamlessly integrates with existing WSN architectures, negating the need for substantial hardware upgrades and maintaining network performance. Results underscore the superior detection accuracy and efficiency of our minimalist machine learning strategy compared to traditional methods. Moreover, its scalability and adaptability render it ideal for deployment across varied WSN setups, fortifying them against DoS threats while safeguarding core network *** mitigating DoS attack impacts without burdening computational resources, our approach marks a significant stride towards bolstering the security and dependability of wireless sensor networks amid evolving threat landscapes. © 2024 IEEE.

关键词： Sensor nodes

来源：评论

学校读者我要写书评

暂无评论

Few-shot Prompting for Pairwise Ranking: An Effective Non-Parametric Retrieval Model

Few-shot Prompting for Pairwise Ranking: An Effective Non-Pa...

引用

2024 Conference on Empirical Methods in Natural Language Processing, EMNLP 2024

作者： Sinhababu, Nilanjan Parry, Andrew Ganguly, Debasis Samanta, Debasis Mitra, Pabitra Centre for Computational and Data Sciences IIT Kharagpur India School of Computing Science University of Glasgow United Kingdom Department of Computer Science and Engineering IIT Kharagpur India

ISBN: (纸本)9798891761681

A supervised ranking model, despite its effectiveness over traditional approaches, usually involves complex processing - typically multiple stages of task-specific pre-training and fine-tuning. This has motivated researchers to explore simpler pipelines leveraging large language models (LLMs) that can work in a zero-shot manner. However, since zero-shot inference does not make use of a training set of pairs of queries and their relevant documents, its performance is mostly worse than that of supervised models, which are trained on such example pairs. Motivated by the existing findings that training examples generally improve zero-shot performance, in our work, we explore if this also applies to ranking models. More specifically, given a query and a pair of documents, the preference prediction task is improved by augmenting examples of preferences for similar queries from a training set. Our proposed pairwise few-shot ranker demonstrates consistent improvements over the zero-shot baseline on both in-domain (TREC DL) and out-domain (BEIR subset) retrieval benchmarks. Our method also achieves a close performance to that of a supervised model without requiring any complex training pipeline. © 2024 Association for Computational Linguistics.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

Probabilistic Reliability via Subsystem Structures of Arrangement Graph Networks

引用

IEEE Transactions on Reliability 2024年第1期73卷 279-289页

作者： Huang, Yanze Lin, Limei Xu, Li Hsieh, Sun-Yuan Fujian University of Technology Fujian Provincial Key Laboratory of Big Data Mining and Applications School of Computer Science and Mathematics Fuzhou350118 China Fujian Normal University College of Computer and Cyber Security Key Laboratory of Network Security and Cryptology Fuzhou350117 China National Cheng Kung University Department of Computer Science and Information Engineering Tainan701 Taiwan

With the rapid growth of the number of processors in a multiprocessor system, faulty processors occur in it with a probability that rises quickly. The probability of a subsystem with an appropriate size being fault-free in a definite time interval is a significant and practical measure of the reliability for a multiprocessor system, which characterizes the functionality of a multiprocessor system well. Motivated by the study of subgraph reliability, as well as the attractive structure and fault tolerance properties of (n, k)-arrangement graph A n, k, we focus on the subgraph reliability for A n, k under the probabilistic fault model in this article. First, we investigate intersections of no more than four subgraphs in A n, k, and classify all the intersecting modes. Second, we focus on the probability P(q, A n, k n-1, k-1) with which at least one (n-1, k-1)-subarrangement graph is fault-free in A n, k, when given a uniform probability q with which a single vertex is fault-free, and we establish the P(q, A n, kn-1, k-1) by adopting the principle of inclusion-exclusion under the probabilistic fault model. Finally, we study the probabilistic fault model involving a nonuniform probability with which a single vertex is fault-free, and we prove that the P(q, A n, kn-1, k-1) under both models is very close to the asymptotic value by both theoretical arguments and experimental results. © 1963-2012 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Comparative Analysis of CNN and SVM Machine Learning Techniques for Plant Disease Detection 4th

Comparative Analysis of CNN and SVM Machine Learning Techniq...

引用

4th International Conference on data, Engineering, and Applications, IDEA 2022

作者： Adeniyi, Abidemi Emmanuel Madamidola, Olugbenga Ayomide Awotunde, Joseph Bamidele Misra, Sanjay Agrawal, Akshat Department of Computer Science College of Computing and Communication Studies Bowen University Iwo Nigeria Department of Information Technology Federal University of Technology Akure Nigeria Department of Computer Science Faculty of Communication and Information Sciences University of Ilorin Ilorin Nigeria Department of Applied Data Science Institute for Energy Technology Halden Norway Department of Computer Science & Engineering Amity University Haryana Gurugram122412 India

ISBN: (纸本)9789819700363

The growing advancement of different jobs, skills and businesses has stimulated the spread of diseases. Most of the time, these diseases can cross countries’ borders and spread at a very rapid rate. Avoiding and detecting these infections have proved to be a major problem for our public health and one that must be treated with great importance. Crop disease has haunted, farmers have been victimized for several decades, and a remedy must be offered to halt this damage. As a result, a system should be developed to detect plant disease. Untreated plant diseases ultimately result in a loss to the farmer. Traditional methods of detecting plant disease have become less efficient and inaccurate;thus there is need to improve on the techniques of plant disease detection, as a reliable detection of plant diseases will greatly improve the quality of food crops produced and decrease the threat plant diseases pose to food security. Therefore, this study is aimed at analyzing comparatively, two machine learning language techniques convolutional neural network (CNN) and support vector machine (SVM) in terms of their respective accuracy in detecting plant diseases through their leaves in which both algorithms are used for the automatic diagnosis of plant disease. From the experimental test conducted on various plants using CNN and SVM algorithms, CNN had an accuracy of 98%, while SVM had an accuracy of 62% on various plant leaves used. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Machine Learning-Enhanced Self-Management for Energy-Effective and Secure Statistics Assortment in Unattended WSNs

引用

SN computer science 2025年第2期6卷 1-10页

作者： Biswas, Preesat Mishra, Aishwarya Dixit, Rinku Sharma Dwivedi, Abhishek Choudhary, Shailee Lohmor Tiwari, Shweta Chakravarthi, M. Ayyappa Electronics & Telecommunications Government Engineering College C. G Jagdalpur India Department of Computer Science & Engineering IES College of Technology M.P Bhopal India Department of Artificial Intelligence and Machine Learning New Delhi Institute of Management Delhi India Department of Data Science and Engineering School of AIML IoT & IS CCE DS and Computer Applications Manipal University Jaipur Jaipur Rajasthan India Department of Computer Science and Engineering Gyan Ganga Institute of Technology and Sciences M.P Jabalpur India Department of CSE-Data Science KKR and KSR Institute of Technology and Sciences Guntur India

Unattended Wireless Sensor Networks (UWSNs) operate without human supervision and have limited resources. In a conventional WSN with a fixed sink for data collection, nodes one hop away from the sink consume more energy, causing a hotspot issue. This leads to network fragmentation and reduced sensing efficiency. To address this, a mobile sink is proposed. This study details the development and implementation of Secure MRL, focusing on legitimate message communication to the mobile sink via convex nodes. By using these convex nodes as data collection points, the mobile sink avoids traversing the entire network. We employ an enhanced system to generate keys and authenticate messages, assessing its resilience against various attacks, including sleep deprivation, snooze, network substitution, and modification. Findings indicate that Secure MRL maintains consistent performance across different node counts and significantly reduces energy consumption by 84%, improving the speed of attack detection. This improvement is achieved by monitoring the digital signature and residual energy of nodes. The proposed SVM-based network training establishes a residual energy cut-off, while convex nodes mitigate synchronization issues among other sensor nodes in Secure MRL. Additionally, convex nodes manage the availability checks for the mobile sink. The proposed approach demonstrates a 92% improvement in packet delivery ratio (PDR) and an 89% reduction in end-to-end delay, highlighting its efficacy in enhancing network performance. © The Author(s), under exclusive licence to Springer Nature Singapore Pte Ltd. 2025.

关键词： Duty-cycled UWSN MRL Sec-MRL SEC-TMP SVM UWSN

来源：评论

学校读者我要写书评

暂无评论

Guardians of Truth: Exploring Techniques for Veracity Identification in social media during an Infodemic 3

Guardians of Truth: Exploring Techniques for Veracity Identi...

引用

3rd International Conference on Artificial Intelligence For Internet of Things, AIIoT 2024

作者： Suthanthiradevi, P. Revathy, G. Sathish Kumar, P. Karthikeyan, B. Muthu, Lakshmi.V SRM institute of Science and Technology Data Science and Business Systems School of Computing India Vels Institute of science Technology and Advanced studies Department of Computer science and engineering India Rajalakshmi institute of technology Computer and Communication Engineering India SASTRA Deemed University School of Computing India St. Joseph's Institute of Technology Department of Computer Science and Engineering India

ISBN: (纸本)9798350372120

With the recent advent of technology, social networks are accessible 24/7 using mobile devices. During covid-19 pandemic the propagation of misinformation are mostly related to the disease, its cures and prevention. With Twitter as the medium this information was spreaded to millions of people who lack domain specific knowledge. This can lead to bloster fear and direct damage to the people. This research focuses on identifying the veracity of the Twitter posts behind pandemic situation. The authors have proposed a Transformer Model using Bat Algorithm for identifying the fake news. This model is trained and evaluated using infodemic metadata. Our experimental results shows by which proposed model accurately detected the fake news and achieved 96.5% of f1-score. © 2024 IEEE.

关键词： Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

Machine Learning Approaches in Detecting Autism Spectrum Disorder 8

Machine Learning Approaches in Detecting Autism Spectrum Dis...

引用

8th International Conference on computer science and Computational Intelligence, ICCSCI 2023

作者： Daniel Dominic, Nicholas Cenggoro, Tjeng Wawan Pardamean, Bens Computer Science Department BINUS Graduate Program - Master of Computer Science Program Bina Nusantara University Jakarta11480 Indonesia Computer Science Department School of Computer Science Bina Nusantara University Jakarta11480 Indonesia Bioinformatics and Data Science Research Center Bina Nusantara University Jakarta11480 Indonesia

Early detection of Autism Spectrum Disorder (ASD) needs to be increased to prevent further adverse impacts. Thus, the classification between ASD and Typically Development (TD) individuals is an intriguing task. This review study has collected 26 related papers to answer four research questions, i.e., what are the most used data inputs, brain atlases, and machine learning models for ASD classification, as also to discover the significant parts of the brain correlated with the ASD. It was eventually found that functional connectivity matrix, Support Vector Machine, and CC200 are the most frequently used data input, model, and brain atlas, respectively. Researchers also concluded that the posterior temporal fusiform cortex, intracalcarine cortex, cuneal cortex, subcallosal cortex, occipital pole, and lateral occipital cortex are the brain regions highly correlated with ASD. © 2023 The Authors. Published by Elsevier B.V.

关键词： autism spectrum disorder brain atlas brain region machine learning

来源：评论

学校读者我要写书评

暂无评论

Document-level Clinical Entity and Relation Extraction via Knowledge Base-Guided Generation 23

Document-level Clinical Entity and Relation Extraction via K...

引用

23rd Meeting of the ACL Special Interest Group on Biomedical Natural Language Processing, BioNLP 2024

作者： Bhattarai, Kriti Oh, Inez Y. Abrams, Zachary B. Lai, Albert M. Institute for Informatics Data Science & Biostatistics Washington University School of Medicine United States Department of Computer Science Washington University in St. Louis United States

ISBN: (纸本)9798891761308

Generative pre-trained transformer (GPT) models have shown promise in clinical entity and relation extraction tasks because of their precise extraction and contextual understanding capability. In this work, we further leverage the Unified Medical Language System (UMLS) knowledge base to accurately identify medical concepts and improve clinical entity and relation extraction at the document level. Our framework selects UMLS concepts relevant to the text and combines them with prompts to guide language models in extracting entities. Our experiments demonstrate that this initial concept mapping and the inclusion of these mapped concepts in the prompts improves extraction results compared to few-shot extraction tasks on generic language models that do not leverage UMLS. Further, our results show that this approach is more effective than the standard Retrieval Augmented Generation (RAG) technique, where retrieved data is compared with prompt embeddings to generate results. Overall, we find that integrating UMLS concepts with GPT models significantly improves entity and relation identification, outperforming the baseline and RAG models. By combining the precise concept mapping capability of knowledge-based approaches like UMLS with the contextual understanding capability of GPT, our method highlights the potential of these approaches in specialized domains like healthcare.. ©2024 Association for Computational Linguistics.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

HORIZON-FREE REGRET FOR LINEAR MARKOV DECISION PROCESSES 12

HORIZON-FREE REGRET FOR LINEAR MARKOV DECISION PROCESSES

引用

12th International Conference on Learning Representations, ICLR 2024

作者： Zhang, Zihan Lee, Jason D. Chen, Yuxin Du, Simon S. Department of Electrical and Computer Engineering Princeton University United States Department of Statistics and Data Science University of Pennsylvania United States Paul G. Allen School of Computer Science and Engineering University of Washington United States

A recent line of works showed regret bounds in reinforcement learning (RL) can be (nearly) independent of planning horizon, a.k.a. the horizon-free bounds. However, these regret bounds only apply to settings where a polynomial dependency on the size of transition model is allowed, such as tabular Markov Decision Process (MDP) and linear mixture MDP. We give the first horizon-free bound for the popular linear MDP setting where the size of the transition model can be exponentially large or even uncountable. In contrast to prior works which explicitly estimate the transition model and compute the inhomogeneous value functions at different time steps, we directly estimate the value functions and confidence sets. We obtain the horizon-free bound by: (1) maintaining multiple weighted least square estimators for the value functions;and (2) a structural lemma which shows the maximal total variation of the inhomogeneous value functions is bounded by a polynomial factor of the feature dimension. © 2024 12th International Conference on Learning Representations, ICLR 2024. All rights reserved.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：