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

4th IEEE International Conference on data Engineering and Communication Systems, ICDECS 2024

作者： Pasumpon Pandian, A. Anakath, A.S. Kannadasan, R. Ravikumar, K. Abdul Kareem, D. Care College of Engineering Department of Computer Science and Engineering Trichy India Saveetha Institute of Medical and Technical Sciences Saveetha School of Engineering Department of Computer Science and Engineering Tamil Nadu Chennai India School of Computer Science and Engineering Department of Software Systems Tamil Nadu Vellore India Rrase College of Engineering Padappai Department of Computer Science & Engineering Chennai India Grt Institute of Engineering and Technology Department of Artificial Intelligence and Data Science Tamil Nadu Tiruttani India

ISBN: (纸本)9798350393354

Several digital dangers were investigated. Malware dominated analysis with 45 attacks. We found 30 phishing attacks. 22 data breaches, 15 cyber espionage, 18 identity theft. This indicates the kind and frequency of harassment digital forensic specialists endure. Digital evidence was crucial to the case. 65 pieces of evidence were collected on computers. 42 incidents showed smartphones and tablets' digital investigative potential. There were 55 examples of communication patterns requiring network logs. In 28 and 12, cloud services and removable media provided proof. A wide range of evidence sources stresses the need for extensive collecting. Digital forensics were essential to the inquiry. In 70% of cases, disk imaging software created forensic copies of metadata-and timestamp-containing storage media. Network packet analyzers examined 48 traffic logs and communication patterns. To analyze volatile memory, 35 cases used memory forensics. In 25 cases, malware analysis platforms decrypted malware. In 60 situations, file recovery software recovered lost or hidden files. Digital forensic specialists' diverse arsenal for thorough investigations is shown here. Legal and ethical considerations dominated the study. The law was important, and all inquiries followed norms. A strong chain of custody protects evidence integrity and admissibility. The data privacy rules were respected. Legal evidence is admissible in court. Ethics ensured objective investigations. This underlines digital forensic investigations' legal and ethical foundation. © 2024 IEEE.

关键词： Cybersecurity

来源：评论

学校读者我要写书评

暂无评论

Medical data publishing based on average distribution and clustering

引用

CAAI Transactions on Intelligence Technology 2022年第3期7卷 381-394页

作者： Tong Yi Minyong Shi Haibin Zhu School of Computer Science and Engineering Guangxi Normal UniversityGuilinChina School of Computer Science Communication University of ChinaBeijingChina Department of Computer Science and Mathematics Nipissing UniversityNorth BayOntarioCanada

Most of the data publishing methods have not considered sensitivity protection,and hence the adversary can disclose privacy by sensitivity *** with this problem,this paper presents a medical data publishing method based on sensitivity *** protect the sensitivity,the sensitivity of disease information is determined by *** seek the trade-off between information utility and privacy security,the new method focusses on the protection of sensitive values with high sensitivity and assigns the highly sensitive disease information to groups as evenly as *** experiments are conducted on two real-world datasets,of which the records include various attributes of *** measure sensitivity protection,the authors define a metric,which can evaluate the degree of sensitivity ***,additional information loss and discernability metrics are used to measure the availability of released *** experimental results indicate that the new method can provide better privacy than the traditional one while the information utility is *** value protection,the proposed method can provide sensitivity protection and available releasing for medical data.

关键词： data publishing information utility security semantics sensitive values sensitivity

来源：评论

学校读者我要写书评

暂无评论

A Cost-Efficient Anonymous Authenticated and Key Agreement Scheme for V2I-Based Vehicular Ad-Hoc Networks

引用

IEEE Transactions on Intelligent Transportation Systems 2024年第9期25卷 12621-12630页

作者： Saleem, Muhammad Asad Li, Xiong Mahmood, Khalid Shamshad, Salman Alenazi, Mohammed J. F. Das, Ashok Kumar University of Electronic Science and Technology of China School of Computer Science and Engineering Chengdu611731 China Shenzhen Institute for Advanced Study University of Electronic Science and Technology of China Shenzhen518000 China National Yunlin University of Science and Technology Graduate School of Intelligent Data Science Yunlin Douliu64002 Taiwan The University of Lahore Department of Software Engineering Lahore54590 Pakistan King Saud University College of Computer and Information Sciences Department of Computer Engineering Riyadh11451 Saudi Arabia International Institute of Information Technology Center for Security Theory and Algorithmic Research Hyderabad500032 India

