Computer Science Review最新文献

A comprehensive survey on IoT security: Challenges, security issues, and countermeasures 物联网安全综合调查：挑战、安全问题和对策

IF 12.7 1区计算机科学

Computer Science Review Pub Date : 2025-10-08 DOI: 10.1016/j.cosrev.2025.100839

Ankit Sharma, Kriti Bhushan

{"title":"A comprehensive survey on IoT security: Challenges, security issues, and countermeasures","authors":"Ankit Sharma, Kriti Bhushan","doi":"10.1016/j.cosrev.2025.100839","DOIUrl":"10.1016/j.cosrev.2025.100839","url":null,"abstract":"<div><div>IoT is an emerging technology in which physical objects are embedded with computing and networking capabilities, commonly referred to as intelligent devices. IoT technology is rapidly growing due to its unique features, such as minimal human intervention, cost-effectiveness, and ease of deployment. However, this widespread adoption also introduces challenges related to scalability and security. Since the IoT ecosystem is characterized by diverse technologies and resource-constrained devices, IoT applications become more vulnerable, providing attackers with a strategic advantage. Consequently, security is a paramount concern in IoT systems. The primary objective of this paper is to investigate security concerns in the IoT environment. This study examines security challenges from multiple perspectives, including architecture-level concerns, component-level vulnerabilities, application-level threats, and emerging risks. This paper discusses general IoT attacks, categorized according to different layers, and subsequently presents RFID as a use case to illustrate these concepts more clearly. Additionally, the current literature addresses emerging attack vectors and their associated countermeasures, offering a thorough overview of evolving security challenges and defense strategies. Many existing research papers do not comprehensively address security issues across the entire IoT ecosystem, including emerging attacks and their countermeasures. This paper covers the major attack vectors in IoT, explores state-of-the-art techniques such as blockchain and their role in enhancing IoT security, and examines newly emerged threats such as adversarial attacks, filling a critical gap.</div></div>","PeriodicalId":48633,"journal":{"name":"Computer Science Review","volume":"59 ","pages":"Article 100839"},"PeriodicalIF":12.7,"publicationDate":"2025-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145261666","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Parameterized Complexity in Machine Learning 机器学习中的参数化复杂性

IF 12.7 1区计算机科学

Computer Science Review Pub Date : 2025-10-06 DOI: 10.1016/j.cosrev.2025.100836

Robert Ganian

引用次数: 0

Unlocking the potential of news: A systematic review of advantages and challenges for event detection and analysis 解锁新闻的潜力：对事件检测和分析的优势和挑战的系统回顾

IF 12.7 1区计算机科学

Computer Science Review Pub Date : 2025-10-06 DOI: 10.1016/j.cosrev.2025.100838

Klaifer Garcia, Lilian Berton

{"title":"Unlocking the potential of news: A systematic review of advantages and challenges for event detection and analysis","authors":"Klaifer Garcia, Lilian Berton","doi":"10.1016/j.cosrev.2025.100838","DOIUrl":"10.1016/j.cosrev.2025.100838","url":null,"abstract":"<div><div>Social media platforms, including both social networks and news outlets, have been widely utilized for event detection and analysis tasks. While social networks constitute the most commonly used data source due to their high volume and immediacy, news articles offer distinctive advantages such as access to well-structured historical archives and the availability of more coherent, detailed narratives, which can enhance the reliability and interpretability of event-related insights. In this study, we conduct a review and highlight key considerations that should be addressed when developing event detection applications based on news data sources. In our systematic review, we retrieved 654 papers from 2019 until 2024, covering four digital libraries (Springer Link, Science Direct from Elsevier, ACM, IEEE Explore). After applying exclusion criteria, we analyzed 79 papers qualitatively and quantitatively. We aimed to answer the following research questions: What is the motivation for using news data? What is the time span of the analyzed events? How detailed can the information be extracted? What are the most commonly used techniques and evaluation metrics? Based on the results, we identified several use cases where news is the most effective source of data in terms of the amount of information that can be retrieved, the quality of the content, and the response time, which can be as fast as social networks in some situations. Finally, we presented some challenges and opportunities in the area.</div></div>","PeriodicalId":48633,"journal":{"name":"Computer Science Review","volume":"59 ","pages":"Article 100838"},"PeriodicalIF":12.7,"publicationDate":"2025-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145261668","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Parameterized inapproximability: From Clique to PIH 参数化不可逼近性：从Clique到PIH

IF 12.7 1区计算机科学

Computer Science Review Pub Date : 2025-10-04 DOI: 10.1016/j.cosrev.2025.100834

Yijia Chen , Bingkai Lin

{"title":"Parameterized inapproximability: From Clique to PIH","authors":"Yijia Chen , Bingkai Lin","doi":"10.1016/j.cosrev.2025.100834","DOIUrl":"10.1016/j.cosrev.2025.100834","url":null,"abstract":"<div><div>Parameterized approximation, first proposed by Mike Fellows, approaches NP-hard problems by allowing the running time of an approximation algorithm to be superpolynomial in the parameter of an problem instance yet still polynomial in the size of the instance itself. One of the main open questions in the area is whether we can approximate the parameterized clique problem within some nontrivial ratio. It is also conjectured by Fellows that no such algorithms exist. In this article, we explain some recent progress on this question.</div><div>Similarly to the classical polynomial time inapproximability of the clique problem, the constraint satisfaction problem, i.e., <span>CSP</span>, plays a key role in most of the known inapproximability results of the parameterized clique problem. As a matter of fact, the parameterized inapproximability hypothesis, i.e., PIH, concerning the binary <span>CSP</span> has been long believed as a viable path towards the inapproximability of the parameterized clique problem. Although it turns out that those recent results do not rely on PIH, the method discovered for the parameterized clique problem leads to a proof of a version of PIH under the exponential time hypothesis, which we will also explain in this article.</div></div>","PeriodicalId":48633,"journal":{"name":"Computer Science Review","volume":"59 ","pages":"Article 100834"},"PeriodicalIF":12.7,"publicationDate":"2025-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145221411","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Techniques in parameterized approximation 参数化近似技术

IF 12.7 1区计算机科学

Computer Science Review Pub Date : 2025-10-04 DOI: 10.1016/j.cosrev.2025.100833

Ariel Kulik , Hadas Shachnai

引用次数: 0

Parameterised counting complexity theory 参数化计数复杂性理论

IF 12.7 1区计算机科学

Computer Science Review Pub Date : 2025-10-03 DOI: 10.1016/j.cosrev.2025.100837

Marc Roth

{"title":"Parameterised counting complexity theory","authors":"Marc Roth","doi":"10.1016/j.cosrev.2025.100837","DOIUrl":"10.1016/j.cosrev.2025.100837","url":null,"abstract":"<div><div>A little more than two decades ago, Flum and Grohe (STOC 02), and McCartin (MFCS 02) introduced the structural foundations of parameterised counting complexity theory with the goal of applying and generalising the extensive toolkit of parameterised algorithmics to the world of counting.</div><div>Counting problems are known to be infamously hard with respect to classical complexity theory, much harder than <span><math><mi>NP</mi></math></span>-complete problems under standard assumptions, as shown by Toda (STOC 91). This holds true even for counting problems that admit a tractable decision version, a fact established in Valiant’s seminal work on the complexity of counting perfect matchings (SICOMP 79). Naturally, the central question in parameterised counting complexity theory asks: Can this intractability be alleviated with a multivariate complexity analysis?</div><div>We have observed that many tools from the “swiss army knife” of parameterised decision algorithms, such as win–win approaches based on bidimensionality, colour-coding, and, to some extent, kernelisation, often fail in the realm of counting problems (especially for exact counting). Circumventing the inapplicability of well-established algorithmic tools, we have witnessed the development of a flurry of novel techniques and theories tailored to parameterised counting problems, with origins in commutative combinatorial algebra, topology and deep graph theory dating back to early works of Lovász.</div><div>In this survey, we will revisit some of the most important frameworks and results discovered and established in the field over the years. Particular focus will be put on the framework of Graph Motif Parameters due to Curticapean, Dell and Marx (STOC 17), one of, if not the most exciting development in parameterised counting since its inception.</div><div>We will assume familiarity with basic concepts of parameterised algorithms and complexity theory, but, aside from that, we aim to present the introduction to the world of parameterised counting in a self-contained way.</div></div>","PeriodicalId":48633,"journal":{"name":"Computer Science Review","volume":"59 ","pages":"Article 100837"},"PeriodicalIF":12.7,"publicationDate":"2025-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145221410","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

What can artificial intelligence do for soil health in agriculture? 人工智能能为农业土壤健康做些什么？

IF 12.7 1区计算机科学

Computer Science Review Pub Date : 2025-09-27 DOI: 10.1016/j.cosrev.2025.100832

Stefan Schweng , Luca Bernardini , Katharina Keiblinger , Hans-Peter Kaul , Iztok Fister Jr. , Niko Lukač , Javier Del Ser , Andreas Holzinger

{"title":"What can artificial intelligence do for soil health in agriculture?","authors":"Stefan Schweng , Luca Bernardini , Katharina Keiblinger , Hans-Peter Kaul , Iztok Fister Jr. , Niko Lukač , Javier Del Ser , Andreas Holzinger","doi":"10.1016/j.cosrev.2025.100832","DOIUrl":"10.1016/j.cosrev.2025.100832","url":null,"abstract":"<div><div>The integration of artificial intelligence (AI) into soil research presents significant opportunities to advance the understanding, management, and conservation of soil ecosystems. This paper reviews the diverse applications of AI in soil health assessment, predictive modeling of soil properties, and the development of pedotransfer functions within the context of agriculture, emphasizing AI’s advantages over traditional analytical methods. We identify soil organic matter decline, compaction, and biodiversity loss as the most frequently addressed forms of soil degradation. Strong trends include the creation of digital soil maps, particularly for soil organic carbon and chemical properties using remote sensing or easily measurable proxies, as well as the development of decision support systems for crop rotation planning and IoT-based monitoring of soil health and crop performance. While random forest models dominate, support vector machines and neural networks are also widely applied for soil parameter modeling. Our analysis of datasets reveals clear regional biases, with tropical, arid, mild continental, and polar tundra climates remaining underrepresented despite their agricultural relevance. We also highlight gaps in predictor–response combinations for soil property modeling, pointing to promising research avenues such as estimating heavy metal content from soil mineral nitrogen content, microbial biomass, or earthworm abundance. Finally, we provide practical guidelines on data preparation, feature extraction, and model selection. Overall, this study synthesizes recent advances, identifies methodological limitations, and outlines a roadmap for future research, underscoring AI’s transformative potential in soil science.</div></div>","PeriodicalId":48633,"journal":{"name":"Computer Science Review","volume":"59 ","pages":"Article 100832"},"PeriodicalIF":12.7,"publicationDate":"2025-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145181248","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

From task-specific to foundation models: A paradigm shift in medical vision-language analysis 从特定任务到基础模型：医学视觉语言分析的范式转变

IF 12.7 1区计算机科学

Computer Science Review Pub Date : 2025-09-26 DOI: 10.1016/j.cosrev.2025.100831

Muhammad Umair Ali , Amad Zafar , Seonghan Kim , Kwang Su Kim , Seung Won Lee

{"title":"From task-specific to foundation models: A paradigm shift in medical vision-language analysis","authors":"Muhammad Umair Ali , Amad Zafar , Seonghan Kim , Kwang Su Kim , Seung Won Lee","doi":"10.1016/j.cosrev.2025.100831","DOIUrl":"10.1016/j.cosrev.2025.100831","url":null,"abstract":"<div><div>Integrating vision-language models (VLMs) into medical imaging drives a paradigm shift from task-specific systems toward generalist foundation models (FMs) capable of zero-shot and few-shot reasoning across diverse clinical domains. This review presents a comprehensive model-centric taxonomy, categorizing over 135 studies into three key developmental stages: (1) task-specific VLMs, (2) modular/adapter-based/prompt-tuned VLMs, and (3) foundation models. We systematically assess each category regarding architectural innovations, learning paradigms, clinical applications, and evaluation metrics. Our analysis reveals that the recent advances in multimodal contrastive learning, prompt engineering, and scalable transformer-based architectures significantly enhance generalizability, data efficiency, and multimodal interpretability in medical AI. Furthermore, we synthesize bibliometric trends and delineate methodological transitions through a PRISMA-based systematic review. This review article concludes with a discussion on the challenges and provides a roadmap for developing clinically reliable, data-efficient, and versatile VLMs, highlighting their transformative potential for improving diagnostic accuracy, workflow automation, and decision support in healthcare.</div></div>","PeriodicalId":48633,"journal":{"name":"Computer Science Review","volume":"59 ","pages":"Article 100831"},"PeriodicalIF":12.7,"publicationDate":"2025-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145159257","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Information-theoretic reduction of Markov chains 马尔可夫链的信息论约简

IF 12.7 1区计算机科学

Computer Science Review Pub Date : 2025-09-23 DOI: 10.1016/j.cosrev.2025.100802

Bernhard C. Geiger

引用次数: 0

New paradigm of distributed artificial intelligence for LLM implementation and its key technologies 面向LLM实现的分布式人工智能新范式及其关键技术

IF 12.7 1区计算机科学

Computer Science Review Pub Date : 2025-09-21 DOI: 10.1016/j.cosrev.2025.100817

Yijin Wu , Zirun Li , Bingrui Guo , Shanshan He , Bijing Liu , Xiaojie Liu , Shan He , Donghui Guo

{"title":"New paradigm of distributed artificial intelligence for LLM implementation and its key technologies","authors":"Yijin Wu , Zirun Li , Bingrui Guo , Shanshan He , Bijing Liu , Xiaojie Liu , Shan He , Donghui Guo","doi":"10.1016/j.cosrev.2025.100817","DOIUrl":"10.1016/j.cosrev.2025.100817","url":null,"abstract":"<div><div>With the Internet’s development and information technology advancement, current network applications and services, such as e-commerce, industrial automation, and vehicular automation, have experienced substantial expansion. Foundation models, represented by large language models (LLMs), have emerged in response to growing demands. Their broad range of applications has brought significant advancements to various industries. While such developments have improved people’s economic lives and social activities, the challenges posed by the rapid growth of data volume and network traffic cannot be overlooked. Intelligent systems aimed at enhancing knowledge computation and learning capabilities are gradually gaining attention. Nevertheless, efficient and flexible intelligent systems are still in their early stages, leaving ample space for further optimization. This study provides an overview of Distributed Artificial Intelligence (DAI) with its related paradigm, briefly introduces the evolution of LLMs, and proposes a novel optimization framework named PCD Tri-Tuning for DAI workflows: leveraging caching-related technologies to enhance perceptual capabilities, adopting load-balancing techniques for computational optimization, and developing reasoning methodologies and cooperation techniques to improve decision-making. Subsequently, the study examines the pivotal role of the proposed optimization framework in practical domains such as e-commerce, smart manufacturing, and vehicular automation while also discussing the challenges and outlining strategies for further development.</div></div>","PeriodicalId":48633,"journal":{"name":"Computer Science Review","volume":"59 ","pages":"Article 100817"},"PeriodicalIF":12.7,"publicationDate":"2025-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145093957","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0