In this paper, we study the issue of optimizing transmission power (energy per symbol) for minimizing the expected energy required to deliver a frame to the destination node in a point-to-point link employing an automatic repeat request (ARQ) scheme over a fading channel. We derive the expected energy as a function of the transmission power and derive a simple optimization algorithm based on the properties of this function.
{"title":"Optimizing Bit Transmission Power for Link Layer Energy Efficiency","authors":"A. Ghanavati, D. Lee","doi":"10.1109/WAINA.2014.119","DOIUrl":"https://doi.org/10.1109/WAINA.2014.119","url":null,"abstract":"In this paper, we study the issue of optimizing transmission power (energy per symbol) for minimizing the expected energy required to deliver a frame to the destination node in a point-to-point link employing an automatic repeat request (ARQ) scheme over a fading channel. We derive the expected energy as a function of the transmission power and derive a simple optimization algorithm based on the properties of this function.","PeriodicalId":424903,"journal":{"name":"2014 28th International Conference on Advanced Information Networking and Applications Workshops","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125182279","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 presents the results of our analysis of the film selection process for a film festival. The selection of films characterises the festival, which then attracts audiences. Although the criteria for selection are fundamentally decided by members of the selection committee, we investigate if computation can characterise the selection process by utilising available data in this study. Selections are made by watching films and not by checking the associated information. However, considering the difficulties in semantically understanding the video content for computers, we attempted the analysis of the selection process based solely on associated information, including textual, numerical, or categorical data. Results of the analysis revealed factors that may affect the outcome of the selection.
{"title":"Analysis of the Film Selection Process for a Film Festival","authors":"Masashi Inoue, Sakie Sakuma","doi":"10.1109/WAINA.2014.96","DOIUrl":"https://doi.org/10.1109/WAINA.2014.96","url":null,"abstract":"This paper presents the results of our analysis of the film selection process for a film festival. The selection of films characterises the festival, which then attracts audiences. Although the criteria for selection are fundamentally decided by members of the selection committee, we investigate if computation can characterise the selection process by utilising available data in this study. Selections are made by watching films and not by checking the associated information. However, considering the difficulties in semantically understanding the video content for computers, we attempted the analysis of the selection process based solely on associated information, including textual, numerical, or categorical data. Results of the analysis revealed factors that may affect the outcome of the selection.","PeriodicalId":424903,"journal":{"name":"2014 28th International Conference on Advanced Information Networking and Applications Workshops","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127758433","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}
Krishna Doddapaneni, Fredrick A. Omondi, E. Ever, P. Shah, O. Gemikonakli, R. Gagliardi
Clustering techniques for wireless sensor networks (WSNs) have been extensively studied and proven to improve the network lifetime, a primary metric, used for performance evaluation of sensor networks. Although introduction of clustering techniques has the potential to reduce energy consumption and extend the lifetime of the network by decreasing the contention through either power control or node scheduling, scalability remains an issue. Therefore, the optimality of the cluster size still needs to be thoroughly investigated. In this paper, a single cluster head (CH) queuing model is presented. Using an event based simulation tool (Castalia), key issues that affect the practical deployment of clustering techniques in wireless sensor networks are analysed. These include identifying the bottlenecks in terms of cluster scalability and predicting the nature of data packets arrival distribution at the CH. Results presented show that this analysis can be used to specify the size of a cluster, when a specific flow of data is expected from the sensing nodes based on a particular application and also the distribution of the inter-arrival times of data packets at the CH follows exponential distribution.
{"title":"Deployment Challenges and Developments in Wireless Sensor Networks Clustering","authors":"Krishna Doddapaneni, Fredrick A. Omondi, E. Ever, P. Shah, O. Gemikonakli, R. Gagliardi","doi":"10.1109/WAINA.2014.46","DOIUrl":"https://doi.org/10.1109/WAINA.2014.46","url":null,"abstract":"Clustering techniques for wireless sensor networks (WSNs) have been extensively studied and proven to improve the network lifetime, a primary metric, used for performance evaluation of sensor networks. Although introduction of clustering techniques has the potential to reduce energy consumption and extend the lifetime of the network by decreasing the contention through either power control or node scheduling, scalability remains an issue. Therefore, the optimality of the cluster size still needs to be thoroughly investigated. In this paper, a single cluster head (CH) queuing model is presented. Using an event based simulation tool (Castalia), key issues that affect the practical deployment of clustering techniques in wireless sensor networks are analysed. These include identifying the bottlenecks in terms of cluster scalability and predicting the nature of data packets arrival distribution at the CH. Results presented show that this analysis can be used to specify the size of a cluster, when a specific flow of data is expected from the sensing nodes based on a particular application and also the distribution of the inter-arrival times of data packets at the CH follows exponential distribution.","PeriodicalId":424903,"journal":{"name":"2014 28th International Conference on Advanced Information Networking and Applications Workshops","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114867530","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}
E. Gazis, K. Sasloglou, A. Merentitis, Kostas Mathioudakis
With Internet of Things applications covering several application domains (e.g., Smart Grid, Smart City, e-Health) with a diverse range of requirements, it is now becoming increasingly recognized that the variety of wireless technologies employed for Machine-to-Machine (M2M) communication is here to stay. Due to the heterogeneity of M2M appliances and communication modes, research has been investigating autonomic principles as an efficient instrument for the integration of large populations of dissimilar M2M devices to the M2M gateway and the overall end-to-end M2M architecture. Herein we present the status of semantic support for the IoT field by briefly surveying research efforts in IoT dealing with semantic concerns at the architecture level. We also summarize the state of the art in adaptable protocol stacks and make the case for their application as an efficiency enabler instrument for IoT. To this end, we present our work in an ontology used to semantically describe the adaptation options of the dynamic protocol stacks for future communication devices. We present the ontology design principles and artifacts and elaborate on the level of semantic support it enables for IoT. Finally, we conclude the paper with our next steps in the area of semantic support for IoT.
{"title":"On the Role of Semantic Descriptions for Adaptable Protocol Stacks in the Internet of Things","authors":"E. Gazis, K. Sasloglou, A. Merentitis, Kostas Mathioudakis","doi":"10.1109/WAINA.2014.73","DOIUrl":"https://doi.org/10.1109/WAINA.2014.73","url":null,"abstract":"With Internet of Things applications covering several application domains (e.g., Smart Grid, Smart City, e-Health) with a diverse range of requirements, it is now becoming increasingly recognized that the variety of wireless technologies employed for Machine-to-Machine (M2M) communication is here to stay. Due to the heterogeneity of M2M appliances and communication modes, research has been investigating autonomic principles as an efficient instrument for the integration of large populations of dissimilar M2M devices to the M2M gateway and the overall end-to-end M2M architecture. Herein we present the status of semantic support for the IoT field by briefly surveying research efforts in IoT dealing with semantic concerns at the architecture level. We also summarize the state of the art in adaptable protocol stacks and make the case for their application as an efficiency enabler instrument for IoT. To this end, we present our work in an ontology used to semantically describe the adaptation options of the dynamic protocol stacks for future communication devices. We present the ontology design principles and artifacts and elaborate on the level of semantic support it enables for IoT. Finally, we conclude the paper with our next steps in the area of semantic support for IoT.","PeriodicalId":424903,"journal":{"name":"2014 28th International Conference on Advanced Information Networking and Applications Workshops","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123063275","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 Domain Name System (DNS) is widely seen as a vital protocol of the modern Internet. For example, popular services like load balancers and Content Delivery Networks heavily rely on DNS. Because of its important role, DNS is also a desirable target for malicious activities such as spamming, phishing, and botnets. To protect networks against these attacks, a number of DNS-based security approaches have been proposed. The key insight of our study is to measure the effectiveness of security approaches that rely on DNS in large-scale networks. For this purpose, we answer the following questions, How often is DNS used? Are most of the Internet flows established after contacting DNS? In this study, we collected data from the University of Auckland campus network with more than 33,000 Internet users and processed it to find out how DNS is being used. Moreover, we studied the flows that were established with and without contacting DNS. Our results show that less than 5 percent of the observed flows use DNS. Therefore, we argue that those security approaches that solely depend on DNS are not sufficient to protect large-scale networks.
{"title":"Effectiveness of DNS-Based Security Approaches in Large-Scale Networks","authors":"M. Janbeglou, H. Naderi, N. Brownlee","doi":"10.1109/WAINA.2014.87","DOIUrl":"https://doi.org/10.1109/WAINA.2014.87","url":null,"abstract":"The Domain Name System (DNS) is widely seen as a vital protocol of the modern Internet. For example, popular services like load balancers and Content Delivery Networks heavily rely on DNS. Because of its important role, DNS is also a desirable target for malicious activities such as spamming, phishing, and botnets. To protect networks against these attacks, a number of DNS-based security approaches have been proposed. The key insight of our study is to measure the effectiveness of security approaches that rely on DNS in large-scale networks. For this purpose, we answer the following questions, How often is DNS used? Are most of the Internet flows established after contacting DNS? In this study, we collected data from the University of Auckland campus network with more than 33,000 Internet users and processed it to find out how DNS is being used. Moreover, we studied the flows that were established with and without contacting DNS. Our results show that less than 5 percent of the observed flows use DNS. Therefore, we argue that those security approaches that solely depend on DNS are not sufficient to protect large-scale networks.","PeriodicalId":424903,"journal":{"name":"2014 28th International Conference on Advanced Information Networking and Applications Workshops","volume":"296 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121719049","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}
Face recognition has received attention from research communities recently. Law enforcement agencies are using facial recognition software as a crime-fighting tool. The quick increasing of Mobile Devices usage and the explosive growth of the mobile applications Mobile face recognition is one of important application. In the same time the mobile devices are facing many challenges in their resources as low computing power, battery life, limited bandwidth and storage. Mobile Cloud Computing (MCC) has been introduced to be a potential technology for mobile services and to solve the mobile resources problem by moving the processing and the storage of data out from mobile devices to the cloud. MCC offers abundant computing power that can be tapped easily. This paper gives explanation of MCC definition, Building private cloud with Open Source cloud OS, Face recognition as MCC Application with presenting the face detection and face recognition algorithms. Our results demonstrate that the proposed architecture is promising for real-time Mobile cloud computing by reducing the overall processing time.
{"title":"Real-Time Mobile Cloud Computing: A Case Study in Face Recognition","authors":"Marwa Ayad, M. Taher, Ashraf M. Salem","doi":"10.1109/WAINA.2014.22","DOIUrl":"https://doi.org/10.1109/WAINA.2014.22","url":null,"abstract":"Face recognition has received attention from research communities recently. Law enforcement agencies are using facial recognition software as a crime-fighting tool. The quick increasing of Mobile Devices usage and the explosive growth of the mobile applications Mobile face recognition is one of important application. In the same time the mobile devices are facing many challenges in their resources as low computing power, battery life, limited bandwidth and storage. Mobile Cloud Computing (MCC) has been introduced to be a potential technology for mobile services and to solve the mobile resources problem by moving the processing and the storage of data out from mobile devices to the cloud. MCC offers abundant computing power that can be tapped easily. This paper gives explanation of MCC definition, Building private cloud with Open Source cloud OS, Face recognition as MCC Application with presenting the face detection and face recognition algorithms. Our results demonstrate that the proposed architecture is promising for real-time Mobile cloud computing by reducing the overall processing time.","PeriodicalId":424903,"journal":{"name":"2014 28th International Conference on Advanced Information Networking and Applications Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126435928","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 utility of mobile ad hoc networks (MANETs) during disaster recovery is well-known. Dynamic networks offer particular advantages in post-disaster circumstances, permitting first-responders to prioritize the use of humanitarian and repair resources in emergency situations caused by extreme weather such as earthquakes, hurricanes, floods, and snow storms. Real-time data and information sharing, using a mobile app, has been expanded from the individual point-to-point communication or 'hot-spots' to dynamically built, with virtual hub-and-spoke topology, mobile ad hoc networks. The MANET approach, supported by a mobile app, makes the disaster recovery more efficient, both in monitoring the scope of the damage and in coordinating appropriate recovery and relief missions. The integrated approach of a mobile app and MANETs can ultimately save lives and reduce the time needed for critical service to be restored.
{"title":"Design of a Mobile Ad Hoc Network Communication App for Disaster Recovery","authors":"Allan Goncalves, Carlos Silva, Patricia Morreale","doi":"10.1109/WAINA.2014.26","DOIUrl":"https://doi.org/10.1109/WAINA.2014.26","url":null,"abstract":"The utility of mobile ad hoc networks (MANETs) during disaster recovery is well-known. Dynamic networks offer particular advantages in post-disaster circumstances, permitting first-responders to prioritize the use of humanitarian and repair resources in emergency situations caused by extreme weather such as earthquakes, hurricanes, floods, and snow storms. Real-time data and information sharing, using a mobile app, has been expanded from the individual point-to-point communication or 'hot-spots' to dynamically built, with virtual hub-and-spoke topology, mobile ad hoc networks. The MANET approach, supported by a mobile app, makes the disaster recovery more efficient, both in monitoring the scope of the damage and in coordinating appropriate recovery and relief missions. The integrated approach of a mobile app and MANETs can ultimately save lives and reduce the time needed for critical service to be restored.","PeriodicalId":424903,"journal":{"name":"2014 28th International Conference on Advanced Information Networking and Applications Workshops","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126508559","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 presents a recommendation mechanism for taxi-sharing. The first aim of our model is to respectively recommend taxis and passengers for picking up passengers quickly and finding taxis easily. The second purpose is providing taxi-sharing service for passengers who want to save the payment. In our method, we analyze the historical Global Positioning System (GPS) trajectories generated by 10,357 taxis during 110 days and present the service region with time-dependent R-Tree. We formulate the problem of choosing the paths among the taxis in the same region by using non-cooperative game theory, and find out the solution of this game which is known as Nash equilibrium. The results show that our method can find taxis and passengers efficiently. In addition, applying our method can reduce the payment of passengers and increase the taxi revenue by taxi-sharing.
{"title":"Game Theory Based Recommendation Mechanism for Taxi-Sharing","authors":"Sheng-Tzong Cheng, Jian-Pan Li, G. Horng","doi":"10.1109/WAINA.2014.106","DOIUrl":"https://doi.org/10.1109/WAINA.2014.106","url":null,"abstract":"This paper presents a recommendation mechanism for taxi-sharing. The first aim of our model is to respectively recommend taxis and passengers for picking up passengers quickly and finding taxis easily. The second purpose is providing taxi-sharing service for passengers who want to save the payment. In our method, we analyze the historical Global Positioning System (GPS) trajectories generated by 10,357 taxis during 110 days and present the service region with time-dependent R-Tree. We formulate the problem of choosing the paths among the taxis in the same region by using non-cooperative game theory, and find out the solution of this game which is known as Nash equilibrium. The results show that our method can find taxis and passengers efficiently. In addition, applying our method can reduce the payment of passengers and increase the taxi revenue by taxi-sharing.","PeriodicalId":424903,"journal":{"name":"2014 28th International Conference on Advanced Information Networking and Applications Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129309206","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}
Privacy Enhancing Techniques (PET) are key to the success in building the trust among the users of the digital world. Enhancing the communication privacy is getting attention nowadays. In this direction, anonymity schemes such as mix, mix networks, onion routing, crowds etc., have started in roads into the deployment at individual and community network levels. To measure the effectiveness and accuracy of such schemes, degree of anonymity is proposed as a privacy metric in literature. To measure the degree of anonymity, many empirical techniques are proposed. We observe that these techniques are computationally intensive and are infeasible for real-time requirements and thus may not be suitable to measure the degree of anonymity under the dynamic changes in the configuration of the network in real-time. In this direction, we propose a novel lightweight privacy metric to measure the degree of anonymity for mix, mix networks and their variants using graph theoretic approach based on Connectivity Index (CI). Further, we also extend this approach with Weighted Connectivity Index (WCI) and have demonstrated the usefulness of the metric through analytical analysis.
{"title":"Design of a Mix Network Using Connectivity Index -- A Novel Privacy Enhancement Approach","authors":"Rajan Ma, H. Rath, P. Balamuralidhar","doi":"10.1109/WAINA.2014.86","DOIUrl":"https://doi.org/10.1109/WAINA.2014.86","url":null,"abstract":"Privacy Enhancing Techniques (PET) are key to the success in building the trust among the users of the digital world. Enhancing the communication privacy is getting attention nowadays. In this direction, anonymity schemes such as mix, mix networks, onion routing, crowds etc., have started in roads into the deployment at individual and community network levels. To measure the effectiveness and accuracy of such schemes, degree of anonymity is proposed as a privacy metric in literature. To measure the degree of anonymity, many empirical techniques are proposed. We observe that these techniques are computationally intensive and are infeasible for real-time requirements and thus may not be suitable to measure the degree of anonymity under the dynamic changes in the configuration of the network in real-time. In this direction, we propose a novel lightweight privacy metric to measure the degree of anonymity for mix, mix networks and their variants using graph theoretic approach based on Connectivity Index (CI). Further, we also extend this approach with Weighted Connectivity Index (WCI) and have demonstrated the usefulness of the metric through analytical analysis.","PeriodicalId":424903,"journal":{"name":"2014 28th International Conference on Advanced Information Networking and Applications Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131307845","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}
Live migration of virtual machines (VMs) enables the transfer of a running VM to a new hardware component with minimal and hardly noticeable interruption. It is an important feature of virtualization technology for maintenance, load-balancing and energy reduction, especially for data centers operators and cluster service providers. Recently, virtualization started to find its way into enterprise environments such as large and medium-sized IT companies. However, no feasibility study to highlight the pros and cons of such a trend has been conducted yet. In particular, a seamless live migration requires a reliable network connection and will have an impact on the network infrastructure. Therefore, this paper describes the design and set-up of our test bed to simulate a realistic implementation of virtualization in an enterprise environment. We tested three different scenarios of live migration and checked the impact of each scenario on the network infrastructure. Based on the implementation results, the paper introduces a list of recommendations for IT companies which might be interested in implementing virtualization and live migration.
{"title":"Investigating the Impact of Live Migration on the Network Infrastructure in Enterprise Environments","authors":"Jose Sinti, F. Jiffry, Mahdi Aiash","doi":"10.1109/WAINA.2014.34","DOIUrl":"https://doi.org/10.1109/WAINA.2014.34","url":null,"abstract":"Live migration of virtual machines (VMs) enables the transfer of a running VM to a new hardware component with minimal and hardly noticeable interruption. It is an important feature of virtualization technology for maintenance, load-balancing and energy reduction, especially for data centers operators and cluster service providers. Recently, virtualization started to find its way into enterprise environments such as large and medium-sized IT companies. However, no feasibility study to highlight the pros and cons of such a trend has been conducted yet. In particular, a seamless live migration requires a reliable network connection and will have an impact on the network infrastructure. Therefore, this paper describes the design and set-up of our test bed to simulate a realistic implementation of virtualization in an enterprise environment. We tested three different scenarios of live migration and checked the impact of each scenario on the network infrastructure. Based on the implementation results, the paper introduces a list of recommendations for IT companies which might be interested in implementing virtualization and live migration.","PeriodicalId":424903,"journal":{"name":"2014 28th International Conference on Advanced Information Networking and Applications Workshops","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121366898","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
扫码关注我们
求助内容：
应助结果提醒方式：