Pub Date : 2009-10-30DOI: 10.1109/ICSPCS.2009.5306406
N. Meghanathan
We propose a node-disjoint multi-path extension to the location prediction-based routing protocol (LPBR-M) to reduce the number of broadcast multi-path route discoveries for mobile ad hoc networks. During a broadcast route discovery, the intermediate forwarding nodes include their location and mobility information in the Route-Request messages. Upon failure of all the node-disjoint paths learnt from the latest route discovery, the destination runs the algorithm to determine the set of node-disjoint paths on a predicted global topology, constructed from the location and mobility information collected during the latest broadcast route discovery, and sends a sequence of Route-Reply messages on each of the predicted paths. If the source receives at least one Route-Reply message within certain time, it continues to send the data packets along the newly learnt node-disjoint paths. Otherwise, the source initiates another broadcast route discovery. Simulation results of LPBR-M along with the link-disjoint path based AOMDV and node-disjoint path based AODVM routing protocols indicate that LPBR-M incurs the longest time between successive broadcast route discoveries and a hop count close to that incurred by the minimum hop count based multi-path protocols.
{"title":"A node-disjoint multi-path extension of the location prediction based routing protocol for mobile ad hoc networks","authors":"N. Meghanathan","doi":"10.1109/ICSPCS.2009.5306406","DOIUrl":"https://doi.org/10.1109/ICSPCS.2009.5306406","url":null,"abstract":"We propose a node-disjoint multi-path extension to the location prediction-based routing protocol (LPBR-M) to reduce the number of broadcast multi-path route discoveries for mobile ad hoc networks. During a broadcast route discovery, the intermediate forwarding nodes include their location and mobility information in the Route-Request messages. Upon failure of all the node-disjoint paths learnt from the latest route discovery, the destination runs the algorithm to determine the set of node-disjoint paths on a predicted global topology, constructed from the location and mobility information collected during the latest broadcast route discovery, and sends a sequence of Route-Reply messages on each of the predicted paths. If the source receives at least one Route-Reply message within certain time, it continues to send the data packets along the newly learnt node-disjoint paths. Otherwise, the source initiates another broadcast route discovery. Simulation results of LPBR-M along with the link-disjoint path based AOMDV and node-disjoint path based AODVM routing protocols indicate that LPBR-M incurs the longest time between successive broadcast route discoveries and a hop count close to that incurred by the minimum hop count based multi-path protocols.","PeriodicalId":356711,"journal":{"name":"2009 3rd International Conference on Signal Processing and Communication Systems","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122767349","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 : 2009-10-30DOI: 10.1109/ICSPCS.2009.5306416
S. Shammaa, R. Huck, P. Verma
Free-space optical communication links are well established as high bandwidth data transfer facilities. They also provide secure communication in hostile environments where Radio Frequency-based communication can be easily tapped into or jammed by a hostile agent. Mobile optical communication will thus provide a highly desirable system in such an environment, e.g., a battlefield. This paper presents the design and performance of a system for providing mobile voice communication that is based on optical links. The voice channel is created over two Field Programmable Gate Array (FPGA) development boards which allow parameters to be changed as needed. These parameters are chosen so that the voice channel emulates the G.711 ITU-T standard. Several configurations with different data rates can be obtained by varying the sampling rate and the number of bits representing each sample so as to optimize the transmission parameters from both fidelity and dynamic range perspectives. The Quality of the audio channel for each configuration is determined by measuring the Mean Opinion Score (MOS) using an Agilent Voice Quality Tester (VQT). Other parameters such as echo and delay are also measured.
{"title":"Designing an audio channel for low-bandwidth mobile optical networks","authors":"S. Shammaa, R. Huck, P. Verma","doi":"10.1109/ICSPCS.2009.5306416","DOIUrl":"https://doi.org/10.1109/ICSPCS.2009.5306416","url":null,"abstract":"Free-space optical communication links are well established as high bandwidth data transfer facilities. They also provide secure communication in hostile environments where Radio Frequency-based communication can be easily tapped into or jammed by a hostile agent. Mobile optical communication will thus provide a highly desirable system in such an environment, e.g., a battlefield. This paper presents the design and performance of a system for providing mobile voice communication that is based on optical links. The voice channel is created over two Field Programmable Gate Array (FPGA) development boards which allow parameters to be changed as needed. These parameters are chosen so that the voice channel emulates the G.711 ITU-T standard. Several configurations with different data rates can be obtained by varying the sampling rate and the number of bits representing each sample so as to optimize the transmission parameters from both fidelity and dynamic range perspectives. The Quality of the audio channel for each configuration is determined by measuring the Mean Opinion Score (MOS) using an Agilent Voice Quality Tester (VQT). Other parameters such as echo and delay are also measured.","PeriodicalId":356711,"journal":{"name":"2009 3rd International Conference on Signal Processing and Communication Systems","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121804674","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 : 2009-10-30DOI: 10.1109/ICSPCS.2009.5306441
Dong Gui-shan, L. Zhengjun, Zhao Dong
this paper discusses the network gatekeeper technology, and proposes a security domain isolation and data exchange model based on virtual machine monitor (VMM). Then we give up an implement framework of this model based on XEN. Finally, we discuss the security feature and the future appliance effect of the model.
{"title":"A security domain isolation and data exchange system based on VMM","authors":"Dong Gui-shan, L. Zhengjun, Zhao Dong","doi":"10.1109/ICSPCS.2009.5306441","DOIUrl":"https://doi.org/10.1109/ICSPCS.2009.5306441","url":null,"abstract":"this paper discusses the network gatekeeper technology, and proposes a security domain isolation and data exchange model based on virtual machine monitor (VMM). Then we give up an implement framework of this model based on XEN. Finally, we discuss the security feature and the future appliance effect of the model.","PeriodicalId":356711,"journal":{"name":"2009 3rd International Conference on Signal Processing and Communication Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129972311","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 : 2009-10-30DOI: 10.1109/ICSPCS.2009.5306432
Robert Grou-Szabo, T. Shibata
This paper talks about a random impulse-noise detection scheme that was developed to be used as the first stage of a switching median filter. First by using an edge detector with a dynamic threshold, hidden artifacts are revealed by gradually changing the threshold of the edge detector. Then by applying a series of masks to the edge maps, the artifacts are pinpointed and tabulated. By analyzing the statistical data, the intensity of the random impulse noise corrupting a pixel is estimated. This information can then be passed on to an adaptive noise reduction filter that can eliminate it with a correlated intensity.
{"title":"Random-valued impulse noise detector for switching median filters using edge detectors","authors":"Robert Grou-Szabo, T. Shibata","doi":"10.1109/ICSPCS.2009.5306432","DOIUrl":"https://doi.org/10.1109/ICSPCS.2009.5306432","url":null,"abstract":"This paper talks about a random impulse-noise detection scheme that was developed to be used as the first stage of a switching median filter. First by using an edge detector with a dynamic threshold, hidden artifacts are revealed by gradually changing the threshold of the edge detector. Then by applying a series of masks to the edge maps, the artifacts are pinpointed and tabulated. By analyzing the statistical data, the intensity of the random impulse noise corrupting a pixel is estimated. This information can then be passed on to an adaptive noise reduction filter that can eliminate it with a correlated intensity.","PeriodicalId":356711,"journal":{"name":"2009 3rd International Conference on Signal Processing and Communication Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131037292","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 : 2009-10-30DOI: 10.1109/ICSPCS.2009.5306369
Yung-Chung Wei, H. Gholamhosseini, Andrew J. D. Cameron, M. Harrison, Ahmed A. Al-Jumaily
This paper employs voice analysis techniques to detect hoarseness occurring as a result of administration of local anesthetic for shoulder surgery. The patients in our study developed transient vocal cord dysfunction; however surgery and anesthesia can also cause permanent vocal cord paralysis, which is a significant clinical problem. Early detection is important to optimize the chance of repair, and to avoid complications associated with an impaired swallow. We have developed an algorithm to detect altered vocal cord function, which is based on Wavelet Packet Analysis (WPA) and Support Vector Machines (SVM). This method is compared to the Hoarseness Diagram method (HDm), which was reported as an objective voice quality evaluation approach and can be used for pathological voice discrimination. We believe that our algorithm is unique in that samples were obtained from the same patients before and after their surgery. Our experiments using voice signals recorded from subjects before and after the procedure show a high classification accuracy, whereas HDm fails in the detection of a hoarse voice.
{"title":"Voice analysis for detection of hoarseness due to a local anesthetic procedure","authors":"Yung-Chung Wei, H. Gholamhosseini, Andrew J. D. Cameron, M. Harrison, Ahmed A. Al-Jumaily","doi":"10.1109/ICSPCS.2009.5306369","DOIUrl":"https://doi.org/10.1109/ICSPCS.2009.5306369","url":null,"abstract":"This paper employs voice analysis techniques to detect hoarseness occurring as a result of administration of local anesthetic for shoulder surgery. The patients in our study developed transient vocal cord dysfunction; however surgery and anesthesia can also cause permanent vocal cord paralysis, which is a significant clinical problem. Early detection is important to optimize the chance of repair, and to avoid complications associated with an impaired swallow. We have developed an algorithm to detect altered vocal cord function, which is based on Wavelet Packet Analysis (WPA) and Support Vector Machines (SVM). This method is compared to the Hoarseness Diagram method (HDm), which was reported as an objective voice quality evaluation approach and can be used for pathological voice discrimination. We believe that our algorithm is unique in that samples were obtained from the same patients before and after their surgery. Our experiments using voice signals recorded from subjects before and after the procedure show a high classification accuracy, whereas HDm fails in the detection of a hoarse voice.","PeriodicalId":356711,"journal":{"name":"2009 3rd International Conference on Signal Processing and Communication Systems","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114127527","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 : 2009-10-30DOI: 10.1109/ICSPCS.2009.5306396
R. Mathar, Georg Bocherer
As a theoretical concept, and a means to understand the potential of interference alignment, in this paper we investigate possibilities to place n transmitter-receiver pairs in n — 1 dimensions such that the interference from unintended transmissions is aligned at each receiving node. By such an arrangement each link has half of the capacity available, at least in theory. Regular patterns of stations are considered. It is shown that placing transmitters “outside” a regular arrangement of receivers provides solutions in any dimension, while placing transmitters “opposite” to intended receivers only yields a solution in dimension one and two. Methodologically we borrow from the field of distance geometry.
{"title":"On spatial patterns of transmitter-receiver pairs that allow for interference alignment by delay","authors":"R. Mathar, Georg Bocherer","doi":"10.1109/ICSPCS.2009.5306396","DOIUrl":"https://doi.org/10.1109/ICSPCS.2009.5306396","url":null,"abstract":"As a theoretical concept, and a means to understand the potential of interference alignment, in this paper we investigate possibilities to place n transmitter-receiver pairs in n — 1 dimensions such that the interference from unintended transmissions is aligned at each receiving node. By such an arrangement each link has half of the capacity available, at least in theory. Regular patterns of stations are considered. It is shown that placing transmitters “outside” a regular arrangement of receivers provides solutions in any dimension, while placing transmitters “opposite” to intended receivers only yields a solution in dimension one and two. Methodologically we borrow from the field of distance geometry.","PeriodicalId":356711,"journal":{"name":"2009 3rd International Conference on Signal Processing and Communication Systems","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133021081","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 : 2009-10-30DOI: 10.1109/ICSPCS.2009.5306438
Yiqing Zhou, Z. Pan, Henry Ye
Different to orthogonal frequency division multiplexing using cyclic prefix (CP-OFDM), time division synchronous OFDM (TDS-OFDM) employs pseudo noise (PN) sequence as the prefix. TDS-OFDM provides better power efficiency than CP-OFDM since the PN prefix can be used for channel estimation while CP-OFDM needs dedicated pilot symbols. However, when TDS-OFDM is considered with frequency domain multiple access (FDMA) where multiple users share the sub-carriers, serious interference is generated between the prefixes of different users since the PN prefix occupies the whole bandwidth. To facilitate the application of TDS-OFDM with FDMA, two prefix design methods are proposed. The prefix should employ time domain repeated PN sequence when discrete grouped sub-carriers are allocated to different mobile stations (MS), while time domain expanded PN sequence should be used when continuous sub-carriers are allocated to different MSs.
{"title":"Prefix design for TDS-OFDM supporting frequency domain multiple access","authors":"Yiqing Zhou, Z. Pan, Henry Ye","doi":"10.1109/ICSPCS.2009.5306438","DOIUrl":"https://doi.org/10.1109/ICSPCS.2009.5306438","url":null,"abstract":"Different to orthogonal frequency division multiplexing using cyclic prefix (CP-OFDM), time division synchronous OFDM (TDS-OFDM) employs pseudo noise (PN) sequence as the prefix. TDS-OFDM provides better power efficiency than CP-OFDM since the PN prefix can be used for channel estimation while CP-OFDM needs dedicated pilot symbols. However, when TDS-OFDM is considered with frequency domain multiple access (FDMA) where multiple users share the sub-carriers, serious interference is generated between the prefixes of different users since the PN prefix occupies the whole bandwidth. To facilitate the application of TDS-OFDM with FDMA, two prefix design methods are proposed. The prefix should employ time domain repeated PN sequence when discrete grouped sub-carriers are allocated to different mobile stations (MS), while time domain expanded PN sequence should be used when continuous sub-carriers are allocated to different MSs.","PeriodicalId":356711,"journal":{"name":"2009 3rd International Conference on Signal Processing and Communication Systems","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121324216","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 : 2009-10-30DOI: 10.1109/ICSPCS.2009.5306421
J. Hao, T. Shibata
A camera motion detection and analysis algorithm applicable to hand-held devices, such as mobile phones, has been developed and applied to digit-writing gesture recognition. The writing stroke is recorded from an image sequence taken by a moving camera. The automatic speed adaptation capability developed in the motion detection system has enabled very robust writing stroke detection. As a result, the temporal stroke distortion due to irregular writing speed has been eliminated. Since both the direction and magnitude of motion is detected at each instant, the writing stroke is correctly reconstructed by integrating the results. For this reason, feature vector for each digit character was constructed by connecting feature distribution in each direction. As a result, handwriting gesture recognition is achieved by simple template matching. The system performance has been evaluated by digit-writing gesture recognition with irregular writing speed, different users, or cursive writing. Preliminary experiments on hand-writing Chinese character recognition have also been attempted and the potentiality of the algorithm for more complicated gesture patterns has been tested.
{"title":"Digit-writing hand gesture recognition by hand-held camera motion analysis","authors":"J. Hao, T. Shibata","doi":"10.1109/ICSPCS.2009.5306421","DOIUrl":"https://doi.org/10.1109/ICSPCS.2009.5306421","url":null,"abstract":"A camera motion detection and analysis algorithm applicable to hand-held devices, such as mobile phones, has been developed and applied to digit-writing gesture recognition. The writing stroke is recorded from an image sequence taken by a moving camera. The automatic speed adaptation capability developed in the motion detection system has enabled very robust writing stroke detection. As a result, the temporal stroke distortion due to irregular writing speed has been eliminated. Since both the direction and magnitude of motion is detected at each instant, the writing stroke is correctly reconstructed by integrating the results. For this reason, feature vector for each digit character was constructed by connecting feature distribution in each direction. As a result, handwriting gesture recognition is achieved by simple template matching. The system performance has been evaluated by digit-writing gesture recognition with irregular writing speed, different users, or cursive writing. Preliminary experiments on hand-writing Chinese character recognition have also been attempted and the potentiality of the algorithm for more complicated gesture patterns has been tested.","PeriodicalId":356711,"journal":{"name":"2009 3rd International Conference on Signal Processing and Communication Systems","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115535402","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 : 2009-10-30DOI: 10.1109/ICSPCS.2009.5306400
Suat Bayram, S. Gezici
In this study, the effects of adding independent noise to observations of a suboptimal detector are studied for M-ary hypothesis-testing problems according to the minimax criterion. It is shown that the optimal additional noise can be represented by a randomization of at most M signal values under certain conditions. In addition, a convex relaxation approach is proposed to obtain an accurate approximation to the noise probability distribution in polynomial time. Furthermore, sufficient conditions are presented to determine when additional noise can or cannot improve the performance of a given detector. Finally, a numerical example is presented.
{"title":"Noise-enhanced M-ary hypothesis-testing in the minimax framework","authors":"Suat Bayram, S. Gezici","doi":"10.1109/ICSPCS.2009.5306400","DOIUrl":"https://doi.org/10.1109/ICSPCS.2009.5306400","url":null,"abstract":"In this study, the effects of adding independent noise to observations of a suboptimal detector are studied for M-ary hypothesis-testing problems according to the minimax criterion. It is shown that the optimal additional noise can be represented by a randomization of at most M signal values under certain conditions. In addition, a convex relaxation approach is proposed to obtain an accurate approximation to the noise probability distribution in polynomial time. Furthermore, sufficient conditions are presented to determine when additional noise can or cannot improve the performance of a given detector. Finally, a numerical example is presented.","PeriodicalId":356711,"journal":{"name":"2009 3rd International Conference on Signal Processing and Communication Systems","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126718553","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 : 2009-10-30DOI: 10.1109/ICSPCS.2009.5306364
B. Q. Vo-Nguyen, T. Duong, N. N. Tran
Closed-form expressions for ergodic capacity of repetition-based cooperative networks under adaptive transmission with selection combining are derived. According to the changing channel conditions, the source adapts its rate and/or power level while the relays simply amplify and then forward the received signals. Specifically, three different adaptive techniques are investigated under the assumption of independent Rayleigh fading channels: optimal simultaneous power and rate adaptation (OPRA), constant power with optimal rate adaptation (OPA) and channel inversion with fixed rate (TIFR). Among them, for an arbitrary number of relays, TIFR gives the worst channel capacity; OPRA gives the best channel capacity and ORA has a channel capacity quality in between the others. The analysis results, based on the upper and lower bound of the end-to-end signal-to-noise ratio (SNR), agree very well with the simulated results and definitely show the impact of selection combining on the calculated channel capacity per unit bandwidth.
{"title":"Ergodic capacity of cooperative networks using adaptive transmission and selection combining","authors":"B. Q. Vo-Nguyen, T. Duong, N. N. Tran","doi":"10.1109/ICSPCS.2009.5306364","DOIUrl":"https://doi.org/10.1109/ICSPCS.2009.5306364","url":null,"abstract":"Closed-form expressions for ergodic capacity of repetition-based cooperative networks under adaptive transmission with selection combining are derived. According to the changing channel conditions, the source adapts its rate and/or power level while the relays simply amplify and then forward the received signals. Specifically, three different adaptive techniques are investigated under the assumption of independent Rayleigh fading channels: optimal simultaneous power and rate adaptation (OPRA), constant power with optimal rate adaptation (OPA) and channel inversion with fixed rate (TIFR). Among them, for an arbitrary number of relays, TIFR gives the worst channel capacity; OPRA gives the best channel capacity and ORA has a channel capacity quality in between the others. The analysis results, based on the upper and lower bound of the end-to-end signal-to-noise ratio (SNR), agree very well with the simulated results and definitely show the impact of selection combining on the calculated channel capacity per unit bandwidth.","PeriodicalId":356711,"journal":{"name":"2009 3rd International Conference on Signal Processing and Communication Systems","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127206509","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
扫码关注我们
求助内容：
应助结果提醒方式：