The rise of smart cities is directly connected to the increasing use of vehicles. The growing vehicle utilization has driven the emergence of Vehicular Ad-hoc Networks (VANETs), facilitating instant information exchange among vehicles. The system provides essential information regarding road conditions, traffic patterns, and more relevant data. VANETs encompass two fundamental categories of communication exchanges, namely Vehicle-to-Vehicle (V2V) and Vehicle-to-Infrastructure (V2I). V2I technology facilitates the integration of cars and transportation infrastructure, enabling effective communication between vehicles and infrastructure. Nevertheless, the potential of V2I communication has various security concerns arising from prevalent security threats. Current authentication techniques encounter challenges regarding complexity, security, and privacy considerations. We designed a hash-based lightweight and anonymous authentication scheme to address the aforementioned restrictions and enhance the effectiveness of authentication in V2I architecture. This scheme effectively combines identity, password, and bio-metric to enhance resistance against impersonation, denial of service, and privileged insider attacks. The devised scheme distinguishes itself by a comparative analysis and security proofs, highlighting its superior capability in guaranteeing secure authentication in V2I communication. The comprehensive security analysis conducted formally and informally showcases the robustness of the proposed solution against several threats. The performance evaluation results show that our scheme demonstrates a decrease in the computational cost of 51.40% approximately and a reduction in communication overhead of around 22.57%. These results establish the efficiency and scalability of the proposed scheme as a viable solution for V2I architecture. © 2000-2011 IEEE.

关键词： Vehicular ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

Segment Proximity Graphs and Nearest Neighbor Queries Amid Disjoint Segments 32

Segment Proximity Graphs and Nearest Neighbor Queries Amid D...

引用

32nd Annual European Symposium on Algorithms, ESA 2024

作者： Agarwal, Pankaj K. Kaplan, Haim Katz, Matthew J. Sharir, Micha Department of Computer Science Duke University DurhamNC United States School of Computer Science Tel Aviv University Israel Department of Computer Science Ben-Gurion University of the Negev Beer Sheva Israel

ISBN: (纸本)9783959773386

In this paper we study a few proximity problems related to a set of pairwise-disjoint segments in R2. Let S be a set of n pairwise-disjoint segments in R2, and let r > 0 be a parameter. We define the segment proximity graph of S to be Gr(S):= (S,E), where E = {(e1,e2) | dist(e1,e2) ≤ r} and dist(e1,e2) = min(p,q)∈e1×e2 p − q is the Euclidean distance between e1 and e2. We define the weight of an edge (e1,e2) ∈ E to be dist(e1,e2). We first present a simple grid-based O(nlog2 n)-time algorithm for computing a BFS tree of Gr(S). We apply it to obtain an O∗(n6/5)+O(nlog2 nlog ∆)-time algorithm for the so-called reverse shortest path problem, in which we want to find the smallest value r∗ for which Gr∗(S) contains a path of some specified length between two designated start and target segments (where the O∗(·) notation hides polylogarithmic factors). Here ∆ = maxe≠e′∈S dist(e,e′)/mine≠e′∈S dist(e,e′) is the spread of S. Next, we present a dynamic data structure that can maintain a set S of pairwise-disjoint segments in the plane under insertions/deletions, so that, for a query segment e from an unknown set Q of pairwise-disjoint segments, such that e does not intersect any segment in (the current version of) S, the segment of S closest to e can be computed in O(log5 n) amortized time. The amortized update time is also O(log5 n). We note that if the segments in S∪Q are allowed to intersect then the known lower bounds on halfplane range searching suggest that a sequence of n updates and queries may take at least close to Ω(n4/3) time. One thus has to strongly rely on the non-intersecting property of S and Q to perform updates and queries in O(polylog(n)) (amortized) time each. Using these results on nearest-neighbor (NN) searching for disjoint segments, we show that a DFS tree (or forest) of Gr(S) can be computed in O∗(n) time. We also obtain an O∗(n)-time algorithm for constructing a minimum spanning tree of Gr(S). Finally, we present an O∗(n4/3)-time algorithm for compu

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

M3Hop-CoT: Misogynous Meme Identification with Multimodal Multi-hop Chain-of-Thought

M3Hop-CoT: Misogynous Meme Identification with Multimodal Mu...

引用

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

作者： Kumari, Gitanjali Jain, Kirtan Ekbal, Asif Department of Computer Science and Engineering India Indian Institute of Technology Patna India School of AI and Data Science Indian Institute of Technology Jodhpur India

ISBN: (纸本)9798891761643

