Pub Date : 2012-12-31DOI: 10.1109/ICCICT.2012.6398166
A. Surabhi, S. Parekh, K. Manikantan, S. Ramachandran
Face Recognition (FR) under varying background conditions is challenging, and exacting background invariant features is an effective approach to solve this problem. In this paper, we propose a novel method for background removal based on the k-means clustering algorithm, which lays the ground for DWT-based feature extraction to enhance the performance of a FR system. Individual stages of the FR system are examined and an attempt is made to improve each stage. A Binary Particle Swarm Optimization (BPSO)-based feature selection algorithm is used to search the feature vector space for the optimal feature subset. Experimental results, obtained by applying the proposed algorithm on ORL, UMIST, Extended Yale B and ColorFERET databases, show that the proposed system outperforms other FR systems. A significant increase in the overall recognition rate and a substantial reduction in the number of features are observed.
{"title":"Background removal using k-means clustering as a preprocessing technique for DWT based Face Recognition","authors":"A. Surabhi, S. Parekh, K. Manikantan, S. Ramachandran","doi":"10.1109/ICCICT.2012.6398166","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398166","url":null,"abstract":"Face Recognition (FR) under varying background conditions is challenging, and exacting background invariant features is an effective approach to solve this problem. In this paper, we propose a novel method for background removal based on the k-means clustering algorithm, which lays the ground for DWT-based feature extraction to enhance the performance of a FR system. Individual stages of the FR system are examined and an attempt is made to improve each stage. A Binary Particle Swarm Optimization (BPSO)-based feature selection algorithm is used to search the feature vector space for the optimal feature subset. Experimental results, obtained by applying the proposed algorithm on ORL, UMIST, Extended Yale B and ColorFERET databases, show that the proposed system outperforms other FR systems. A significant increase in the overall recognition rate and a substantial reduction in the number of features are observed.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127827592","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 : 2012-12-31DOI: 10.1109/ICCICT.2012.6398200
V. Chamola, M. K. Dutta, V. K. Chaubey
One of the key problems in the application of optical burst switching (OBS) network is to overcome the performance degradation due to contention. Contention takes place when two or more incoming bursts are directed to the same output line. This problem can be solved in time domain by incorporating fiber delay lines (FDLs) in the switch architecture. In the present paper a mathematical model has been proposed to estimate the blocking probability of an OBS network in presence of FDLs. The proposed work has further been extended to find out the effect of fiber non-idealities on the performance of OBS network. The performance of the proposed model has been evaluated using MATLAB simulations. Simulation results demonstrate that significant performance gains in optical-burst switching are achievable when FDLs are employed as optical buffers for contention resolution.
{"title":"Performance analysis of optical burst switching (OBS) network using fiber delay line: A simulation approach","authors":"V. Chamola, M. K. Dutta, V. K. Chaubey","doi":"10.1109/ICCICT.2012.6398200","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398200","url":null,"abstract":"One of the key problems in the application of optical burst switching (OBS) network is to overcome the performance degradation due to contention. Contention takes place when two or more incoming bursts are directed to the same output line. This problem can be solved in time domain by incorporating fiber delay lines (FDLs) in the switch architecture. In the present paper a mathematical model has been proposed to estimate the blocking probability of an OBS network in presence of FDLs. The proposed work has further been extended to find out the effect of fiber non-idealities on the performance of OBS network. The performance of the proposed model has been evaluated using MATLAB simulations. Simulation results demonstrate that significant performance gains in optical-burst switching are achievable when FDLs are employed as optical buffers for contention resolution.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127972886","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 : 2012-12-31DOI: 10.1109/ICCICT.2012.6398146
H. B. Kekre, V. Bharadi, A. Sawant, O. Kadam, P. Lanke, R. Lodhiya
Speaker identification system is one of the applications of biometric using voice signal. In this paper we have implemented a speaker recognition system using a combination of Mel Frequency Capestral Coefficients (MFCC) & Kekre's Median Codebook Generation Algorithm (KMCG). The MFCC algorithm is used for feature extraction while the KMCG algorithm plays important role in code book generation and feature matching. For implementation simplicity the system is built as a text dependent system, i.e. common text used by all users. KMCG algorithm provides implementation simplicity along with high level of accuracy.
{"title":"Speaker recognition using Vector Quantization by MFCC and KMCG clustering algorithm","authors":"H. B. Kekre, V. Bharadi, A. Sawant, O. Kadam, P. Lanke, R. Lodhiya","doi":"10.1109/ICCICT.2012.6398146","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398146","url":null,"abstract":"Speaker identification system is one of the applications of biometric using voice signal. In this paper we have implemented a speaker recognition system using a combination of Mel Frequency Capestral Coefficients (MFCC) & Kekre's Median Codebook Generation Algorithm (KMCG). The MFCC algorithm is used for feature extraction while the KMCG algorithm plays important role in code book generation and feature matching. For implementation simplicity the system is built as a text dependent system, i.e. common text used by all users. KMCG algorithm provides implementation simplicity along with high level of accuracy.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129200020","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 : 2012-12-31DOI: 10.1109/ICCICT.2012.6398124
Shivangi Raman, V. Chaurasiya, Venkatesan S. Division
The process by which information is retrieved from the repositories is called as information retrieval. This process had been a manual process since many centuries but since the advent of computers since the past few decades, it has become automated. Certain models form the basis of information retrieval in automated systems and are categorized as conventional and unconventional. This is because the motive of information retrieval systems is not only to render information to the regular users of internet but also, help the novice users of internet to skim out the documents that they need. In our paper, we have suggested that the information retrieval models must contain some questions regarding the user intent as well so that the search engine is able to search the websites that may prove to be informative for the users. These questions may enable the system to find out the user intent because entering one word may give varied results based upon the various uses to which it is put so that refining of requirements may be helpful in yielding appropriate results.
{"title":"Performance comparison of various information retrieval models used in search engines","authors":"Shivangi Raman, V. Chaurasiya, Venkatesan S. Division","doi":"10.1109/ICCICT.2012.6398124","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398124","url":null,"abstract":"The process by which information is retrieved from the repositories is called as information retrieval. This process had been a manual process since many centuries but since the advent of computers since the past few decades, it has become automated. Certain models form the basis of information retrieval in automated systems and are categorized as conventional and unconventional. This is because the motive of information retrieval systems is not only to render information to the regular users of internet but also, help the novice users of internet to skim out the documents that they need. In our paper, we have suggested that the information retrieval models must contain some questions regarding the user intent as well so that the search engine is able to search the websites that may prove to be informative for the users. These questions may enable the system to find out the user intent because entering one word may give varied results based upon the various uses to which it is put so that refining of requirements may be helpful in yielding appropriate results.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121268405","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 : 2012-12-31DOI: 10.1109/ICCICT.2012.6398219
T. Jyotismita, T. Hori, D. G. Chandra, N. Pathak
In this paper the tone structure of Bodo and Rabha language have been studied. These two languages have the syllable structures such as (V, CV, VC, CVC). The variation of pitch (Fo) contour of three types i.e. Rising, Falling and Flat has been considered. In the study the following observations have been made for Bodo language, in case of vowels, Fo contour is rising, except the high back un-rounded vowel (/w/) which shows a falling trend. But for vowels of Rabha language, Fo contour always show a rising. It is found that most of the pitch contour starts at a little higher position, (depending on speaker's initial vocal condition) and falls gradually to a low pitch and then shows a slight rise at the end of the syllable. If the nucleus is followed by tail syllables the falling part of the pattern is accompanied by the nucleus itself. The overall intonation pattern for both the languages, in case of sentences, are found to be composed of local rises and falls of tones across words or syllables i.e. the perceptions of a sentence is dependent on the tone pattern or pitch pattern of the syllables or words and intonation in general.
{"title":"Intonation pattern in BODO and RABHA language","authors":"T. Jyotismita, T. Hori, D. G. Chandra, N. Pathak","doi":"10.1109/ICCICT.2012.6398219","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398219","url":null,"abstract":"In this paper the tone structure of Bodo and Rabha language have been studied. These two languages have the syllable structures such as (V, CV, VC, CVC). The variation of pitch (Fo) contour of three types i.e. Rising, Falling and Flat has been considered. In the study the following observations have been made for Bodo language, in case of vowels, Fo contour is rising, except the high back un-rounded vowel (/w/) which shows a falling trend. But for vowels of Rabha language, Fo contour always show a rising. It is found that most of the pitch contour starts at a little higher position, (depending on speaker's initial vocal condition) and falls gradually to a low pitch and then shows a slight rise at the end of the syllable. If the nucleus is followed by tail syllables the falling part of the pattern is accompanied by the nucleus itself. The overall intonation pattern for both the languages, in case of sentences, are found to be composed of local rises and falls of tones across words or syllables i.e. the perceptions of a sentence is dependent on the tone pattern or pitch pattern of the syllables or words and intonation in general.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115626905","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 : 2012-12-31DOI: 10.1109/ICCICT.2012.6398197
A. T. Poyil, K. Nasimudeen
This paper presents an idea for improving the multi resolution performance of Wigner Ville Distribution during multi component signal analysis. The method concentrates on reducing the mathematical cross-terms of a multi-component signal, which are unfortunate terms arised in the calculation of Wigner Ville Distribution (WVD). Linear FM signals without any noise component ideally have a clear line representation while plotted in the time-frequency domain. When the WVD of a multi-component signal is calculated, the resultant cross-terms will sometimes have higher peaks compared to the main signal components. There have been many methods proposed to filter out these cross terms, so that the signal can be clearly represented in the time-frequency domain. In this paper, a method based on Hough Transformation is applied to WVD of the signal. A line in the time-frequency domain can be represented as a point in the Hough transformed domain. Once we identify the coordinates of this point in the transformed domain, we can estimate the properties of the line in the time-frequency domain which corresponds exactly to the actual signal components. This paper proposes the back parameter estimation method to select and retain only the components corresponding to the auto-terms of the signal, from the time-frequency domain of WVD.
{"title":"Multi resolution signal analysis using improved Wigner Ville Distribution","authors":"A. T. Poyil, K. Nasimudeen","doi":"10.1109/ICCICT.2012.6398197","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398197","url":null,"abstract":"This paper presents an idea for improving the multi resolution performance of Wigner Ville Distribution during multi component signal analysis. The method concentrates on reducing the mathematical cross-terms of a multi-component signal, which are unfortunate terms arised in the calculation of Wigner Ville Distribution (WVD). Linear FM signals without any noise component ideally have a clear line representation while plotted in the time-frequency domain. When the WVD of a multi-component signal is calculated, the resultant cross-terms will sometimes have higher peaks compared to the main signal components. There have been many methods proposed to filter out these cross terms, so that the signal can be clearly represented in the time-frequency domain. In this paper, a method based on Hough Transformation is applied to WVD of the signal. A line in the time-frequency domain can be represented as a point in the Hough transformed domain. Once we identify the coordinates of this point in the transformed domain, we can estimate the properties of the line in the time-frequency domain which corresponds exactly to the actual signal components. This paper proposes the back parameter estimation method to select and retain only the components corresponding to the auto-terms of the signal, from the time-frequency domain of WVD.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123307876","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 : 2012-12-31DOI: 10.1109/ICCICT.2012.6398218
R. Swaraj, K. K. Arun, R. K. Srinivas
In almost all the Digital Signal Processing (DSP) applications, the vital operations involve multiplications and accumulations. Consequently, there is a demand for dedicated hardware in processors to enhance the speed with which these multiplications and accumulations are performed. In the present world of irreversible circuits, the Multiply Accumulate Unit multiplies the two operands, adds the product to the previously accumulated result and stores back the new result in the Accumulator all in a single clock cycle. On the other hand, implementation of digital circuits in reversible logic is gaining popularity with the arrival of quantum computing and reversible logic. In this paper, we propose a novel Reversible Multiply Accumulate (MAC) unit. We also build a Reversible Vedic MAC unit and compare various possible implementations of the reversible MAC unit in terms of Quantum Cost, number of Garbage Outputs and Depth.
{"title":"Reversible implementation of novel multiply accumulate (MAC) unit","authors":"R. Swaraj, K. K. Arun, R. K. Srinivas","doi":"10.1109/ICCICT.2012.6398218","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398218","url":null,"abstract":"In almost all the Digital Signal Processing (DSP) applications, the vital operations involve multiplications and accumulations. Consequently, there is a demand for dedicated hardware in processors to enhance the speed with which these multiplications and accumulations are performed. In the present world of irreversible circuits, the Multiply Accumulate Unit multiplies the two operands, adds the product to the previously accumulated result and stores back the new result in the Accumulator all in a single clock cycle. On the other hand, implementation of digital circuits in reversible logic is gaining popularity with the arrival of quantum computing and reversible logic. In this paper, we propose a novel Reversible Multiply Accumulate (MAC) unit. We also build a Reversible Vedic MAC unit and compare various possible implementations of the reversible MAC unit in terms of Quantum Cost, number of Garbage Outputs and Depth.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115302480","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 : 2012-12-31DOI: 10.1109/ICCICT.2012.6398209
Ashutosh Kumar Singh, J. A. Ansari, K. Kamakshi, A. Mishra, M. Aneesh
In this paper, a dual resonance frequency antenna is achieved by introducing notch and shorting pin in semicircular disk. It is analyzed by using circuit theory concept. The resonance frequencies are found to be 2.84 GHz and 6.33 GHz, and the bandwidth of the proposed antenna for lower and upper resonance frequency are found to be 9.94% and 13.8% respectively. The frequency ratio and antenna efficiency are 2.28 and 90.68% respectively. The theoretical results are compared with IE3D simulation as well as reported experimental results, and they are in good agreement.
{"title":"Dualband notch loaded semi-circular disk microstrip patch antenna","authors":"Ashutosh Kumar Singh, J. A. Ansari, K. Kamakshi, A. Mishra, M. Aneesh","doi":"10.1109/ICCICT.2012.6398209","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398209","url":null,"abstract":"In this paper, a dual resonance frequency antenna is achieved by introducing notch and shorting pin in semicircular disk. It is analyzed by using circuit theory concept. The resonance frequencies are found to be 2.84 GHz and 6.33 GHz, and the bandwidth of the proposed antenna for lower and upper resonance frequency are found to be 9.94% and 13.8% respectively. The frequency ratio and antenna efficiency are 2.28 and 90.68% respectively. The theoretical results are compared with IE3D simulation as well as reported experimental results, and they are in good agreement.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"2 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131369348","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 : 2012-12-31DOI: 10.1109/ICCICT.2012.6398132
B. Kamdar, D. Shah, S. Sorathia, Y. S. Rao
High Peak to Average Power Ratio (PAPR) is one of the major challenges of any Orthogonal Frequency Division Multiplexing (OFDM) system. Many methods have been suggested for reducing PAPR. In this paper we design and implement an OFDM system on a FPGA along with PAPR reduction using Selected Mapping (SLM) technique. We analyse challenges in practical implementation of the system and also investigate the resource utilization increase as compared to a normal OFDM system.
{"title":"Hardware implementation of PAPR reduction scheme for OFDM system","authors":"B. Kamdar, D. Shah, S. Sorathia, Y. S. Rao","doi":"10.1109/ICCICT.2012.6398132","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398132","url":null,"abstract":"High Peak to Average Power Ratio (PAPR) is one of the major challenges of any Orthogonal Frequency Division Multiplexing (OFDM) system. Many methods have been suggested for reducing PAPR. In this paper we design and implement an OFDM system on a FPGA along with PAPR reduction using Selected Mapping (SLM) technique. We analyse challenges in practical implementation of the system and also investigate the resource utilization increase as compared to a normal OFDM system.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130661065","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 : 2012-12-31DOI: 10.1109/ICCICT.2012.6398108
J. Kolap, S. Krishnan, N. Shaha
IEEE 802.11n Draft is an ongoing next-generation wireless LAN standard. This paper describes detailed description and comparative study of various frame aggregation mechanisms proposed in the latest 802.11n draft standard, which improve extensively the channel efficiency and data throughput. Ns 2 simulator is used for simulation of 802.11n WLAN frame aggregation. Simulation results confirm that A-MPDU, and Two level frame aggregation methods improve extensively data throughput. It analyze the performance of each frame aggregation scheme in distinct scenarios, and it conclude that overall, the two-level aggregation can improve throughput performance of 802.11n. Two level aggregation can more effectively deliver data from multiple sources, PDR rate is much higher with much lower delay and less energy consumption as compared with A-MPDU approach.
{"title":"Comparison of frame aggregation mechanism in 802.11n WLAN","authors":"J. Kolap, S. Krishnan, N. Shaha","doi":"10.1109/ICCICT.2012.6398108","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398108","url":null,"abstract":"IEEE 802.11n Draft is an ongoing next-generation wireless LAN standard. This paper describes detailed description and comparative study of various frame aggregation mechanisms proposed in the latest 802.11n draft standard, which improve extensively the channel efficiency and data throughput. Ns 2 simulator is used for simulation of 802.11n WLAN frame aggregation. Simulation results confirm that A-MPDU, and Two level frame aggregation methods improve extensively data throughput. It analyze the performance of each frame aggregation scheme in distinct scenarios, and it conclude that overall, the two-level aggregation can improve throughput performance of 802.11n. Two level aggregation can more effectively deliver data from multiple sources, PDR rate is much higher with much lower delay and less energy consumption as compared with A-MPDU approach.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124372202","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
扫码关注我们
求助内容：
应助结果提醒方式：