Stefano Bistarelli, Marco Mantilacci, Paolo Santancini, Francesco Santini
In this work we re-adapt the Bitcoin e-payment system and propose it as a decentralised end-to-end voting platform (from voters to candidates). We describe the main architectural choices behind the implementation, which consists of the pre-voting, voting, and post-voting phases. The resulting implementation is completely decentralised: it is possible to directly cast a vote in the block-chain without any collecting intermediate-level. All the votes can be verified by anyone reading such a public ledger. We also exploit digital asset coins to directly keep track of votes (through the Open Asset Protocol), and we show the election cost for n voters.
{"title":"An end-to-end voting-system based on bitcoin","authors":"Stefano Bistarelli, Marco Mantilacci, Paolo Santancini, Francesco Santini","doi":"10.1145/3019612.3019841","DOIUrl":"https://doi.org/10.1145/3019612.3019841","url":null,"abstract":"In this work we re-adapt the Bitcoin e-payment system and propose it as a decentralised end-to-end voting platform (from voters to candidates). We describe the main architectural choices behind the implementation, which consists of the pre-voting, voting, and post-voting phases. The resulting implementation is completely decentralised: it is possible to directly cast a vote in the block-chain without any collecting intermediate-level. All the votes can be verified by anyone reading such a public ledger. We also exploit digital asset coins to directly keep track of votes (through the Open Asset Protocol), and we show the election cost for n voters.","PeriodicalId":20728,"journal":{"name":"Proceedings of the Symposium on Applied Computing","volume":"470 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83037564","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}
Alysson Milanez, Bianca Lima, José Ferreira, T. Massoni
Detecting nonconformances between contracts and code is critical in contract-based programs, although detection is only the first step in correction; one needs to pinpoint their causes. For example, a nonconformance may be due to a method precondition that is weaker than it should be, or maybe the program behavior breaks the corresponding contracts. Previous research on contract-based programs lacks evidence about the most frequent causes for nonconformances. Either, no previous work elaborate on the effort required for establishing a likely cause. In this work, from 63 automatically-detected nonconformances found in 12 open source C#/Code Contracts systems, we manually analyze their likely causes, among contract or code defects. We observe nonconformances are frequently due to the weakness of preconditions, or to programs failing to fulfill contracts that seem appropriate to the problem at hand, although most nonconformances cause failures at the exit of operations (postcondition and invariant nonconformances sum up to 35). We also report on the obstacles in determining a likely cause, in which context information about the affected program fragment is often relevant.
{"title":"Nonconformance between programs and contracts: a study on C#/code contracts open source systems","authors":"Alysson Milanez, Bianca Lima, José Ferreira, T. Massoni","doi":"10.1145/3019612.3019779","DOIUrl":"https://doi.org/10.1145/3019612.3019779","url":null,"abstract":"Detecting nonconformances between contracts and code is critical in contract-based programs, although detection is only the first step in correction; one needs to pinpoint their causes. For example, a nonconformance may be due to a method precondition that is weaker than it should be, or maybe the program behavior breaks the corresponding contracts. Previous research on contract-based programs lacks evidence about the most frequent causes for nonconformances. Either, no previous work elaborate on the effort required for establishing a likely cause. In this work, from 63 automatically-detected nonconformances found in 12 open source C#/Code Contracts systems, we manually analyze their likely causes, among contract or code defects. We observe nonconformances are frequently due to the weakness of preconditions, or to programs failing to fulfill contracts that seem appropriate to the problem at hand, although most nonconformances cause failures at the exit of operations (postcondition and invariant nonconformances sum up to 35). We also report on the obstacles in determining a likely cause, in which context information about the affected program fragment is often relevant.","PeriodicalId":20728,"journal":{"name":"Proceedings of the Symposium on Applied Computing","volume":"5 2 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83432496","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}
Alexander Marsalek, Thomas Zefferer, Florian Reimair, Ç. Karabat, Elif Ustundag Soykan
The concepts of electronic identity (eID) and electronic signature (e-Signature) are crucial enablers of e-government solutions in Europe. The present heterogeneity of national e-government infrastructures in Europe raises serious challenges. The country-specific nature of infrastructure components prevents an easy reuse of country-specific components in other countries. We propose a solution, that facilitates the deployment and integration or third-party components into existing national e-government infrastructures. We demonstrate the feasibility of our proposal by means of a concrete implementation. Evaluation results obtained are promising and show the proposed solution's potential to leverage the adoption of eID and e-Signature solutions in Europe.
{"title":"Leveraging the adoption of electronic identities and electronic-signature solutions in Europe","authors":"Alexander Marsalek, Thomas Zefferer, Florian Reimair, Ç. Karabat, Elif Ustundag Soykan","doi":"10.1145/3019612.3019885","DOIUrl":"https://doi.org/10.1145/3019612.3019885","url":null,"abstract":"The concepts of electronic identity (eID) and electronic signature (e-Signature) are crucial enablers of e-government solutions in Europe. The present heterogeneity of national e-government infrastructures in Europe raises serious challenges. The country-specific nature of infrastructure components prevents an easy reuse of country-specific components in other countries. We propose a solution, that facilitates the deployment and integration or third-party components into existing national e-government infrastructures. We demonstrate the feasibility of our proposal by means of a concrete implementation. Evaluation results obtained are promising and show the proposed solution's potential to leverage the adoption of eID and e-Signature solutions in Europe.","PeriodicalId":20728,"journal":{"name":"Proceedings of the Symposium on Applied Computing","volume":"38 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74390877","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}
Jonatas Wehrmann, Rodrigo C. Barros, S. N. D. Dôres, R. Cerri
In classification tasks, an object usually belongs to one class within a set of disjoint classes. In more complex tasks, an object can belong to more than one class, in what is conventionally termed multi-label classification. Moreover, there are cases in which the set of classes are organised in a hierarchical fashion, and an object must be associated to a single path in this hierarchy, defining the so-called hierarchical classification. Finally, in even more complex scenarios, the classes are organised in a hierarchical structure and the object can be associated to multiple paths of this hierarchy, defining the problem investigated in this article: hierarchical multi-label classification (HMC). We address a typical problem of HMC, which is protein function prediction, and for that we propose an approach that chains multiple neural networks, performing both local and global optimisation in order to provide the final prediction: one or multiple paths in the hierarchy of classes. We experiment with four variations of this chaining process, and we compare these strategies with the state-of-the-art HMC algorithms for protein function prediction, showing that our novel approach significantly outperforms these methods.
{"title":"Hierarchical multi-label classification with chained neural networks","authors":"Jonatas Wehrmann, Rodrigo C. Barros, S. N. D. Dôres, R. Cerri","doi":"10.1145/3019612.3019664","DOIUrl":"https://doi.org/10.1145/3019612.3019664","url":null,"abstract":"In classification tasks, an object usually belongs to one class within a set of disjoint classes. In more complex tasks, an object can belong to more than one class, in what is conventionally termed multi-label classification. Moreover, there are cases in which the set of classes are organised in a hierarchical fashion, and an object must be associated to a single path in this hierarchy, defining the so-called hierarchical classification. Finally, in even more complex scenarios, the classes are organised in a hierarchical structure and the object can be associated to multiple paths of this hierarchy, defining the problem investigated in this article: hierarchical multi-label classification (HMC). We address a typical problem of HMC, which is protein function prediction, and for that we propose an approach that chains multiple neural networks, performing both local and global optimisation in order to provide the final prediction: one or multiple paths in the hierarchy of classes. We experiment with four variations of this chaining process, and we compare these strategies with the state-of-the-art HMC algorithms for protein function prediction, showing that our novel approach significantly outperforms these methods.","PeriodicalId":20728,"journal":{"name":"Proceedings of the Symposium on Applied Computing","volume":"29 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73484006","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}
Computationally efficient and exact inference of regulatory network topology is an open problem in System Biology. In this work we investigate the use of prior information about the network topology as a guide to a Markov Chain Monte Carlo sampler of network structures. The prior information is obtained from a coarser and faster network inference method, the Relevance Networks with Mutual Information scores. Moreover, the regulatory networks are represented by the Bayesian Networks model. The results show that the use of prior information drastically improves the convergence of the MCMC sampler. Therefore, the use of a more refined method is justified as it is likely to lead to more reliable results with less MCMC iterations.
{"title":"Inference of regulatory networks with MCMC sampler guided by mutual information","authors":"Nilzair M. Barreto, K. Machado, A. Werhli","doi":"10.1145/3019612.3022189","DOIUrl":"https://doi.org/10.1145/3019612.3022189","url":null,"abstract":"Computationally efficient and exact inference of regulatory network topology is an open problem in System Biology. In this work we investigate the use of prior information about the network topology as a guide to a Markov Chain Monte Carlo sampler of network structures. The prior information is obtained from a coarser and faster network inference method, the Relevance Networks with Mutual Information scores. Moreover, the regulatory networks are represented by the Bayesian Networks model. The results show that the use of prior information drastically improves the convergence of the MCMC sampler. Therefore, the use of a more refined method is justified as it is likely to lead to more reliable results with less MCMC iterations.","PeriodicalId":20728,"journal":{"name":"Proceedings of the Symposium on Applied Computing","volume":"65 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78749217","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}
Carlton Shepherd, Raja Naeem Akram, K. Markantonakis
The emergence of powerful, sensor-rich devices has led to the development of continuous authentication (CA) schemes using off-the-shelf hardware, where user behaviour is compared to past experience to produce an authentication decision with the aim of addressing challenges with traditional authentication schemes. Current CA proposals, however, have largely neglected adversaries present in a real-world deployment, namely the ubiquity of mal ware and software attacks. This has particular importance when a device cannot be trusted by a third-party, such as a corporation, that controls access to assets based on that decision. A software compromise, either on the scheme implementation or platform, may enable an adversary to modify authentication scores to alter the status of the device in reality, give insights into user behaviour, or gain unauthorised access to restricted assets. Hence, for the first time, we examine two standardised constructs that offer isolated and trusted execution - Secure Elements (SEs) and Trusted Execution Environments (TEEs) - even when an adversary has root-level privileges, and propose measures for providing trusted CA while retaining deployability. Based on these, we implement the first system for evaluating TEE-based CA on a consumer mobile device using Intel SGX, thus providing confidentiality, integrity and trust while removing the main platform from the TCB. We present an empirical evaluation of TEE-and non-TEE performance using methods proposed in related CA schemes. Our results indicate that trusted CA can be provided with no significant performance penalty, and may even offer performance benefits.
{"title":"Towards trusted execution of multi-modal continuous authentication schemes","authors":"Carlton Shepherd, Raja Naeem Akram, K. Markantonakis","doi":"10.1145/3019612.3019652","DOIUrl":"https://doi.org/10.1145/3019612.3019652","url":null,"abstract":"The emergence of powerful, sensor-rich devices has led to the development of continuous authentication (CA) schemes using off-the-shelf hardware, where user behaviour is compared to past experience to produce an authentication decision with the aim of addressing challenges with traditional authentication schemes. Current CA proposals, however, have largely neglected adversaries present in a real-world deployment, namely the ubiquity of mal ware and software attacks. This has particular importance when a device cannot be trusted by a third-party, such as a corporation, that controls access to assets based on that decision. A software compromise, either on the scheme implementation or platform, may enable an adversary to modify authentication scores to alter the status of the device in reality, give insights into user behaviour, or gain unauthorised access to restricted assets. Hence, for the first time, we examine two standardised constructs that offer isolated and trusted execution - Secure Elements (SEs) and Trusted Execution Environments (TEEs) - even when an adversary has root-level privileges, and propose measures for providing trusted CA while retaining deployability. Based on these, we implement the first system for evaluating TEE-based CA on a consumer mobile device using Intel SGX, thus providing confidentiality, integrity and trust while removing the main platform from the TCB. We present an empirical evaluation of TEE-and non-TEE performance using methods proposed in related CA schemes. Our results indicate that trusted CA can be provided with no significant performance penalty, and may even offer performance benefits.","PeriodicalId":20728,"journal":{"name":"Proceedings of the Symposium on Applied Computing","volume":"175 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76992309","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}
Malware analysis uses debuggers to understand and manipulate the behaviors of stripped binaries. To circumvent analysis, malware applies a variety of anti-debugging techniques, such as self-modifying, checking for or removing breakpoints, hijacking keyboard and mouse events, escaping the debugger, etc. Most state-of-the-art debuggers are vulnerable to these anti-debugging techniques. In this paper, we first systematically analyze the spectrum of possible anti-debugging techniques and compile a list of 79 attack vectors. We then propose a framework, called Apate, which detects and defeats each of these attack vectors, by performing: (1) just-in-time disassembling based on single-stepping, (2) careful monitoring of the debuggee's execution and, when needed, modification of the debuggee's states to hide the debugger's presence. We implement Apate as an extension to WinDbg and extensively evaluate it using five different datasets, with known and new malware samples. Apate outperforms other debugger-hiding technologies by a wide margin, addressing 58+--465+ more attack vectors.
{"title":"Hiding debuggers from malware with apate","authors":"Hao Shi, J. Mirkovic","doi":"10.1145/3019612.3019791","DOIUrl":"https://doi.org/10.1145/3019612.3019791","url":null,"abstract":"Malware analysis uses debuggers to understand and manipulate the behaviors of stripped binaries. To circumvent analysis, malware applies a variety of anti-debugging techniques, such as self-modifying, checking for or removing breakpoints, hijacking keyboard and mouse events, escaping the debugger, etc. Most state-of-the-art debuggers are vulnerable to these anti-debugging techniques. In this paper, we first systematically analyze the spectrum of possible anti-debugging techniques and compile a list of 79 attack vectors. We then propose a framework, called Apate, which detects and defeats each of these attack vectors, by performing: (1) just-in-time disassembling based on single-stepping, (2) careful monitoring of the debuggee's execution and, when needed, modification of the debuggee's states to hide the debugger's presence. We implement Apate as an extension to WinDbg and extensively evaluate it using five different datasets, with known and new malware samples. Apate outperforms other debugger-hiding technologies by a wide margin, addressing 58+--465+ more attack vectors.","PeriodicalId":20728,"journal":{"name":"Proceedings of the Symposium on Applied Computing","volume":"16 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88221778","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}
Marwa Boulakbech, Nizar Messai, Yacine Sam, T. Devogele
A wide range of Mobile Web-based applications are nowadays being built and proposed as mashup applications. Their aim is to be intuitive enough to be easily created by end-users directly selecting interactive elements, content and functionalities from existing resources, without requiring any technical skills. We propose in this article a Mobile Web Trip Planner Tool that mashups heterogeneous online travel information provided from multiple Restful Web services to recommend custom visit plans. This application takes into account tourist preferences (type of stay, interest) and constraints (duration, budget, locomotion modality). Moreover, it considers real-time events (e.g., weather data or temporary unavailability of a touristic site) to adapt proposed schedules.
{"title":"A smart MobiWeb mashup trip planner tool","authors":"Marwa Boulakbech, Nizar Messai, Yacine Sam, T. Devogele","doi":"10.1145/3019612.3019917","DOIUrl":"https://doi.org/10.1145/3019612.3019917","url":null,"abstract":"A wide range of Mobile Web-based applications are nowadays being built and proposed as mashup applications. Their aim is to be intuitive enough to be easily created by end-users directly selecting interactive elements, content and functionalities from existing resources, without requiring any technical skills. We propose in this article a Mobile Web Trip Planner Tool that mashups heterogeneous online travel information provided from multiple Restful Web services to recommend custom visit plans. This application takes into account tourist preferences (type of stay, interest) and constraints (duration, budget, locomotion modality). Moreover, it considers real-time events (e.g., weather data or temporary unavailability of a touristic site) to adapt proposed schedules.","PeriodicalId":20728,"journal":{"name":"Proceedings of the Symposium on Applied Computing","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88655136","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}
Despite having a significant impact on overall data system performance, database drivers connecting the application to the database system have not innovated at the same pace as the database systems themselves. This work describes a database driver designed for the requirements of cloud-based systems requiring flexibility, high availability, scaling, and performance. The unique contribution is a rule-based query routing system that supports real-time configurations and optimizations without requiring any changes to the application code or database system. With the increasing migration of applications and databases to the cloud as well as different database technologies such as NoSQL systems, this flexibility allows application owners to optimize and migrate legacy applications to exploit the advantages of new database technologies. Experimental results demonstrate how queries cached by the driver can improve query response times by an order of magnitude and reduce the overall load on the database system by up to 50+.
{"title":"Next generation JDBC database drivers for performance, transparent caching, load balancing, and scale-out","authors":"R. Lawrence, Erik Brandsberg, R. Lee","doi":"10.1145/3019612.3019870","DOIUrl":"https://doi.org/10.1145/3019612.3019870","url":null,"abstract":"Despite having a significant impact on overall data system performance, database drivers connecting the application to the database system have not innovated at the same pace as the database systems themselves. This work describes a database driver designed for the requirements of cloud-based systems requiring flexibility, high availability, scaling, and performance. The unique contribution is a rule-based query routing system that supports real-time configurations and optimizations without requiring any changes to the application code or database system. With the increasing migration of applications and databases to the cloud as well as different database technologies such as NoSQL systems, this flexibility allows application owners to optimize and migrate legacy applications to exploit the advantages of new database technologies. Experimental results demonstrate how queries cached by the driver can improve query response times by an order of magnitude and reduce the overall load on the database system by up to 50+.","PeriodicalId":20728,"journal":{"name":"Proceedings of the Symposium on Applied Computing","volume":"862 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88661063","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}
Cloud computing technologies have matured enough that the service providers are compelled to migrate their services to virtualized infrastructure in cloud data centers. However, moving the computation and network to shared physical infrastructure poses a multitude of questions, both for service providers and for data center owners. In this work, we propose HyViDE - a framework for optimal placement of multiple virtual data center networks on a physical data center network. HyViDE preselects a subset of virtual data center network requests and uses a hybrid strategy for embedding them on the physical data center. Coordinated static and dynamic embedding algorithms are used in this hybrid framework to minimize the rejection of requests and fulfill QoS demands of the embedded networks. HyViDE can employ suitable static and dynamic strategies to meet the objectives of data center owners and customers. Experimental evaluation of our algorithms on HyViDE shows that, the acceptance rate is high with faster servicing of requests.
{"title":"HyViDE: a framework for virtual data center network embedding","authors":"M. Gilesh, S. D. M. Kumar, L. Jacob","doi":"10.1145/3019612.3019629","DOIUrl":"https://doi.org/10.1145/3019612.3019629","url":null,"abstract":"Cloud computing technologies have matured enough that the service providers are compelled to migrate their services to virtualized infrastructure in cloud data centers. However, moving the computation and network to shared physical infrastructure poses a multitude of questions, both for service providers and for data center owners. In this work, we propose HyViDE - a framework for optimal placement of multiple virtual data center networks on a physical data center network. HyViDE preselects a subset of virtual data center network requests and uses a hybrid strategy for embedding them on the physical data center. Coordinated static and dynamic embedding algorithms are used in this hybrid framework to minimize the rejection of requests and fulfill QoS demands of the embedded networks. HyViDE can employ suitable static and dynamic strategies to meet the objectives of data center owners and customers. Experimental evaluation of our algorithms on HyViDE shows that, the acceptance rate is high with faster servicing of requests.","PeriodicalId":20728,"journal":{"name":"Proceedings of the Symposium on Applied Computing","volume":"4 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84947603","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
扫码关注我们
求助内容：
应助结果提醒方式：