Pub Date : 2008-11-01DOI: 10.1109/TENCON.2008.4766542
S. Pattnaik, A. Panda, K. Mahapatra
A new zero-voltage switching (ZVS) pulse width modulation (PWM) DC-DC converter using MOSFETs is proposed in this paper. The proposed converter achieves ZVS with reduction in voltage and current stresses across switches to improve the efficiency by minimizing the switching and conduction losses. The predicted operation principles and theoretical analysis of the presented converter are verified with a prototype of a 360 W, 50 V/6 V and 100 kHz PWM half bridge buck converter. Additionally, at full output power in the proposed soft switching converter the overall efficiency, which is 80% in the hard switching case, increases to about 95%.
{"title":"Analysis of a novel improved soft switching PWM DC-DC converter with dead time control","authors":"S. Pattnaik, A. Panda, K. Mahapatra","doi":"10.1109/TENCON.2008.4766542","DOIUrl":"https://doi.org/10.1109/TENCON.2008.4766542","url":null,"abstract":"A new zero-voltage switching (ZVS) pulse width modulation (PWM) DC-DC converter using MOSFETs is proposed in this paper. The proposed converter achieves ZVS with reduction in voltage and current stresses across switches to improve the efficiency by minimizing the switching and conduction losses. The predicted operation principles and theoretical analysis of the presented converter are verified with a prototype of a 360 W, 50 V/6 V and 100 kHz PWM half bridge buck converter. Additionally, at full output power in the proposed soft switching converter the overall efficiency, which is 80% in the hard switching case, increases to about 95%.","PeriodicalId":22230,"journal":{"name":"TENCON 2008 - 2008 IEEE Region 10 Conference","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84623196","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-11-01DOI: 10.1109/TENCON.2008.4766836
S. Pravin Kumar, N. Sriraam, P. Benakop
Electroencephalograms (EEG) are the brain signals that provide us the valuable information about the normal or epileptic state of the brain. In this paper the EEG signals were characterized by wavelet, sample and spectral entropy approach and the recurrent neural network classifier is used for the automated detection of epileptic seizures.
{"title":"Automated detection of epileptic seizures using wavelet entropy feature with recurrent neural network classifier","authors":"S. Pravin Kumar, N. Sriraam, P. Benakop","doi":"10.1109/TENCON.2008.4766836","DOIUrl":"https://doi.org/10.1109/TENCON.2008.4766836","url":null,"abstract":"Electroencephalograms (EEG) are the brain signals that provide us the valuable information about the normal or epileptic state of the brain. In this paper the EEG signals were characterized by wavelet, sample and spectral entropy approach and the recurrent neural network classifier is used for the automated detection of epileptic seizures.","PeriodicalId":22230,"journal":{"name":"TENCON 2008 - 2008 IEEE Region 10 Conference","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88729016","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-11-01DOI: 10.1109/TENCON.2008.4766790
K. Bhattacharyya, S. Banerjee
This paper addresses the problem of the evaluation of inverse discrete cosine transform (IDCT) using existing radix-2 IFFT algorithm applicable for image and signal processing where a huge number of data points are required for a particular operation. Since radix-4 architecture has fewer multiplications than radix-2, then it is judicial to carry out the IDCT operation via radix-4 IFFT for a huge savings of number of computations for the data points which are power of four. In this paper the authors have modified the existing IDCT-DFT algorithm to allow the computation of two concurrent N Point IDCT s via a single N point radix-4 IFFT instead of using radix-2 IFFT. As a result the total amount of arithmetic workload is greatly reduced. A supporting architecture which can be applicable for real time operation is also suggested to realize a 16 point IDCT algorithm.
{"title":"Computation of two N-point IDCT s via a single N-point IFFT using radix-4 algorithm & its proposed architecture","authors":"K. Bhattacharyya, S. Banerjee","doi":"10.1109/TENCON.2008.4766790","DOIUrl":"https://doi.org/10.1109/TENCON.2008.4766790","url":null,"abstract":"This paper addresses the problem of the evaluation of inverse discrete cosine transform (IDCT) using existing radix-2 IFFT algorithm applicable for image and signal processing where a huge number of data points are required for a particular operation. Since radix-4 architecture has fewer multiplications than radix-2, then it is judicial to carry out the IDCT operation via radix-4 IFFT for a huge savings of number of computations for the data points which are power of four. In this paper the authors have modified the existing IDCT-DFT algorithm to allow the computation of two concurrent N Point IDCT s via a single N point radix-4 IFFT instead of using radix-2 IFFT. As a result the total amount of arithmetic workload is greatly reduced. A supporting architecture which can be applicable for real time operation is also suggested to realize a 16 point IDCT algorithm.","PeriodicalId":22230,"journal":{"name":"TENCON 2008 - 2008 IEEE Region 10 Conference","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88781999","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-11-01DOI: 10.1109/TENCON.2008.4766496
Sourav Saha, M. Mukherjee, S. Neogy
A mobile node needs to be configured with a unique IP address. It has been seen that address autoconfiguration is a suitable technique in MANETs because of high mobility of nodes. Extensive survey of previous autoconfiguration related schemes reveal the need for reducing DoS attack, security breaches and improving DAD, QoS and overall performance. This paper also presents a critical study of mobility management related schemes. In this paper, we propose a scheme Mobile-autoconf that employs ring-based hierarchy for both autoconfiguration and mobility management for larger MANETs. It reduces DAD dependency, scope for DoS attack and temporary address dependency. It reduces cost increases reliability, robustness and location management becomes easier. QoS improvement and recycling of address pool are also aimed at here. The simulation of Mobile-autoconf is also carried out.
{"title":"Mobile-autoconf: Mobility management with autoconfiguration in mobile ad-hoc networks","authors":"Sourav Saha, M. Mukherjee, S. Neogy","doi":"10.1109/TENCON.2008.4766496","DOIUrl":"https://doi.org/10.1109/TENCON.2008.4766496","url":null,"abstract":"A mobile node needs to be configured with a unique IP address. It has been seen that address autoconfiguration is a suitable technique in MANETs because of high mobility of nodes. Extensive survey of previous autoconfiguration related schemes reveal the need for reducing DoS attack, security breaches and improving DAD, QoS and overall performance. This paper also presents a critical study of mobility management related schemes. In this paper, we propose a scheme Mobile-autoconf that employs ring-based hierarchy for both autoconfiguration and mobility management for larger MANETs. It reduces DAD dependency, scope for DoS attack and temporary address dependency. It reduces cost increases reliability, robustness and location management becomes easier. QoS improvement and recycling of address pool are also aimed at here. The simulation of Mobile-autoconf is also carried out.","PeriodicalId":22230,"journal":{"name":"TENCON 2008 - 2008 IEEE Region 10 Conference","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80595852","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-11-01DOI: 10.1109/TENCON.2008.4766452
Nitin, V. Kumar Sehgal, R. Sharma, D. Singh Chauhan, N. Srivastava, S. Garhwal
Our previous work on combining switches multistage interconnection network (CSMIN) makes use of distance tag routing algorithm to provide two correct disjoint paths for every source-destination pair. Our algorithm backtracks a packet to the previous stage and takes the other disjoint path in the event of a fault or a collision in the network. To eliminate the backtracking penalties of CSMIN, we propose a new design called fully-chained combining switches multistage interconnection network (FCSMIN). FCSMIN has the similar characteristics of 1-fault tolerance and two disjoint paths between any source-destination pair but it can tolerate at least one link or switch fault at each stage without backtracking. Our comparative analysis and results show that FCSMIN has the added advantages of destination tag routing, lower hardware costs than CSMIN, strong reroutability and lower pre-processing overhead.
{"title":"Modified fault tolerant Combining Switches Multistage Interconnection Networks with chaining: Algorithm, design and cost issues","authors":"Nitin, V. Kumar Sehgal, R. Sharma, D. Singh Chauhan, N. Srivastava, S. Garhwal","doi":"10.1109/TENCON.2008.4766452","DOIUrl":"https://doi.org/10.1109/TENCON.2008.4766452","url":null,"abstract":"Our previous work on combining switches multistage interconnection network (CSMIN) makes use of distance tag routing algorithm to provide two correct disjoint paths for every source-destination pair. Our algorithm backtracks a packet to the previous stage and takes the other disjoint path in the event of a fault or a collision in the network. To eliminate the backtracking penalties of CSMIN, we propose a new design called fully-chained combining switches multistage interconnection network (FCSMIN). FCSMIN has the similar characteristics of 1-fault tolerance and two disjoint paths between any source-destination pair but it can tolerate at least one link or switch fault at each stage without backtracking. Our comparative analysis and results show that FCSMIN has the added advantages of destination tag routing, lower hardware costs than CSMIN, strong reroutability and lower pre-processing overhead.","PeriodicalId":22230,"journal":{"name":"TENCON 2008 - 2008 IEEE Region 10 Conference","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80621917","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-11-01DOI: 10.1109/TENCON.2008.4766614
P. Nathan, N. Kalyanasundaram, M. Raju
Polarization mode dispersion (PMD) is a serious impairment in high-bit-rate optical soliton communication systems. This paper presents a detailed investigation of soliton pulse propagation in randomly varying birefringent optical fibers and how solitons broaden in presence of third order dispersion. Fiber birefringence is the physical origin of PMD. It is found that the third-order dispersion in the fibers is strong enough to cause the pulse distortion. In this paper we propose optical soliton propagation in birefringent single mode fibers with a new stochastic model in which the stochastically varying birefringence and third order dispersion are considered.
{"title":"Analysis of optical soliton propagation in birefringent fibers","authors":"P. Nathan, N. Kalyanasundaram, M. Raju","doi":"10.1109/TENCON.2008.4766614","DOIUrl":"https://doi.org/10.1109/TENCON.2008.4766614","url":null,"abstract":"Polarization mode dispersion (PMD) is a serious impairment in high-bit-rate optical soliton communication systems. This paper presents a detailed investigation of soliton pulse propagation in randomly varying birefringent optical fibers and how solitons broaden in presence of third order dispersion. Fiber birefringence is the physical origin of PMD. It is found that the third-order dispersion in the fibers is strong enough to cause the pulse distortion. In this paper we propose optical soliton propagation in birefringent single mode fibers with a new stochastic model in which the stochastically varying birefringence and third order dispersion are considered.","PeriodicalId":22230,"journal":{"name":"TENCON 2008 - 2008 IEEE Region 10 Conference","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80647623","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-11-01DOI: 10.1109/TENCON.2008.4766553
S. Kashyap, C. Meena, A.K. Singh
This paper presents a unique comparison between Wavelet Packet Transform (WPT) and Discrete Wavelet Transform (DWT) in the power system harmonics scenario. The signals used are actual tested waveforms which have been obtained using power quality analyzer. The results obtained using WPT and DWT are then compared with IEEE Standard 1459 - 2000 based values. The percentage error has been calculated for the individual parameters in both the cases. The comparative study shows DWT to be more suitable over WPT for quantization of power system harmonics.
{"title":"Comparison of WPT and DWT in quantization of power system harmonics in context of IEEE standard 1459–2000","authors":"S. Kashyap, C. Meena, A.K. Singh","doi":"10.1109/TENCON.2008.4766553","DOIUrl":"https://doi.org/10.1109/TENCON.2008.4766553","url":null,"abstract":"This paper presents a unique comparison between Wavelet Packet Transform (WPT) and Discrete Wavelet Transform (DWT) in the power system harmonics scenario. The signals used are actual tested waveforms which have been obtained using power quality analyzer. The results obtained using WPT and DWT are then compared with IEEE Standard 1459 - 2000 based values. The percentage error has been calculated for the individual parameters in both the cases. The comparative study shows DWT to be more suitable over WPT for quantization of power system harmonics.","PeriodicalId":22230,"journal":{"name":"TENCON 2008 - 2008 IEEE Region 10 Conference","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85165355","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-11-01DOI: 10.1109/TENCON.2008.4766601
S. Manjula, R. Krupa, K. Saba, N. Lalithamma, L. Kavitha, K. Shaila, L. Nalini, K. Venugopal, L. Patnaik
Wireless Sensor Networks (WSNs) is a collection of a large number of sensor nodes with sensing, computation and wireless communication capabilities. Dead end problem is one of the challenges that occurs in greedy forwarding. When a message is forwarded to a node that has no neighbors closer to destination than itself, it causes greedy forwarding to fail at that node. In this paper, we propose energy efficient algorithm called GRADE (Gradient Algorithm for Dead End) to solve this problem. GRADE divides network graph into functional subgraphs using only information about immediate neighbors, and based on these subgraphs, each node is given the message forwarding direction. It does not require planarization of the underlying graph and generates loop free paths. Experimental results show that GRADE provides path length close to shortest path, low energy consumption and optimal control overhead than other techniques.
无线传感器网络(WSNs)是由大量具有感知、计算和无线通信能力的传感器节点组成的网络。死角问题是贪婪转发中遇到的难题之一。当一个消息被转发到一个没有比它自己更接近目的地的邻居的节点时，它会导致该节点的贪婪转发失败。在本文中，我们提出了一种节能的算法，称为GRADE (Gradient algorithm for Dead End)来解决这个问题。GRADE仅使用近邻信息将网络图划分为功能子图，并根据这些子图给出每个节点的消息转发方向。它不需要底层图的平面化，并生成循环自由路径。实验结果表明，与其他技术相比，GRADE具有路径长度接近最短路径、能耗低和控制开销最优的特点。
{"title":"Network lifetime maximizing Gradient Algorithm for Dead End in Wireless Sensor Networks","authors":"S. Manjula, R. Krupa, K. Saba, N. Lalithamma, L. Kavitha, K. Shaila, L. Nalini, K. Venugopal, L. Patnaik","doi":"10.1109/TENCON.2008.4766601","DOIUrl":"https://doi.org/10.1109/TENCON.2008.4766601","url":null,"abstract":"Wireless Sensor Networks (WSNs) is a collection of a large number of sensor nodes with sensing, computation and wireless communication capabilities. Dead end problem is one of the challenges that occurs in greedy forwarding. When a message is forwarded to a node that has no neighbors closer to destination than itself, it causes greedy forwarding to fail at that node. In this paper, we propose energy efficient algorithm called GRADE (Gradient Algorithm for Dead End) to solve this problem. GRADE divides network graph into functional subgraphs using only information about immediate neighbors, and based on these subgraphs, each node is given the message forwarding direction. It does not require planarization of the underlying graph and generates loop free paths. Experimental results show that GRADE provides path length close to shortest path, low energy consumption and optimal control overhead than other techniques.","PeriodicalId":22230,"journal":{"name":"TENCON 2008 - 2008 IEEE Region 10 Conference","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89834903","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-11-01DOI: 10.1109/TENCON.2008.4766658
V. Nagarajan, P. Dananjayan
A distributed non cooperative power control game with pricing (NPGP) for multiple-input multiple-output (MIMO) multi-carrier direct sequence code division multiple access (MC -DS/ CDMA) system for different modulation is considered in this work. The utility functions for assaying the performance of MIMO MC-DS /CDMA for spectral efficient communication of the system carrying wireless data are envisaged. The spectral efficiency and power efficiency are referred as utility which divulges the level of satisfaction a user may get. According to the utility functions, two NPGPpsilas are propounded, which determines the existence and individuality of the Nash equilibria. A novel power control algorithm that delves the performance of the anticipated power control games to achieve the Nash equilibria is presented in this paper. The simulated results elucidate that a significant amelioration in terms of utilities specifically spectral efficiency for all users can be achieved using this approach. Also the propounded scheme exhibits better performance in the MIMO MC-DS /CDMA in terms of spectral efficiency as compared to the traditional system.
{"title":"A novel game theoretic power control algorithm for spectral efficient communication for MIMO MC-DS/CDMA system","authors":"V. Nagarajan, P. Dananjayan","doi":"10.1109/TENCON.2008.4766658","DOIUrl":"https://doi.org/10.1109/TENCON.2008.4766658","url":null,"abstract":"A distributed non cooperative power control game with pricing (NPGP) for multiple-input multiple-output (MIMO) multi-carrier direct sequence code division multiple access (MC -DS/ CDMA) system for different modulation is considered in this work. The utility functions for assaying the performance of MIMO MC-DS /CDMA for spectral efficient communication of the system carrying wireless data are envisaged. The spectral efficiency and power efficiency are referred as utility which divulges the level of satisfaction a user may get. According to the utility functions, two NPGPpsilas are propounded, which determines the existence and individuality of the Nash equilibria. A novel power control algorithm that delves the performance of the anticipated power control games to achieve the Nash equilibria is presented in this paper. The simulated results elucidate that a significant amelioration in terms of utilities specifically spectral efficiency for all users can be achieved using this approach. Also the propounded scheme exhibits better performance in the MIMO MC-DS /CDMA in terms of spectral efficiency as compared to the traditional system.","PeriodicalId":22230,"journal":{"name":"TENCON 2008 - 2008 IEEE Region 10 Conference","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90951960","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-11-01DOI: 10.1109/TENCON.2008.4766721
A. Sastry, S. Lanka., P. P. Clee, L. Reddy
The transformation from the traditional paper based society to a truly paperless information society involves huge amount of knowledge with necessary algorithmic approaches in the area of Document Image Processing. Progress in Indic Script analysis gained momentum in the recent period. Individual characters in these scripts undergo large number of shape variations due to complex nature of the canonical structure resembling the phonetic sequence. Separation of individual components and establishment of the relationship between these components in the recognition process is the major approach found in literature. In this paper, an attempt is made to extract Middle Zone Components by combining Component model and Zone Separation model on Telugu Document Images. Recognition of middle zone components is achieved with a novel technique of combining spatial features for understanding the topological characteristics and transform feature for effective classification. A tree classifier is adopted with Euler Number, Compact Ratio and Zernike moment as features. Unsupervised training strategy is adopted to identify the Middle Zone components. The optimum size of the training set is evaluated for various font sizes.
{"title":"Combining spatial and transform features for the recognition of middle zone components of Telugu","authors":"A. Sastry, S. Lanka., P. P. Clee, L. Reddy","doi":"10.1109/TENCON.2008.4766721","DOIUrl":"https://doi.org/10.1109/TENCON.2008.4766721","url":null,"abstract":"The transformation from the traditional paper based society to a truly paperless information society involves huge amount of knowledge with necessary algorithmic approaches in the area of Document Image Processing. Progress in Indic Script analysis gained momentum in the recent period. Individual characters in these scripts undergo large number of shape variations due to complex nature of the canonical structure resembling the phonetic sequence. Separation of individual components and establishment of the relationship between these components in the recognition process is the major approach found in literature. In this paper, an attempt is made to extract Middle Zone Components by combining Component model and Zone Separation model on Telugu Document Images. Recognition of middle zone components is achieved with a novel technique of combining spatial features for understanding the topological characteristics and transform feature for effective classification. A tree classifier is adopted with Euler Number, Compact Ratio and Zernike moment as features. Unsupervised training strategy is adopted to identify the Middle Zone components. The optimum size of the training set is evaluated for various font sizes.","PeriodicalId":22230,"journal":{"name":"TENCON 2008 - 2008 IEEE Region 10 Conference","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89725037","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
扫码关注我们
求助内容：
应助结果提醒方式：