In recent days the advancement in the wireless communication is with that of wireless sensor networks. In Wireless Sensor Networks (WSNs) the data are collected from many sensor nodes by the base station which is the goal of the network. In this type of WSNs, the major constraints are low energy, limited bandwidth and less memory. With these constraints in mind we propose a method to reduce the energy consumption with maximum data collection. In this new method we use multiple mobile sinks (MMS) instead of a single mobile sink. Here we have considered three scenarios. In the first scenario, all nodes are interested to send data to only one sink. In the second and third scenario all nodes are interested to send the data to any other mobile sink among the selected group of mobile sinks. We have simulated using MATLAB and the simulated results show that the update energy cost is reduced when two or more number of sinks are used.
{"title":"MMS Routing for Wireless Sensor Networks","authors":"M. Premi, K. S. Shaji","doi":"10.1109/ICCSN.2010.67","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.67","url":null,"abstract":"In recent days the advancement in the wireless communication is with that of wireless sensor networks. In Wireless Sensor Networks (WSNs) the data are collected from many sensor nodes by the base station which is the goal of the network. In this type of WSNs, the major constraints are low energy, limited bandwidth and less memory. With these constraints in mind we propose a method to reduce the energy consumption with maximum data collection. In this new method we use multiple mobile sinks (MMS) instead of a single mobile sink. Here we have considered three scenarios. In the first scenario, all nodes are interested to send data to only one sink. In the second and third scenario all nodes are interested to send the data to any other mobile sink among the selected group of mobile sinks. We have simulated using MATLAB and the simulated results show that the update energy cost is reduced when two or more number of sinks are used.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126914721","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 rake diversity combining scheme for detection of a single data stream in ultra-wideband (UWB) multiple input multiple output (MIMO) systems is considered as an extension of single input multiple output (SIMO) systems. The BER performance of a linear receive rake diversity scheme is presented in a log-normal multipath fading channel. It is shown that the increase of an antenna dimension happens to degrade the performance in the range of high SNRs. It is seen that as the number of transmit and receive antennas increases, the rake diversity combining system improves the performance at low SNRs or in the case of large antenna dimension at high SNRs.
{"title":"Performance of UWB MIMO Systems with Rake Receive Processing","authors":"J. An, Sangchoon Kim","doi":"10.1109/ICCSN.2010.11","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.11","url":null,"abstract":"In this paper, a rake diversity combining scheme for detection of a single data stream in ultra-wideband (UWB) multiple input multiple output (MIMO) systems is considered as an extension of single input multiple output (SIMO) systems. The BER performance of a linear receive rake diversity scheme is presented in a log-normal multipath fading channel. It is shown that the increase of an antenna dimension happens to degrade the performance in the range of high SNRs. It is seen that as the number of transmit and receive antennas increases, the rake diversity combining system improves the performance at low SNRs or in the case of large antenna dimension at high SNRs.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116428810","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 I investigate factors of the testability of structured programs. The starting point is given by a study of the literature to obtain both an initial model of testability and existing models related to testability. The main objective of this paper is to propose models for the estimation of testability (Tb), on the basis of various affecting attributes. The values of the attributes were estimated for programs under consideration with the help of software developed for this purpose. The models proposed conform to our intuitive reasoning
{"title":"Testability Models for Structured Programs","authors":"Chhattar Singh Lamba","doi":"10.1109/ICCSN.2010.112","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.112","url":null,"abstract":"In this paper I investigate factors of the testability of structured programs. The starting point is given by a study of the literature to obtain both an initial model of testability and existing models related to testability. The main objective of this paper is to propose models for the estimation of testability (Tb), on the basis of various affecting attributes. The values of the attributes were estimated for programs under consideration with the help of software developed for this purpose. The models proposed conform to our intuitive reasoning","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"1 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113954279","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 recent year, some popular P2P file-sharing systems have been identified to be polluted by the copyright Industry to control the unauthorized distribution of content. As one of the most common P2P pollution methods, the index poisoning controls the P2P file-sharing by inserting massive numbers of bogus records into the index of the P2P file-sharing system. In this paper, the index poisoning in the structured P2P file-sharing system is introduced firstly. A term “poison multiplication” is defined to describe the level of the poisoning and the probability model that a peer receives valid peer information on the condition of the index poisoning in BitTorrent is proposed. We run index poisoning in BitTorrent and evaluate the effect of it. The result of the evaluation shows that with the poison multiplication increases, the connection time and the randomness of the connection time increases. To our knowledge, this is the first study to employ BitTorrent as the platform to evaluate the effectiveness of the index poisoning.
{"title":"The Evaluation of Index Poisoning in BitTorrent","authors":"Jie Kong, Wandong Cai, Lei Wang","doi":"10.1109/ICCSN.2010.39","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.39","url":null,"abstract":"In recent year, some popular P2P file-sharing systems have been identified to be polluted by the copyright Industry to control the unauthorized distribution of content. As one of the most common P2P pollution methods, the index poisoning controls the P2P file-sharing by inserting massive numbers of bogus records into the index of the P2P file-sharing system. In this paper, the index poisoning in the structured P2P file-sharing system is introduced firstly. A term “poison multiplication” is defined to describe the level of the poisoning and the probability model that a peer receives valid peer information on the condition of the index poisoning in BitTorrent is proposed. We run index poisoning in BitTorrent and evaluate the effect of it. The result of the evaluation shows that with the poison multiplication increases, the connection time and the randomness of the connection time increases. To our knowledge, this is the first study to employ BitTorrent as the platform to evaluate the effectiveness of the index poisoning.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130365115","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 an artificial neural network demodulator to demodulate binary frequency shift keying signal is proposed. This demodulator has some important features compared with conventional method such as coherent and non-coherent demodulator and also other proposed neural network demodulators. In contrast with conventional demodulator, this demodulator (which uses a tapped delayed line in its two layers) does not need any band pass filter (to select the desired frequency band), any pulse shaping filter (to worry about its output sharpness) and any synchronous local oscillator and the other usual demodulator components. it is just a neural network implementation demodulator, that should be called soft demodulator, because once it is trained properly for a special kind of modulation, it works well for that kind of modulation and it is easy to train it for another modulation scheme without changing hardware, i.e., train it and then use it ! Compared with the other ANN demodulators proposed before it can be trained faster (or with less training data bits), it has more efficient BER curve and also has a better performance (MSE or SSE).
{"title":"A BFSK Neural Network Demodulator with Fast Training Hints","authors":"M. Amini, Mohammad Moghadasi, Iman Fatehi","doi":"10.1109/ICCSN.2010.123","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.123","url":null,"abstract":"In this paper an artificial neural network demodulator to demodulate binary frequency shift keying signal is proposed. This demodulator has some important features compared with conventional method such as coherent and non-coherent demodulator and also other proposed neural network demodulators. In contrast with conventional demodulator, this demodulator (which uses a tapped delayed line in its two layers) does not need any band pass filter (to select the desired frequency band), any pulse shaping filter (to worry about its output sharpness) and any synchronous local oscillator and the other usual demodulator components. it is just a neural network implementation demodulator, that should be called soft demodulator, because once it is trained properly for a special kind of modulation, it works well for that kind of modulation and it is easy to train it for another modulation scheme without changing hardware, i.e., train it and then use it ! Compared with the other ANN demodulators proposed before it can be trained faster (or with less training data bits), it has more efficient BER curve and also has a better performance (MSE or SSE).","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128221580","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}
Media-Independent Pre-Authentication (MPA) is used as a secure handover optimization scheme working over any link layer. With MPA, a mobile node (the MN) can establish a security association with a candidate target network (CTN), obtain an IP address and other parameters from the CTN, and complete the binding update of any mobility management protocol with the new care-of address (nCoA) before performing a handover at the link layer. This can significantly reduce handover delay. However, the packets transmitted to the MN may be lost if a link layer handover occurs due to the link going down before the MN completes the binding update. The possible simultaneous mobility problem also gives rise to undesirable handover delay. In this paper, we design a framework called enhanced MPA (eMPA) by improving handover execution procedures of MPA. When a MN decides to perform handover at the link layer, it will request to create an IPSec tunnel between its nCoA and old access router (oAR) before deleting the proactive handover tunnel (PHT) that created between the MN and new access router (nAR). Then data packets sent to the oAR will be forwarded to the MN with the nCoA via nAR. Then the nAR will start to buffer those packets until the MN sends an explicit signal to stop buffering and flushes the packets after completing handover at the link layer. In addition, we present a binding update retransmission mechanism in the eMPA to resolve control plane packet timeout problem. With this mechanism, we can prevent packet loss during the handover.
{"title":"An Enhanced Media-Independent Pre-authentication Framework for Preventing Packet Loss","authors":"Lun-Huo Yeh, Shun-Neng Yang, Wei-Kuo Chiang","doi":"10.1109/ICCSN.2010.52","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.52","url":null,"abstract":"Media-Independent Pre-Authentication (MPA) is used as a secure handover optimization scheme working over any link layer. With MPA, a mobile node (the MN) can establish a security association with a candidate target network (CTN), obtain an IP address and other parameters from the CTN, and complete the binding update of any mobility management protocol with the new care-of address (nCoA) before performing a handover at the link layer. This can significantly reduce handover delay. However, the packets transmitted to the MN may be lost if a link layer handover occurs due to the link going down before the MN completes the binding update. The possible simultaneous mobility problem also gives rise to undesirable handover delay. In this paper, we design a framework called enhanced MPA (eMPA) by improving handover execution procedures of MPA. When a MN decides to perform handover at the link layer, it will request to create an IPSec tunnel between its nCoA and old access router (oAR) before deleting the proactive handover tunnel (PHT) that created between the MN and new access router (nAR). Then data packets sent to the oAR will be forwarded to the MN with the nCoA via nAR. Then the nAR will start to buffer those packets until the MN sends an explicit signal to stop buffering and flushes the packets after completing handover at the link layer. In addition, we present a binding update retransmission mechanism in the eMPA to resolve control plane packet timeout problem. With this mechanism, we can prevent packet loss during the handover.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122208896","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 recent years, overlay networks have emerged as an approach to provide a general framework for new applications and services to be implemented without significant changes in the IP-layer network infrastructure. Overlay Service Network (OSN) is a unified framework which acts as a top layer over the IP-layer network and makes overlay routing feasible. This paper mainly focuses on designing a QoS-satisfied dynamic overlay routing protocol based on OSN framework. While satisfying the QoS requirements, being a dynamic routing protocol enhances the reliability and performance of the routing. So the proposed algorithm not only satisfies the application QoS requirements, but also improves the routing performance. The goals are: (1) to discover an overlay path which fulfills the QoS requirements, as well as (2) balancing the computational capacity of the resources and at the same time, (3) enhance the performance of the overlay network. To achieve these goals, we propose a path selection algorithm called Modified Least-Cost Path (MLCP) algorithm. Our simulation experiments have shown that the proposed algorithm performs well in achieving QoS-satisfied overlay routing while maintaining the performance.
近年来，覆盖网络作为一种方法出现，它为新应用和服务的实现提供了一个通用框架，而无需对ip层网络基础设施进行重大更改。OSN (Overlay Service Network)是一个统一的框架，它作为ip层网络的顶层，使覆盖路由成为可能。本文主要研究了一种基于OSN框架的满足qos的动态覆盖路由协议的设计。动态路由协议在满足QoS要求的同时，提高了路由的可靠性和性能。因此，该算法既满足了应用对QoS的要求，又提高了路由性能。目标是:(1)发现一条满足QoS要求的覆盖路径;(2)平衡资源的计算能力;同时(3)提高覆盖网络的性能。为了实现这些目标，我们提出了一种路径选择算法，称为修正最小代价路径(MLCP)算法。仿真实验表明，该算法在保持性能的同时，能够很好地实现满足qos的覆盖路由。
{"title":"QoS-Satisfied Dynamic Routing Based on Overlay Service Network","authors":"Amir Karamoozian, Mostafa Erfani, A. Abdullah","doi":"10.1109/ICCSN.2010.99","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.99","url":null,"abstract":"In recent years, overlay networks have emerged as an approach to provide a general framework for new applications and services to be implemented without significant changes in the IP-layer network infrastructure. Overlay Service Network (OSN) is a unified framework which acts as a top layer over the IP-layer network and makes overlay routing feasible. This paper mainly focuses on designing a QoS-satisfied dynamic overlay routing protocol based on OSN framework. While satisfying the QoS requirements, being a dynamic routing protocol enhances the reliability and performance of the routing. So the proposed algorithm not only satisfies the application QoS requirements, but also improves the routing performance. The goals are: (1) to discover an overlay path which fulfills the QoS requirements, as well as (2) balancing the computational capacity of the resources and at the same time, (3) enhance the performance of the overlay network. To achieve these goals, we propose a path selection algorithm called Modified Least-Cost Path (MLCP) algorithm. Our simulation experiments have shown that the proposed algorithm performs well in achieving QoS-satisfied overlay routing while maintaining the performance.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"272 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122769517","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. Najar, Hassan Awad Hassan Al-Sukhni, Navid Aghakhani
in this study researcher tried to improve relation between citizens and government by presenting a new model based on Service Oriented Architecture (SOA). With utilizing the presented model in government body on one hand governments will have the ability to minimize citizens’ dissatisfaction and on the other hand it can encourage citizens to participate in controlling government body such as governments’ staffs and organizations. This study can also be helpful in other fields of e-government in terms of citizen adoption and citizen loyalty. Results of this study can be a good reference to find out users needs from e-complaint and the importance of complaint in the body of government.
{"title":"The Application of Service-Oriented Architecture in E-complaint System","authors":"A. Najar, Hassan Awad Hassan Al-Sukhni, Navid Aghakhani","doi":"10.1109/ICCSN.2010.107","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.107","url":null,"abstract":"in this study researcher tried to improve relation between citizens and government by presenting a new model based on Service Oriented Architecture (SOA). With utilizing the presented model in government body on one hand governments will have the ability to minimize citizens’ dissatisfaction and on the other hand it can encourage citizens to participate in controlling government body such as governments’ staffs and organizations. This study can also be helpful in other fields of e-government in terms of citizen adoption and citizen loyalty. Results of this study can be a good reference to find out users needs from e-complaint and the importance of complaint in the body of government.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117104402","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}
Computer software that can intercept and log traffic passing over a digital network or part of a network is better known as packet sniffer. The sniffer captures these packets by setting the NIC card in the promiscuous mode and eventually decodes them. The decoded information can be used in any way depending upon the intention of the person concerned who decodes the data (i.e. malicious or beneficial purpose). Depending on the network structure one can sniff all or just parts of the traffic from a single machine within the network. However, there are some methods to avoid traffic narrowing by switches to gain access to traffic from other systems on the network. This paper focuses on the basics of packet sniffer and its working, development of the tool on Linux platform and its use for Intrusion Detection. It also discusses ways to detect the presence of such software on the network and to handle them in an efficient way. Focus has also been laid to analyze the bottleneck scenario arising in the network, using this self developed packet sniffer. Before the development of this indigenous software, minute observation has been made on the working behavior of already existing sniffer software such as wireshark (formerly known as ethereal), tcpdump, and snort, which serve as the base for the development of our sniffer software. For the capture of the packets, a library known as libpcap has been used. The development of such software gives a chance to the developer to incorporate the additional features that are not in the existing one.
{"title":"Network Traffic Analysis and Intrusion Detection Using Packet Sniffer","authors":"M. Qadeer, A. Iqbal, Mohammad Zahid, M. Siddiqui","doi":"10.1109/ICCSN.2010.104","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.104","url":null,"abstract":"Computer software that can intercept and log traffic passing over a digital network or part of a network is better known as packet sniffer. The sniffer captures these packets by setting the NIC card in the promiscuous mode and eventually decodes them. The decoded information can be used in any way depending upon the intention of the person concerned who decodes the data (i.e. malicious or beneficial purpose). Depending on the network structure one can sniff all or just parts of the traffic from a single machine within the network. However, there are some methods to avoid traffic narrowing by switches to gain access to traffic from other systems on the network. This paper focuses on the basics of packet sniffer and its working, development of the tool on Linux platform and its use for Intrusion Detection. It also discusses ways to detect the presence of such software on the network and to handle them in an efficient way. Focus has also been laid to analyze the bottleneck scenario arising in the network, using this self developed packet sniffer. Before the development of this indigenous software, minute observation has been made on the working behavior of already existing sniffer software such as wireshark (formerly known as ethereal), tcpdump, and snort, which serve as the base for the development of our sniffer software. For the capture of the packets, a library known as libpcap has been used. The development of such software gives a chance to the developer to incorporate the additional features that are not in the existing one.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121472353","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}
Yinzi Chen, Yang Deng, Y. Guo, Wendong Wang, Y. Zou, Kongqiao Wang
A temporal video segmentation method is proposed in this paper. This method is based on the detection of shot abrupt transition and gradual transition, and then takes into account the conditions of user terminals, which could generate different video summarization for each user. The experimental results show that the video summarization is able to meet the user's browsing requirements, and allows user to enjoy better browsing experience.
{"title":"A Temporal Video Segmentation and Summary Generation Method Based on Shots' Abrupt and Gradual Transition Boundary Detecting","authors":"Yinzi Chen, Yang Deng, Y. Guo, Wendong Wang, Y. Zou, Kongqiao Wang","doi":"10.1109/ICCSN.2010.58","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.58","url":null,"abstract":"A temporal video segmentation method is proposed in this paper. This method is based on the detection of shot abrupt transition and gradual transition, and then takes into account the conditions of user terminals, which could generate different video summarization for each user. The experimental results show that the video summarization is able to meet the user's browsing requirements, and allows user to enjoy better browsing experience.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134193718","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
扫码关注我们
求助内容：
应助结果提醒方式：