Pub Date : 2010-07-26DOI: 10.5220/0002991600940097
J. Molina-Gil, C. Caballero-Gil, P. Caballero-Gil
Vehicular networks are becoming more and more important in our society because of the great benefits that can be obtained from them. Most research contributions propose specific mechanisms where the presence of a Certification Authority is necessary, which implies a centralized system in charge of certification and revocation services. In our work we propose a more realistic view of what will be the beginning of these networks, where privacy and integrity are required and where misbehaving or faulty nodes have to be detected and prevented from disrupting the network operation in a self-organized way.
{"title":"Cooperative approach to self-managed VANETs","authors":"J. Molina-Gil, C. Caballero-Gil, P. Caballero-Gil","doi":"10.5220/0002991600940097","DOIUrl":"https://doi.org/10.5220/0002991600940097","url":null,"abstract":"Vehicular networks are becoming more and more important in our society because of the great benefits that can be obtained from them. Most research contributions propose specific mechanisms where the presence of a Certification Authority is necessary, which implies a centralized system in charge of certification and revocation services. In our work we propose a more realistic view of what will be the beginning of these networks, where privacy and integrity are required and where misbehaving or faulty nodes have to be detected and prevented from disrupting the network operation in a self-organized way.","PeriodicalId":332730,"journal":{"name":"2010 International Conference on Wireless Information Networks and Systems (WINSYS)","volume":"112 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114025465","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-07-26DOI: 10.5220/0002966401570160
A. Salim
In this paper we consider the greedy scheduling algorithm that routes transmission of users' packets based on their reported CSI in the uplink channel to the user with the best instantaneous channel conditions. We propose a scheduling scheme that relies on reporting partial feedback of the CSI. We compare the proposed scheme to the one that uses perfect channel information at the base station, we will see that the proposed scheme has significantly less complexity at the expense of a loss in the system's capacity.
{"title":"Partial feedback multi-user scheduling in multi-antenna systems","authors":"A. Salim","doi":"10.5220/0002966401570160","DOIUrl":"https://doi.org/10.5220/0002966401570160","url":null,"abstract":"In this paper we consider the greedy scheduling algorithm that routes transmission of users' packets based on their reported CSI in the uplink channel to the user with the best instantaneous channel conditions. We propose a scheduling scheme that relies on reporting partial feedback of the CSI. We compare the proposed scheme to the one that uses perfect channel information at the base station, we will see that the proposed scheme has significantly less complexity at the expense of a loss in the system's capacity.","PeriodicalId":332730,"journal":{"name":"2010 International Conference on Wireless Information Networks and Systems (WINSYS)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121609537","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-07-26DOI: 10.5220/0002916900050012
N. Krichene, N. Boudriga
IEEE 802.16e amendments for the mesh mode do not specify particular QoS mechanisms. However, each Mesh Subscriber Station (MSS) transmits its own traffic and forwards the traffic of its children while each traffic flow has its particular QoS constraints. As all forwarded traffics use the same link, one MSS may experience starvation or act selfishly. Besides, the MSS's mobility adds important complexity as all the affected flows need to be re-routed, re-admitted and re-scheduled while respecting their original QoS requirements. In this paper, we adopt the concept of assigning five virtual nodes to each MSS reflecting the five QoS classes of IEEE 802.16e and we propose scheduling the uplink transmissions of the real-time Polling Service (rtPS) traffic class by adopting the Genetic Algorithms concept. We define the priority assigner component which communicates with the scheduler of the mesh BS in order to set and update flows' priority and we optimize the time spent by a flow in the queue while implementing the mobility constraints within the mutation function.
针对mesh模式的IEEE 802.16e修订没有指定特定的QoS机制。然而，每个Mesh Subscriber Station (MSS)传输自己的业务并转发其子业务，而每个业务流都有其特定的QoS约束。由于所有转发的流量都使用同一链路，因此一个MSS可能会遇到饥饿或自私的行为。此外，MSS的移动性增加了重要的复杂性，因为所有受影响的流需要在尊重其原始QoS需求的同时重新路由、重新接收和重新调度。在本文中，我们采用了为每个MSS分配5个虚拟节点的概念，反映了IEEE 802.16e的5个QoS类，我们提出了采用遗传算法的概念来调度实时轮询服务(rtPS)流量类的上行传输。我们定义了优先级分配器组件，该组件与mesh BS的调度程序通信，以设置和更新流的优先级，并优化了流在队列中花费的时间，同时在突变函数中实现了移动性约束。
{"title":"QoS scheduling for IEEE 802.16e mesh mode using Genetic Algorithms","authors":"N. Krichene, N. Boudriga","doi":"10.5220/0002916900050012","DOIUrl":"https://doi.org/10.5220/0002916900050012","url":null,"abstract":"IEEE 802.16e amendments for the mesh mode do not specify particular QoS mechanisms. However, each Mesh Subscriber Station (MSS) transmits its own traffic and forwards the traffic of its children while each traffic flow has its particular QoS constraints. As all forwarded traffics use the same link, one MSS may experience starvation or act selfishly. Besides, the MSS's mobility adds important complexity as all the affected flows need to be re-routed, re-admitted and re-scheduled while respecting their original QoS requirements. In this paper, we adopt the concept of assigning five virtual nodes to each MSS reflecting the five QoS classes of IEEE 802.16e and we propose scheduling the uplink transmissions of the real-time Polling Service (rtPS) traffic class by adopting the Genetic Algorithms concept. We define the priority assigner component which communicates with the scheduler of the mesh BS in order to set and update flows' priority and we optimize the time spent by a flow in the queue while implementing the mobility constraints within the mutation function.","PeriodicalId":332730,"journal":{"name":"2010 International Conference on Wireless Information Networks and Systems (WINSYS)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114626145","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-07-26DOI: 10.5220/0003030701890194
Uta Christoph, Karl-Heinz Krempels, Janno von Stülpnagel, Christoph Terwelp
Mobile devices have obtained a significant role in our life providing a large variety of useful functionalities and features. It is desirable to have an automated adaptation of the behavior of a mobile device depending on a change of user context to fulfill expectations towards practical usefulness. To enable mobile devices to adapt their behavior automatically there is a need to determine the mobile user's context. In this paper we introduce an integrated approach for the automatic detection of a user's context. Therefore, we summarize and discuss existing approaches and technologies and describe a service architecture that takes into account information from the interaction of the mobile device with communication networks and positioning systems, from integrated sensors, and planned behavior of the user from e.g his calendar or activity list. Additionally it considers the social network of the user to derive further information about his context and finally it takes into account his customs through a behavior model.
{"title":"Automatic context detection of a mobile user","authors":"Uta Christoph, Karl-Heinz Krempels, Janno von Stülpnagel, Christoph Terwelp","doi":"10.5220/0003030701890194","DOIUrl":"https://doi.org/10.5220/0003030701890194","url":null,"abstract":"Mobile devices have obtained a significant role in our life providing a large variety of useful functionalities and features. It is desirable to have an automated adaptation of the behavior of a mobile device depending on a change of user context to fulfill expectations towards practical usefulness. To enable mobile devices to adapt their behavior automatically there is a need to determine the mobile user's context. In this paper we introduce an integrated approach for the automatic detection of a user's context. Therefore, we summarize and discuss existing approaches and technologies and describe a service architecture that takes into account information from the interaction of the mobile device with communication networks and positioning systems, from integrated sensors, and planned behavior of the user from e.g his calendar or activity list. Additionally it considers the social network of the user to derive further information about his context and finally it takes into account his customs through a behavior model.","PeriodicalId":332730,"journal":{"name":"2010 International Conference on Wireless Information Networks and Systems (WINSYS)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114747527","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-07-26DOI: 10.5220/0002978601230128
J. P. Carvalho, N. Marques, H. Veiga, C. Pacheco, A. Reis
Wireless communications have been increasingly important. Besides Wi-Fi, FSO plays a very relevant technological role in this context. Performance is essential, resulting in more reliable and efficient communications. A FSO medium range link has been successfully implemented for high requirement applications at Gbps. An experimental performance evaluation of this link has been carried out at OSI layers 1, 4 and 7, through a specifically planned field test arrangement. Several results are presented and discussed, as obtained from simultaneous measurements of powers received by the laser heads, TCP, UDP and FTP experiments, resulting in determinations of TCP throughput, jitter, percentage datagram loss and FTP transfer rate. Conclusions are drawn about link performance.
{"title":"Experimental performance evaluation of a Gbps FSO link: A case study","authors":"J. P. Carvalho, N. Marques, H. Veiga, C. Pacheco, A. Reis","doi":"10.5220/0002978601230128","DOIUrl":"https://doi.org/10.5220/0002978601230128","url":null,"abstract":"Wireless communications have been increasingly important. Besides Wi-Fi, FSO plays a very relevant technological role in this context. Performance is essential, resulting in more reliable and efficient communications. A FSO medium range link has been successfully implemented for high requirement applications at Gbps. An experimental performance evaluation of this link has been carried out at OSI layers 1, 4 and 7, through a specifically planned field test arrangement. Several results are presented and discussed, as obtained from simultaneous measurements of powers received by the laser heads, TCP, UDP and FTP experiments, resulting in determinations of TCP throughput, jitter, percentage datagram loss and FTP transfer rate. Conclusions are drawn about link performance.","PeriodicalId":332730,"journal":{"name":"2010 International Conference on Wireless Information Networks and Systems (WINSYS)","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133526991","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-07-26DOI: 10.5220/0002987200420046
Hao Wu, Chao-Chung Cheng, Z. Zhong
Resource discovery is one of the key issues in mobile P2P studies. Nonetheless, in existing schemes thereare still some deficiencies, such as the lake of flexibility, proportionality and adaptability. In this paper, we present a resource discovery model Mobile-Tapestry (M-Tapestry) for mobile P2P networks based on the P2P Tapestry strategy. The philosophy of this model is to make the network architecture layered, and only a small number of super nodes are chosen instead of all nodes to access the Tapestry system. This measure may reduce the cost of ordinary nodes and solve the reliability problems caused, when the routing table is updated frequently. Additionally, we partition the nodes according to their geographical location, this may avoid the problem that the distance between the nodes having adjacent IDs is actually large due to the Hash operation. Finally, our simulation results and analysis shows that the M-Tapestry strategy has an improved lookup efficiency for mobile P2P networks compared to the Tapestry strategy.
{"title":"A resource discovery strategy for mobile Peer-to-Peer networks","authors":"Hao Wu, Chao-Chung Cheng, Z. Zhong","doi":"10.5220/0002987200420046","DOIUrl":"https://doi.org/10.5220/0002987200420046","url":null,"abstract":"Resource discovery is one of the key issues in mobile P2P studies. Nonetheless, in existing schemes thereare still some deficiencies, such as the lake of flexibility, proportionality and adaptability. In this paper, we present a resource discovery model Mobile-Tapestry (M-Tapestry) for mobile P2P networks based on the P2P Tapestry strategy. The philosophy of this model is to make the network architecture layered, and only a small number of super nodes are chosen instead of all nodes to access the Tapestry system. This measure may reduce the cost of ordinary nodes and solve the reliability problems caused, when the routing table is updated frequently. Additionally, we partition the nodes according to their geographical location, this may avoid the problem that the distance between the nodes having adjacent IDs is actually large due to the Hash operation. Finally, our simulation results and analysis shows that the M-Tapestry strategy has an improved lookup efficiency for mobile P2P networks compared to the Tapestry strategy.","PeriodicalId":332730,"journal":{"name":"2010 International Conference on Wireless Information Networks and Systems (WINSYS)","volume":"718 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116128519","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-07-26DOI: 10.5220/0003105100230028
S. K. Dhurandher, M. Obaidat, Deepank Gupta, Nidhi Gupta, Anupriya Asthana
Security is essential in wireless sensor networks as they are being used in urban environments, life saving disaster management and rescue operations. Any serious attack at the routing layer can cause serious damages. Although a lot of security measures have been proposed for application and transport layer, we have found that there is not enough research geared towards securing the network at the routing layer. In this paper, we propose a novel solution for securing against external as well as internal attacks. The protocol maintains a working network by using redundant multiple paths despite attacks at one route. It also identifies and removes the malicious nodes from the system. Since the system is totally distributed and does not require a central server as required in some of the other protocols, there is no single point of failure. We also keep in mind the limited computing resources and network bandwidth of the wireless sensor nodes. Finally the paper quantifies the protocol's effectiveness against some of the existing secure routing protocols namely QDV and SNEP using simulation studies.
{"title":"Network layer based secure routing protocol for wireless ad hoc sensor networks in urban environments","authors":"S. K. Dhurandher, M. Obaidat, Deepank Gupta, Nidhi Gupta, Anupriya Asthana","doi":"10.5220/0003105100230028","DOIUrl":"https://doi.org/10.5220/0003105100230028","url":null,"abstract":"Security is essential in wireless sensor networks as they are being used in urban environments, life saving disaster management and rescue operations. Any serious attack at the routing layer can cause serious damages. Although a lot of security measures have been proposed for application and transport layer, we have found that there is not enough research geared towards securing the network at the routing layer. In this paper, we propose a novel solution for securing against external as well as internal attacks. The protocol maintains a working network by using redundant multiple paths despite attacks at one route. It also identifies and removes the malicious nodes from the system. Since the system is totally distributed and does not require a central server as required in some of the other protocols, there is no single point of failure. We also keep in mind the limited computing resources and network bandwidth of the wireless sensor nodes. Finally the paper quantifies the protocol's effectiveness against some of the existing secure routing protocols namely QDV and SNEP using simulation studies.","PeriodicalId":332730,"journal":{"name":"2010 International Conference on Wireless Information Networks and Systems (WINSYS)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124804885","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-07-26DOI: 10.5220/0002944501730180
Nikolaos Triantafyllou, Iakovos Ouranos, P. Stefaneas, P. Frangos
OMA-Digital Rights Management System is a standard proposed by the Open Mobile Alliance (OMA) for protecting digital content distribution via mobile networks. To solve the decision problem, in the case that multiple licenses refer to the same content, OMA suggests a license choice algorithm. This algorithm ensures the fine grained consumption of contents. CafeOBJ is a new generation algebraic specification language. We apply the OTS/CafeOBJ method to formally model, specify and verify the above mentioned license choice algorithm. More specifically, we develop the mathematical model of the OMA decision algorithm as an OTS, a kind of transition system expressed in an equational CafeOBJ specification style. Finally, we verify that this algorithm fulfills the following safety property: Whenever a license is chosen for a given content, then the license is valid at that specific time.
{"title":"Formal specification and verification of the OMA license choice algorithm in the OTS/CafeOBJ method","authors":"Nikolaos Triantafyllou, Iakovos Ouranos, P. Stefaneas, P. Frangos","doi":"10.5220/0002944501730180","DOIUrl":"https://doi.org/10.5220/0002944501730180","url":null,"abstract":"OMA-Digital Rights Management System is a standard proposed by the Open Mobile Alliance (OMA) for protecting digital content distribution via mobile networks. To solve the decision problem, in the case that multiple licenses refer to the same content, OMA suggests a license choice algorithm. This algorithm ensures the fine grained consumption of contents. CafeOBJ is a new generation algebraic specification language. We apply the OTS/CafeOBJ method to formally model, specify and verify the above mentioned license choice algorithm. More specifically, we develop the mathematical model of the OMA decision algorithm as an OTS, a kind of transition system expressed in an equational CafeOBJ specification style. Finally, we verify that this algorithm fulfills the following safety property: Whenever a license is chosen for a given content, then the license is valid at that specific time.","PeriodicalId":332730,"journal":{"name":"2010 International Conference on Wireless Information Networks and Systems (WINSYS)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124279737","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-07-26DOI: 10.5220/0002994100470052
Kevin S. Kuciapinski, M. Temple, R. W. Klein
Analysis of variance (ANOVA) is applied to RF DNA fingerprinting techniques to ascertain the most significant signal characteristics that can be used to form robust statistical fingerprint features. The goal is to find features that enable reliable identification of like-model communication devices having different serial numbers. Once achieved, these unique physical layer identities can be used to augment existing bit-level protection mechanisms and overall network security is improved. ANOVA experimentation is generated using a subset of collected signal characteristics (amplitude, phase, frequency, signal-to-noise ratio, etc.) and post-collection processing parameters (bandwidth, fingerprint regions, statistical features, etc.). The ANOVA input is percent correct device classification as obtained from MDA/ML discrimination using three like-model devices from a given manufacturer. Full factorial design experiments and ANOVA are used to determine the significance of individual parameters, and interactions thereof, in achieving higher percentages of correct classification. ANOVA is shown to be well-suited for the task and reveals parametric interactions that are otherwise unobservable using conventional graphical and tabular data representations.
{"title":"ANOVA-based RF DNA analysis: Identifying significant parameters for device classification","authors":"Kevin S. Kuciapinski, M. Temple, R. W. Klein","doi":"10.5220/0002994100470052","DOIUrl":"https://doi.org/10.5220/0002994100470052","url":null,"abstract":"Analysis of variance (ANOVA) is applied to RF DNA fingerprinting techniques to ascertain the most significant signal characteristics that can be used to form robust statistical fingerprint features. The goal is to find features that enable reliable identification of like-model communication devices having different serial numbers. Once achieved, these unique physical layer identities can be used to augment existing bit-level protection mechanisms and overall network security is improved. ANOVA experimentation is generated using a subset of collected signal characteristics (amplitude, phase, frequency, signal-to-noise ratio, etc.) and post-collection processing parameters (bandwidth, fingerprint regions, statistical features, etc.). The ANOVA input is percent correct device classification as obtained from MDA/ML discrimination using three like-model devices from a given manufacturer. Full factorial design experiments and ANOVA are used to determine the significance of individual parameters, and interactions thereof, in achieving higher percentages of correct classification. ANOVA is shown to be well-suited for the task and reveals parametric interactions that are otherwise unobservable using conventional graphical and tabular data representations.","PeriodicalId":332730,"journal":{"name":"2010 International Conference on Wireless Information Networks and Systems (WINSYS)","volume":"22 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128830518","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-07-26DOI: 10.5220/0002912100550060
Benigno Rodríguez
In this paper several hints to be considered in the design of a commercial broadband wireless network are pre-sented. The case of study is based in Worldwide Interoperability for Microwave Access (WiMAX) networks, but the general concepts are also valid for Long Term Evolution (LTE). The information presented here is not only valid for the task of designing a broadband wireless network, but also it can be useful to focus research in the economically most sensitive areas.
{"title":"Planning of a broadband wireless network based in OFDM: General considerations","authors":"Benigno Rodríguez","doi":"10.5220/0002912100550060","DOIUrl":"https://doi.org/10.5220/0002912100550060","url":null,"abstract":"In this paper several hints to be considered in the design of a commercial broadband wireless network are pre-sented. The case of study is based in Worldwide Interoperability for Microwave Access (WiMAX) networks, but the general concepts are also valid for Long Term Evolution (LTE). The information presented here is not only valid for the task of designing a broadband wireless network, but also it can be useful to focus research in the economically most sensitive areas.","PeriodicalId":332730,"journal":{"name":"2010 International Conference on Wireless Information Networks and Systems (WINSYS)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132145833","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
扫码关注我们
求助内容：
应助结果提醒方式：