Sinem Getir, Sebla Demirkol, Moharram Challenger, G. Kardas
Internal complexity of agents makes development of agent-based software systems complicated. On the other hand, MAS implementation becomes even more complex when new requirements and interactions for environments such as the Semantic Web is considered. A Domain Specific Modelling Language (DSML) can provide the required abstraction and hence support a more fruitful methodology for the development of MAS especially working on the new challenging environments like the Semantic Web. In this paper, a graphical syntax tool is introduced in which agent developers can model MASs according to a DSML called Semantic web Enabled Agent Modeling Language, SEA_ML.
代理的内部复杂性使得基于代理的软件系统的开发变得复杂。另一方面，当考虑到诸如语义Web等环境的新需求和交互时，MAS的实现变得更加复杂。领域特定建模语言(Domain Specific modeling Language, DSML)可以提供所需的抽象，从而为MAS的开发提供更有效的方法，特别是在语义网等新的具有挑战性的环境中工作。本文介绍了一种图形化语法工具，agent开发人员可以在该工具中根据语义web支持的agent建模语言SEA_ML对MASs进行建模。
{"title":"The GMF-based syntax tool of a DSML for the semantic web enabled multi-agent systems","authors":"Sinem Getir, Sebla Demirkol, Moharram Challenger, G. Kardas","doi":"10.1145/2095050.2095087","DOIUrl":"https://doi.org/10.1145/2095050.2095087","url":null,"abstract":"Internal complexity of agents makes development of agent-based software systems complicated. On the other hand, MAS implementation becomes even more complex when new requirements and interactions for environments such as the Semantic Web is considered. A Domain Specific Modelling Language (DSML) can provide the required abstraction and hence support a more fruitful methodology for the development of MAS especially working on the new challenging environments like the Semantic Web. In this paper, a graphical syntax tool is introduced in which agent developers can model MASs according to a DSML called Semantic web Enabled Agent Modeling Language, SEA_ML.","PeriodicalId":143880,"journal":{"name":"SPLASH Workshops","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123563546","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 extraordinary progress of mobile device technologies pushes for a new generation of smart mobile applications, featuring complex computational and interactive behaviour, exhibiting different degrees of autonomy and flexibility. This raises new challenges in mobile application programming, calling for programming tools and development platforms providing a proper level of abstraction to deal with such a new level of complexity. This demo aims at investigating the adoption of agent-oriented programming - and in particular of agent-based programming languages rooted on a strong notion of agency - to tackle the complexities related to the design of fore-coming smart mobile applications. For doing this we present an agent-oriented platform called JaCa-Android, providing an agent-oriented level of abstraction to design, program and execute smart mobile applications on top of the Android platform.
{"title":"Exploiting intelligent agent-based technologies for programming smart mobile applications","authors":"Andrea Santi, A. Ricci","doi":"10.1145/2095050.2095086","DOIUrl":"https://doi.org/10.1145/2095050.2095086","url":null,"abstract":"The extraordinary progress of mobile device technologies pushes for a new generation of smart mobile applications, featuring complex computational and interactive behaviour, exhibiting different degrees of autonomy and flexibility. This raises new challenges in mobile application programming, calling for programming tools and development platforms providing a proper level of abstraction to deal with such a new level of complexity. This demo aims at investigating the adoption of agent-oriented programming - and in particular of agent-based programming languages rooted on a strong notion of agency - to tackle the complexities related to the design of fore-coming smart mobile applications. For doing this we present an agent-oriented platform called JaCa-Android, providing an agent-oriented level of abstraction to design, program and execute smart mobile applications on top of the Android platform.","PeriodicalId":143880,"journal":{"name":"SPLASH Workshops","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125359995","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}
In this paper, we investigate a way to promote the reuse of legacy tools (or transformations) in specific contexts (defined by specific metamodels). More precisely we suggest a model transformation approach to achieve this purpose. We first introduce a language based on a metamodel called Modif in order to specify the differences between two semantically close metamodels. We can generate automatically data migration components from a Modif specification. They enable to put data complying with the specific context under the scope of the legacy tool. But more importantly in the case of a rewriting tool, they enable to put the tool's outcome back into the original specific context. Then we propose a process and a set of helpers based on Modif to automate the reuse of legacy tools for domain-specific contexts. To illustrate this approach, we apply it to the case of simple finite state machines.
{"title":"A DSML for reversible transformations","authors":"Mickaël Kerboeuf, Jean-Philippe Babau","doi":"10.1145/2095050.2095057","DOIUrl":"https://doi.org/10.1145/2095050.2095057","url":null,"abstract":"In this paper, we investigate a way to promote the reuse of legacy tools (or transformations) in specific contexts (defined by specific metamodels). More precisely we suggest a model transformation approach to achieve this purpose.\u0000 We first introduce a language based on a metamodel called Modif in order to specify the differences between two semantically close metamodels. We can generate automatically data migration components from a Modif specification. They enable to put data complying with the specific context under the scope of the legacy tool. But more importantly in the case of a rewriting tool, they enable to put the tool's outcome back into the original specific context.\u0000 Then we propose a process and a set of helpers based on Modif to automate the reuse of legacy tools for domain-specific contexts. To illustrate this approach, we apply it to the case of simple finite state machines.","PeriodicalId":143880,"journal":{"name":"SPLASH Workshops","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114162268","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}
Sean Whitsitt, Armando Barreto, M. Hudson, H. Al-Helal, Diyang Chu, K. Didan, J. Sprinkle
The popularity and ubiquity of personal mobile computing devices' coupled with their powerful sensing capabilities' allow their application in the structured collection of data for societal benefit and science applications. Citizen scientists are willing users and active contributors to scientific research and applications, but if they gather data in an unconstrained or ad hoc manner, their efforts may be of little scientific value. In this paper, we present a user interface for a mobile device which is properly constrained to permit the gathering of valid scientific data. This helps to achieve the goal that any individual with a basic familiarity of the device (but not of the science) should be able to obtain useful data with little learning required. As a use case for this concept, we present a mobile application that allows user to collect location-stamped images to supplement satellite data for climate change research.
{"title":"Constrained data acquisition for mobile citizen science applications","authors":"Sean Whitsitt, Armando Barreto, M. Hudson, H. Al-Helal, Diyang Chu, K. Didan, J. Sprinkle","doi":"10.1145/2095050.2095095","DOIUrl":"https://doi.org/10.1145/2095050.2095095","url":null,"abstract":"The popularity and ubiquity of personal mobile computing devices' coupled with their powerful sensing capabilities' allow their application in the structured collection of data for societal benefit and science applications. Citizen scientists are willing users and active contributors to scientific research and applications, but if they gather data in an unconstrained or ad hoc manner, their efforts may be of little scientific value. In this paper, we present a user interface for a mobile device which is properly constrained to permit the gathering of valid scientific data. This helps to achieve the goal that any individual with a basic familiarity of the device (but not of the science) should be able to obtain useful data with little learning required. As a use case for this concept, we present a mobile application that allows user to collect location-stamped images to supplement satellite data for climate change research.","PeriodicalId":143880,"journal":{"name":"SPLASH Workshops","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115236882","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}
A multi-agent systems (MAS) can be used to solve several problems that permeate current complex software systems design, specially distributed systems. The MAS research community has extensively studied protocols, algorithms, methodologies, and architectures to create autonomous, adaptable, robust, and scalable systems. Despite the MAS research achievements, mainstream software developers do not leverage from this knowledge. Design patterns provide a simple, although effective, mechanism to disseminate knowledge about well proven solutions for recurrent software design problems. The widespread acceptance, by the software development industry, of design patterns shows their effectiveness. Some researchers attempted to identify MAS design patterns, what is a first step towards broader acceptance of MAS solutions. However, we believe that the MAS research community needs to embrace the identification of MAS design patterns in order to spread MAS solutions to the software industry.
{"title":"(No) more design patterns for multi-agent systems","authors":"M. Torres, T. Beers, T. Holvoet","doi":"10.1145/2095050.2095083","DOIUrl":"https://doi.org/10.1145/2095050.2095083","url":null,"abstract":"A multi-agent systems (MAS) can be used to solve several problems that permeate current complex software systems design, specially distributed systems. The MAS research community has extensively studied protocols, algorithms, methodologies, and architectures to create autonomous, adaptable, robust, and scalable systems. Despite the MAS research achievements, mainstream software developers do not leverage from this knowledge.\u0000 Design patterns provide a simple, although effective, mechanism to disseminate knowledge about well proven solutions for recurrent software design problems. The widespread acceptance, by the software development industry, of design patterns shows their effectiveness.\u0000 Some researchers attempted to identify MAS design patterns, what is a first step towards broader acceptance of MAS solutions. However, we believe that the MAS research community needs to embrace the identification of MAS design patterns in order to spread MAS solutions to the software industry.","PeriodicalId":143880,"journal":{"name":"SPLASH Workshops","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120989593","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}
Weslley Torres, G. Pinto, Benito Fernandes, J. P. Oliveira, Filipe Alencar Ximenes, F. C. Filho
We would like to know if Java developers are retrofitting applications to become concurrent and, to get better performance on multicore machines. Also, we would like to know what concurrent programming constructs they currently use. Evidence of how programmers write concurrent programs can help other programmers to be more efficient when using the available constructs. Moreover, this evidence can assist researchers in devising new mechanisms and improving existing ones. For this purpose, we have conducted a study targeting a large-scale Java open source repository, SourceForge. We have analyzed a number of FLOSS projects along two dimensions: spatial and temporal. For the spatial dimension, we studied the latest versions of more than 2000 projects. Our goal is to understand which constructs developers of concurrent systems employ and how frequently they use them. For the temporal dimension we took a closer look at various versions of six projects and analyzed how the use of concurrency constructs has evolved over time. In addition, we tried to establish if uses of concurrency control constructs were aimed at leveraging multicore processors. We have downloaded more than two thousand Java projects including their various versions, in addition to individual analysing about six well known open-source projects.
{"title":"Are Java programmers transitioning to multicore?: a large scale study of java FLOSS","authors":"Weslley Torres, G. Pinto, Benito Fernandes, J. P. Oliveira, Filipe Alencar Ximenes, F. C. Filho","doi":"10.1145/2095050.2095072","DOIUrl":"https://doi.org/10.1145/2095050.2095072","url":null,"abstract":"We would like to know if Java developers are retrofitting applications to become concurrent and, to get better performance on multicore machines. Also, we would like to know what concurrent programming constructs they currently use. Evidence of how programmers write concurrent programs can help other programmers to be more efficient when using the available constructs. Moreover, this evidence can assist researchers in devising new mechanisms and improving existing ones. For this purpose, we have conducted a study targeting a large-scale Java open source repository, SourceForge. We have analyzed a number of FLOSS projects along two dimensions: spatial and temporal. For the spatial dimension, we studied the latest versions of more than 2000 projects. Our goal is to understand which constructs developers of concurrent systems employ and how frequently they use them. For the temporal dimension we took a closer look at various versions of six projects and analyzed how the use of concurrency constructs has evolved over time. In addition, we tried to establish if uses of concurrency control constructs were aimed at leveraging multicore processors. We have downloaded more than two thousand Java projects including their various versions, in addition to individual analysing about six well known open-source projects.","PeriodicalId":143880,"journal":{"name":"SPLASH Workshops","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115948054","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}
An Intermediate Language (IL) specifies a program at a level of abstraction that includes precise semantics for state updates and control flow, but leaves unspecified the low-level software and hardware mechanisms that will be used to implement the semantics. Past ILs have followed the Von Neumann execution model by making sequential execution the default, and by supporting parallelism with runtime calls for lower-level mechanisms such as threads and locks. Now that the multicore trend is making parallelism the default execution model for all software, it behooves us as a community to study the fundamental requirements in parallel execution models and explore how they can be supported by first-class abstractions at the IL level. In this paper, we introduce five key requirements for Parallel Intermediate Representations (PIR): 1) Lightweight asynchronous tasks and communications, 2) Explicit locality, 3) Directed Synchronization with Dynamic Parallelism:, 4) Mutual Exclusion and Isolation with Dynamic Parallelism, and 5) Relaxed Exception semantics for Parallelism. We summarize the approach being taken in the Habanero Multicore Software Research project at Rice University to define a Parallel Intermediate Representation (PIR) to address these requirements. We discuss the basic issues of designing and implementing PIRs within the Habanero-Java (HJ) compilation framework that spans multiple levels of PIRs. By demonstrating several program optimizations developed in the HJ compilation framework, we show that this new PIR-based approach to compiler development brings robustness to the process of analyzing and optimizing parallel programs and is applicable to a wide range of task-parallelism programming models available today.
{"title":"Intermediate language extensions for parallelism","authors":"Jisheng Zhao, Vivek Sarkar","doi":"10.1145/2095050.2095103","DOIUrl":"https://doi.org/10.1145/2095050.2095103","url":null,"abstract":"An Intermediate Language (IL) specifies a program at a level of abstraction that includes precise semantics for state updates and control flow, but leaves unspecified the low-level software and hardware mechanisms that will be used to implement the semantics. Past ILs have followed the Von Neumann execution model by making sequential execution the default, and by supporting parallelism with runtime calls for lower-level mechanisms such as threads and locks. Now that the multicore trend is making parallelism the default execution model for all software, it behooves us as a community to study the fundamental requirements in parallel execution models and explore how they can be supported by first-class abstractions at the IL level.\u0000 In this paper, we introduce five key requirements for Parallel Intermediate Representations (PIR): 1) Lightweight asynchronous tasks and communications, 2) Explicit locality, 3) Directed Synchronization with Dynamic Parallelism:, 4) Mutual Exclusion and Isolation with Dynamic Parallelism, and 5) Relaxed Exception semantics for Parallelism. We summarize the approach being taken in the Habanero Multicore Software Research project at Rice University to define a Parallel Intermediate Representation (PIR) to address these requirements. We discuss the basic issues of designing and implementing PIRs within the Habanero-Java (HJ) compilation framework that spans multiple levels of PIRs. By demonstrating several program optimizations developed in the HJ compilation framework, we show that this new PIR-based approach to compiler development brings robustness to the process of analyzing and optimizing parallel programs and is applicable to a wide range of task-parallelism programming models available today.","PeriodicalId":143880,"journal":{"name":"SPLASH Workshops","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122347439","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}
In the software industry, the Agile movement has produced much discussion since its inception at the 2001 meeting in Snowbird, Utah. Although Agile practices have been applied quite widely in various software development environments, the field of embedded systems has seen relatively few Agile projects. Because interest in Agile is growing in the embedded world, this paper reviews Agile practices from the perspective of embedded systems development. Some characteristics of embedded system development may influence the applicability of Agile practices to this subfield.
{"title":"Agile practices in embedded systems","authors":"Charles E. Matthews","doi":"10.1145/2095050.2095091","DOIUrl":"https://doi.org/10.1145/2095050.2095091","url":null,"abstract":"In the software industry, the Agile movement has produced much discussion since its inception at the 2001 meeting in Snowbird, Utah. Although Agile practices have been applied quite widely in various software development environments, the field of embedded systems has seen relatively few Agile projects. Because interest in Agile is growing in the embedded world, this paper reviews Agile practices from the perspective of embedded systems development. Some characteristics of embedded system development may influence the applicability of Agile practices to this subfield.","PeriodicalId":143880,"journal":{"name":"SPLASH Workshops","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130561132","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}
Many researchers believe that software transactional memory (STM) will play an important role in the transition to multicore systems. However, little effort has been placed on assessing whether STM delivers on its promises of avoiding common concurrent/parallel programming pitfalls. In this paper, we describe a controlled experiment aiming to evaluate the ease of using STM. The study targets Haskell, a purely functional programming language that includes a mature implementation of STM. It compares the use of STM and Haskell's lock-based concurrency control mechanism to develop a program with (coarse-grained) mutual exclusion and synchronization requirements. We organized the 51 subjects in two groups, one for each technique. We found out that the two techniques did not differ significantly in terms of concurrency errors, number of LoC and time to develop the resulting programs. However, for programs where developers made only non-concurrency-related mistakes, STM programmers finished their assignments quicker.
{"title":"Software transactional memory vs. locking in a functional language: a controlled experiment","authors":"F. C. Filho, J. P. Oliveira, André L. M. Santos","doi":"10.1145/2095050.2095071","DOIUrl":"https://doi.org/10.1145/2095050.2095071","url":null,"abstract":"Many researchers believe that software transactional memory (STM) will play an important role in the transition to multicore systems. However, little effort has been placed on assessing whether STM delivers on its promises of avoiding common concurrent/parallel programming pitfalls. In this paper, we describe a controlled experiment aiming to evaluate the ease of using STM. The study targets Haskell, a purely functional programming language that includes a mature implementation of STM. It compares the use of STM and Haskell's lock-based concurrency control mechanism to develop a program with (coarse-grained) mutual exclusion and synchronization requirements. We organized the 51 subjects in two groups, one for each technique. We found out that the two techniques did not differ significantly in terms of concurrency errors, number of LoC and time to develop the resulting programs. However, for programs where developers made only non-concurrency-related mistakes, STM programmers finished their assignments quicker.","PeriodicalId":143880,"journal":{"name":"SPLASH Workshops","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132891751","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}
As mobile devices are rapidly replacing desktop computers for a growing number of users, existing user interfaces often need to be ported from the desktop to a mobile device. In addition, successful user interfaces written for one mobile platform are commonly ported to other mobile platforms. Traditionally, porting user interfaces requires that their source code be reverse-engineered and translated, which is difficult and error-prone. In this paper, we present an approach that reverse-engineers user interfaces without having to analyze their source code. Specifically, our approach examines an interface's runtime representation by means of aspect-oriented programming (AOP). An aspect intercepts the program's control flow at the point when all the components of an interface are laid out on the screen, but before the interface is displayed. The aspect analyzes the interface's in-memory representation and extracts a platform-independent model that can then be used to generate equivalent interfaces for other devices and platforms. Our initial proof of concept ports Java Swing interfaces to Android. In this paper, we describe our approach, discuss its main technical challenges, and outline future research directions.
{"title":"Reverse-engineering user interfaces to facilitateporting to and across mobile devices and platforms","authors":"E. Shah, E. Tilevich","doi":"10.1145/2095050.2095093","DOIUrl":"https://doi.org/10.1145/2095050.2095093","url":null,"abstract":"As mobile devices are rapidly replacing desktop computers for a growing number of users, existing user interfaces often need to be ported from the desktop to a mobile device. In addition, successful user interfaces written for one mobile platform are commonly ported to other mobile platforms. Traditionally, porting user interfaces requires that their source code be reverse-engineered and translated, which is difficult and error-prone. In this paper, we present an approach that reverse-engineers user interfaces without having to analyze their source code. Specifically, our approach examines an interface's runtime representation by means of aspect-oriented programming (AOP). An aspect intercepts the program's control flow at the point when all the components of an interface are laid out on the screen, but before the interface is displayed. The aspect analyzes the interface's in-memory representation and extracts a platform-independent model that can then be used to generate equivalent interfaces for other devices and platforms. Our initial proof of concept ports Java Swing interfaces to Android. In this paper, we describe our approach, discuss its main technical challenges, and outline future research directions.","PeriodicalId":143880,"journal":{"name":"SPLASH Workshops","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129395696","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
扫码关注我们
求助内容：
应助结果提醒方式：