Computer Standards & Interfaces最新文献

筛选
英文 中文
Uncharted dimensions, gaps, and future trends of serious games in software engineering 软件工程中的严肃游戏的未知层面、差距和未来趋势
IF 4.1 2区 计算机科学
Computer Standards & Interfaces Pub Date : 2024-08-08 DOI: 10.1016/j.csi.2024.103915
{"title":"Uncharted dimensions, gaps, and future trends of serious games in software engineering","authors":"","doi":"10.1016/j.csi.2024.103915","DOIUrl":"10.1016/j.csi.2024.103915","url":null,"abstract":"<div><h3>Objective</h3><p>Serious Games (SG) are a rising trend in Software Engineering (SE) education, for this reason, and since this topic is still immature and further research was encouraged, it is important to investigate how SGs are integrated into SE education. In this line, this study explores the landscape of SGs in SE) education, focusing on their categorization according to their addressed SWEBOK areas and Bloom's levels, extracted their key elements, mechanics and dynamics, exploring in depth their most portrayed player profiles, finding what makes them successful SGs in this field, and last addressing their resulting challenges in the realm of SE education.</p></div><div><h3>Methodology</h3><p>A systematic search was conducted across prominent databases: Science Direct, IEEE Xplore, ACM, Scopus, and Wiley. Initially, 125 papers met our initial inclusion criteria, from which 46 remained after rigorous full-text review. Utilizing snowball sampling, we added 28 additional studies, resulting in a total of 74 selected papers for comprehensive analysis.</p></div><div><h3>Results</h3><p>Among the selected papers, which spanned from the early 2000s to May 2021, a notable increase in publications on SGs in SE was observed, particularly since 2010. The majority of these studies focused on validation research (60 %), followed by solution proposals (17.56 %) and evaluation research (13.51 %). Publication channels predominantly included conferences (79.73 %), underscoring the emerging nature of SGs in SE research, with a smaller proportion appearing in journal articles (20.27 %). Specific focus areas within SE, such as Software Engineering Management (33.78 %) and SE Professional Practice (13.51 %), received significant attention, while others, like SE Models and Methods, showed minimal representation. Furthermore, SGs were found to effectively target higher-order cognitive skills based on Bloom's Taxonomy, with notable implementations of game dynamics such as Teams and Realism to enhance learning experiences. Despite these advancements, there remains a predominant focus on player profiles like Achievers (48.64 %) and Players (47.30 %), suggesting potential gaps in addressing a broader spectrum of learner types within SGs designed for SE education.</p></div><div><h3>Conclusion</h3><p>This study underscores the evolving role of SGs in SE education, emphasizing the need for diverse approaches to enhance engagement and educational outcomes. Future research should focus on optimizing SG potential across educational and industrial settings by expanding publication visibility, integrating artificial intelligence (AI), and conducting comprehensive evaluations of SGs tailored to SE contexts.</p></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":null,"pages":null},"PeriodicalIF":4.1,"publicationDate":"2024-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0920548924000849/pdfft?md5=aabc12b8df17cadc4147fd2af50e915d&pid=1-s2.0-S0920548924000849-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142122606","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Prototype, method, and experiment for evaluating usability of smart home user interfaces 评估智能家居用户界面可用性的原型、方法和实验
IF 4.1 2区 计算机科学
Computer Standards & Interfaces Pub Date : 2024-08-03 DOI: 10.1016/j.csi.2024.103903
{"title":"Prototype, method, and experiment for evaluating usability of smart home user interfaces","authors":"","doi":"10.1016/j.csi.2024.103903","DOIUrl":"10.1016/j.csi.2024.103903","url":null,"abstract":"<div><p>Despite the widespread adoption of smart devices and home automation systems, users still face usability challenges. Additionally, evaluating the usability of smart home systems is not straightforward. Our paper focuses on building a Smart Home Prototype, selecting, and evaluating software User Interfaces (UI). We have chosen the smart home heating system as the basis, but the principles are applicable to other applications. To discuss smart home UIs, it is necessary to understand the components, implementation scenarios, configuration, and operation of smart home systems. Therefore, we devote considerable attention to these topics in the paper. Our smart home system utilizes a Raspberry Pi computer, temperature sensors, servo drives, an Android-based smartphone, and other necessary hardware. We installed and configured open-source software and third-party services on the experimental setup. We provided a brief description of each selected software. We used the Home Assistant operating system, its mobile application, voice assistant Alice, and Telegram chatbot. In our study, we described a methodology for evaluating user interfaces in smart homes and conducted an experiment to assess their usability. The experiment results indicated which interface was more user-friendly and identified the drawbacks of each. In conclusion, we discuss UI features that can improve usability and available options for building a smart home based on capabilities.</p></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":null,"pages":null},"PeriodicalIF":4.1,"publicationDate":"2024-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141991092","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Research on the construction and mapping model of knowledge organization system driven by standards 标准驱动的知识组织系统构建与映射模型研究
IF 4.1 2区 计算机科学
Computer Standards & Interfaces Pub Date : 2024-08-03 DOI: 10.1016/j.csi.2024.103905
{"title":"Research on the construction and mapping model of knowledge organization system driven by standards","authors":"","doi":"10.1016/j.csi.2024.103905","DOIUrl":"10.1016/j.csi.2024.103905","url":null,"abstract":"<div><p>With the rapid development of artificial intelligence and enterprise digital transformation, the standardization organization, storage and management of semantic knowledge in computers have become the current research focus. As the core theory of knowledge system construction, knowledge organization (KO) provides theoretical support for the study of semantic knowledge organization and representation, among which knowledge organization system (KOS) is the important tool of semantic organization. At present, many scholars have carried out research from different perspectives of KOS based on theory, which provides the direction for the sustainable development of KOS. However, most of these studies focus on some aspects of KOS, which are in a \"scattered\" state, lacking systematic analysis of the basic principles of KOS construction and semantic organization based on theories and international standards. Therefore, this paper firstly constructs KOS theoretical models in the conceptual world and computer world respectively through a comprehensive study of multi-disciplinary basic theories such as semantics, logic, system theory, and international standards such as ISO 1087:2019, ISO 25964:2013, and ISO 11179:2023, and traces the iterative construction, organization and mapping process from \"concept\" in the conceptual world to \"metadata\" knowledge and semantics in the computer world. The semantic organization based on metadata is realized in computer. Secondly, on this basis, in order to realize ontology representation of domain knowledge, the ontology construction method based on MDR metadata is proposed. Finally, taking the semantic organization and ontology construction of Epicentre model in petroleum field as an example, the feasibility of the ideas and methods proposed in this paper is verified. The model and method proposed in this paper is independent of the specific type of KOS, so it is innovative and universal. The methodology is also applicable to other fields of conceptual system modeling, metadata standard construction, and data model modeling.</p></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":null,"pages":null},"PeriodicalIF":4.1,"publicationDate":"2024-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141941207","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Lattice-based strong designated verifier signature with non-delegatability 基于网格的强指定验证器签名具有不可转让性
IF 4.1 2区 计算机科学
Computer Standards & Interfaces Pub Date : 2024-08-03 DOI: 10.1016/j.csi.2024.103904
{"title":"Lattice-based strong designated verifier signature with non-delegatability","authors":"","doi":"10.1016/j.csi.2024.103904","DOIUrl":"10.1016/j.csi.2024.103904","url":null,"abstract":"<div><p>Strong designated verifier signature (SDVS) is a special type of digital signatures which provides authentication of a message without providing non-repudiation property. More specifically, SDVS can enable that it is impossible for any entity, other than the designated verifier, to recognize the validity of a given signature. Although there have been several proposals of lattice-based SDVS schemes since the first non-quantum resistant scheme proposed by Jakobsson et al. at EUROCRYPT 1996, all the existing lattice-based ones cannot achieve a security notion called non-delegatablity (ND), which was an essential property introduced by Lipmaa et al. at ICALP 2005 when considering an SDVS in scenarios where the responsibility of the signer is important and the signing rights cannot be delegated to another entity. Therefore, in this work, we provide the first lattice-based SDVS scheme that offers non-delegatablity (i.e., neither the signer nor the designated verifier can delegate the signing rights to other entities without the revealment of their corresponding private keys), and thus, resolve a prominent open problem posed by previous works. Moreover, we achieve this non-trivial feat in a relatively simple manner. Starting with Lyubashevsky’s lattice signatures without trapdoors at EUROCRYPT 2012 - which is arguably the first practical alternative method in general lattices for designing digital signatures not adopting the “hash-and-sign” methodology, we introduce simple-but-insightful tweaks allowing to upgrade it directly into an SDVS with non-delegatablity. The scheme satisfies the strong security requirements of Lipmaa et al.’s model and is proven secure in the random oracle model under the short integer solution (SIS) and the learning with errors (LWE) assumptions.</p></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":null,"pages":null},"PeriodicalIF":4.1,"publicationDate":"2024-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141941200","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A consent-aware electronic medical records sharing method based on blockchain 基于区块链的同意感知电子病历共享方法
IF 4.1 2区 计算机科学
Computer Standards & Interfaces Pub Date : 2024-07-31 DOI: 10.1016/j.csi.2024.103902
{"title":"A consent-aware electronic medical records sharing method based on blockchain","authors":"","doi":"10.1016/j.csi.2024.103902","DOIUrl":"10.1016/j.csi.2024.103902","url":null,"abstract":"<div><p>Electronic medical records (EMRs) sharing has become a vital component of the modern health care system, which involves patients, The Medical Institution with Medical Records (MI-MR), and The Medical Institution Requiring Medical Records (MI-RMR) within this ecosystem. Currently, a substantial amount of research focuses on the security, authenticity, and privacy of the shared information. However, there is a shortage of attention on design and research that adequately reflect personal rights and interests of patients. We propose a consent-aware EMR sharing method leveraging blockchain technology, which not only preserves patients’ right to be informed, but also fulfills the fundamental needs for security and privacy in EMR sharing. Furthermore, it ensures transparency and decentralization in the sharing process and incorporates on-chain verification mechanisms against malicious alteration of blockchain data. To enhance system scalability, a secure off-chain storage mechanism has been implemented. Our experimental findings underscore the practicality of our smart contract on Ethereum, along with its economic benefits, evaluated using tests conducted on a Ganache-based Ethereum blockchain network and a Remix-based Ethereum blockchain network. The performance and advantages of the proposed architecture have been corroborated through a prototype implementation using Ethereum.</p></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":null,"pages":null},"PeriodicalIF":4.1,"publicationDate":"2024-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141941199","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Encrypted data inner product KNN secure query based on BALL-PB tree 基于 BALL-PB 树的加密数据内积 KNN 安全查询
IF 4.1 2区 计算机科学
Computer Standards & Interfaces Pub Date : 2024-07-31 DOI: 10.1016/j.csi.2024.103901
{"title":"Encrypted data inner product KNN secure query based on BALL-PB tree","authors":"","doi":"10.1016/j.csi.2024.103901","DOIUrl":"10.1016/j.csi.2024.103901","url":null,"abstract":"<div><p>With the increased data volume, data query service outsourcing to cloud servers is widely used. However, enabling authorized users to access confidential data is critical when conducting queries on untrusted cloud servers. To this end, an inner-product k-nearest neighbor (KNN) query scheme with access control (IPKNN_AC) is proposed under privacy protection. Firstly, this scheme utilizes the designed Ball-PB tree structure to partition the dataset into multiple subsets. Considering the efficiency and confidentiality of inner-product queries on the tree, the scheme represents the internal nodes and leaf nodes accordingly and defines a secure inner-product calculation protocol, EncInp. Secondly, relying on EncInp, a query algorithm is employed to perform similarity inner-product queries on the encrypted tree representation. Finally, the scheme is shown to be secure through security proofs of homomorphic encryption. Experimental evaluation results on medical datasets demonstrate the effectiveness of the scheme.</p></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":null,"pages":null},"PeriodicalIF":4.1,"publicationDate":"2024-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0920548924000709/pdfft?md5=c8c4923f65a97b115b4f3323d577d702&pid=1-s2.0-S0920548924000709-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141941202","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Quantifying heuristic evaluation 量化启发式评估
IF 4.1 2区 计算机科学
Computer Standards & Interfaces Pub Date : 2024-07-29 DOI: 10.1016/j.csi.2024.103891
{"title":"Quantifying heuristic evaluation","authors":"","doi":"10.1016/j.csi.2024.103891","DOIUrl":"10.1016/j.csi.2024.103891","url":null,"abstract":"<div><p>Since Nielsen presented his work on heuristic evaluation in the 90s, it has been seen how this inspection method has been used recurrently not only in academia but also in the industry. The benefits of their application have been studied widely and multiple heuristics for multiple purposes have been designed. Despite it, quantifying their qualitative nature has been challenging. This research presents a novel approach to provide a framework for quantifying an heuristic evaluation based on the calculus of what we called Usability Percentage. We have used an initial study that started in 2018 with 7 different evaluators and we presented a new methodology to calculate the aforementioned percentage and also provide multiple information that might be added into a final report. We have used the platform RUXAILAB that allows us to create heuristic evaluations to prepare and execute the test. Our findings are that by comparing both studies the new methodology presents a narrowed data distribution through the different evaluators and allows us to identify in a more precise and concise way which heuristics might fail in an evaluation test.</p></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":null,"pages":null},"PeriodicalIF":4.1,"publicationDate":"2024-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141941201","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Privacy-preserving top-k spatio-temporal keyword preference query 保护隐私的顶k时空关键词偏好查询
IF 4.1 2区 计算机科学
Computer Standards & Interfaces Pub Date : 2024-07-27 DOI: 10.1016/j.csi.2024.103900
{"title":"Privacy-preserving top-k spatio-temporal keyword preference query","authors":"","doi":"10.1016/j.csi.2024.103900","DOIUrl":"10.1016/j.csi.2024.103900","url":null,"abstract":"<div><p>With the rapid advancement of location-based services and mobile devices, spatial keyword query attracts increasing attention. In this paper, we focus on a new query type known as top-<span><math><mi>k</mi></math></span> spatio-temporal keyword preference query. This kind of query considers both the spatial object itself and other spatial objects in the neighborhood to return <span><math><mi>k</mi></math></span> spatial objects with the highest score. These <span><math><mi>k</mi></math></span> spatial objects satisfy spatial and temporal constraints, while their scores are determined by the keyword similarity of the neighboring spatial objects. We propose a scheme to enable privacy-preserving top-<span><math><mi>k</mi></math></span> spatio-temporal keyword preference queries. To effectively represent temporal information, we employ time vectors to denote time periods, allowing us to assess whether the data satisfies temporal constraints based on the inner product of time vectors. Furthermore, we adopt a two-step strategy to execute the query. The first step is to find all Points of Interest (POIs) that meet the spatial and temporal constraints. The second step is to calculate the score of each POI and return the top-<span><math><mi>k</mi></math></span> POIs with the highest score. To enhance query efficiency, we build a tree index structure that can achieve sub-linear query complexity. Additionally, we utilize <em>EASPE</em> algorithm to encrypt both the index and the query, ensuring privacy-preserving capabilities. Security analysis proves that our scheme satisfies CQA2-security. At the same time, experimental evaluation validates the query performance of our scheme.</p></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":null,"pages":null},"PeriodicalIF":4.1,"publicationDate":"2024-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141838718","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Framework of standards, guides and methodologies for project, program, portfolio, and PMO management 项目、计划、组合和项目管理办公室管理的标准、指南和方法框架
IF 4.1 2区 计算机科学
Computer Standards & Interfaces Pub Date : 2024-07-26 DOI: 10.1016/j.csi.2024.103888
{"title":"Framework of standards, guides and methodologies for project, program, portfolio, and PMO management","authors":"","doi":"10.1016/j.csi.2024.103888","DOIUrl":"10.1016/j.csi.2024.103888","url":null,"abstract":"<div><p>Project, program, portfolio, and Project Management Office (PMO) management standards, guides, and methodologies are indispensable for professionals and companies as they reflect the best practices in the area. However, the number and diversity of extant documents are significant and growing, making their identification, study, and selection difficult. To help overcome this issue, this article presents a framework that integrates and organizes a wide range of concepts, standards, guides, and methodologies for project, program, portfolio, and PMO management. We carried out a literature review of the available documents published by several international entities, including the leading professional associations. The documents were then compiled, analyzed, and organized comprehensively. Theoretically, the proposed framework provides a structured perspective on the standards, guides, and methodologies according to their purpose, scope, and detail. It is also a valuable tool for assisting practitioners in identifying references for managing their projects, programs, portfolios, and PMOs. Moreover, it provides teachers, students, and training entities with a basis for studying standards, guides, and methodologies and designing training courses.</p></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":null,"pages":null},"PeriodicalIF":4.1,"publicationDate":"2024-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0920548924000576/pdfft?md5=d8bbfe5cedb165cf1118120ec7c211e2&pid=1-s2.0-S0920548924000576-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141848114","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Privacy-preserving fair outsourcing polynomial computation without FHE and FPR 无 FHE 和 FPR 的隐私保护公平外包多项式计算
IF 4.1 2区 计算机科学
Computer Standards & Interfaces Pub Date : 2024-07-25 DOI: 10.1016/j.csi.2024.103899
{"title":"Privacy-preserving fair outsourcing polynomial computation without FHE and FPR","authors":"","doi":"10.1016/j.csi.2024.103899","DOIUrl":"10.1016/j.csi.2024.103899","url":null,"abstract":"<div><p>With the development of cloud computing, verifiable outsourcing computation (VC) has received much more attention. The polynomial is a fundamental mathematical function with widespread applications. Plenty of VC schemes for polynomials have been proposed recently. However, most previous schemes focus on ensuring that the client can get a valid result returned by the cloud service provide (CSP) before payment, while often ignoring the CSP’s interest. To the best of our knowledge, Guan et al. (2021) proposed a pioneering framework for building fair outsourcing polynomial computation, which serves as the state of the art. However, it discloses the privacy of outsourced polynomials, inputs, and outputs. Furthermore, it suffers from a false positive rate (FPR) in the verification phase due to the sampling technique. As a result, it breaks the fairness between the client and the CSP.</p><p>To solve these problems, we propose a privacy-preserving fair outsourcing polynomial computation without FPR. To avoid expensive Fully Homomorphic Encryption (FHE), we utilize Paillier encryption and blind technique to ensure privacy. Our proposed scheme can guarantee fairness with an overwhelming probability by applying the SGX technique. The comprehensive performance evaluation and extensive simulations show that our protocol is more practical in cloud computing.</p></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":null,"pages":null},"PeriodicalIF":4.1,"publicationDate":"2024-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141853702","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"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学术文献互助群
群 号:481959085
Book学术官方微信