In recent years, there has been a significant rise in the phenomenon of hate against women on social media platforms, particularly through the use of misogynous memes. These memes often target women with subtle and obscure cues, making their detection a challenging task for automated systems. Recently, Large Language Models (LLMs) have shown promising results in reasoning using Chain-of-Thought (CoT) prompting to generate the intermediate reasoning chains as the rationale to facilitate multimodal tasks, but often neglect cultural diversity and key aspects like emotion and contextual knowledge hidden in the visual modalities. To address this gap, we introduce a Multimodal Multi-hop CoT (M3Hop-CoT) framework for Misogynous meme identification, combining a CLIP-based classifier and a multimodal CoT module with entity-object-relationship integration. M3Hop-CoT employs a three-step multimodal prompting principle to induce emotions, target awareness, and contextual knowledge for meme analysis. Our empirical evaluation, including both qualitative and quantitative analysis, validates the efficacy of the M3HopCoT framework on the SemEval-2022 Task 5 (MAMI task) dataset, highlighting its strong performance in the macro-F1 score. Furthermore, we evaluate the model's generalizability by evaluating it on various benchmark meme datasets, offering a thorough insight into the effectiveness of our approach across different datasets. © 2024 Association for Computational Linguistics.

关键词： Chains

来源：评论

学校读者我要写书评

暂无评论

Efficient Identification of DeepFake Images using CNN 2

Efficient Identification of DeepFake Images using CNN

引用

2nd International Conference on Intelligent data Communication Technologies and Internet of Things, IDCIoT 2024

作者： Gowda, Naveen Chandra Veena, H.N. Ramani, D Roja School of Computer Science and Engineering REVA University Bengaluru India SJB Institute of Technology Department of Computer Science and Engineering Bengaluru India Newhorizon College of Engineering Department of Computer Science and Engineering Bengaluru India

ISBN: (纸本)9798350327533

The development of Deepfakes has become more prevalent with the rise of Generative Adversarial Networks (GANs). Deepfakes are synthetically created, modified images that have been made to look real;they pose severe social concerns with privacy an d security issues. To solve these issues, this paper offers a novel method to detect Deepfakes in photographs using a Convolutional Neural Network (CNN) architecture. To detect whether a image has been altered or not, the suggested method examines many aspects of the image. The proposed methods are tested using a sizable benchmark dataset of Deepfakes and non-Deepfakes, and were able to identify modified images with high precision. The strategy is resistant to a variety of manipulations, including those intended to trick cutting-edge detection techniques. It is found that proposed strategy will improve digital media's security and credibility while helping mitigate any possible problems of Deepfake images. © 2024 IEEE.

关键词： Convolutional Neural Network (CNN) DeepFake Deeplearning Generative Adversarial Networks (GANs)

来源：评论

学校读者我要写书评

暂无评论

Counterfactual discriminative micro-expression recognition

引用

Visual Intelligence 2024年第1期2卷 1-10页

作者： Li, Yong Liu, Menglin Lao, Lingjie Wang, Yuanzhi Cui, Zhen Department of Computer Science City University of Hong Kong 999077 Hong Kong School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing 210094 China Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information Ministry of Education School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing 210094 China

Micro-expressions are spontaneous, rapid and subtle facial movements that can hardly be suppressed or fabricated. Micro-expression recognition (MER) is one of the most challenging topics in affective computing. It aims to recognize subtle facial movements which are quite difficult for humans to perceive in a fleeting period. Recently, many deep learning-based MER methods have been developed. However, how to effectively capture subtle temporal variations for robust MER still perplexes us. We propose a counterfactual discriminative micro-expression recognition (CoDER) method to effectively learn the slight temporal variations for video-based MER. To explicitly capture the causality from temporal dynamics hidden in the micro-expression (ME) sequence, we propose ME counterfactual reasoning by comparing the effects of the facts w.r.t. original ME sequences and the counterfactuals w.r.t. counterfactually-revised ME sequences, and then perform causality-aware prediction to encourage the model to learn those latent ME temporal cues. Extensive experiments on four widely-used ME databases demonstrate the effectiveness of CoDER, which results in comparable and superior MER performance compared with that of the state-of-the-art methods. The visualization results show that CoDER successfully perceives the meaningful temporal variations in sequential faces. © The Author(s) 2024.

关键词： Affective computing Causal graph Counterfactual reasoning Micro-expression recognition Temporal variation

来源：评论

学校读者我要写书评

暂无评论

