Machine-to-Machine (M2M) communication technologies is emerging as one of the major trends shaping the development of services in the Future Internet sector. Additionally, cloud computing technologies have been utilized in building large-scale M2M systems, as they could potentially offer more advance solutions for managing data monitoring and service elasticity to support the needs of different consumers. Today, service providers are building a new eco-system with partner vendors to offer new innovative services for Smart Cities. From the users/applications perspective, three concepts aim to deliver Smart service: M2M communication, ubiquitous computing and ambient intelligence. In this paper we identify the requirements for centric service enablers to support the development of desired Smart Cities systems. Also the paper reviews the ongoing work in standardization organizations in this field. Providing standard interfaces to M2M platforms in a network independent way will allow applications deployment by 3rd party developers across variety of end user devices.
{"title":"Towards Standard M2M APIs for Cloud-based Telco Service Platforms","authors":"Asma Elmangoush, A. Al-Hezmi, T. Magedanz","doi":"10.1145/2536853.2536892","DOIUrl":"https://doi.org/10.1145/2536853.2536892","url":null,"abstract":"Machine-to-Machine (M2M) communication technologies is emerging as one of the major trends shaping the development of services in the Future Internet sector. Additionally, cloud computing technologies have been utilized in building large-scale M2M systems, as they could potentially offer more advance solutions for managing data monitoring and service elasticity to support the needs of different consumers. Today, service providers are building a new eco-system with partner vendors to offer new innovative services for Smart Cities. From the users/applications perspective, three concepts aim to deliver Smart service: M2M communication, ubiquitous computing and ambient intelligence. In this paper we identify the requirements for centric service enablers to support the development of desired Smart Cities systems. Also the paper reviews the ongoing work in standardization organizations in this field. Providing standard interfaces to M2M platforms in a network independent way will allow applications deployment by 3rd party developers across variety of end user devices.","PeriodicalId":135195,"journal":{"name":"Advances in Mobile Multimedia","volume":"185 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123272384","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}
Joo-Sung Kim, Ryu-Hyeok Gwon, Jin-Tak Park, Hak-kyoung Kim, Yoo-Sung Kim
Since generating ground truth data for developing object detection algorithms of intelligent surveillance systems is very important, a user-friendly tool to annotate videos efficiently and accurately is essential. In this paper, a semi-automatic video annotation tool is developed. For efficiency, the developed tool can automatically generate the initial annotation data for input videos by the automatic object detection modules which are developed independently and registered. To guarantee the accuracy of the ground truth data, the system also has several user-friendly functions to support the users to check the validity of the initial annotation data. With the developed video annotation tool, users can generate large amount of ground truth data for many videos.
{"title":"A Semi-Automatic Video Annotation Tool to Generate Ground Truth for Intelligent Video Surveillance Systems","authors":"Joo-Sung Kim, Ryu-Hyeok Gwon, Jin-Tak Park, Hak-kyoung Kim, Yoo-Sung Kim","doi":"10.1145/2536853.2536936","DOIUrl":"https://doi.org/10.1145/2536853.2536936","url":null,"abstract":"Since generating ground truth data for developing object detection algorithms of intelligent surveillance systems is very important, a user-friendly tool to annotate videos efficiently and accurately is essential. In this paper, a semi-automatic video annotation tool is developed. For efficiency, the developed tool can automatically generate the initial annotation data for input videos by the automatic object detection modules which are developed independently and registered. To guarantee the accuracy of the ground truth data, the system also has several user-friendly functions to support the users to check the validity of the initial annotation data. With the developed video annotation tool, users can generate large amount of ground truth data for many videos.","PeriodicalId":135195,"journal":{"name":"Advances in Mobile Multimedia","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117280679","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}
Hashing for nearest neighbor search has attracted great attentions in the past years. Many hashing methods have been successfully applied in real-world applications like the mobile product search. The performance of these applications usually highly relies on the quality of hash bits. However, it still lacks of a general method that can provide good hash bits for different scenarios. In this paper, we propose a novel method that can select compact, independent and informative hash bits using the Markov Process. Our method can serve as a unified framework compatible with different hashing methods. We design two algorithms, BS-CMP and BS-DMP, and formulate the selection problem as the subgraph discovery on a graph. Experiments are conducted for two important selection scenarios when applying hash techniques, i.e., hashing using different hashing algorithms and hashing with multiple features. The result indicates that our proposed bit selection approaches outperform naive selection methods significantly under aforementioned two scenarios.
{"title":"Hash Bit Selection Using Markov Process for Approximate Nearest Neighbor Search","authors":"Danchen Zhang, Xianglong Liu, B. Lang","doi":"10.1145/2536853.2536934","DOIUrl":"https://doi.org/10.1145/2536853.2536934","url":null,"abstract":"Hashing for nearest neighbor search has attracted great attentions in the past years. Many hashing methods have been successfully applied in real-world applications like the mobile product search. The performance of these applications usually highly relies on the quality of hash bits. However, it still lacks of a general method that can provide good hash bits for different scenarios. In this paper, we propose a novel method that can select compact, independent and informative hash bits using the Markov Process. Our method can serve as a unified framework compatible with different hashing methods. We design two algorithms, BS-CMP and BS-DMP, and formulate the selection problem as the subgraph discovery on a graph. Experiments are conducted for two important selection scenarios when applying hash techniques, i.e., hashing using different hashing algorithms and hashing with multiple features. The result indicates that our proposed bit selection approaches outperform naive selection methods significantly under aforementioned two scenarios.","PeriodicalId":135195,"journal":{"name":"Advances in Mobile Multimedia","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123116873","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}
R. Madeira, Patrícia Macedo, Pedro Pita, Í. Bonança, Helena Germano
This paper describes the project I Aware my Stuttering, which is a system with a focus on a mobile application for smartphones directed to people who stutter. This software will allow users to register their stuttering related situations, registering, for example, the contexts in which they occur, the interlocutors and their reactions to the situations, and the emotions felt. The application provides a reporting module that includes charts to help visualizing how stuttering situations evolve according to several features. It will help promote daily self-monitoring of speech as a means of controlling stuttering, being personalized according to the user profile. The system also offers a module for the speech therapist, which can monitor and receive reports related to users which are her/his patients. This collected data will improve the therapeutic process by enhancing discussion about registers performed immediately after a real context situation. Additionally, this paper presents a first user study conducted to assess and validate the project's purpose and the central module for registration of stuttering related situations.
{"title":"Building on Mobile towards Better Stuttering Awareness to Improve Speech Therapy","authors":"R. Madeira, Patrícia Macedo, Pedro Pita, Í. Bonança, Helena Germano","doi":"10.1145/2536853.2536911","DOIUrl":"https://doi.org/10.1145/2536853.2536911","url":null,"abstract":"This paper describes the project I Aware my Stuttering, which is a system with a focus on a mobile application for smartphones directed to people who stutter. This software will allow users to register their stuttering related situations, registering, for example, the contexts in which they occur, the interlocutors and their reactions to the situations, and the emotions felt. The application provides a reporting module that includes charts to help visualizing how stuttering situations evolve according to several features. It will help promote daily self-monitoring of speech as a means of controlling stuttering, being personalized according to the user profile. The system also offers a module for the speech therapist, which can monitor and receive reports related to users which are her/his patients. This collected data will improve the therapeutic process by enhancing discussion about registers performed immediately after a real context situation. Additionally, this paper presents a first user study conducted to assess and validate the project's purpose and the central module for registration of stuttering related situations.","PeriodicalId":135195,"journal":{"name":"Advances in Mobile Multimedia","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124806698","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}
Britta Meixner, Beate Siegel, Peter Schultes, F. Lehner, H. Kosch
With HTML5 becoming more and more standardized, it is possible to implement platform independent applications running on smartphones, tablets, laptops, and desktop PCs with different operating systems and screen resolutions. A combination of HTML5 with CSS and JavaScript allows the implementation of appealing user interfaces with advanced functionality. In this paper we present an HTML5 player for interactive non-linear videos using these technologies. In addition to standard player functions, our player provides extended navigation (button panels, table of contents, keyword search) in the video, areas for additional information, opportunities for collaboration, and a logging function. The latter allows analyses of the user behavior for further research questions. We also address first user studies.
{"title":"An HTML5 Player for Interactive Non-linear Video with Time-based Collaborative Annotations","authors":"Britta Meixner, Beate Siegel, Peter Schultes, F. Lehner, H. Kosch","doi":"10.1145/2536853.2536868","DOIUrl":"https://doi.org/10.1145/2536853.2536868","url":null,"abstract":"With HTML5 becoming more and more standardized, it is possible to implement platform independent applications running on smartphones, tablets, laptops, and desktop PCs with different operating systems and screen resolutions. A combination of HTML5 with CSS and JavaScript allows the implementation of appealing user interfaces with advanced functionality. In this paper we present an HTML5 player for interactive non-linear videos using these technologies. In addition to standard player functions, our player provides extended navigation (button panels, table of contents, keyword search) in the video, areas for additional information, opportunities for collaboration, and a logging function. The latter allows analyses of the user behavior for further research questions. We also address first user studies.","PeriodicalId":135195,"journal":{"name":"Advances in Mobile Multimedia","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129826125","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}
Mobile Ad hoc networks (MANETs) are self-organizing and self-configuring multi-hop wireless networks without any pre-existing communication infrastructures or centralized management. Scalability in MANETs is a new issue where network topology includes large number of nodes and demands a large number of packets in limited wireless bandwidth and nodes mobility that results in a high frequency of failure regarding wireless links. Clustering in MANETs is an important topic that divides the large network into several sub networks and widely used in efficient network management, improving resource management, hierarchical routing protocol design, Quality of Service and a good monitoring architecture of MANETs security. Subsequently, many clustering approaches have been proposed to divide nodes into clusters to support routing and network management. In this paper, we propose a new efficient weight based clustering algorithm. It takes into consideration the metrics: trust (T), density (D), Mobility (M) and energy (E) to choose locally the optimal cluster heads during cluster formation phase. In our proposed algorithm each cluster is supervised by its cluster head in order to ensure an acceptable level of security. It aims to improve the usage of scarce resources such as bandwidth, maintaining stable clusters structure with a lowest number of clusters formed, decreasing the total overhead during cluster formation and maintenance, maximizing lifespan of mobile nodes in the network and reduces energy consumption. Preliminary simulation experiments are conducted to compare the performance of our algorithm to Lowest ID, Highest Degree and WCA in terms of Average Number of CHs, Average Number of CH Changes, Total Number of Re-affiliations, Clusters Stability and Total Overhead. The initial results show that our scheme performs better than other clustering schemes based on the performance metrics considered.
{"title":"A Weight Based Clustering Scheme for Mobile Ad hoc Networks","authors":"A. Bentaleb, S. Harous, Abdelhak Boubetra","doi":"10.1145/2536853.2536863","DOIUrl":"https://doi.org/10.1145/2536853.2536863","url":null,"abstract":"Mobile Ad hoc networks (MANETs) are self-organizing and self-configuring multi-hop wireless networks without any pre-existing communication infrastructures or centralized management. Scalability in MANETs is a new issue where network topology includes large number of nodes and demands a large number of packets in limited wireless bandwidth and nodes mobility that results in a high frequency of failure regarding wireless links. Clustering in MANETs is an important topic that divides the large network into several sub networks and widely used in efficient network management, improving resource management, hierarchical routing protocol design, Quality of Service and a good monitoring architecture of MANETs security. Subsequently, many clustering approaches have been proposed to divide nodes into clusters to support routing and network management. In this paper, we propose a new efficient weight based clustering algorithm. It takes into consideration the metrics: trust (T), density (D), Mobility (M) and energy (E) to choose locally the optimal cluster heads during cluster formation phase. In our proposed algorithm each cluster is supervised by its cluster head in order to ensure an acceptable level of security. It aims to improve the usage of scarce resources such as bandwidth, maintaining stable clusters structure with a lowest number of clusters formed, decreasing the total overhead during cluster formation and maintenance, maximizing lifespan of mobile nodes in the network and reduces energy consumption. Preliminary simulation experiments are conducted to compare the performance of our algorithm to Lowest ID, Highest Degree and WCA in terms of Average Number of CHs, Average Number of CH Changes, Total Number of Re-affiliations, Clusters Stability and Total Overhead. The initial results show that our scheme performs better than other clustering schemes based on the performance metrics considered.","PeriodicalId":135195,"journal":{"name":"Advances in Mobile Multimedia","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127800285","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 field of wireless sensor networks there is a course to develop methods for tracking intrusions and unauthorised access by an attacker as well as detecting attempted attacks against the stability of wireless sensor networks, by using intrusion detection systems. So far, very little research has been done in the development of honeypots. Such systems represent the current state of the art in the field of research on detecting attacks on wireless sensor networks. It is considered that insufficient research has been conducted in the development of wireless sensor network honeypots, thus offering not enough opportunities for specific analysis and intercepting attacks.
{"title":"Honeypot Framework for Wireless Sensor Networks","authors":"J. Markert, M. Massoth","doi":"10.1145/2536853.2536941","DOIUrl":"https://doi.org/10.1145/2536853.2536941","url":null,"abstract":"In the field of wireless sensor networks there is a course to develop methods for tracking intrusions and unauthorised access by an attacker as well as detecting attempted attacks against the stability of wireless sensor networks, by using intrusion detection systems. So far, very little research has been done in the development of honeypots. Such systems represent the current state of the art in the field of research on detecting attacks on wireless sensor networks. It is considered that insufficient research has been conducted in the development of wireless sensor network honeypots, thus offering not enough opportunities for specific analysis and intercepting attacks.","PeriodicalId":135195,"journal":{"name":"Advances in Mobile Multimedia","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122917010","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}
Simone Spagnol, M. Geronazzo, D. Rocchesso, F. Avanzini
The paper presents a system for customized binaural audio delivery based on the extraction of the relevant features from a 2-D representation of the listener's pinna. A procedure based on multi-flash imaging for recognizing the main contours of the pinna and their position with respect to the ear canal entrance is detailed. The resulting contours drive the parametrization of a structural head-related transfer function model that performs in real time the spatialization of a desired sound file according to the listener's position with respect to the virtual sound source, tracked by sensor-equipped headphones. The low complexity of the model allows smooth implementation and delivery on any mobile device. The purpose of the desired system is to provide low-tech custom binaural audio to any user without the need of tedious and cumbersome subjective measurements.
{"title":"Extraction of Pinna Features for Customized Binaural Audio Delivery on Mobile Devices","authors":"Simone Spagnol, M. Geronazzo, D. Rocchesso, F. Avanzini","doi":"10.1145/2536853.2536909","DOIUrl":"https://doi.org/10.1145/2536853.2536909","url":null,"abstract":"The paper presents a system for customized binaural audio delivery based on the extraction of the relevant features from a 2-D representation of the listener's pinna. A procedure based on multi-flash imaging for recognizing the main contours of the pinna and their position with respect to the ear canal entrance is detailed. The resulting contours drive the parametrization of a structural head-related transfer function model that performs in real time the spatialization of a desired sound file according to the listener's position with respect to the virtual sound source, tracked by sensor-equipped headphones. The low complexity of the model allows smooth implementation and delivery on any mobile device. The purpose of the desired system is to provide low-tech custom binaural audio to any user without the need of tedious and cumbersome subjective measurements.","PeriodicalId":135195,"journal":{"name":"Advances in Mobile Multimedia","volume":"145 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123777922","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}
Coexistence of various wireless access networks and the ability of mobile terminals to switch between them make an optimal selection of serving networks for multicast groups a challenging problem. Since optimal network selection requires large dimensions of data to be collected from several network locations and sent between several network components, the scalability can easily become a bottleneck in large-scale systems. Therefore, reducing data exchange within heterogeneous wireless networks is important. We study the decision-making process and the data that needs to be sent between different network components. We present two decentralized solutions to this problem that operate with reduced sets of information. We define the upper and lower bounds to these solutions and evaluate them in the OMNet++ simulation environment. Both solutions provide a substantial improvement in performance compared to the lower bound.
{"title":"Network Selection for Multicast Groups in Heterogeneous Wireless Environments","authors":"S. Boudko, W. Leister","doi":"10.1145/2536853.2536871","DOIUrl":"https://doi.org/10.1145/2536853.2536871","url":null,"abstract":"Coexistence of various wireless access networks and the ability of mobile terminals to switch between them make an optimal selection of serving networks for multicast groups a challenging problem. Since optimal network selection requires large dimensions of data to be collected from several network locations and sent between several network components, the scalability can easily become a bottleneck in large-scale systems. Therefore, reducing data exchange within heterogeneous wireless networks is important. We study the decision-making process and the data that needs to be sent between different network components. We present two decentralized solutions to this problem that operate with reduced sets of information. We define the upper and lower bounds to these solutions and evaluate them in the OMNet++ simulation environment. Both solutions provide a substantial improvement in performance compared to the lower bound.","PeriodicalId":135195,"journal":{"name":"Advances in Mobile Multimedia","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123779368","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 last years, wireless sensor networks (WSNs) have been used in a wide range of applications like monitoring, tracking, classification, etc. One of the most crucial challenges in the WSNs is designing an efficient method to monitor a set of targets and, at the same time, extend the network lifetime. Because of high density of the deployed sensors, scheduling algorithms can be considered as a promising method. In this paper, a learning automata-based scheduling algorithm is designed for finding a near-optimal solution to the target coverage problem that can produce both disjoint and non-disjoint cover sets in the WSNS. In the proposed algorithm, one learning automaton is in charge of choosing the sensor nodes that should be activated at each stage to cover all the targets. Furthermore, two pruning rules are devised to help the learning automaton in selection of more suitable active sensors. We have conducted several simulation experiments to evaluate the performance of the proposed algorithm. The obtained results revealed that the proposed algorithm could successfully extend the network lifetime.
{"title":"A learning automata-based solution to the target coverage problem in wireless sensor networks","authors":"Shaharuddin Salleh, S. Marouf","doi":"10.1145/2536853.2536921","DOIUrl":"https://doi.org/10.1145/2536853.2536921","url":null,"abstract":"In the last years, wireless sensor networks (WSNs) have been used in a wide range of applications like monitoring, tracking, classification, etc. One of the most crucial challenges in the WSNs is designing an efficient method to monitor a set of targets and, at the same time, extend the network lifetime. Because of high density of the deployed sensors, scheduling algorithms can be considered as a promising method. In this paper, a learning automata-based scheduling algorithm is designed for finding a near-optimal solution to the target coverage problem that can produce both disjoint and non-disjoint cover sets in the WSNS. In the proposed algorithm, one learning automaton is in charge of choosing the sensor nodes that should be activated at each stage to cover all the targets. Furthermore, two pruning rules are devised to help the learning automaton in selection of more suitable active sensors. We have conducted several simulation experiments to evaluate the performance of the proposed algorithm. The obtained results revealed that the proposed algorithm could successfully extend the network lifetime.","PeriodicalId":135195,"journal":{"name":"Advances in Mobile Multimedia","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126151833","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
扫码关注我们
求助内容：
应助结果提醒方式：