Jiyu Zhang, Liusheng Huang, Hongli Xu, Mingjun Xiao, W. Guo
In order to protect legitimate vehicles from cheating by spurious alert messages, we propose a general filter model for Vehicular Ad-hoc Network (VANET) to distinguish spurious messages from valid ones. It is a two-layer filter, the coarse filter is responsible for rapid filtration and the fine filter is for accurate filtration. The data flow should pass through them to get the classification results. The coarse filter makes a judgment by combining several sources of information such as timeliness of the report and correlation of the accident location while the fine filter is based on Back Propagation Neural Network (BPNN) which includes an incremental learning part. The BPNN module refers to vehicles' reputations and behaviors in response to an event, and the support from neighbors will also be a great help. In this paper, we compare the filtering effect of incremental BPNN with several commonly used decision logics including majority voting, weighted voting and Bayesian method. The simulation results show that our scheme performs better both in filtering reliability and stability.
{"title":"An Incremental BP Neural Network Based Spurious Message Filter for VANET","authors":"Jiyu Zhang, Liusheng Huang, Hongli Xu, Mingjun Xiao, W. Guo","doi":"10.1109/CyberC.2012.67","DOIUrl":"https://doi.org/10.1109/CyberC.2012.67","url":null,"abstract":"In order to protect legitimate vehicles from cheating by spurious alert messages, we propose a general filter model for Vehicular Ad-hoc Network (VANET) to distinguish spurious messages from valid ones. It is a two-layer filter, the coarse filter is responsible for rapid filtration and the fine filter is for accurate filtration. The data flow should pass through them to get the classification results. The coarse filter makes a judgment by combining several sources of information such as timeliness of the report and correlation of the accident location while the fine filter is based on Back Propagation Neural Network (BPNN) which includes an incremental learning part. The BPNN module refers to vehicles' reputations and behaviors in response to an event, and the support from neighbors will also be a great help. In this paper, we compare the filtering effect of incremental BPNN with several commonly used decision logics including majority voting, weighted voting and Bayesian method. The simulation results show that our scheme performs better both in filtering reliability and stability.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126092004","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}
Discrete Wavelet Transform (DWT) is widely-used in image and video processing with high computing complexity and regular data flow, which is suitable for the implementation on a Coarse-grained Reconfigurable Architecture (CGRA) owing to its rich parallel computing resources. In this article, the two wavelet filters adopted in JPEG2000 image standard, 5/3 DWT and 9/7 DWT, were realized on a CGRA platform called Reconfigurable Multimedia System-II (REMUS-II). The result shows that the CGRA-based implementation has advantage in area, power and performance over the state-of the-art GPU including 7800GTX and 9800GTX. The die size and power consumption of REMUS-II is respectively less than 1% and 10% compared to the GPU implementations, whereas the performance speed-up is 92.9x for 9/7 filter compared to GPU 7800GTX and 6.54x for 5/3 filter compared to GPU 9800GTX.
{"title":"A New Approach to Implement Discrete Wavelet Transform on Coarse-Grained Reconfigurable Architecture","authors":"Jie Li, Xinxiang Ke, Peng Cao, Weiwei Shan","doi":"10.1109/CyberC.2012.56","DOIUrl":"https://doi.org/10.1109/CyberC.2012.56","url":null,"abstract":"Discrete Wavelet Transform (DWT) is widely-used in image and video processing with high computing complexity and regular data flow, which is suitable for the implementation on a Coarse-grained Reconfigurable Architecture (CGRA) owing to its rich parallel computing resources. In this article, the two wavelet filters adopted in JPEG2000 image standard, 5/3 DWT and 9/7 DWT, were realized on a CGRA platform called Reconfigurable Multimedia System-II (REMUS-II). The result shows that the CGRA-based implementation has advantage in area, power and performance over the state-of the-art GPU including 7800GTX and 9800GTX. The die size and power consumption of REMUS-II is respectively less than 1% and 10% compared to the GPU implementations, whereas the performance speed-up is 92.9x for 9/7 filter compared to GPU 7800GTX and 6.54x for 5/3 filter compared to GPU 9800GTX.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"267 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116065424","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}
We focus on the problem of links scheduling in heterogeneous wireless sensor networks. Links scheduling becomes more difficult due to the diversity of workload among sensor nodes. An improper links scheduling strategy will lead to high end-to-end delay and then diminish the data availability. We assume the energy cost of state transition cannot be ignored, especially for wireless multimedia sensor node which equips with camera and higher performance processor compared to scalar sensor node. In this paper, we use the conflict graph to model the conflicts among nodes and then propose a workload-aware heuristic scheduling algorithm. In the scheduling, each node can obtain consecutive time-slots to transmit all data at a schedule transmission, and the number of time-slots is calculated based on nodeâs workload. Hence, it is possible for our scheduling to reduce the end-to-end delay and save energy consumed by nodeâs state-switching in heterogeneous wireless sensor networks. In additional, a metric is proposed to measure the frequency of nodeâs state-switching. The numerical results show that our scheduling can reduce the end-to-end delay and meanwhile improve energy efficiency by reducing the energy cost of state-switches.
{"title":"A Workload-Aware Link Scheduling for Heterogeneous Wireless Sensor Networks","authors":"Bo Zeng, Yabo Dong, Zhidan Liu, Dongming Lu","doi":"10.1109/CyberC.2012.66","DOIUrl":"https://doi.org/10.1109/CyberC.2012.66","url":null,"abstract":"We focus on the problem of links scheduling in heterogeneous wireless sensor networks. Links scheduling becomes more difficult due to the diversity of workload among sensor nodes. An improper links scheduling strategy will lead to high end-to-end delay and then diminish the data availability. We assume the energy cost of state transition cannot be ignored, especially for wireless multimedia sensor node which equips with camera and higher performance processor compared to scalar sensor node. In this paper, we use the conflict graph to model the conflicts among nodes and then propose a workload-aware heuristic scheduling algorithm. In the scheduling, each node can obtain consecutive time-slots to transmit all data at a schedule transmission, and the number of time-slots is calculated based on nodeâs workload. Hence, it is possible for our scheduling to reduce the end-to-end delay and save energy consumed by nodeâs state-switching in heterogeneous wireless sensor networks. In additional, a metric is proposed to measure the frequency of nodeâs state-switching. The numerical results show that our scheduling can reduce the end-to-end delay and meanwhile improve energy efficiency by reducing the energy cost of state-switches.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123639086","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 complexity of exhaustive search decoding technique grows exponentially with size of transmitted data. This paper proposes lattice sphere decoding technique with optimum performance and lower complexity. A linear system with a relatively small condition number is well-conditioned, so errors are not amplified significantly. In this paper, orthonormal basis of channel matrix has been used, hence the condition number is 1 which is the minimum. The proposed technique achieves significant performance improvement with huge complexity reduction.
{"title":"Lattice Sphere Decoding Technique Assisted Optimum Detection for Block Data Transmission Systems","authors":"M. Albreem, M. Salleh","doi":"10.1109/CyberC.2012.75","DOIUrl":"https://doi.org/10.1109/CyberC.2012.75","url":null,"abstract":"The complexity of exhaustive search decoding technique grows exponentially with size of transmitted data. This paper proposes lattice sphere decoding technique with optimum performance and lower complexity. A linear system with a relatively small condition number is well-conditioned, so errors are not amplified significantly. In this paper, orthonormal basis of channel matrix has been used, hence the condition number is 1 which is the minimum. The proposed technique achieves significant performance improvement with huge complexity reduction.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130160458","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}
Lidong Zhai, Wei Guo, Zhaopeng Jia, Li Guo, Jinqiao Shi
Recent threats caused by worms on mobile phones are recognized as one of the most serious security threats to heterogeneous networks. Some early work model assumes that worm propagation on mobile phone cannot infect Computer in the Internet, or vice versa. However, as the development of mobile phone and multiply approaches surfing online, such as 3G, Wi-Fi, itputs hybrid nodes (mobile phone and Computer) infecting each other into practice. In this paper, we study hybrid nodes infected each other by download files. Unlike worms spreading only in Internet or Mobile network, this hybrid worm (HY-worm) spread in the heterogeneous networks constituted by hybrid nodes will cause more serious damage. We present a novel analytical model to analyze the HY-worm spreading. Based on limited storage, computing, download speed and the lack of protect system of mobile phone, we find that the better the mobile phone is the more damage HY-worm will cause.
{"title":"Worm Propagation Model for Heterogeneous Network","authors":"Lidong Zhai, Wei Guo, Zhaopeng Jia, Li Guo, Jinqiao Shi","doi":"10.1109/CyberC.2012.32","DOIUrl":"https://doi.org/10.1109/CyberC.2012.32","url":null,"abstract":"Recent threats caused by worms on mobile phones are recognized as one of the most serious security threats to heterogeneous networks. Some early work model assumes that worm propagation on mobile phone cannot infect Computer in the Internet, or vice versa. However, as the development of mobile phone and multiply approaches surfing online, such as 3G, Wi-Fi, itputs hybrid nodes (mobile phone and Computer) infecting each other into practice. In this paper, we study hybrid nodes infected each other by download files. Unlike worms spreading only in Internet or Mobile network, this hybrid worm (HY-worm) spread in the heterogeneous networks constituted by hybrid nodes will cause more serious damage. We present a novel analytical model to analyze the HY-worm spreading. Based on limited storage, computing, download speed and the lack of protect system of mobile phone, we find that the better the mobile phone is the more damage HY-worm will cause.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117323842","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}
In this paper a new watermark embedding and recovery technique is proposed based on the compressed sensing framework. Both the watermark and the host signal are assumed to be sparse, each in its own domain. In recovery, the L1-minimization is used to recover the watermark and the host signal perfectly in clean conditions. The proposed technique is tested on MP3 audio where the effects of MP3 compression/decompression, sampling rate reduction and additive noise attacks are considered and bit error rate is compared with spread spectrum embedding. The proposed technique offers significantly better performance in all tested conditions and opens a new research approach for watermark embedding and recovery.
{"title":"Sparse Watermark Embedding and Recovery Using Compressed Sensing Framework for Audio Signals","authors":"M. Fakhr","doi":"10.1109/CyberC.2012.99","DOIUrl":"https://doi.org/10.1109/CyberC.2012.99","url":null,"abstract":"In this paper a new watermark embedding and recovery technique is proposed based on the compressed sensing framework. Both the watermark and the host signal are assumed to be sparse, each in its own domain. In recovery, the L1-minimization is used to recover the watermark and the host signal perfectly in clean conditions. The proposed technique is tested on MP3 audio where the effects of MP3 compression/decompression, sampling rate reduction and additive noise attacks are considered and bit error rate is compared with spread spectrum embedding. The proposed technique offers significantly better performance in all tested conditions and opens a new research approach for watermark embedding and recovery.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"359 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134457962","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}
D. Hamdan, O. Aktouf, I. Parissis, B. El-Hassan, Abbas Hijazi, Bassam Moslem
In Wireless Sensor Networks (WSNs), performance and reliability depend on the fault tolerance scheme used in the system. Fault diagnosis is an important part of fault tolerance. An effective diagnosis tool helps network administrators clearly monitor, manage, and troubleshoot the performance of the network. However, the design of online fault diagnosis is crucial in WSNs since many faults can easily happen and propagate. Besides, fault diagnosis put extra burden on the sensor node and it will also consume extra resources of the sensor nodes. Thus, in order to guarantee the network quality of service, it is essential for WSNs to be able to diagnosis faults efficiently. In this paper, we propose an adaptive and efficient approach for fault diagnosis in WSN called (SMART). SMART is a layer independent fault diagnosis service for WSNs. The presented service focuses on diagnosis two types of failures that are likely to happen in WSN deployments which are the node failure due to energy depletion, and the link failure due to poor connectivity with neighbors. From the design view, SMART provides to the application many tunable parameters that make it suitable for various deployment needs: energy-robustness-detection latency tradeoffs, tolerable packet loss, reports frequency etc. Simulation results prove that SMART is resource efficient while providing satisfactory detection and diagnosis accuracy.
{"title":"A Self-Monitoring, Adaptive and Resource Efficient Approach for Improving QoS in Wireless Sensor Networks","authors":"D. Hamdan, O. Aktouf, I. Parissis, B. El-Hassan, Abbas Hijazi, Bassam Moslem","doi":"10.1109/CyberC.2012.72","DOIUrl":"https://doi.org/10.1109/CyberC.2012.72","url":null,"abstract":"In Wireless Sensor Networks (WSNs), performance and reliability depend on the fault tolerance scheme used in the system. Fault diagnosis is an important part of fault tolerance. An effective diagnosis tool helps network administrators clearly monitor, manage, and troubleshoot the performance of the network. However, the design of online fault diagnosis is crucial in WSNs since many faults can easily happen and propagate. Besides, fault diagnosis put extra burden on the sensor node and it will also consume extra resources of the sensor nodes. Thus, in order to guarantee the network quality of service, it is essential for WSNs to be able to diagnosis faults efficiently. In this paper, we propose an adaptive and efficient approach for fault diagnosis in WSN called (SMART). SMART is a layer independent fault diagnosis service for WSNs. The presented service focuses on diagnosis two types of failures that are likely to happen in WSN deployments which are the node failure due to energy depletion, and the link failure due to poor connectivity with neighbors. From the design view, SMART provides to the application many tunable parameters that make it suitable for various deployment needs: energy-robustness-detection latency tradeoffs, tolerable packet loss, reports frequency etc. Simulation results prove that SMART is resource efficient while providing satisfactory detection and diagnosis accuracy.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115382606","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}
Sining Ma, X. Chen, Guicai Song, Juan Wang, Limin Sun, Jia Yan
Smart home has become a popular application all over the world. However, the service to interact with smart grid, and the service to guide residents utilize power, are ignored. In this paper, we propose an effective converged service oriented architecture (CSOA) to give a solution for supplying a converged service in smart homes. This architecture not only supports diversified service integrated with smart power consumption service and bi-directional interaction service but supports converged communication service. The architecture is evaluated in practice, and the initial result shows that converged service makes life more comfortable, healthy and energy efficient.
{"title":"The Converged Service Oriented Architecture in Smart Home Service","authors":"Sining Ma, X. Chen, Guicai Song, Juan Wang, Limin Sun, Jia Yan","doi":"10.1109/CyberC.2012.47","DOIUrl":"https://doi.org/10.1109/CyberC.2012.47","url":null,"abstract":"Smart home has become a popular application all over the world. However, the service to interact with smart grid, and the service to guide residents utilize power, are ignored. In this paper, we propose an effective converged service oriented architecture (CSOA) to give a solution for supplying a converged service in smart homes. This architecture not only supports diversified service integrated with smart power consumption service and bi-directional interaction service but supports converged communication service. The architecture is evaluated in practice, and the initial result shows that converged service makes life more comfortable, healthy and energy efficient.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115494281","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}
Botnets are the most serious network security threat bothering cyber security researchers around the globe. In this paper, we propose a proactive botnet detection framework using Support Vector Machine (SVM) to identify P2P botnets based on payload independent statistical features. Our investigation is based on the assumption that there exists significant difference between flow feature values of P2P botnet traffic and that of normal web traffic. However, we don't see a significant difference among flow feature values of normal web traffic and that of normal P2P traffic. Therefore, we combined normal web traffic and normal P2P traffic for the purpose of binary classification. Furthermore, we tried to evaluate the optimum SVM model that provides the best classification of P2P botnet data. Our optimized method yields approximately 99.01% accuracy for unbiased training and testing samples with a False Positive rate of 0.11 and 0.003 for bot and normal data flows respectively.
{"title":"A Framework for P2P Botnet Detection Using SVM","authors":"Pijush Barthakur, M. Dahal, M. Ghose","doi":"10.1109/CyberC.2012.40","DOIUrl":"https://doi.org/10.1109/CyberC.2012.40","url":null,"abstract":"Botnets are the most serious network security threat bothering cyber security researchers around the globe. In this paper, we propose a proactive botnet detection framework using Support Vector Machine (SVM) to identify P2P botnets based on payload independent statistical features. Our investigation is based on the assumption that there exists significant difference between flow feature values of P2P botnet traffic and that of normal web traffic. However, we don't see a significant difference among flow feature values of normal web traffic and that of normal P2P traffic. Therefore, we combined normal web traffic and normal P2P traffic for the purpose of binary classification. Furthermore, we tried to evaluate the optimum SVM model that provides the best classification of P2P botnet data. Our optimized method yields approximately 99.01% accuracy for unbiased training and testing samples with a False Positive rate of 0.11 and 0.003 for bot and normal data flows respectively.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114648394","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 decomposition method is a superior method in solving big and complicated problem. This article puts forward a domain decomposition method based on the weighted average, this method decomposes the grid based on the land cover, and discrete parameters using time dimension finite difference method, and then the patches of each grid are weighted aggregated to obtain the final output. This paper proposed the concrete steps of the method, and validated it by using the sensible and latent heat flux simulation result based on the CoLM (The common land model) land surface model.
区域分解法是解决大型复杂问题的一种优越方法。本文提出了一种基于加权平均的区域分解方法，该方法基于土地覆盖对网格进行分解，采用时间维有限差分法对离散参数进行分解，然后对每个网格的patch进行加权聚合，得到最终输出。提出了该方法的具体步骤，并利用基于CoLM (the common land model)陆面模型的感热通量和潜热通量模拟结果对其进行了验证。
{"title":"The Domain Decomposition Method in Land Surface Model","authors":"Jianhui Shi, Wenbo Zhou, Y. Liu","doi":"10.1109/CyberC.2012.98","DOIUrl":"https://doi.org/10.1109/CyberC.2012.98","url":null,"abstract":"The domain decomposition method is a superior method in solving big and complicated problem. This article puts forward a domain decomposition method based on the weighted average, this method decomposes the grid based on the land cover, and discrete parameters using time dimension finite difference method, and then the patches of each grid are weighted aggregated to obtain the final output. This paper proposed the concrete steps of the method, and validated it by using the sensible and latent heat flux simulation result based on the CoLM (The common land model) land surface model.","PeriodicalId":416468,"journal":{"name":"2012 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121952249","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
扫码关注我们
求助内容：
应助结果提醒方式：