Pub Date : 2016-09-01DOI: 10.1109/ETFA.2016.7733571
M. Ortiz, Yigen Zenlander, N. Xiong, F. Herrera
Harmonic filtering has been widely applied to reduce harmonic distortion in power distribution systems. This paper investigates a new method of exploiting Differential Evolution (DE) to support the optimal design of harmonic filters. DE is a class of stochastic and population-based optimization algorithms that are expected to have stronger global ability than trajectory-based optimization techniques in locating the best component sizes for filters. However, the performance of DE is largely affected by its two control parameters: scaling factor and crossover rate, which are problem dependent. How to decide appropriate setting for these two parameters presents a practical difficulty in real applications. Greedy Adaptive Differential Evolution (GADE) algorithm is suggested in the paper as a more convenient and effective means to automatically optimize filter designs. GADE is attractive in that it does not require proper setting of the scaling factor and crossover rate prior to the running of the program. Instead it enables dynamic adjustment of the DE parameters during the course of search for performance improvement. The results of tests on several problem examples have demonstrated that the use of GADE leads to the discovery of better filter circuits facilitating less harmonic distortion than the basic DE method.
{"title":"Designing optimal harmonic filters in power systems using greedy adaptive Differential Evolution","authors":"M. Ortiz, Yigen Zenlander, N. Xiong, F. Herrera","doi":"10.1109/ETFA.2016.7733571","DOIUrl":"https://doi.org/10.1109/ETFA.2016.7733571","url":null,"abstract":"Harmonic filtering has been widely applied to reduce harmonic distortion in power distribution systems. This paper investigates a new method of exploiting Differential Evolution (DE) to support the optimal design of harmonic filters. DE is a class of stochastic and population-based optimization algorithms that are expected to have stronger global ability than trajectory-based optimization techniques in locating the best component sizes for filters. However, the performance of DE is largely affected by its two control parameters: scaling factor and crossover rate, which are problem dependent. How to decide appropriate setting for these two parameters presents a practical difficulty in real applications. Greedy Adaptive Differential Evolution (GADE) algorithm is suggested in the paper as a more convenient and effective means to automatically optimize filter designs. GADE is attractive in that it does not require proper setting of the scaling factor and crossover rate prior to the running of the program. Instead it enables dynamic adjustment of the DE parameters during the course of search for performance improvement. The results of tests on several problem examples have demonstrated that the use of GADE leads to the discovery of better filter circuits facilitating less harmonic distortion than the basic DE method.","PeriodicalId":6483,"journal":{"name":"2016 IEEE 21st International Conference on Emerging Technologies and Factory Automation (ETFA)","volume":"18 1","pages":"1-7"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79085119","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}
Pub Date : 2016-09-01DOI: 10.1109/ETFA.2016.7733738
Heng-Chao Yan, Junhong Zhou, C. Pang
In general, one limitation in current diagnosis approaches is that they could only detect the existing types of faults, while not be able to detect new types of faults. It is difficult to know in advance all fault types and new types of faults may occur in industry. As such, effective detection and diagnosis on new types of faults are important. In this paper, a novel mixed soft&hard assignment clustering framework will be proposed to detect and diagnose new types of faults based on the feature signals. As a popular soft assignment strategy, Gaussian mixture model targets to diagnose existing types from training and detect new category. Next, the hard assignment strategy based on the Euclidean distance of K-means is used to further classify the fault details if the new category is detected. Effectiveness of the proposed framework is testified on a partial discharge measurement dataset of different high voltage electronic and power equipment in industry. It is able to achieve as good performance as benchmark approaches for conventional diagnosis without new fault category, while it also effectively detects and classifies new types of faults with average accuracy of 75.0%.
{"title":"New types of faults detection and diagnosis using a mixed soft & hard clustering framework","authors":"Heng-Chao Yan, Junhong Zhou, C. Pang","doi":"10.1109/ETFA.2016.7733738","DOIUrl":"https://doi.org/10.1109/ETFA.2016.7733738","url":null,"abstract":"In general, one limitation in current diagnosis approaches is that they could only detect the existing types of faults, while not be able to detect new types of faults. It is difficult to know in advance all fault types and new types of faults may occur in industry. As such, effective detection and diagnosis on new types of faults are important. In this paper, a novel mixed soft&hard assignment clustering framework will be proposed to detect and diagnose new types of faults based on the feature signals. As a popular soft assignment strategy, Gaussian mixture model targets to diagnose existing types from training and detect new category. Next, the hard assignment strategy based on the Euclidean distance of K-means is used to further classify the fault details if the new category is detected. Effectiveness of the proposed framework is testified on a partial discharge measurement dataset of different high voltage electronic and power equipment in industry. It is able to achieve as good performance as benchmark approaches for conventional diagnosis without new fault category, while it also effectively detects and classifies new types of faults with average accuracy of 75.0%.","PeriodicalId":6483,"journal":{"name":"2016 IEEE 21st International Conference on Emerging Technologies and Factory Automation (ETFA)","volume":"IA-11 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84588315","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}
Pub Date : 2016-09-01DOI: 10.1109/ETFA.2016.7733728
T. Cochard, David Gouyon, J. Pétin
The main objective of operation procedure engineering for complex and critical systems is to provide action sequences satisfying safety requirements specifications. A classical limit of the use of formal generation approaches for this purpose is the combinatorial explosion due to the size and the number of required models. This article addresses this issue by proposing an iterative approach for the generation of safe operation sequences, using timed automata, and based on reachability analysis. The originality of this approach is to combine a bottom-up framework to build progressively system models by abstraction, and a top-down iterative action sequence generation.
{"title":"Generation of safe operation sequences using iterative refinements and abstractions of timed automata","authors":"T. Cochard, David Gouyon, J. Pétin","doi":"10.1109/ETFA.2016.7733728","DOIUrl":"https://doi.org/10.1109/ETFA.2016.7733728","url":null,"abstract":"The main objective of operation procedure engineering for complex and critical systems is to provide action sequences satisfying safety requirements specifications. A classical limit of the use of formal generation approaches for this purpose is the combinatorial explosion due to the size and the number of required models. This article addresses this issue by proposing an iterative approach for the generation of safe operation sequences, using timed automata, and based on reachability analysis. The originality of this approach is to combine a bottom-up framework to build progressively system models by abstraction, and a top-down iterative action sequence generation.","PeriodicalId":6483,"journal":{"name":"2016 IEEE 21st International Conference on Emerging Technologies and Factory Automation (ETFA)","volume":"62 1","pages":"1-8"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84716678","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}
Pub Date : 2016-09-01DOI: 10.1109/ETFA.2016.7733632
S. Cavalieri, G. Puglisi, Marco Stefano Scroppo, L. Galvagno
The increased need of flexibility of automation systems and the increased capabilities of sensors and actuators paired with more capable bus systems, pave the way for the reallocation of IEC 61131-3 applications away from the field level into so-called compute pools. Such compute pools are decentralised with enough compute power for a large number of applications, while providing the required flexibility to quickly adapt to changes of the applications requirements. The paper proposes a framework able to deploy IEC 61131-3 applications to multiple computing platforms. It is based on CLR VM and does not require any modifications of the IEC 61131-3 applications. The paper presents also an analysis about the capability of the proposed framework to respect real-time constraints of the industrial processes.
{"title":"Moving IEC 61131-3 applications to a computing framework based on CLR Virtual Machine","authors":"S. Cavalieri, G. Puglisi, Marco Stefano Scroppo, L. Galvagno","doi":"10.1109/ETFA.2016.7733632","DOIUrl":"https://doi.org/10.1109/ETFA.2016.7733632","url":null,"abstract":"The increased need of flexibility of automation systems and the increased capabilities of sensors and actuators paired with more capable bus systems, pave the way for the reallocation of IEC 61131-3 applications away from the field level into so-called compute pools. Such compute pools are decentralised with enough compute power for a large number of applications, while providing the required flexibility to quickly adapt to changes of the applications requirements. The paper proposes a framework able to deploy IEC 61131-3 applications to multiple computing platforms. It is based on CLR VM and does not require any modifications of the IEC 61131-3 applications. The paper presents also an analysis about the capability of the proposed framework to respect real-time constraints of the industrial processes.","PeriodicalId":6483,"journal":{"name":"2016 IEEE 21st International Conference on Emerging Technologies and Factory Automation (ETFA)","volume":"26 1","pages":"1-8"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85008525","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}
Pub Date : 2016-09-01DOI: 10.1109/ETFA.2016.7733675
Michelle Günther, André Scholz, P. Schmidt, A. Fay, Patrick Diekhake, Damian Eduardo Diaz Fuentes, U. Becker
The planning and layout of a building automation system is a complex process characterized by the selection, application and interconnection of multiple different functions. Planning mistakes are often not recognized before the initial operation of the building. In order to allow an earlier fault and function analysis and to ease planning, an approach for an efficient development of a functional model for the building automation system has been developed. This functional model offers not only a simulation of the building automation system but also the automatic configuration of the hardware components of the building automation system.
{"title":"Requirements engineering and modelling for building automation systems","authors":"Michelle Günther, André Scholz, P. Schmidt, A. Fay, Patrick Diekhake, Damian Eduardo Diaz Fuentes, U. Becker","doi":"10.1109/ETFA.2016.7733675","DOIUrl":"https://doi.org/10.1109/ETFA.2016.7733675","url":null,"abstract":"The planning and layout of a building automation system is a complex process characterized by the selection, application and interconnection of multiple different functions. Planning mistakes are often not recognized before the initial operation of the building. In order to allow an earlier fault and function analysis and to ease planning, an approach for an efficient development of a functional model for the building automation system has been developed. This functional model offers not only a simulation of the building automation system but also the automatic configuration of the hardware components of the building automation system.","PeriodicalId":6483,"journal":{"name":"2016 IEEE 21st International Conference on Emerging Technologies and Factory Automation (ETFA)","volume":"7 1","pages":"1-8"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84662244","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}
Pub Date : 2016-09-01DOI: 10.1109/ETFA.2016.7733579
Yingbing Hua, Stefan Zander, Mirko Bordignon, B. Hein
One of the major investment for applying industrial robots in production resides in the software development, which is an interdisciplinary and heterogeneous engineering process. This paper presents a novel model-driven approach that uses AutomationML as modeling framework and ontological reasoning as inference framework for constructing robotic application using Robot Operating System (ROS). We show how different robotic components can be classified and modeled with AutomationML, how these components can be composed together to a production system, and how the AutomationML models can be processed semantically by utilizing Semantic Web technologies and ontological reasoning. By applying model-to-text transformation techniques, executable ROS code can be generated from the models that foster fast prototyping and the reuse of robotic software.
{"title":"From AutomationML to ROS: A model-driven approach for software engineering of industrial robotics using ontological reasoning","authors":"Yingbing Hua, Stefan Zander, Mirko Bordignon, B. Hein","doi":"10.1109/ETFA.2016.7733579","DOIUrl":"https://doi.org/10.1109/ETFA.2016.7733579","url":null,"abstract":"One of the major investment for applying industrial robots in production resides in the software development, which is an interdisciplinary and heterogeneous engineering process. This paper presents a novel model-driven approach that uses AutomationML as modeling framework and ontological reasoning as inference framework for constructing robotic application using Robot Operating System (ROS). We show how different robotic components can be classified and modeled with AutomationML, how these components can be composed together to a production system, and how the AutomationML models can be processed semantically by utilizing Semantic Web technologies and ontological reasoning. By applying model-to-text transformation techniques, executable ROS code can be generated from the models that foster fast prototyping and the reuse of robotic software.","PeriodicalId":6483,"journal":{"name":"2016 IEEE 21st International Conference on Emerging Technologies and Factory Automation (ETFA)","volume":"11 1","pages":"1-8"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85269886","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}
Pub Date : 2016-09-01DOI: 10.1109/ETFA.2016.7733523
Nils Wantia, Menno Esen, Andre Hengstebeck, F. Heinze, J. Roßmann, J. Deuse, B. Kuhlenkötter
One of the next steps in factory automation might not exclusively be an automation issue, but instead combining robot and human skills to further improve industrial work processes. For various reasons, there is still a low dissemination of hybrid work processes characterized by direct human robot interaction. For instance, it is very difficult to decide which manual work processes are eligible for a transformation to a human-robot interactive process. Thus, the research project MANUSERV delivers a tool to support this decision process. Here, the central concept is a task planning system capable of generating automated as well as hybrid human-robot solutions. Therefore, a structured description of manual work processes forms the input to the planning system. Subsequently, a simulation system verifies and evaluates the proposed solutions and generates the necessary information for a transformation of the planning results to a real application scenario.
{"title":"Task planning for human robot interactive processes","authors":"Nils Wantia, Menno Esen, Andre Hengstebeck, F. Heinze, J. Roßmann, J. Deuse, B. Kuhlenkötter","doi":"10.1109/ETFA.2016.7733523","DOIUrl":"https://doi.org/10.1109/ETFA.2016.7733523","url":null,"abstract":"One of the next steps in factory automation might not exclusively be an automation issue, but instead combining robot and human skills to further improve industrial work processes. For various reasons, there is still a low dissemination of hybrid work processes characterized by direct human robot interaction. For instance, it is very difficult to decide which manual work processes are eligible for a transformation to a human-robot interactive process. Thus, the research project MANUSERV delivers a tool to support this decision process. Here, the central concept is a task planning system capable of generating automated as well as hybrid human-robot solutions. Therefore, a structured description of manual work processes forms the input to the planning system. Subsequently, a simulation system verifies and evaluates the proposed solutions and generates the necessary information for a transformation of the planning results to a real application scenario.","PeriodicalId":6483,"journal":{"name":"2016 IEEE 21st International Conference on Emerging Technologies and Factory Automation (ETFA)","volume":"22 1","pages":"1-8"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85371240","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}
Pub Date : 2016-09-01DOI: 10.1109/ETFA.2016.7733553
Jan Niklas Haus, Arne Muxfeldt, Daniel Kubus
Physical human robot interaction (pHRI) in industrial manufacturing environments requires reliable environment perception capabilities usually employing multiple sensor modalities and particularly tactile sensor matrices to facilitate the management of human robot contacts. However, their high cost still impedes the large-scale integration of pHRI in manufacturing environments. To enable the development of low-cost tactile sensor matrices for pHRI applications, we examine five cost-effective piezoresistive materials w.r.t. their suitability for tactile sensor matrices. Since hysteresis and drift can severely deteriorate the performance of a tactile sensor, particular attention is paid to these properties. For the apparently best material and a very low-cost alternative, the input-output behavior is modeled using a machine learning approach. The differences in the input-output behavior of the individual taxels are comparatively low - thus significantly simplifying parameter identification and calibration.
{"title":"Material comparison and design of low cost modular tactile surface sensors for industrial manipulators","authors":"Jan Niklas Haus, Arne Muxfeldt, Daniel Kubus","doi":"10.1109/ETFA.2016.7733553","DOIUrl":"https://doi.org/10.1109/ETFA.2016.7733553","url":null,"abstract":"Physical human robot interaction (pHRI) in industrial manufacturing environments requires reliable environment perception capabilities usually employing multiple sensor modalities and particularly tactile sensor matrices to facilitate the management of human robot contacts. However, their high cost still impedes the large-scale integration of pHRI in manufacturing environments. To enable the development of low-cost tactile sensor matrices for pHRI applications, we examine five cost-effective piezoresistive materials w.r.t. their suitability for tactile sensor matrices. Since hysteresis and drift can severely deteriorate the performance of a tactile sensor, particular attention is paid to these properties. For the apparently best material and a very low-cost alternative, the input-output behavior is modeled using a machine learning approach. The differences in the input-output behavior of the individual taxels are comparatively low - thus significantly simplifying parameter identification and calibration.","PeriodicalId":6483,"journal":{"name":"2016 IEEE 21st International Conference on Emerging Technologies and Factory Automation (ETFA)","volume":"11 1 1","pages":"1-7"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80645413","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}
Pub Date : 2016-09-01DOI: 10.1109/ETFA.2016.7733662
Padma Iyenghar, Arne Noyer, Joachim Engelhardt, E. Pulvermüller
In model-based Embedded Software Engineering (ESE), individual systems are modeled with chains of components that are translated to chains of tasks/runnables for a scheduling analysis. Early analysis of response time of such systems (e.g. end-to-end path delay) provides important feedback to understand how the function blocks/components in the system may actually behave. In this paper we report on work in progress pertaining to an overall workflow for model-driven specification, translation and validation of such timing constraints in ESE projects developed using Matlab/Simulink. The challenges addressed in this workflow and future directions are outlined.
{"title":"Translating timing requirements of Embedded Software systems modeled in Simulink to a timing analysis model","authors":"Padma Iyenghar, Arne Noyer, Joachim Engelhardt, E. Pulvermüller","doi":"10.1109/ETFA.2016.7733662","DOIUrl":"https://doi.org/10.1109/ETFA.2016.7733662","url":null,"abstract":"In model-based Embedded Software Engineering (ESE), individual systems are modeled with chains of components that are translated to chains of tasks/runnables for a scheduling analysis. Early analysis of response time of such systems (e.g. end-to-end path delay) provides important feedback to understand how the function blocks/components in the system may actually behave. In this paper we report on work in progress pertaining to an overall workflow for model-driven specification, translation and validation of such timing constraints in ESE projects developed using Matlab/Simulink. The challenges addressed in this workflow and future directions are outlined.","PeriodicalId":6483,"journal":{"name":"2016 IEEE 21st International Conference on Emerging Technologies and Factory Automation (ETFA)","volume":"49 1","pages":"1-4"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82738693","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}
Pub Date : 2016-09-01DOI: 10.1109/ETFA.2016.7733739
I. Seilonen, Tomi Tuovinen, J. Elovaara, Ian Tuomi, T. Oksanen
An aggregating server providing data access to multiple data sources is a software architecture that is often applied in industrial applications. This paper presents a design of an aggregating server based on OPC UA technology and tests it with two different experimental applications, one about production control of a flexible manufacturing system and another about remote monitoring of mobile work machines. The presented design enables transparent access to the data in the address space of the aggregating server through utilization of address space transformations. The transformations can be either configured with rules or be programmed. Feasibility of the design of the aggregating server and the applications was evaluated with experimental implementations containing both simulated devices and real work machines.
{"title":"Aggregating OPC UA servers for monitoring manufacturing systems and mobile work machines","authors":"I. Seilonen, Tomi Tuovinen, J. Elovaara, Ian Tuomi, T. Oksanen","doi":"10.1109/ETFA.2016.7733739","DOIUrl":"https://doi.org/10.1109/ETFA.2016.7733739","url":null,"abstract":"An aggregating server providing data access to multiple data sources is a software architecture that is often applied in industrial applications. This paper presents a design of an aggregating server based on OPC UA technology and tests it with two different experimental applications, one about production control of a flexible manufacturing system and another about remote monitoring of mobile work machines. The presented design enables transparent access to the data in the address space of the aggregating server through utilization of address space transformations. The transformations can be either configured with rules or be programmed. Feasibility of the design of the aggregating server and the applications was evaluated with experimental implementations containing both simulated devices and real work machines.","PeriodicalId":6483,"journal":{"name":"2016 IEEE 21st International Conference on Emerging Technologies and Factory Automation (ETFA)","volume":"32 1","pages":"1-4"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90740000","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
扫码关注我们
求助内容：
应助结果提醒方式：