Evjola Spaho, Kevin Bylykbashi, L. Barolli, Vladi Koliçi, Algenti Lala
In this paper, we evaluate and compare the performance of four different routing protocols in a many-to-one communication opportunistic network. Seven groups with three stationary sensor nodes sense the temperature, humidity and wind speed and send these data to a stationary destination node that collect them for statistical and data analysis purposes. Vehicles moving in Tirana city roads during the opportunistic contacts will exchange the sensed data to destination node. The simulations are conducted with the Opportunistic Network Environment (ONE) simulator. For the simulations we considered two different scenarios where the distance of the source nodes from the destination is short and long. The performance is analyzed using delivery probability, overhead ratio, average latency, average number of hops and average buffer time metrics. For both scenarios the effect of increasing ttl is evaluated. The simulation results show that the increase of ttl from 15 min to 60 min slightly effects the performance of all protocols. By increasing the distance between source nodes and destination node, delivery probability is decreased almost10% for all protocols, the overhead for spray and wait does not change, but for other protocols is slightly increased and theaverage number of hops and average latency is increased.
{"title":"Evaluation of Different DTN Routing Protocols in an Opportunistic Network Considering Many-to-One Communication Scenario","authors":"Evjola Spaho, Kevin Bylykbashi, L. Barolli, Vladi Koliçi, Algenti Lala","doi":"10.1109/NBiS.2016.84","DOIUrl":"https://doi.org/10.1109/NBiS.2016.84","url":null,"abstract":"In this paper, we evaluate and compare the performance of four different routing protocols in a many-to-one communication opportunistic network. Seven groups with three stationary sensor nodes sense the temperature, humidity and wind speed and send these data to a stationary destination node that collect them for statistical and data analysis purposes. Vehicles moving in Tirana city roads during the opportunistic contacts will exchange the sensed data to destination node. The simulations are conducted with the Opportunistic Network Environment (ONE) simulator. For the simulations we considered two different scenarios where the distance of the source nodes from the destination is short and long. The performance is analyzed using delivery probability, overhead ratio, average latency, average number of hops and average buffer time metrics. For both scenarios the effect of increasing ttl is evaluated. The simulation results show that the increase of ttl from 15 min to 60 min slightly effects the performance of all protocols. By increasing the distance between source nodes and destination node, delivery probability is decreased almost10% for all protocols, the overhead for spray and wait does not change, but for other protocols is slightly increased and theaverage number of hops and average latency is increased.","PeriodicalId":390397,"journal":{"name":"2016 19th International Conference on Network-Based Information Systems (NBiS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122294204","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}
Hiroki Nakayama, Shigenari Nakamura, T. Enokido, M. Takizawa
An event-driven publish/subscribe (PS) model of a distributed system is used in various applications. In this paper, we discuss a peer-to-peer (P2P) model of a topic-based PS system (P2PPS model) where each peer process (peer) can both subscribe interesting topics and publish event messages with topics. In our previous studies, we propose the TBC (topicbased causally delivery) protocol an homogeneous networks where maximum delay time between every pair of peers is same. Here, a pair of event messages are checked if the event messages are related in the topic vector and are causally delivered by taking advantage of physical time and linear time. In this paper, we consider a system where peers are interconnected in heterogeneous networks. Here, maximum delay time between every pair of peers is not same. We propose a heterogeneous TBC (HTBC) protocol where event messages are TBC-causally delivered to target peers in heterogeneous network. We evaluate the HTBC protocol and show the number of pair of event messages unnecessarily ordered is reduced in the HTBC protocol.
{"title":"Topic-Based Causally Ordered Delivery of Event Messages in a Peer-to-Peer (P2P) Model of Publish/Subscribe Systems","authors":"Hiroki Nakayama, Shigenari Nakamura, T. Enokido, M. Takizawa","doi":"10.1109/NBiS.2016.89","DOIUrl":"https://doi.org/10.1109/NBiS.2016.89","url":null,"abstract":"An event-driven publish/subscribe (PS) model of a distributed system is used in various applications. In this paper, we discuss a peer-to-peer (P2P) model of a topic-based PS system (P2PPS model) where each peer process (peer) can both subscribe interesting topics and publish event messages with topics. In our previous studies, we propose the TBC (topicbased causally delivery) protocol an homogeneous networks where maximum delay time between every pair of peers is same. Here, a pair of event messages are checked if the event messages are related in the topic vector and are causally delivered by taking advantage of physical time and linear time. In this paper, we consider a system where peers are interconnected in heterogeneous networks. Here, maximum delay time between every pair of peers is not same. We propose a heterogeneous TBC (HTBC) protocol where event messages are TBC-causally delivered to target peers in heterogeneous network. We evaluate the HTBC protocol and show the number of pair of event messages unnecessarily ordered is reduced in the HTBC protocol.","PeriodicalId":390397,"journal":{"name":"2016 19th International Conference on Network-Based Information Systems (NBiS)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116856591","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}
Localization has been a fundermental and crucial issue for wireless sensor networks (WSNs). In this paper, we propose a distributed range-free localization scheme based on RSS rank vectors (RRV). In RRV, each normal node is first localized in an estimative rectangle based on the connectivity constraints. Then the estimative rectangle of the normal node is refined with the RSS rank vector. At last, the centroid of the estimated residence area is calculated as the location of the normal node. The performance of the proposed methods is validated through simulations. Results confirm that RRV outperforms competing localization approaches.
{"title":"Localization in Wireless Sensor Networks Based on RSS Rank Vectors","authors":"Zengfeng Wang, H. Zhang, Tingting Lv","doi":"10.1109/NBiS.2016.6","DOIUrl":"https://doi.org/10.1109/NBiS.2016.6","url":null,"abstract":"Localization has been a fundermental and crucial issue for wireless sensor networks (WSNs). In this paper, we propose a distributed range-free localization scheme based on RSS rank vectors (RRV). In RRV, each normal node is first localized in an estimative rectangle based on the connectivity constraints. Then the estimative rectangle of the normal node is refined with the RSS rank vector. At last, the centroid of the estimated residence area is calculated as the location of the normal node. The performance of the proposed methods is validated through simulations. Results confirm that RRV outperforms competing localization approaches.","PeriodicalId":390397,"journal":{"name":"2016 19th International Conference on Network-Based Information Systems (NBiS)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123455532","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}
Adnan Ahmad, N. Javaid, Saeed Ahmad, S. Saud, U. Qasim, Z. Khan
One of the most promising concepts which make smart grid (SG) superior over the traditional grid is demand side management (DSM). However, most of the recent DSM techniques are centralized by nature and primarily focus on industrial consumers. In contrast, this paper proposes a realistic home energy management system (RHEMS) which incorporate the residential sector into DSM activities and facilitate the integration of renewable energy sources (RESs). Our proposed RHEMS handle the problem of cost minimization as an optimization problem, and household appliances along with RES are scheduled in response to the real-time pricing of the electricity market. First, the constrained optimization problem is mathematically formulated and then solved by using the genetic algorithm. Simulation results show that the proposed scheme significantly reduce the energy expenses of the consumer i.e. by 35.53%.
{"title":"Realistic Home Energy Management System Using Exogenous Grid Signals","authors":"Adnan Ahmad, N. Javaid, Saeed Ahmad, S. Saud, U. Qasim, Z. Khan","doi":"10.1109/NBiS.2016.78","DOIUrl":"https://doi.org/10.1109/NBiS.2016.78","url":null,"abstract":"One of the most promising concepts which make smart grid (SG) superior over the traditional grid is demand side management (DSM). However, most of the recent DSM techniques are centralized by nature and primarily focus on industrial consumers. In contrast, this paper proposes a realistic home energy management system (RHEMS) which incorporate the residential sector into DSM activities and facilitate the integration of renewable energy sources (RESs). Our proposed RHEMS handle the problem of cost minimization as an optimization problem, and household appliances along with RES are scheduled in response to the real-time pricing of the electricity market. First, the constrained optimization problem is mathematically formulated and then solved by using the genetic algorithm. Simulation results show that the proposed scheme significantly reduce the energy expenses of the consumer i.e. by 35.53%.","PeriodicalId":390397,"journal":{"name":"2016 19th International Conference on Network-Based Information Systems (NBiS)","volume":"94 17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129056904","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A two-stage centroid localization algorithm for wireless networks (WSNs) based on received signal strength (RSS) is proposed. In the first stage, the unknown node performs symmetric lens presence tests to construct a virtual neighboring anchor list. By using the locations of two neighboring anchors and the RSS relationships, a symmetric lens presence test determines a residence area of the unknown node which is geometrically shaped as a half-symmetric lens. The centroid of the estimated residence area is then defined as a virtual neighboring anchor. In the second stage, the location of the unknown node is estimated based on the virtual neighboring anchor locations, using the centroid formula. Simulation results show that the proposed method has better performance compared to other two typical range-free localization methods.
{"title":"Two-Stage Centroid Localization for Wireless Sensor Networks Using Received Signal Strength","authors":"Zengfeng Wang, Yujuan Sun, H. Zhang, Tingting Lv","doi":"10.1109/NBiS.2016.7","DOIUrl":"https://doi.org/10.1109/NBiS.2016.7","url":null,"abstract":"A two-stage centroid localization algorithm for wireless networks (WSNs) based on received signal strength (RSS) is proposed. In the first stage, the unknown node performs symmetric lens presence tests to construct a virtual neighboring anchor list. By using the locations of two neighboring anchors and the RSS relationships, a symmetric lens presence test determines a residence area of the unknown node which is geometrically shaped as a half-symmetric lens. The centroid of the estimated residence area is then defined as a virtual neighboring anchor. In the second stage, the location of the unknown node is estimated based on the virtual neighboring anchor locations, using the centroid formula. Simulation results show that the proposed method has better performance compared to other two typical range-free localization methods.","PeriodicalId":390397,"journal":{"name":"2016 19th International Conference on Network-Based Information Systems (NBiS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114270345","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}
Due to the recent popularization of hybrid Webcast environments, streaming delivery using broadcast and telecommunication is attracting great attention. In streaming delivery on the hybrid broadcasting environment, clients concurrently receive streaming data such as music or movies from both broadcasting and telecommunication systems. Although these systems compensate for the demerits of each other, the waiting time is lengthened if the system does not deliver the data efficiently. To reduce this waiting time, many researches have been proposed scheduling methods. However, since most scheduling methods use a computer simulation, they do not show clearly the effectiveness. In this paper, we implement a hybrid broadcasting system to solve the problem in the conventional methods. In our proposed system, we evaluate the effectiveness for reducing the waiting time using scheduling methods.
{"title":"Hybrid Broadcasting System for Webcast","authors":"T. Ozaki, Y. Gotoh","doi":"10.1109/NBiS.2016.45","DOIUrl":"https://doi.org/10.1109/NBiS.2016.45","url":null,"abstract":"Due to the recent popularization of hybrid Webcast environments, streaming delivery using broadcast and telecommunication is attracting great attention. In streaming delivery on the hybrid broadcasting environment, clients concurrently receive streaming data such as music or movies from both broadcasting and telecommunication systems. Although these systems compensate for the demerits of each other, the waiting time is lengthened if the system does not deliver the data efficiently. To reduce this waiting time, many researches have been proposed scheduling methods. However, since most scheduling methods use a computer simulation, they do not show clearly the effectiveness. In this paper, we implement a hybrid broadcasting system to solve the problem in the conventional methods. In our proposed system, we evaluate the effectiveness for reducing the waiting time using scheduling methods.","PeriodicalId":390397,"journal":{"name":"2016 19th International Conference on Network-Based Information Systems (NBiS)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121821454","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}
N. Iftikhar, Xiufeng Liu, F. Nordbjerg, Sergiu Danalachi
With the prevalence of cloud computing and Internet of Things (IoT), smart meters have become one of the main components of smart city strategies. Smart meters generate large amounts of fine-grained data that is used to provide useful information to consumers and utility companies for decision making. Now-a-days, smart meter analytics systems consist of analytical algorithms that process massive amounts of data. These analytics algorithms require ample amounts of realistic data for testing and verification purposes. However, it is usually difficult to obtain adequate amounts of realistic data, mainly due to privacy issues. This paper proposes a smart meter data generator that can generate realistic energy consumption data by making use of a small real-world data set as seed. The generator generates data using a prediction-based method that depends on historical energy consumption patterns along with Gaussian white noise. In this paper, we comprehensively evaluate the efficiency and effectiveness of the proposed method based on a real-world energy data set.
{"title":"A Prediction-Based Smart Meter Data Generator","authors":"N. Iftikhar, Xiufeng Liu, F. Nordbjerg, Sergiu Danalachi","doi":"10.1109/NBiS.2016.15","DOIUrl":"https://doi.org/10.1109/NBiS.2016.15","url":null,"abstract":"With the prevalence of cloud computing and Internet of Things (IoT), smart meters have become one of the main components of smart city strategies. Smart meters generate large amounts of fine-grained data that is used to provide useful information to consumers and utility companies for decision making. Now-a-days, smart meter analytics systems consist of analytical algorithms that process massive amounts of data. These analytics algorithms require ample amounts of realistic data for testing and verification purposes. However, it is usually difficult to obtain adequate amounts of realistic data, mainly due to privacy issues. This paper proposes a smart meter data generator that can generate realistic energy consumption data by making use of a small real-world data set as seed. The generator generates data using a prediction-based method that depends on historical energy consumption patterns along with Gaussian white noise. In this paper, we comprehensively evaluate the efficiency and effectiveness of the proposed method based on a real-world energy data set.","PeriodicalId":390397,"journal":{"name":"2016 19th International Conference on Network-Based Information Systems (NBiS)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122503447","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}
Masahiro Fujita, Yuto Mano, Takuya Kaneko, Kenta Takahashi, M. Nishigaki
We propose a new biometric authentication mechanism called "micro biometric authentication". This mechanism uses minute patterns of human body parts as biometric information. Minimization of the biometric information used for the authentication enables the mechanism to satisfy the following three requirements needed for biometric authentication systems: (i) higher tolerance against a masquerade attack, (ii) consideration of the issue of traceability, and (iii) higher authentication accuracy. As a first attempt, we developed a micro biometric authentication system that uses minute patterns of human skin texture. Experimental results showed that the system can achieve an EER of about 0.5% and that the mechanism satisfies all three requirements.
{"title":"A Micro Biometric Authentication Mechanism Considering Minute Patterns of the Human Body: A Proposal and the First Attempt","authors":"Masahiro Fujita, Yuto Mano, Takuya Kaneko, Kenta Takahashi, M. Nishigaki","doi":"10.1109/NBiS.2016.13","DOIUrl":"https://doi.org/10.1109/NBiS.2016.13","url":null,"abstract":"We propose a new biometric authentication mechanism called \"micro biometric authentication\". This mechanism uses minute patterns of human body parts as biometric information. Minimization of the biometric information used for the authentication enables the mechanism to satisfy the following three requirements needed for biometric authentication systems: (i) higher tolerance against a masquerade attack, (ii) consideration of the issue of traceability, and (iii) higher authentication accuracy. As a first attempt, we developed a micro biometric authentication system that uses minute patterns of human skin texture. Experimental results showed that the system can achieve an EER of about 0.5% and that the mechanism satisfies all three requirements.","PeriodicalId":390397,"journal":{"name":"2016 19th International Conference on Network-Based Information Systems (NBiS)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128574606","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}
Ryoma Watanabe, Dilawaer Duolikun, T. Enokido, M. Takizawa
It is critical to reduce the electric energy consumed by servers in clusters. In cloud computing systems, computation resources like CPU, memory, and storages are virtualized so that applications can use the resources without being conscious of which physical servers supports which service. Virtual machine technologies are now used to support applications with virtual computation service. Virtual machines are used to perform application processes issued by clients. More importantly, virtual machines can migrate from a host server to a guest server while processes are being performed on the virtual machines. In this paper, we take advantage of migration technologies of virtual machines to reduce the electric energy consumed by servers in a cluster. By using the virtual machines, we propose an energyaware migration model of processes to decide to which virtual machine a process issued by a client is allocated and which virtual machine migrates to another energy-efficient server in order to reduce the electric energy consumption.
{"title":"An Eco Model of Process Migration with Virtual Machines","authors":"Ryoma Watanabe, Dilawaer Duolikun, T. Enokido, M. Takizawa","doi":"10.1109/NBiS.2016.72","DOIUrl":"https://doi.org/10.1109/NBiS.2016.72","url":null,"abstract":"It is critical to reduce the electric energy consumed by servers in clusters. In cloud computing systems, computation resources like CPU, memory, and storages are virtualized so that applications can use the resources without being conscious of which physical servers supports which service. Virtual machine technologies are now used to support applications with virtual computation service. Virtual machines are used to perform application processes issued by clients. More importantly, virtual machines can migrate from a host server to a guest server while processes are being performed on the virtual machines. In this paper, we take advantage of migration technologies of virtual machines to reduce the electric energy consumed by servers in a cluster. By using the virtual machines, we propose an energyaware migration model of processes to decide to which virtual machine a process issued by a client is allocated and which virtual machine migrates to another energy-efficient server in order to reduce the electric energy consumption.","PeriodicalId":390397,"journal":{"name":"2016 19th International Conference on Network-Based Information Systems (NBiS)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116178310","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}
Takamichi Saito, Ryohei Watanabe, Shuta Kondo, S. Sugawara, Masahiro Yokoyama
Memory corruption vulnerability is prevalent in software that are written using languages that lack memory safety features, e.g., C and C++. This has become a serious problem because the number of the attacks that exploit this vulnerability has increased. More specifically, this vulnerability allows control-flow-hijacking, a memory corruption attack that involves a well-known dangerous program stack. Several countermeasures have been proposed both in academia and the information technology industry to thwart such attacks. Some of these countermeasures have been implemented and used in practice. However, memory corruption attacks continue to be a serious problem because even these countermeasures are simply bypassed by new attacks. In this paper, we survey and classify protection and mitigation technologies that are especially pervasive in operating systems and compilers. This study aims to organize the pervasive countermeasures against these attacks. We present the existing countermeasures to address the current serious problem and propose modifications to these countermeasures that can be implemented in the future.
{"title":"A Survey of Prevention/Mitigation against Memory Corruption Attacks","authors":"Takamichi Saito, Ryohei Watanabe, Shuta Kondo, S. Sugawara, Masahiro Yokoyama","doi":"10.1109/NBiS.2016.11","DOIUrl":"https://doi.org/10.1109/NBiS.2016.11","url":null,"abstract":"Memory corruption vulnerability is prevalent in software that are written using languages that lack memory safety features, e.g., C and C++. This has become a serious problem because the number of the attacks that exploit this vulnerability has increased. More specifically, this vulnerability allows control-flow-hijacking, a memory corruption attack that involves a well-known dangerous program stack. Several countermeasures have been proposed both in academia and the information technology industry to thwart such attacks. Some of these countermeasures have been implemented and used in practice. However, memory corruption attacks continue to be a serious problem because even these countermeasures are simply bypassed by new attacks. In this paper, we survey and classify protection and mitigation technologies that are especially pervasive in operating systems and compilers. This study aims to organize the pervasive countermeasures against these attacks. We present the existing countermeasures to address the current serious problem and propose modifications to these countermeasures that can be implemented in the future.","PeriodicalId":390397,"journal":{"name":"2016 19th International Conference on Network-Based Information Systems (NBiS)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125922199","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
扫码关注我们
求助内容：
应助结果提醒方式：