Optimizing Service Stipulation Uncertainty with Deep Reinforcement Learning for Internet Vehicle Systems

引用

computers, Materials & Continua 2023年第3期74卷 5705-5721页

作者： Zulqar Nain B.Shahana Shehzad Ashraf Chaudhry P.Viswanathan M.S.Mekala Sung Won Kim Department of Information and Communication Engineering Yeungnam UniversityGyeongsan-siKorea Department of Computer Science and Engineering KLEFIndia Department of Computer Engineering Faculty of Engineering and ArchitectureIstanbul Gelisim UniversityIstanbul34310Turkey School of Computer Science and Engineering VIT UniversityVelloreIndia

Fog computing brings computational services near the network edge to meet the latency constraints of cyber-physical System(CPS)*** devices enable limited computational capacity and energy availability that hamper end user *** designed a novel performance measurement index to gauge a device’s resource *** examination addresses the offloading mechanism issues,where the end user(EU)offloads a part of its workload to a nearby edge server(ES).Sometimes,the ES further offloads the workload to another ES or cloud server to achieve reliable performance because of limited resources(such as storage and computation).The manuscript aims to reduce the service offloading rate by selecting a potential device or server to accomplish a low average latency and service completion time to meet the deadline constraints of sub-divided *** this regard,an adaptive online status predictive model design is significant for prognosticating the asset requirement of arrived services to make float ***,the development of a reinforcement learning-based flexible x-scheduling(RFXS)approach resolves the service offloading issues,where x=service/resource for producing the low latency and high performance of the *** approach to the theoretical bound and computational complexity is derived by formulating the system efficiency.A quadratic restraint mechanism is employed to formulate the service optimization issue according to a set ofmeasurements,as well as the behavioural association rate and adulation *** system managed an average 0.89%of the service offloading rate,with 39 ms of delay over complex scenarios(using three servers with a 50%service arrival rate).The simulation outcomes confirm that the proposed scheme attained a low offloading uncertainty,and is suitable for simulating heterogeneous CPS frameworks.

关键词： Fog computing task allocation measurement models feasible node selection methods performance metrics

来源：评论

学校读者我要写书评

暂无评论

Enhancing Energy Efficiency with a Dynamic Trust Measurement Scheme in Power Distribution Network

引用

computers, Materials & Continua 2024年第3期78卷 3909-3927页

作者： Yilei Wang Xin Sun Guiping Zheng Ahmar Rashid Sami Ullah Hisham Alasmary Muhammad Waqas Zhejiang Electric-Power Corporation Research Institute Zhejiang310014China Faculty of Information Technology Beijing University of TechnologyBeijing100124China Beijing Trusty Cloud Technology Co. Ltd.Beijing100022China Department of Computer Science and Engineering Ghulam Ishaq Khan Institute of Engineering Sciences and EngineeringTopi23640Pakistan Department of Computer Science Shaheed Benazir Bhutto UniversitySheringalUpper Dir18050Pakistan Department of Computer Science College of Computer ScienceKing Khalid UniversityAbha61421Saudi Arabia School of Computing and Mathematical Science Faculty of Engineering and ScienceUniversity of GreenwichLondonSE109LSUK School of Engineering Edith Cowan UniversityPerth6027Australia

The application of Intelligent Internet of Things(IIoT)in constructing distribution station areas strongly supports platform transformation,upgrade,and intelligent *** sensing layer of IIoT comprises the edge convergence layer and the end sensing layer,with the former using intelligent fusion terminals for real-time data collection and ***,the influx of multiple low-voltage in the smart grid raises higher demands for the performance,energy efficiency,and response speed of the substation fusion ***,it brings significant security risks to the entire distribution substation,posing a major challenge to the smart *** response to these challenges,a proposed dynamic and energy-efficient trust measurement scheme for smart grids aims to address these *** scheme begins by establishing a hierarchical trust measurement model,elucidating the trust relationships among smart IoT *** then incorporates multidimensional measurement factors,encompassing static environmental factors,dynamic behaviors,and energy *** comprehensive approach reduces the impact of subjective factors on trust ***,the scheme incorporates a detection process designed for identifying malicious low-voltage end sensing units,ensuring the prompt identification and elimination of any malicious ***,in turn,enhances the security and reliability of the smart grid *** effectiveness of the proposed scheme in pinpointing malicious nodes has been demonstrated through simulation ***,the scheme outperforms established trust metric models in terms of energy efficiency,showcasing its significant contribution to the field.

关键词： IIoT trusted measure energy efficient

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：