Pub Date : 2008-11-17DOI: 10.1109/ICCCN.2008.ECP.30
P. Mérindol, Jean-Jacques Pansiot, S. Cateloin
Internet service providers have to provision network resources to optimize bandwidth utilization. Dynamic routing protocols take traffic variations into account to control the load distribution. Multipath routing protocols attempt to take advantage of the path diversity to bring network robustness and reliability. Indeed, with a specific traffic engineering policy, they enable load balancing across several paths. Our aim is to compute a set of loopfree paths in order to allow routers to share the load on several next hops depending on current load measurement. In this paper, we first describe our original Incoming Interface Multipath Routing technique, DT(p), then we present a scheme for load balancing, DT(p)-TE, based on link monitoring. We evaluate and compare our technique with several existing approaches by a set of simulations, using different scenarios and topologies. The simulations results suggest that the path diversity achieved with our proposition can significantly improve the network response time.
{"title":"Improving Load Balancing with Multipath Routing","authors":"P. Mérindol, Jean-Jacques Pansiot, S. Cateloin","doi":"10.1109/ICCCN.2008.ECP.30","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.30","url":null,"abstract":"Internet service providers have to provision network resources to optimize bandwidth utilization. Dynamic routing protocols take traffic variations into account to control the load distribution. Multipath routing protocols attempt to take advantage of the path diversity to bring network robustness and reliability. Indeed, with a specific traffic engineering policy, they enable load balancing across several paths. Our aim is to compute a set of loopfree paths in order to allow routers to share the load on several next hops depending on current load measurement. In this paper, we first describe our original Incoming Interface Multipath Routing technique, DT(p), then we present a scheme for load balancing, DT(p)-TE, based on link monitoring. We evaluate and compare our technique with several existing approaches by a set of simulations, using different scenarios and topologies. The simulations results suggest that the path diversity achieved with our proposition can significantly improve the network response time.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115288704","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 : 2008-11-17DOI: 10.1109/ICCCN.2008.ECP.151
A. Mammeri, A. Khoumsi, D. Ziou, Brahim Hadjou
We address the problem of modeling and adapting JPEG to the energy requirements of visual sensor networks (VSN). For JPEG modeling purposes, we develop a simplified high-level energy consumption model for each stage of JPEG-like scheme, which can be used to roughly evaluate the energy dissipated by a given visual sensor. This model is based on the basic operations needed at each stage of JPEG, and it does not take into account the complexity of implementation. For JPEG adaptation, we propose to process only a reduced part of each block of 8times8 DCT coefficients of the target image, which minimizes the dissipated energy and maximizes the system lifetime, while preserving an adequate image quality at the sink.
{"title":"Modeling and Adapting JPEG to the Energy Requirements of VSN","authors":"A. Mammeri, A. Khoumsi, D. Ziou, Brahim Hadjou","doi":"10.1109/ICCCN.2008.ECP.151","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.151","url":null,"abstract":"We address the problem of modeling and adapting JPEG to the energy requirements of visual sensor networks (VSN). For JPEG modeling purposes, we develop a simplified high-level energy consumption model for each stage of JPEG-like scheme, which can be used to roughly evaluate the energy dissipated by a given visual sensor. This model is based on the basic operations needed at each stage of JPEG, and it does not take into account the complexity of implementation. For JPEG adaptation, we propose to process only a reduced part of each block of 8times8 DCT coefficients of the target image, which minimizes the dissipated energy and maximizes the system lifetime, while preserving an adequate image quality at the sink.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"252 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122491702","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 : 2008-11-17DOI: 10.1109/ICCCN.2008.ECP.150
Junlin Li, G. Al-Regib
In this paper, we consider distributed estimation in energy-limited wireless sensor networks from lifetime-distortion perspective, where the goal is to maximize the network lifetime for a given distortion requirement. To take into account both local quantization and multi-hop transmission, which are essential to save transmission energy and thus prolong the network lifetime, the network lifetime maximization problem is formulated as a nonlinear programming (NLP) problem, where there are three factors needed to be optimized jointly: (i) source coding at each sensor, (ii) source throughput of each sensor, and (iii) multi-hop routing path. Furthermore, we show that this NLP problem can be decoupled without loss of optimality and reformulated as a linear programming (LP) problem. The proposed algorithm is optimal and the simulation results show that a significant gain is achieved by the proposed algorithm compared with heuristic methods.
{"title":"Maximizing Network Lifetime for Estimation in Multi-Hop Wireless Sensor Networks","authors":"Junlin Li, G. Al-Regib","doi":"10.1109/ICCCN.2008.ECP.150","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.150","url":null,"abstract":"In this paper, we consider distributed estimation in energy-limited wireless sensor networks from lifetime-distortion perspective, where the goal is to maximize the network lifetime for a given distortion requirement. To take into account both local quantization and multi-hop transmission, which are essential to save transmission energy and thus prolong the network lifetime, the network lifetime maximization problem is formulated as a nonlinear programming (NLP) problem, where there are three factors needed to be optimized jointly: (i) source coding at each sensor, (ii) source throughput of each sensor, and (iii) multi-hop routing path. Furthermore, we show that this NLP problem can be decoupled without loss of optimality and reformulated as a linear programming (LP) problem. The proposed algorithm is optimal and the simulation results show that a significant gain is achieved by the proposed algorithm compared with heuristic methods.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128542583","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 : 2008-11-17DOI: 10.1109/ICCCN.2008.ECP.57
Bjørnar Libæk, Ø. Kure
The SVC (scalable video coding) extension to the recent video compression standard H.264/MPEG-4 AVC paves the way for video congestion control, by allowing flexible on-the-fly adjustments of the sending rate. We study the interaction between TFRC (TCP-friendly rate control) and application level rate control, and observe that TFRC requires relatively large router buffers to keep packet loss on acceptable levels. In turn, this leads to increased jitter which excludes delay sensitive applications. As a response, the packet pair assisted congestion control is presented and compared with TFRC. The two transport protocols are simulated in a DiffServ environment, and we find that proper congestion control may replace complex admission control mechanisms without sacrificing utilization or QoS guarantees. In fact, the results indicate that semi-elastic video can be sent in an AF (assured forwarding) class with small buffers, leaving the EF (expedited forwarding) class to traffic with more extreme delay requirements.
{"title":"Congestion Control for Scalable VBR Video with Packet Pair Assistance","authors":"Bjørnar Libæk, Ø. Kure","doi":"10.1109/ICCCN.2008.ECP.57","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.57","url":null,"abstract":"The SVC (scalable video coding) extension to the recent video compression standard H.264/MPEG-4 AVC paves the way for video congestion control, by allowing flexible on-the-fly adjustments of the sending rate. We study the interaction between TFRC (TCP-friendly rate control) and application level rate control, and observe that TFRC requires relatively large router buffers to keep packet loss on acceptable levels. In turn, this leads to increased jitter which excludes delay sensitive applications. As a response, the packet pair assisted congestion control is presented and compared with TFRC. The two transport protocols are simulated in a DiffServ environment, and we find that proper congestion control may replace complex admission control mechanisms without sacrificing utilization or QoS guarantees. In fact, the results indicate that semi-elastic video can be sent in an AF (assured forwarding) class with small buffers, leaving the EF (expedited forwarding) class to traffic with more extreme delay requirements.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128545296","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 : 2008-11-17DOI: 10.1109/ICCCN.2008.ECP.177
Hyun Seok Kim, Jin-Young Choi
A radio frequency identification (RFID) is an important part in mobile and ubiquitous domain, and brings enormous productivity benefits in applications where objects require automatic identification. However, this pervasive use of RFID tags opens up the possibility of various attacks that violate user privacy and authentication. Security mechanisms for RFID systems are therefore of the utmost important. In this paper, the RFID security protocols (HB++[first] and HB++[second]) presented in Bringer et al. are shown to be vulnerable to active attacks and a modified solution is presented. Some of the security violations that may occur and possible remedies that were provided in the literature are discussed. Finally, the modifications to HB++, a recent variant of HB is proposed.
{"title":"A Lightweight Protocol Analysis and Modification for Secure RFID System","authors":"Hyun Seok Kim, Jin-Young Choi","doi":"10.1109/ICCCN.2008.ECP.177","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.177","url":null,"abstract":"A radio frequency identification (RFID) is an important part in mobile and ubiquitous domain, and brings enormous productivity benefits in applications where objects require automatic identification. However, this pervasive use of RFID tags opens up the possibility of various attacks that violate user privacy and authentication. Security mechanisms for RFID systems are therefore of the utmost important. In this paper, the RFID security protocols (HB++[first] and HB++[second]) presented in Bringer et al. are shown to be vulnerable to active attacks and a modified solution is presented. Some of the security violations that may occur and possible remedies that were provided in the literature are discussed. Finally, the modifications to HB++, a recent variant of HB is proposed.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129656820","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 : 2008-11-17DOI: 10.1109/ICCCN.2008.ECP.158
A. Tucholski, Agnieszka Francesson, A. Majka, Joanna Sasin, Marcin Pilarski
The method of finding point of bending on efficiency curve in a distributed systems has been presented. The performance of distributed environment was studied as a cost function of mean network throughput and memory buffers availability. The method can be used then to build up an autonomic bandwidth management. The bounding point on efficiency curve was found as well analytically as for testing facility of a distributed laboratory environment. The influence of data replication and scheduling strategy on final results has been included. The computer simulation has been supported by analytical calculation. Two regions of different behavior on universal hyperbolic like dependence of the performance versus mean network throughput was shown up. A method of finding bounding point has been discuss in order to optimize efficiency of the considered system by such parameters like memory buffers and network bandwidth.
{"title":"Bandwidth Management For Distributed Systems","authors":"A. Tucholski, Agnieszka Francesson, A. Majka, Joanna Sasin, Marcin Pilarski","doi":"10.1109/ICCCN.2008.ECP.158","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.158","url":null,"abstract":"The method of finding point of bending on efficiency curve in a distributed systems has been presented. The performance of distributed environment was studied as a cost function of mean network throughput and memory buffers availability. The method can be used then to build up an autonomic bandwidth management. The bounding point on efficiency curve was found as well analytically as for testing facility of a distributed laboratory environment. The influence of data replication and scheduling strategy on final results has been included. The computer simulation has been supported by analytical calculation. Two regions of different behavior on universal hyperbolic like dependence of the performance versus mean network throughput was shown up. A method of finding bounding point has been discuss in order to optimize efficiency of the considered system by such parameters like memory buffers and network bandwidth.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113955711","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 : 2008-11-17DOI: 10.1109/ICCCN.2008.ECP.173
Shiqian Wu, Weisi Lin
This paper derives the formulae for defocus blur parameter from a single image, based upon the line spread function (LSF). To achieve high accuracy and robustness, the over determining strategies are adopted: 1) a number of LSFs on one edge are extracted; 2) more edges in the images are used. The trust-region method is then employed to obtain the optimal estimation of blur parameter. The experimental results have demonstrated the effectiveness of the proposed method. It can be used for blind image quality evaluation in vision-based applications.
{"title":"Defocus Estimation from a Single Image","authors":"Shiqian Wu, Weisi Lin","doi":"10.1109/ICCCN.2008.ECP.173","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.173","url":null,"abstract":"This paper derives the formulae for defocus blur parameter from a single image, based upon the line spread function (LSF). To achieve high accuracy and robustness, the over determining strategies are adopted: 1) a number of LSFs on one edge are extracted; 2) more edges in the images are used. The trust-region method is then employed to obtain the optimal estimation of blur parameter. The experimental results have demonstrated the effectiveness of the proposed method. It can be used for blind image quality evaluation in vision-based applications.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124497270","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 : 2008-11-17DOI: 10.1109/ICCCN.2008.ECP.125
Xianren Wu, Hui Xu, H. Sadjadpour, J. Garcia-Luna-Aceves
We present a mathematical framework for the performance evaluation of proactive and reactive routing protocols operating in mobile ad hoc networks (MANETs). The model captures the functionality of the routing protocols together with the characterization of the performance of the medium access control protocol (MAC). It reveals the interplay between the protocol functionality and network parameters, and provides new insight on the relative benefits of proactive and on-demand routing in MANETS. The analytical results are corroborated with results obtained using discrete-event simulations.
{"title":"Proactive or Reactive Routing: A Unified Analytical Framework in MANETs","authors":"Xianren Wu, Hui Xu, H. Sadjadpour, J. Garcia-Luna-Aceves","doi":"10.1109/ICCCN.2008.ECP.125","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.125","url":null,"abstract":"We present a mathematical framework for the performance evaluation of proactive and reactive routing protocols operating in mobile ad hoc networks (MANETs). The model captures the functionality of the routing protocols together with the characterization of the performance of the medium access control protocol (MAC). It reveals the interplay between the protocol functionality and network parameters, and provides new insight on the relative benefits of proactive and on-demand routing in MANETS. The analytical results are corroborated with results obtained using discrete-event simulations.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126551547","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 existing vehicular sensors of taxi companies in most of cities can be used for traffic monitoring, however sensors are always set with a long sampling interval because of communication cost saving and network congestion avoidance. In this paper, we focus on the traffic data processing in vehicular sensor networks providing sparse and incomplete information. A performance evaluation study has been carried out in Shanghai by utilizing the sensors installed on 4000 taxis. Two types of traffic status estimation algorithms, the link-based and the vehicle-based, are introduced based on such data basis. The results from large-scale testing cases show that the traffic status can be fairly well estimated based on these imperfect data and we demonstrate the feasibility of such application in most of cities.
{"title":"Traffic Data Processing in Vehicular Sensor Networks","authors":"Xu Li, W. Shu, Minglu Li, Pei'en Luo, Hongyu Huang, Minyou Wu","doi":"10.1109/ICCCN.2008.ECP.42","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.42","url":null,"abstract":"The existing vehicular sensors of taxi companies in most of cities can be used for traffic monitoring, however sensors are always set with a long sampling interval because of communication cost saving and network congestion avoidance. In this paper, we focus on the traffic data processing in vehicular sensor networks providing sparse and incomplete information. A performance evaluation study has been carried out in Shanghai by utilizing the sensors installed on 4000 taxis. Two types of traffic status estimation algorithms, the link-based and the vehicle-based, are introduced based on such data basis. The results from large-scale testing cases show that the traffic status can be fairly well estimated based on these imperfect data and we demonstrate the feasibility of such application in most of cities.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128074264","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 : 2008-11-17DOI: 10.1109/ICCCN.2008.ECP.138
Tao Sheng, B. Oh, Guogang Hua, Hongxing Guo, Jing-li Zhou, C. Chen
This paper presents a new scheme for robust video transmission over packet erasure wireless channels based on Wyner-Ziv coding of motion regions. The multipath fading and shading of the wireless channels usually lead to loss or erroneous video packets which on occasions result in some spontaneous drop in video quality. Existing approaches with forward error correction (FEC) and error concealment have not been able to provide the desired robustness in video transmission. We develop a new scheme with a motion-based Wyner-Ziv coding (MWZC) by leveraging distributed source coding (DSC) ideas for error robustness. This new scheme is based on the fact that motion regions of a given video frame are particularly important in both objective and perceptual video quality and hence should be given preferential Wyner-Ziv coding based embedded protection. To achieve high coding efficiency, we determine the underlining motion regions based on a rate-distortion model. Within the framework of H.264/AVC specification, motion region determination can be efficiently implemented using flexible macroblock ordering (FMO) and data partitioning (DP). The bit stream generated by the proposed scheme consists two parts: the systematic portion generated from conventional H.264/AVC bit stream and the supplementary bit stream for error robust video transmission generated by the Wyner-Ziv coding of motion regions. Experimental results demonstrate that the proposed scheme significantly outperforms both decoder-based error concealment (DBEC) and conventional FEC with DBEC approaches.
{"title":"Robust Video Transmission Over Packet Erasure Wireless Channels Based on Wyner-Ziv Coding of Motion Regions","authors":"Tao Sheng, B. Oh, Guogang Hua, Hongxing Guo, Jing-li Zhou, C. Chen","doi":"10.1109/ICCCN.2008.ECP.138","DOIUrl":"https://doi.org/10.1109/ICCCN.2008.ECP.138","url":null,"abstract":"This paper presents a new scheme for robust video transmission over packet erasure wireless channels based on Wyner-Ziv coding of motion regions. The multipath fading and shading of the wireless channels usually lead to loss or erroneous video packets which on occasions result in some spontaneous drop in video quality. Existing approaches with forward error correction (FEC) and error concealment have not been able to provide the desired robustness in video transmission. We develop a new scheme with a motion-based Wyner-Ziv coding (MWZC) by leveraging distributed source coding (DSC) ideas for error robustness. This new scheme is based on the fact that motion regions of a given video frame are particularly important in both objective and perceptual video quality and hence should be given preferential Wyner-Ziv coding based embedded protection. To achieve high coding efficiency, we determine the underlining motion regions based on a rate-distortion model. Within the framework of H.264/AVC specification, motion region determination can be efficiently implemented using flexible macroblock ordering (FMO) and data partitioning (DP). The bit stream generated by the proposed scheme consists two parts: the systematic portion generated from conventional H.264/AVC bit stream and the supplementary bit stream for error robust video transmission generated by the Wyner-Ziv coding of motion regions. Experimental results demonstrate that the proposed scheme significantly outperforms both decoder-based error concealment (DBEC) and conventional FEC with DBEC approaches.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"57 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113961703","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
扫码关注我们
求助内容：
应助结果提醒方式：