I. Ribón, Maria-Esther Vidal, B. Kämpgen, York Sure-Vetter
Knowledge graphs encode semantics that describes resources in terms of several aspects, e.g., neighbors, class hierarchies, or node degrees. Assessing relatedness of knowledge graph entities is crucial for several data-driven tasks, e.g., ranking, clustering, or link discovery. However, existing similarity measures consider aspects in isolation when determining entity relatedness. We address the problem of similarity assessment between knowledge graph entities, and devise GADES. GADES relies on aspect similarities and computes a similarity measure as the combination of these similarity values. We empirically evaluate the accuracy of GADES on knowledge graphs from different domains, e.g., proteins, and news. Experiment results indicate that GADES exhibits higher correlation with gold standards than studied existing approaches. Thus, these results suggest that similarity measures should not consider aspects in isolation, but combinations of them to precisely determine relatedness.
{"title":"GADES: A Graph-based Semantic Similarity Measure","authors":"I. Ribón, Maria-Esther Vidal, B. Kämpgen, York Sure-Vetter","doi":"10.1145/2993318.2993343","DOIUrl":"https://doi.org/10.1145/2993318.2993343","url":null,"abstract":"Knowledge graphs encode semantics that describes resources in terms of several aspects, e.g., neighbors, class hierarchies, or node degrees. Assessing relatedness of knowledge graph entities is crucial for several data-driven tasks, e.g., ranking, clustering, or link discovery. However, existing similarity measures consider aspects in isolation when determining entity relatedness. We address the problem of similarity assessment between knowledge graph entities, and devise GADES. GADES relies on aspect similarities and computes a similarity measure as the combination of these similarity values. We empirically evaluate the accuracy of GADES on knowledge graphs from different domains, e.g., proteins, and news. Experiment results indicate that GADES exhibits higher correlation with gold standards than studied existing approaches. Thus, these results suggest that similarity measures should not consider aspects in isolation, but combinations of them to precisely determine relatedness.","PeriodicalId":177013,"journal":{"name":"Proceedings of the 12th International Conference on Semantic Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117109718","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper examines a semantic approach for identity management, namely the W3C WebID, as a representation of personal information, and the WebID-TLS as a decentralized authentication protocol, allowing individuals to manage their own identities and data privacy. The paper identifies a set of important usability, privacy and security issues that needs to be addressed, and proposes an end to end authentication mechanism based on WebID, JSON Web Tokens (JWT) and the blockchain. The WebID includes a personal profile with its certificate, and the social relationship information described as the RDF-based FOAF ontology. The JWT is a standardized container format to encode personal related information in a secure way using "claims". The distributed, irreversible, undeletable, and immutable nature of the blockchain has appropriate attributes for distributed credential storage and decentralized identity management.
本文研究了身份管理的语义方法，即W3C WebID作为个人信息的表示，而WebID- tls作为分散的身份验证协议，允许个人管理自己的身份和数据隐私。本文确定了一系列需要解决的重要可用性、隐私和安全问题，并提出了一种基于webbid、JSON Web Tokens (JWT)和区块链的端到端身份验证机制。WebID包括带有证书的个人简介，以及描述为基于rdf的FOAF本体的社会关系信息。JWT是一种标准化的容器格式，使用“声明”以一种安全的方式对个人相关信息进行编码。区块链的分布式、不可逆、不可删除和不可变的特性，为分布式凭证存储和去中心化身份管理提供了合适的属性。
{"title":"Decentralized Semantic Identity","authors":"J. Faísca, J. Rogado","doi":"10.1145/2993318.2993348","DOIUrl":"https://doi.org/10.1145/2993318.2993348","url":null,"abstract":"This paper examines a semantic approach for identity management, namely the W3C WebID, as a representation of personal information, and the WebID-TLS as a decentralized authentication protocol, allowing individuals to manage their own identities and data privacy. The paper identifies a set of important usability, privacy and security issues that needs to be addressed, and proposes an end to end authentication mechanism based on WebID, JSON Web Tokens (JWT) and the blockchain. The WebID includes a personal profile with its certificate, and the social relationship information described as the RDF-based FOAF ontology. The JWT is a standardized container format to encode personal related information in a secure way using \"claims\". The distributed, irreversible, undeletable, and immutable nature of the blockchain has appropriate attributes for distributed credential storage and decentralized identity management.","PeriodicalId":177013,"journal":{"name":"Proceedings of the 12th International Conference on Semantic Systems","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127139273","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Umutcan Simsek, A. Fensel, A. Zafeiropoulos, Eleni Fotopoulou, Paris Liapis, A. Bouras, Fernando Terroso-Sáenz, A. Gómez-Skarmeta
Residential and office buildings have the largest share in energy consumption, followed by transport and industry. At the same time, many buildings do not leverage all feasible opportunities to increase their energy efficiency. Particularly, the solutions influencing the behaviour of the end-users are lacking. In this paper, we present a novel semantics-empowered approach for motivating end-users towards the adoption of energy efficient lifestyles, based on recommendations provided through personalised applications and serious games. As a foundation of our approach, we have designed two semantic models to represent energy consumption and behavioural characteristics of consumers. The Energy Efficiency Semantic Model represents energy consumption data collected from a heterogeneous sensor network, while the Behavioural Semantic Model focuses on energy consumption profile of end-users. These models are being validated in the reference architecture and use cases of EU H2020 project ENTROPY.
{"title":"A semantic approach towards implementing energy efficient lifestyles through behavioural change","authors":"Umutcan Simsek, A. Fensel, A. Zafeiropoulos, Eleni Fotopoulou, Paris Liapis, A. Bouras, Fernando Terroso-Sáenz, A. Gómez-Skarmeta","doi":"10.1145/2993318.2993346","DOIUrl":"https://doi.org/10.1145/2993318.2993346","url":null,"abstract":"Residential and office buildings have the largest share in energy consumption, followed by transport and industry. At the same time, many buildings do not leverage all feasible opportunities to increase their energy efficiency. Particularly, the solutions influencing the behaviour of the end-users are lacking. In this paper, we present a novel semantics-empowered approach for motivating end-users towards the adoption of energy efficient lifestyles, based on recommendations provided through personalised applications and serious games. As a foundation of our approach, we have designed two semantic models to represent energy consumption and behavioural characteristics of consumers. The Energy Efficiency Semantic Model represents energy consumption data collected from a heterogeneous sensor network, while the Behavioural Semantic Model focuses on energy consumption profile of end-users. These models are being validated in the reference architecture and use cases of EU H2020 project ENTROPY.","PeriodicalId":177013,"journal":{"name":"Proceedings of the 12th International Conference on Semantic Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127372763","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The process of designing Cyber Physical Production Systems (CPPS), e.g., modern power plants or steel mills, typically takes place in a multi-disciplinary engineering environment, in which experts from various engineering domains and organizations work together towards creating complex engineering artifacts. The process of designing such complex engineering artifacts requires iterations and redesign phases, which lead to continuous changes of the data and knowledge. To manage changes in such environment, we have previously proposed a generic reference process for conducting Knowledge Change Management and Analysis (KCMA). This paper implements this process for the case study of a modern Hydro Power Plant by adapting the proposed generic reference process into a scientific prototype developed using Semantic Web Technologies. Finally, we conduct an evaluation to evaluate the feasibility of the proposed reference process and the developed prototype. Thus, the contribution of this paper is two-folds: (1) A tool-supported prototype for KCMA of a hydro power plant, and (2) A feasibility evaluation of this prototype that reports feedback and lessons learned for achieving KCMA in real-world case studies.
{"title":"Knowledge Change Management and Analysis during the Engineering of Cyber Physical Production Systems: A Use Case of Hydro Power Plants","authors":"F. Ekaputra, M. Sabou, Estefanía Serral, S. Biffl","doi":"10.1145/2993318.2993325","DOIUrl":"https://doi.org/10.1145/2993318.2993325","url":null,"abstract":"The process of designing Cyber Physical Production Systems (CPPS), e.g., modern power plants or steel mills, typically takes place in a multi-disciplinary engineering environment, in which experts from various engineering domains and organizations work together towards creating complex engineering artifacts. The process of designing such complex engineering artifacts requires iterations and redesign phases, which lead to continuous changes of the data and knowledge. To manage changes in such environment, we have previously proposed a generic reference process for conducting Knowledge Change Management and Analysis (KCMA). This paper implements this process for the case study of a modern Hydro Power Plant by adapting the proposed generic reference process into a scientific prototype developed using Semantic Web Technologies. Finally, we conduct an evaluation to evaluate the feasibility of the proposed reference process and the developed prototype. Thus, the contribution of this paper is two-folds: (1) A tool-supported prototype for KCMA of a hydro power plant, and (2) A feasibility evaluation of this prototype that reports feedback and lessons learned for achieving KCMA in real-world case studies.","PeriodicalId":177013,"journal":{"name":"Proceedings of the 12th International Conference on Semantic Systems","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129666257","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
One approach to continuously achieve a certain data quality level is to use an integration pipeline that continuously checks and monitors the quality of a data set according to defined metrics. This approach is inspired by Continuous Integration pipelines, that have been introduced in the area of software development and DevOps to perform continuous source code checks. By investigating in possible tools to use and discussing the specific requirements for RDF data sets, an integration pipeline is derived that joins current approaches of the areas of software-development and semantic-web as well as reuses existing tools. As these tools have not been built explicitly for CI usage, we evaluate their usability and propose possible workarounds and improvements. Furthermore, a real-world usage scenario is discussed, outlining the benefit of the usage of such a pipeline.
{"title":"Using DevOps Principles to Continuously Monitor RDF Data Quality","authors":"R. Meissner, K. Junghanns","doi":"10.1145/2993318.2993351","DOIUrl":"https://doi.org/10.1145/2993318.2993351","url":null,"abstract":"One approach to continuously achieve a certain data quality level is to use an integration pipeline that continuously checks and monitors the quality of a data set according to defined metrics. This approach is inspired by Continuous Integration pipelines, that have been introduced in the area of software development and DevOps to perform continuous source code checks. By investigating in possible tools to use and discussing the specific requirements for RDF data sets, an integration pipeline is derived that joins current approaches of the areas of software-development and semantic-web as well as reuses existing tools. As these tools have not been built explicitly for CI usage, we evaluate their usability and propose possible workarounds and improvements. Furthermore, a real-world usage scenario is discussed, outlining the benefit of the usage of such a pipeline.","PeriodicalId":177013,"journal":{"name":"Proceedings of the 12th International Conference on Semantic Systems","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132077411","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The Semantic Web provides mechanisms to interlink data in a fast and efficient way and build complex information networks. However, one of the most important features missing for industrial application is version control which allows recording changes and rolling them back at any time if necessary. It is not sufficiently supported by today's triplestores and recent version control systems are not very well integrated into the Semantic Web. This paper shows a way of dealing with version and revision control using SPARQL. It presents R43ples as an approach using named graphs for semantically storing the differences between revisions. Furthermore it allows a direct access and manipulation of revisions with extended version of SPARQL. Smart mechanisms for restoring old revisions relying on query rewriting provide a fast way of querying old revisions of big datasets. A prototypical implementation of the system prove an appropriate performance under different conditions.
{"title":"Open Semantic Revision Control with R43ples: Extending SPARQL to access revisions of Named Graphs","authors":"Markus Graube, Stephan Hensel, L. Urbas","doi":"10.1145/2993318.2993336","DOIUrl":"https://doi.org/10.1145/2993318.2993336","url":null,"abstract":"The Semantic Web provides mechanisms to interlink data in a fast and efficient way and build complex information networks. However, one of the most important features missing for industrial application is version control which allows recording changes and rolling them back at any time if necessary. It is not sufficiently supported by today's triplestores and recent version control systems are not very well integrated into the Semantic Web. This paper shows a way of dealing with version and revision control using SPARQL. It presents R43ples as an approach using named graphs for semantically storing the differences between revisions. Furthermore it allows a direct access and manipulation of revisions with extended version of SPARQL. Smart mechanisms for restoring old revisions relying on query rewriting provide a fast way of querying old revisions of big datasets. A prototypical implementation of the system prove an appropriate performance under different conditions.","PeriodicalId":177013,"journal":{"name":"Proceedings of the 12th International Conference on Semantic Systems","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126933162","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
M. Frommhold, Rubén Navarro Piris, Natanael Arndt, Sebastian Tramp, Niklas Petersen, Michael Martin
Coherent and consistent tracking of provenance data and in particular update history information is a crucial building block for any serious information system architecture. Version Control Systems can be a part of such an architecture enabling users to query and manipulate versioning information as well as content revisions. In this paper, we introduce an RDF versioning approach as a foundation for a full featured RDF Version Control System. We argue that such a system needs support for all concepts of the RDF specification including support for RDF datasets and blank nodes. Furthermore, we placed special emphasis on the protection against unperceived history manipulation by hashing the resulting patches. In addition to the conceptual analysis and an RDF vocabulary for representing versioning information, we present a mature implementation which captures versioning information for changes to arbitrary RDF datasets.
{"title":"Towards Versioning of Arbitrary RDF Data","authors":"M. Frommhold, Rubén Navarro Piris, Natanael Arndt, Sebastian Tramp, Niklas Petersen, Michael Martin","doi":"10.1145/2993318.2993327","DOIUrl":"https://doi.org/10.1145/2993318.2993327","url":null,"abstract":"Coherent and consistent tracking of provenance data and in particular update history information is a crucial building block for any serious information system architecture. Version Control Systems can be a part of such an architecture enabling users to query and manipulate versioning information as well as content revisions. In this paper, we introduce an RDF versioning approach as a foundation for a full featured RDF Version Control System. We argue that such a system needs support for all concepts of the RDF specification including support for RDF datasets and blank nodes. Furthermore, we placed special emphasis on the protection against unperceived history manipulation by hashing the resulting patches. In addition to the conceptual analysis and an RDF vocabulary for representing versioning information, we present a mature implementation which captures versioning information for changes to arbitrary RDF datasets.","PeriodicalId":177013,"journal":{"name":"Proceedings of the 12th International Conference on Semantic Systems","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128081374","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We developed a quiz game that uses questions automatically generated from the Czech and English DBpedia. The game uses class membership and categorization to split DBpedia resources into domains of questions, such as persons or films. Difficulty of questions is estimated by using the indegree graph metric based on links between Wikipedia pages. Surface forms of the DBpedia resources including inbound link labels and select properties are used to remove potential spoilers from questions. We evaluate the relation of indegree to answer success rate and the contribution of semantic features for spoiler removal using online evaluation during game sessions with actual users. Our findings indicate that answer success rate correlates with indegree, but it has a stronger correlation with page views. The evaluation also suggests that additional surface forms improve spoiler detection.
{"title":"DB-quiz: a DBpedia-backed knowledge game","authors":"Jindrich Mynarz, Václav Zeman","doi":"10.1145/2993318.2993339","DOIUrl":"https://doi.org/10.1145/2993318.2993339","url":null,"abstract":"We developed a quiz game that uses questions automatically generated from the Czech and English DBpedia. The game uses class membership and categorization to split DBpedia resources into domains of questions, such as persons or films. Difficulty of questions is estimated by using the indegree graph metric based on links between Wikipedia pages. Surface forms of the DBpedia resources including inbound link labels and select properties are used to remove potential spoilers from questions. We evaluate the relation of indegree to answer success rate and the contribution of semantic features for spoiler removal using online evaluation during game sessions with actual users. Our findings indicate that answer success rate correlates with indegree, but it has a stronger correlation with page views. The evaluation also suggests that additional surface forms improve spoiler detection.","PeriodicalId":177013,"journal":{"name":"Proceedings of the 12th International Conference on Semantic Systems","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133392263","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Javier D. Fernández, Jürgen Umbrich, A. Polleres, Magnus Knuth
There is an emerging demand on efficiently archiving and (temporal) querying different versions of evolving semantic Web data. As novel archiving systems are starting to address this challenge, foundations/standards for benchmarking RDF archives are needed to evaluate its storage space efficiency and the performance of different retrieval operations. To this end, we provide theoretical foundations on the design of data and queries to evaluate emerging RDF archiving systems. Then, we instantiate these foundations along a concrete set of queries on the basis of a real-world evolving dataset. Finally, we perform an empirical evaluation of various current archiving techniques and querying strategies on this data. Our work comprises -- to the best of our knowledge -- the first benchmark for querying evolving RDF data archives.
{"title":"Evaluating Query and Storage Strategies for RDF Archives","authors":"Javier D. Fernández, Jürgen Umbrich, A. Polleres, Magnus Knuth","doi":"10.1145/2993318.2993333","DOIUrl":"https://doi.org/10.1145/2993318.2993333","url":null,"abstract":"There is an emerging demand on efficiently archiving and (temporal) querying different versions of evolving semantic Web data. As novel archiving systems are starting to address this challenge, foundations/standards for benchmarking RDF archives are needed to evaluate its storage space efficiency and the performance of different retrieval operations. To this end, we provide theoretical foundations on the design of data and queries to evaluate emerging RDF archiving systems. Then, we instantiate these foundations along a concrete set of queries on the basis of a real-world evolving dataset. Finally, we perform an empirical evaluation of various current archiving techniques and querying strategies on this data. Our work comprises -- to the best of our knowledge -- the first benchmark for querying evolving RDF data archives.","PeriodicalId":177013,"journal":{"name":"Proceedings of the 12th International Conference on Semantic Systems","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115987762","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Distributed actors working on a common RDF dataset regularly encounter the issue to compare the status of one graph with another or generally to synchronize copies of a dataset. A versioning system helps to synchronize the copies of a dataset, combined with a difference calculation system it is also possible to compare versions in a log and to determine, in which version a certain statement was introduced or removed. In this demo we present Quit Diff1, a tool to compare versions of a Git versioned quad store, while it is also applicable to simple unversioned RDF datasets. We are following an approach to abstract from differences on a syntactical level to differences on the level of the RDF data model, while we leave further semantic interpretation on the schema and instance level to specialized applications. Quit Diff can generate patches in various output formats and can be directly integrated in the distributed version control system Git which provides a foundation for a comprehensive co-evolution work flow on RDF datasets.
{"title":"Quit Diff: Calculating the Delta Between RDF Datasets Under Version Control","authors":"Natanael Arndt, Norman Radtke","doi":"10.1145/2993318.2993349","DOIUrl":"https://doi.org/10.1145/2993318.2993349","url":null,"abstract":"Distributed actors working on a common RDF dataset regularly encounter the issue to compare the status of one graph with another or generally to synchronize copies of a dataset. A versioning system helps to synchronize the copies of a dataset, combined with a difference calculation system it is also possible to compare versions in a log and to determine, in which version a certain statement was introduced or removed. In this demo we present Quit Diff1, a tool to compare versions of a Git versioned quad store, while it is also applicable to simple unversioned RDF datasets. We are following an approach to abstract from differences on a syntactical level to differences on the level of the RDF data model, while we leave further semantic interpretation on the schema and instance level to specialized applications. Quit Diff can generate patches in various output formats and can be directly integrated in the distributed version control system Git which provides a foundation for a comprehensive co-evolution work flow on RDF datasets.","PeriodicalId":177013,"journal":{"name":"Proceedings of the 12th International Conference on Semantic Systems","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132805806","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：