Computer Science Review最新文献

筛选
英文 中文
Navigating the quantum computing threat landscape for blockchains: A comprehensive survey 导航区块链的量子计算威胁格局:一项全面调查
IF 12.7 1区 计算机科学
Computer Science Review Pub Date : 2026-02-01 Epub Date: 2025-11-12 DOI: 10.1016/j.cosrev.2025.100846
Hassan Khodaiemehr, Khadijeh Bagheri, Chen Feng
{"title":"Navigating the quantum computing threat landscape for blockchains: A comprehensive survey","authors":"Hassan Khodaiemehr,&nbsp;Khadijeh Bagheri,&nbsp;Chen Feng","doi":"10.1016/j.cosrev.2025.100846","DOIUrl":"10.1016/j.cosrev.2025.100846","url":null,"abstract":"<div><div>Quantum computers pose a significant threat to blockchain technology’s security, which heavily relies on public-key cryptography and hash functions. The cryptographic algorithms used in blockchains, based on large odd prime numbers and discrete logarithms, can be easily compromised by quantum computing algorithms like Shor’s algorithm and its future qubit variations. This survey paper comprehensively examines the impact of quantum computers on blockchain security and explores potential mitigation strategies. The survey focuses on the quantum security of blockchain’s fundamental building blocks, including digital signatures, hash functions, consensus algorithms, and smart contracts. We analyze the vulnerabilities introduced by quantum computers and discuss potential countermeasures and enhancements to ensure the integrity and confidentiality of blockchain systems. Furthermore, we investigate the quantum attack surface of blockchains, identifying potential avenues for exploiting quantum computing to strengthen existing attacks. We emphasize the need for developing quantum-resistant defenses and explore solutions for mitigating the threat of quantum computers to blockchains, including the adoption of quantum and post-quantum blockchain architectures. The paper also discusses the limitations of current efforts, such as the computational overhead of post-quantum algorithms and the practical challenges in real-world deployment, illustrated through case studies of Bitcoin and Ethereum. Future research directions include developing scalable quantum-resistant blockchain protocols, optimizing cryptographic implementations for embedded devices, and establishing standardized security frameworks to mitigate emerging quantum attacks.</div></div>","PeriodicalId":48633,"journal":{"name":"Computer Science Review","volume":"59 ","pages":"Article 100846"},"PeriodicalIF":12.7,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145515619","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
AI based advances in diagnosis of chronic obstructive pulmonary disease: A systematic review 基于人工智能的慢性阻塞性肺疾病诊断进展综述
IF 12.7 1区 计算机科学
Computer Science Review Pub Date : 2026-02-01 Epub Date: 2025-09-11 DOI: 10.1016/j.cosrev.2025.100820
Dhanashree Vipul Yevle , Palvinder Singh Mann , Dinesh Kumar
{"title":"AI based advances in diagnosis of chronic obstructive pulmonary disease: A systematic review","authors":"Dhanashree Vipul Yevle ,&nbsp;Palvinder Singh Mann ,&nbsp;Dinesh Kumar","doi":"10.1016/j.cosrev.2025.100820","DOIUrl":"10.1016/j.cosrev.2025.100820","url":null,"abstract":"<div><div>Chronic Obstructive Pulmonary Disease (COPD) is one of the major global health problems, and early detection plays a great role in improving outcomes for patients. Traditional methods of diagnosis are generally based on subjective interpretation, thus delaying diagnosis in many cases. Artificial Intelligence presents a disruptive opportunity, making the detection and classification of COPD possible with a variety of data types. This paper reviews the use of AI-based approaches in COPD diagnosis by using three primary types of datasets: text data, such as clinical notes and electronic health records; audio data, including lung sounds, cough signals, and so on; and image data from chest X-rays and CT scans. Discussing the use of deep learning techniques, specifically CNNs, in analyzing images, we identify how these networks can successfully classify COPD cases along with the level of severity. The potential of AI models in COPD diagnostics is very promising, though there are areas of challenges like data standardization, model generalizability, and interpretability. This review emphasizes the AI potential for COPD diagnostics revolution and outlines future research directions: integration of multi-modal data and advancements in model transparency to support clinical adoption.</div></div>","PeriodicalId":48633,"journal":{"name":"Computer Science Review","volume":"59 ","pages":"Article 100820"},"PeriodicalIF":12.7,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145049627","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
Quantum artificial intelligence: A survey 量子人工智能:综述
IF 12.7 1区 计算机科学
Computer Science Review Pub Date : 2026-02-01 Epub Date: 2025-09-10 DOI: 10.1016/j.cosrev.2025.100807
Giovanni Acampora, Angela Chiatto, Roberto Schiattarella, Autilia Vitiello
{"title":"Quantum artificial intelligence: A survey","authors":"Giovanni Acampora,&nbsp;Angela Chiatto,&nbsp;Roberto Schiattarella,&nbsp;Autilia Vitiello","doi":"10.1016/j.cosrev.2025.100807","DOIUrl":"10.1016/j.cosrev.2025.100807","url":null,"abstract":"<div><div>Quantum computing and artificial intelligence are two highly topical fields of research that can benefit from each other’s discoveries by opening a completely new scenario in computation, that of quantum artificial intelligence. Indeed, on the one hand, artificial intelligence algorithms can be made computationally more efficient due to the potential speedup enabled by quantum phenomena; on the other hand, the complex development of quantum computing technologies and methodologies can be properly supported by the use of classical artificial intelligence approaches. The “entanglement” of these two disciplines is opening up completely new directions in computer science research, and this survey aims to provide a systematic and taxonomic overview of the work that has already been done and that which will begin in the near future.</div></div>","PeriodicalId":48633,"journal":{"name":"Computer Science Review","volume":"59 ","pages":"Article 100807"},"PeriodicalIF":12.7,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145027378","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 : 2026-02-01 Epub Date: 2025-10-06 DOI: 10.1016/j.cosrev.2025.100836
Robert Ganian
{"title":"Parameterized Complexity in Machine Learning","authors":"Robert Ganian","doi":"10.1016/j.cosrev.2025.100836","DOIUrl":"10.1016/j.cosrev.2025.100836","url":null,"abstract":"<div><div>Classifying the complexity of problems into those which can be seen as “tractable” and those which are “intractable” has been a core topic of theoretical computer science already since its inception. For the latter class, the parameterized complexity paradigm pioneered by Downey and Fellows provides a powerful set of tools to identify the exact boundaries of tractability for each specific problem under consideration. And yet, in many subfields of machine learning, there has historically been a distinct lack of research targeting the parameterized complexity of fundamental problems.</div><div>In this survey, we take aim at some of the recent developments at the interface between machine learning and parameterized complexity which successfully bridge the gap between these two areas of research. The survey focuses primarily on three subfields of machine learning where significant progress towards this direction has been made in recent years: Bayesian Networks, Data Completion and Neural Network Training. The survey also provides pointers to some related developments in other subfields of machine learning, such as Decision Tree Learning and Sample Complexity.</div></div>","PeriodicalId":48633,"journal":{"name":"Computer Science Review","volume":"59 ","pages":"Article 100836"},"PeriodicalIF":12.7,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145261667","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
Research hotspots and trends of human-computer collaboration: A bibliometric analysis 人机协作研究热点与趋势:文献计量学分析
IF 12.7 1区 计算机科学
Computer Science Review Pub Date : 2026-02-01 Epub Date: 2025-09-21 DOI: 10.1016/j.cosrev.2025.100830
Chang Guo , Anglu Li
{"title":"Research hotspots and trends of human-computer collaboration: A bibliometric analysis","authors":"Chang Guo ,&nbsp;Anglu Li","doi":"10.1016/j.cosrev.2025.100830","DOIUrl":"10.1016/j.cosrev.2025.100830","url":null,"abstract":"<div><div>Human-computer collaboration represents a crucial model for future human-machine relationships. There is an urgent need to summarize its current state, delineate its research trajectory, and explore future trends. This paper employs a bibliometric approach, using 1713 human-computer collaboration-related publications from the Web of Science core database as initial data. With the scientific bibliometrics and software tools like VOSviewer and CiteSpace, this study creates a scientific knowledge map, which includes publication year distribution, countries, research institutions, authors, keyword clustering, and citation network analysis, facilitating a comprehensive understanding of the field. This research aims to provide a comprehensive overview of international human-computer collaboration research from 1990 to November 2024, identifying current research hotspots and theoretical foundations and exploring new trends in line with current research focuses. This research trend will drive the field of human-computer collaboration to continue to evolve towards intelligence, user-orientation, efficiency and provides a wealth of research opportunities for closer human-computer collaboration.</div></div>","PeriodicalId":48633,"journal":{"name":"Computer Science Review","volume":"59 ","pages":"Article 100830"},"PeriodicalIF":12.7,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145093959","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
Enhancing IoT security with resource-efficient cryptography: A comprehensive review of lightweight and hybrid algorithms 利用资源高效的加密技术增强物联网安全性:对轻量级和混合算法的全面回顾
IF 12.7 1区 计算机科学
Computer Science Review Pub Date : 2026-02-01 Epub Date: 2025-11-24 DOI: 10.1016/j.cosrev.2025.100861
Zeeshan Ali Haider , Asim Zeb , A.K.M.Muzahidul Islam , Taj Rahman , Ali Arishi , Inam Ullah
{"title":"Enhancing IoT security with resource-efficient cryptography: A comprehensive review of lightweight and hybrid algorithms","authors":"Zeeshan Ali Haider ,&nbsp;Asim Zeb ,&nbsp;A.K.M.Muzahidul Islam ,&nbsp;Taj Rahman ,&nbsp;Ali Arishi ,&nbsp;Inam Ullah","doi":"10.1016/j.cosrev.2025.100861","DOIUrl":"10.1016/j.cosrev.2025.100861","url":null,"abstract":"<div><div>The rapid development of the Internet of Things (IoT) has greatly changed several industries, such as smart healthcare, smart grid, and industrial automation. However, IoT devices are resource-constrained in terms of processing power and energy, which render them unsuitable for traditional cryptographic solutions. This review focuses on cryptographic schemes especially lightweight and hybrid, that have been tailored to secure IoT systems without consuming many resources for their operations as well this review analyses recent technologies such as, the elliptic curve cryptography (ECC), attribute-based encryption (ABE) and quantum key distribution (QKD) in terms of low resource consumption which is the main advantage while considering securing communications in an IoT network. The review indicates that ECC is considered to be the right trade-off between efficiency and security, due to scalability issues associated with both ABE and QKD. Hybrid Encryption is used by combining symmetric and asymmetric techniques to address security and scalability. Future studies are expected to enhance the scalability of existing cryptographic solutions, introduce post-quantum cryptography techniques, and adapt machine learning for adaptive encryption and anomaly detection. This survey provides a complete examination of lightweight and hybrid cryptographic primitives in IoT, also discussing their security level, performance, and design space for different scenarios.</div></div>","PeriodicalId":48633,"journal":{"name":"Computer Science Review","volume":"59 ","pages":"Article 100861"},"PeriodicalIF":12.7,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145583725","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
Parameterised counting complexity theory 参数化计数复杂性理论
IF 12.7 1区 计算机科学
Computer Science Review Pub Date : 2026-02-01 Epub 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":"2026-02-01","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
Optimizing shape parameters in RBF methods: A systematic review of techniques, applications, and computational challenges 优化形状参数的RBF方法:技术,应用和计算挑战的系统回顾
IF 12.7 1区 计算机科学
Computer Science Review Pub Date : 2026-02-01 Epub Date: 2025-10-17 DOI: 10.1016/j.cosrev.2025.100842
Jian Sun, Wenshuai Wang
{"title":"Optimizing shape parameters in RBF methods: A systematic review of techniques, applications, and computational challenges","authors":"Jian Sun,&nbsp;Wenshuai Wang","doi":"10.1016/j.cosrev.2025.100842","DOIUrl":"10.1016/j.cosrev.2025.100842","url":null,"abstract":"<div><div>Radial Basis Function (RBF) methods offer a robust meshless framework for numerical interpolation, PDE solving, and machine learning, advancing computer science, artificial intelligence, and interdisciplinary fields like geophysics and autonomous systems. The shape parameter <span><math><mi>ϵ</mi></math></span>, pivotal to their performance, governs the balance between accuracy and stability, yet its optimal selection remains a significant challenge due to data and problem complexities, making <span><math><mi>ϵ</mi></math></span> optimization a core focus of RBF research. This systematic review synthesizes 169 seminal studies, examining selection methodologies across traditional (e.g., LOOCV), optimization-driven (e.g., genetic algorithms), and data-driven (e.g., neural network-based) approaches. We assess their algorithmic foundations, computational demands, and impact on applications, including real-time data processing, image inpainting, and autonomous navigation. Recent adaptive methods, including our contribution to optimizing <span><math><mi>ϵ</mi></math></span> for enhanced stability, improve accuracy across domains. However, challenges like high-dimensional scalability, noise resilience, and theoretical gaps demand scalable algorithms, noise-robust strategies, and rigorous theoretical frameworks to advance RBF methods and foster innovation in computational science and interdisciplinary applications.</div></div>","PeriodicalId":48633,"journal":{"name":"Computer Science Review","volume":"59 ","pages":"Article 100842"},"PeriodicalIF":12.7,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145314959","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
Critical insights into runtime scheduling, image, storage, and networking challenges in modern Kubernetes environments 对现代Kubernetes环境中运行时调度、映像、存储和网络挑战的关键见解
IF 12.7 1区 计算机科学
Computer Science Review Pub Date : 2026-02-01 Epub Date: 2025-11-14 DOI: 10.1016/j.cosrev.2025.100851
Bablu Kumar , Anshul Verma , Pradeepika Verma
{"title":"Critical insights into runtime scheduling, image, storage, and networking challenges in modern Kubernetes environments","authors":"Bablu Kumar ,&nbsp;Anshul Verma ,&nbsp;Pradeepika Verma","doi":"10.1016/j.cosrev.2025.100851","DOIUrl":"10.1016/j.cosrev.2025.100851","url":null,"abstract":"<div><div>Kubernetes has become the de-facto standard for orchestrating containerized workloads across cloud and edge environments. Despite its modular and extensible architecture, the growing complexity of runtime behaviors, scheduling demands, and evolving application requirements has revealed persistent challenges in scalability, performance, and operational resilience. This paper presents an in-depth review of recent advancements in Kubernetes, with an emphasis on version 1.33, structured around three core problem domains: (1) runtime and scheduling inefficiencies, (2) container image and storage bottlenecks, and (3) event-driven processing and networking limitations. Across all three domains, we examine how the evolution of communication infrastructure, such as changing network protocols, traffic patterns from edge to cloud, and service coordination mechanisms, impacts orchestration reliability and system design. We explore recent feature enhancements such as JobSet, In-place Pod Resizing, improved autoscalers, and nftables-based kube-proxy, analyzing their relevance to modern workloads including distributed machine learning and high-performance computing. Beyond feature evaluation, we highlight unresolved challenges, such as device-aware workload orchestration, adaptive resource provisioning, and scalable event management, and discuss their implications in emerging scenarios. Finally, we outline future research directions and architectural strategies aimed at achieving intelligent, resilient, and workload-aware orchestration in Kubernetes. This study serves as both a state-of-the-art review and a guidepost for advancing Kubernetes-based systems.</div></div>","PeriodicalId":48633,"journal":{"name":"Computer Science Review","volume":"59 ","pages":"Article 100851"},"PeriodicalIF":12.7,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145519519","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
Emerging security paradigms in IoT: A scientometric analysis of research trends and future prospects 物联网中的新兴安全范式:对研究趋势和未来前景的科学计量分析
IF 12.7 1区 计算机科学
Computer Science Review Pub Date : 2026-02-01 Epub Date: 2025-10-22 DOI: 10.1016/j.cosrev.2025.100840
Munish Bhatia , K.M. Charul
{"title":"Emerging security paradigms in IoT: A scientometric analysis of research trends and future prospects","authors":"Munish Bhatia ,&nbsp;K.M. Charul","doi":"10.1016/j.cosrev.2025.100840","DOIUrl":"10.1016/j.cosrev.2025.100840","url":null,"abstract":"<div><div>The exponential growth of the Internet of Things (IoT) has intensified security challenges, necessitating the adoption of emerging techniques such as Intelligent Threat Detection (ITD), Distributed Ledger Protection (DLP), Deceptive Defense Mechanism(DDM), and Quantum-Resilient Cryptography (QRC). Current study presents a comprehensive scientometric analysis of IoT security research from 2017 to 2024, examining publication trends, citation patterns, collaborative networks, and keyword co-occurrences. Findings reveal a substantial increase in ITD publications, highlighting the rising adoption of AI-driven threat monitoring, while DLP demonstrates robust growth in blockchain-based secure architectures. DDM shows steady progress in proactive defense strategies, and QRC exhibits rapid recent expansion in response to quantum-enabled threats. Country-level collaboration analysis identifies India, China, and the United States as leading contributors, with active international research networks shaping the field. Keyword and co-citation analyses uncover thematic clusters and research hotspots, including federated learning, privacy-preserving blockchain, honeypots, and post-quantum cryptography. The study also highlights major challenges and potential future research directions, providing actionable insights for both researchers and practitioners. By mapping the intellectual structure and evolution of emerging IoT security techniques, the research offers a data-driven foundation for guiding future investigations and policy initiatives.</div></div>","PeriodicalId":48633,"journal":{"name":"Computer Science Review","volume":"59 ","pages":"Article 100840"},"PeriodicalIF":12.7,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145362336","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
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书