Admir Barolli, Tetsuya Oda, L. Barolli, F. Xhafa, V. Loia, K. Uchida
Wireless Mesh Networks (WMNs) are attracting a lot of attention from wireless network researchers. Node placement problems have been investigated for a long time in the optimization field due to numerous applications in location science. In our previous work, we evaluated WMN-GA system which is based on Genetic Algorithms (GAs) to find an optimal location assignment for mesh routers. In this paper, we evaluate the performance of two different distributions of mesh clients for two WMN architectures considering throughput, delay and energy metrics. For simulations, we used ns-3 and Optimized Link State Routing (OLSR). We compare the performance for normal and uniform distributions of mesh clients by sending multiple Constant Bit Rate (CBR) flows in the network. The simulation results show that for both distributions, the throughput of Hybrid WMN is higher than I/B WMN architecture. The delay of Hybrid WMN is a lower compared with I/B WMN. The delay for Hybrid WMN is almost the same for both distributions. However for I/B WMN, the delay is lower for Uniform distribution. For Normal distribution, the energy decreases sharply, because of the high density of nodes. For Uniform distribution, the remaining energy is higher compared with Normal distribution.
{"title":"Performance Analysis of WMN-GA Simulation System for Different WMN Architectures Considering OLSR","authors":"Admir Barolli, Tetsuya Oda, L. Barolli, F. Xhafa, V. Loia, K. Uchida","doi":"10.1109/AINA.2015.187","DOIUrl":"https://doi.org/10.1109/AINA.2015.187","url":null,"abstract":"Wireless Mesh Networks (WMNs) are attracting a lot of attention from wireless network researchers. Node placement problems have been investigated for a long time in the optimization field due to numerous applications in location science. In our previous work, we evaluated WMN-GA system which is based on Genetic Algorithms (GAs) to find an optimal location assignment for mesh routers. In this paper, we evaluate the performance of two different distributions of mesh clients for two WMN architectures considering throughput, delay and energy metrics. For simulations, we used ns-3 and Optimized Link State Routing (OLSR). We compare the performance for normal and uniform distributions of mesh clients by sending multiple Constant Bit Rate (CBR) flows in the network. The simulation results show that for both distributions, the throughput of Hybrid WMN is higher than I/B WMN architecture. The delay of Hybrid WMN is a lower compared with I/B WMN. The delay for Hybrid WMN is almost the same for both distributions. However for I/B WMN, the delay is lower for Uniform distribution. For Normal distribution, the energy decreases sharply, because of the high density of nodes. For Uniform distribution, the remaining energy is higher compared with Normal distribution.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"115 1","pages":"207-214"},"PeriodicalIF":0.0,"publicationDate":"2015-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75463841","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}
Effectively managing network infrastructure requires administrators to appropriately understand up-to-data network system status. Accurate understandings are especially crucial when installing new communication equipment and fixing network failures. In this paper, we propose a network topology visualization system based on AR (Augmented Reality) for assisting an administrator in real working environments. The proposed system graphically visualizes network configuration information and physical cabling structure related to a specific network node such as a router or a switch through an HMD (Head Mounted Display) device worn by the administrator. The system supports not only the administrator to efficiently performing the network management task but also trainees to acquire practical knowledge and skills on network administration.
{"title":"A Network Topology Visualization System Based on Mobile AR Technology","authors":"Toshiyuki Haramaki, Hiroaki Nishino","doi":"10.1109/AINA.2015.219","DOIUrl":"https://doi.org/10.1109/AINA.2015.219","url":null,"abstract":"Effectively managing network infrastructure requires administrators to appropriately understand up-to-data network system status. Accurate understandings are especially crucial when installing new communication equipment and fixing network failures. In this paper, we propose a network topology visualization system based on AR (Augmented Reality) for assisting an administrator in real working environments. The proposed system graphically visualizes network configuration information and physical cabling structure related to a specific network node such as a router or a switch through an HMD (Head Mounted Display) device worn by the administrator. The system supports not only the administrator to efficiently performing the network management task but also trainees to acquire practical knowledge and skills on network administration.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"48 1","pages":"442-447"},"PeriodicalIF":0.0,"publicationDate":"2015-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78959218","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper explores the relationship between organizational culture, ontologies and the success of green IT initiatives. It investigates the impact of organizational culture on the degree of adoption of Green IT initiatives and on their success. The nature of culture within IT is explored and the effect of culture on the sustainable use of IT is analyzed. The paper presents ontological dimensions from a philosophical perspective by outlining the origins of ontologies. The ontological analysis is also investigated from a computing perspective with respect to semantic web concepts. The relationship between Culture and Green ICT ontologies is explored. It is argued that green IT systems should be designed with an ontology that incorporates cultural issues. The final section of the paper presents concluding remarks and identifies areas of future work.
{"title":"An Ontological Analysis of the Role of Culture within Green IT","authors":"Jagdev Bhogal, William M. Campbell","doi":"10.1109/WAINA.2015.20","DOIUrl":"https://doi.org/10.1109/WAINA.2015.20","url":null,"abstract":"This paper explores the relationship between organizational culture, ontologies and the success of green IT initiatives. It investigates the impact of organizational culture on the degree of adoption of Green IT initiatives and on their success. The nature of culture within IT is explored and the effect of culture on the sustainable use of IT is analyzed. The paper presents ontological dimensions from a philosophical perspective by outlining the origins of ontologies. The ontological analysis is also investigated from a computing perspective with respect to semantic web concepts. The relationship between Culture and Green ICT ontologies is explored. It is argued that green IT systems should be designed with an ontology that incorporates cultural issues. The final section of the paper presents concluding remarks and identifies areas of future work.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"13 1","pages":"399-404"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73008331","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}
T. Tokuyasu, T. Nakayama, Kazuhiko Toshimitsu, K. Okamura, K. Yoshiura
There has been an increase in the number of dentist since the 1950s in Japan. This has been recognized as one of medical issues in Japan. The increase of dentists causes a reduction of diagnostic opportunity per dentist and becomes a factor which declines the quality of dental therapy. By the way the education contents implemented in dental college has not been changed, where dental students study the knowledge and technique for intraoral radiograph. In the dental examination room, dentist often touches a patient face to identify the causes of disease such as dental curies and/or tumors. This diagnostic method has been called as maxillofacial palpation. Because some of dental diseases can be found by maxillofacial palpation, this diagnostic method has been recognized as the important skill for dentist. However, no practical training of maxillofacial palpation against a patient has been included in the curriculum of dental education. A training system which enables dental students to practice maxillofacial palpation with a patient was requested from the dentists, and then this study aims to develop a virtual training system for maxillofacial palpation that provides dental students to touch a patient face virtually. The system consists of a personal computer and a haptic interface. The computer processes a virtual patient model which reacts graphically and dynamically against the haptic interface operated by a trainee. This study applies free mesh method to the dynamic model of virtual patient model in order to reduce the computation cost. This paper introduces a basic concept of free mesh method and discusses the validity of this method through the experimental results.
{"title":"Development of Virtual Palpation System for Dental Education","authors":"T. Tokuyasu, T. Nakayama, Kazuhiko Toshimitsu, K. Okamura, K. Yoshiura","doi":"10.1109/WAINA.2015.35","DOIUrl":"https://doi.org/10.1109/WAINA.2015.35","url":null,"abstract":"There has been an increase in the number of dentist since the 1950s in Japan. This has been recognized as one of medical issues in Japan. The increase of dentists causes a reduction of diagnostic opportunity per dentist and becomes a factor which declines the quality of dental therapy. By the way the education contents implemented in dental college has not been changed, where dental students study the knowledge and technique for intraoral radiograph. In the dental examination room, dentist often touches a patient face to identify the causes of disease such as dental curies and/or tumors. This diagnostic method has been called as maxillofacial palpation. Because some of dental diseases can be found by maxillofacial palpation, this diagnostic method has been recognized as the important skill for dentist. However, no practical training of maxillofacial palpation against a patient has been included in the curriculum of dental education. A training system which enables dental students to practice maxillofacial palpation with a patient was requested from the dentists, and then this study aims to develop a virtual training system for maxillofacial palpation that provides dental students to touch a patient face virtually. The system consists of a personal computer and a haptic interface. The computer processes a virtual patient model which reacts graphically and dynamically against the haptic interface operated by a trainee. This study applies free mesh method to the dynamic model of virtual patient model in order to reduce the computation cost. This paper introduces a basic concept of free mesh method and discusses the validity of this method through the experimental results.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"40 1","pages":"44-48"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79445669","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}
Mesh and torus are the most popular topologies suggested to implement Network-on-Chip (NoC). Concentration has been suggested to reduce networks complexity in terms of routers and wiring requirements. Several studies have examined the performance of concentrated mesh. This paper expands on these studies to re-evaluate the benefits of concentration in mesh and torus. Three alternative router configurations are proposed to investigate bottleneck performance due to concentration. Simulation results indicate that, under uniform traffic distribution, only large ratios of packet length-to-average hop count is in favor of concentrated mesh and torus. The Cmesh profits from its high channel bandwidth to offer better performance than Ctorus. The latter is unable to overcome the high packet serialization overhead even when using separate input ports at routers, one for each IP core, to reduce packet contention. Furthermore, non-local traffic at routers suffers more from contention than local traffic. Providing dedicated input ports, one for each IP core, at routers, reduces the average packet latency by 80% compared to a configuration with a single input port shared by all IP cores of the cluster, while only 20% improvement is achieved by adding a separate input port to service local traffic. However, when high traffic load is sent locally to the IP cores belonging to the same cluster as the source, a router configuration with multiple channels servicing local traffic greatly reduces the overall packet latency.
{"title":"Performance Analysis of Traffic Bottleneck Induced by Concentration at K-Ary N-Cube NoC Routers","authors":"S. Loucif","doi":"10.1109/AINA.2015.172","DOIUrl":"https://doi.org/10.1109/AINA.2015.172","url":null,"abstract":"Mesh and torus are the most popular topologies suggested to implement Network-on-Chip (NoC). Concentration has been suggested to reduce networks complexity in terms of routers and wiring requirements. Several studies have examined the performance of concentrated mesh. This paper expands on these studies to re-evaluate the benefits of concentration in mesh and torus. Three alternative router configurations are proposed to investigate bottleneck performance due to concentration. Simulation results indicate that, under uniform traffic distribution, only large ratios of packet length-to-average hop count is in favor of concentrated mesh and torus. The Cmesh profits from its high channel bandwidth to offer better performance than Ctorus. The latter is unable to overcome the high packet serialization overhead even when using separate input ports at routers, one for each IP core, to reduce packet contention. Furthermore, non-local traffic at routers suffers more from contention than local traffic. Providing dedicated input ports, one for each IP core, at routers, reduces the average packet latency by 80% compared to a configuration with a single input port shared by all IP cores of the cluster, while only 20% improvement is achieved by adding a separate input port to service local traffic. However, when high traffic load is sent locally to the IP cores belonging to the same cluster as the source, a router configuration with multiple channels servicing local traffic greatly reduces the overall packet latency.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"16 1","pages":"98-105"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81703106","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}
Modular exponentiation with a large modulus, which is usually accomplished by repeated modular multiplications, has been widely used in public key cryptosystems for secure data communications. Hohenberger and Lysyanskaya [14] proposed the first algorithm for secure outsourcing of modular exponentiations, and then Chen et al. [16] improved the algorithm, which can implement simultaneous modular exponentiations of u1au2b. In this paper, we present a secure algorithm for resource-constrained customers, who outsource simulataneous modular exponentiations operation, a task of intensive computation workload, to untrusted servers in the model with one malicious adversary. Based on Chen's algorithm, our algorithm achieves n simultaneous modular exponentiations in outsourcing computation. Compared with [14] and [16], our algorithm is more efficiency.
{"title":"Secure Outsourcing of Multiple Modular Exponentiations","authors":"Jinyang Li, Jun Ye","doi":"10.1109/AINA.2015.272","DOIUrl":"https://doi.org/10.1109/AINA.2015.272","url":null,"abstract":"Modular exponentiation with a large modulus, which is usually accomplished by repeated modular multiplications, has been widely used in public key cryptosystems for secure data communications. Hohenberger and Lysyanskaya [14] proposed the first algorithm for secure outsourcing of modular exponentiations, and then Chen et al. [16] improved the algorithm, which can implement simultaneous modular exponentiations of u1au2b. In this paper, we present a secure algorithm for resource-constrained customers, who outsource simulataneous modular exponentiations operation, a task of intensive computation workload, to untrusted servers in the model with one malicious adversary. Based on Chen's algorithm, our algorithm achieves n simultaneous modular exponentiations in outsourcing computation. Compared with [14] and [16], our algorithm is more efficiency.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"61 1","pages":"808-811"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85227909","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}
Multimedia sensors are attracting the attention of the researchers increasingly, and have shifted the focus from traditional scalar sensors to sensors equipped with multimedia devices. The characteristics of multimedia services impose more resource constraints that involve energy consumption, memory, buffer size, bandwidth, and processing capabilities. Existing routing solutions used in wireless multimedia sensor networks suffer from limitations in term of QoS and energy efficiency. In this paper, we propose a new QoS routing solution to increase the energy efficiency while guaranteeing the QoS requirements of the multimedia services over the wireless sensor networks.
{"title":"Energy-Efficient QoS Routing in Wireless Multimedia Sensor Networks","authors":"Ziad Serhan, W. B. Diab","doi":"10.1109/AINA.2015.189","DOIUrl":"https://doi.org/10.1109/AINA.2015.189","url":null,"abstract":"Multimedia sensors are attracting the attention of the researchers increasingly, and have shifted the focus from traditional scalar sensors to sensors equipped with multimedia devices. The characteristics of multimedia services impose more resource constraints that involve energy consumption, memory, buffer size, bandwidth, and processing capabilities. Existing routing solutions used in wireless multimedia sensor networks suffer from limitations in term of QoS and energy efficiency. In this paper, we propose a new QoS routing solution to increase the energy efficiency while guaranteeing the QoS requirements of the multimedia services over the wireless sensor networks.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"108 1","pages":"223-230"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85914697","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}
Emergency situations are unfortunately part of our lives. Today's smart computing allow us handle such situations and fulfill our requirements more efficiently and effectively. This paper presents architecture to handle various kinds of emergency situations more efficiently and effectively, by allowing the user (victim or witness) easy and quick way to alert the concerned department (s) with just a single button press. The service automatically sends the location of incident and contacts the appropriate emergency dealing department automatically through already stored contact numbers. The emergency related information is then synchronized automatically to the mobile cloud, allowing further analysis and improvement in safety of people and creates further services for the concerned authorities and users. Performance in most certain scenarios is also evaluated and presented in this study.
{"title":"M2M Emergency Help Alert Mobile Cloud Architecture","authors":"Mohammad Aazam, Pham Phuoc Hung, E. Huh","doi":"10.1109/WAINA.2015.105","DOIUrl":"https://doi.org/10.1109/WAINA.2015.105","url":null,"abstract":"Emergency situations are unfortunately part of our lives. Today's smart computing allow us handle such situations and fulfill our requirements more efficiently and effectively. This paper presents architecture to handle various kinds of emergency situations more efficiently and effectively, by allowing the user (victim or witness) easy and quick way to alert the concerned department (s) with just a single button press. The service automatically sends the location of incident and contacts the appropriate emergency dealing department automatically through already stored contact numbers. The emergency related information is then synchronized automatically to the mobile cloud, allowing further analysis and improvement in safety of people and creates further services for the concerned authorities and users. Performance in most certain scenarios is also evaluated and presented in this study.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"48 1","pages":"500-505"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85540030","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}
Anasthasia Agnes Haryanto, D. Taniar, Kiki Maulana
In Reverse Nearest Neighbour (RNN) Query, every single object in the space has a certain region where all objects inside this region will think of the query object as their nearest neighbour. Other objects that are outside the region will not consider the query object as their nearest neighbour. In many cases, we might encounter a situation where we want to find this kind of region for several objects altogether, instead of a single object. Current RNN region approach cannot be used for this problem. Therefore we propose Group Reverse kNN as a solution, which we will find a specific region based on multiple query objects. So any objects located inside this region will always consider all of the query objects as the nearest compare to the non-query objects. Our experiments demonstrate the performance efficiency of the proposed Group Reverse kNN algorithm.
{"title":"Processing Group Reverse kNN in Spatial Databases","authors":"Anasthasia Agnes Haryanto, D. Taniar, Kiki Maulana","doi":"10.1109/AINA.2015.176","DOIUrl":"https://doi.org/10.1109/AINA.2015.176","url":null,"abstract":"In Reverse Nearest Neighbour (RNN) Query, every single object in the space has a certain region where all objects inside this region will think of the query object as their nearest neighbour. Other objects that are outside the region will not consider the query object as their nearest neighbour. In many cases, we might encounter a situation where we want to find this kind of region for several objects altogether, instead of a single object. Current RNN region approach cannot be used for this problem. Therefore we propose Group Reverse kNN as a solution, which we will find a specific region based on multiple query objects. So any objects located inside this region will always consider all of the query objects as the nearest compare to the non-query objects. Our experiments demonstrate the performance efficiency of the proposed Group Reverse kNN algorithm.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"24 1","pages":"126-133"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85714985","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This work analyzes the co-authorship of science papers published by university teachers, and then constructs are searcher co-authorship network and characterizes the network by some varying quantities: the clustering coefficient, the average degree, diameter, average distance and components. Consequently, this paper visualizes the researcher co-authorship network which can lead to a better understanding of the applications of information visualization technology.
{"title":"Analysis of Researcher Co-authorship Network","authors":"Jiana Meng, Jun Guo","doi":"10.1109/WAINA.2015.63","DOIUrl":"https://doi.org/10.1109/WAINA.2015.63","url":null,"abstract":"This work analyzes the co-authorship of science papers published by university teachers, and then constructs are searcher co-authorship network and characterizes the network by some varying quantities: the clustering coefficient, the average degree, diameter, average distance and components. Consequently, this paper visualizes the researcher co-authorship network which can lead to a better understanding of the applications of information visualization technology.","PeriodicalId":6845,"journal":{"name":"2015 IEEE 29th International Conference on Advanced Information Networking and Applications Workshops","volume":"9 1","pages":"283-286"},"PeriodicalIF":0.0,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85892275","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
扫码关注我们
求助内容：
应助结果提醒方式：