Pub Date : 2017-02-01DOI: 10.1109/CIACT.2017.7977345
Pankaj Kumar, R. Sharma
In the era of advanced microelectronics, rate of chip failure is increased with increased in chip density. A system must be fault tolerant to decrease the failure rate. The presence of multiple faults can destroy the functionality of a full adder and there is a trade-off between number of fault tolerated and area overhead. This paper presents an area efficient fault tolerant full adder design that can repair single and double fault without interrupting the normal operation of a system. In this approach, self checking full adder is used detecting the fault based on internal functionality. This makes the method efficient in term of area and number of fault tolerated when compared to the existing designs.
{"title":"Double fault tolerant full adder design using fault localization","authors":"Pankaj Kumar, R. Sharma","doi":"10.1109/CIACT.2017.7977345","DOIUrl":"https://doi.org/10.1109/CIACT.2017.7977345","url":null,"abstract":"In the era of advanced microelectronics, rate of chip failure is increased with increased in chip density. A system must be fault tolerant to decrease the failure rate. The presence of multiple faults can destroy the functionality of a full adder and there is a trade-off between number of fault tolerated and area overhead. This paper presents an area efficient fault tolerant full adder design that can repair single and double fault without interrupting the normal operation of a system. In this approach, self checking full adder is used detecting the fault based on internal functionality. This makes the method efficient in term of area and number of fault tolerated when compared to the existing designs.","PeriodicalId":218079,"journal":{"name":"2017 3rd International Conference on Computational Intelligence & Communication Technology (CICT)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134348284","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 : 2017-02-01DOI: 10.1109/CIACT.2017.7977360
Neha Bagwari, O. Kumar
Hadoop is an efficient open source framework to store and process the big data. Its component HDFS stores data in distributed manner preserving its consistency and availability while MapReduce is responsible for parallel processing. Hadoop fits best for fault tolerant storage and batch processing but searching is not optimized in Hadoop as it stores data in the form of blocks. It lacks in optimized index design leading to costly searching mechanism. To deal with this various indexing approaches have been proposed as an improvement in Hadoop architecture. In most of the approaches, MapReduce typically generates index at run time to process the data distributed across the cluster. This paper compares the existing indexing approaches and proposes a new index creation and storage technique for Hadoop eco system which will lead to better search results in Hadoop environment.
{"title":"Indexing optimizations on Hadoop","authors":"Neha Bagwari, O. Kumar","doi":"10.1109/CIACT.2017.7977360","DOIUrl":"https://doi.org/10.1109/CIACT.2017.7977360","url":null,"abstract":"Hadoop is an efficient open source framework to store and process the big data. Its component HDFS stores data in distributed manner preserving its consistency and availability while MapReduce is responsible for parallel processing. Hadoop fits best for fault tolerant storage and batch processing but searching is not optimized in Hadoop as it stores data in the form of blocks. It lacks in optimized index design leading to costly searching mechanism. To deal with this various indexing approaches have been proposed as an improvement in Hadoop architecture. In most of the approaches, MapReduce typically generates index at run time to process the data distributed across the cluster. This paper compares the existing indexing approaches and proposes a new index creation and storage technique for Hadoop eco system which will lead to better search results in Hadoop environment.","PeriodicalId":218079,"journal":{"name":"2017 3rd International Conference on Computational Intelligence & Communication Technology (CICT)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134304095","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 : 2017-02-01DOI: 10.1109/CIACT.2017.7977368
S. Devi, S. Deb
Technology driven modern education system highly depends on the devices which is not an exception in the classrooms. These technological advancements pave new opportunities for creating innovative methods of collaboration depending on gesticulations, body-movements and management of real-objects enhancing higher degree of engagement in classroom. Tangible user interfaces can be noteworthy to the educational environment by empowering the students to interact with virtual objects augmented with the computing power. In this paper, we proposed a system specifying how TUI can be a better alternative in regular classroom teaching learning and explore various possibilities of TUI that can enhance the learning outcome with spontaneous learning zeal. The system also outlines the solution to various problems associated with quality learning in elementary classes. Investigative, design engrossed studies have shown that TUI's offer educational aids, due to the added haptic dimension, shared-space and improved approachability which could be used effectively in collective circumstances.
{"title":"Exploring the potential of tangible user interface in classroom teaching — Learning","authors":"S. Devi, S. Deb","doi":"10.1109/CIACT.2017.7977368","DOIUrl":"https://doi.org/10.1109/CIACT.2017.7977368","url":null,"abstract":"Technology driven modern education system highly depends on the devices which is not an exception in the classrooms. These technological advancements pave new opportunities for creating innovative methods of collaboration depending on gesticulations, body-movements and management of real-objects enhancing higher degree of engagement in classroom. Tangible user interfaces can be noteworthy to the educational environment by empowering the students to interact with virtual objects augmented with the computing power. In this paper, we proposed a system specifying how TUI can be a better alternative in regular classroom teaching learning and explore various possibilities of TUI that can enhance the learning outcome with spontaneous learning zeal. The system also outlines the solution to various problems associated with quality learning in elementary classes. Investigative, design engrossed studies have shown that TUI's offer educational aids, due to the added haptic dimension, shared-space and improved approachability which could be used effectively in collective circumstances.","PeriodicalId":218079,"journal":{"name":"2017 3rd International Conference on Computational Intelligence & Communication Technology (CICT)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122209562","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 : 2017-02-01DOI: 10.1109/CIACT.2017.7977383
Ayan Kumar Tudu, P. Kundu
According to symmetric component theory, negative phase sequence in induction motors is caused due to unbalanced windings or due to the application of unbalanced supply voltages on the stator terminals. A magnetic field is created by this negative phase sequence component and this field rotates in the opposite direction causing a decrease in the motor output torque. In this article, a novel negative phase sequence detector for relaying for motor/generator protection and motor condition monitoring is proposed without using any negative sequence filter. In the proposed scheme, a phase sensitive rectification has been used for extraction resistive and reactive components of negative phase sequence current. A Matlab Simulink model has been developed to simulate the performance of phase sensitive rectification (PSR) and necessary computation of rms value of negative sequence component.
{"title":"Simulation of negative phase sequence relay based on phase sensitive rectification","authors":"Ayan Kumar Tudu, P. Kundu","doi":"10.1109/CIACT.2017.7977383","DOIUrl":"https://doi.org/10.1109/CIACT.2017.7977383","url":null,"abstract":"According to symmetric component theory, negative phase sequence in induction motors is caused due to unbalanced windings or due to the application of unbalanced supply voltages on the stator terminals. A magnetic field is created by this negative phase sequence component and this field rotates in the opposite direction causing a decrease in the motor output torque. In this article, a novel negative phase sequence detector for relaying for motor/generator protection and motor condition monitoring is proposed without using any negative sequence filter. In the proposed scheme, a phase sensitive rectification has been used for extraction resistive and reactive components of negative phase sequence current. A Matlab Simulink model has been developed to simulate the performance of phase sensitive rectification (PSR) and necessary computation of rms value of negative sequence component.","PeriodicalId":218079,"journal":{"name":"2017 3rd International Conference on Computational Intelligence & Communication Technology (CICT)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125527330","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 : 2017-02-01DOI: 10.1109/CIACT.2017.7977353
Manidipa Roy, A. Mittal
The microstrip patch antenna is extensively used in wireless communication purposes because of its compact size, planar design and economical aspects. Inspite of providing the designer the above mentioned advantages, the antenna suffers from serious hindrances of surface wave propagation and polarization mismatch. In this paper design techniques have been summarized for suppression of surface waves in microstrip patch antenna. Artificial dielectrics designed using EBGs have been proposed. The EBG structures thus proposed can be most suitable to suppress surface wave reduction.
{"title":"Recent advancements in techniques to suppress surface wave propagation in microstrip patch antenna","authors":"Manidipa Roy, A. Mittal","doi":"10.1109/CIACT.2017.7977353","DOIUrl":"https://doi.org/10.1109/CIACT.2017.7977353","url":null,"abstract":"The microstrip patch antenna is extensively used in wireless communication purposes because of its compact size, planar design and economical aspects. Inspite of providing the designer the above mentioned advantages, the antenna suffers from serious hindrances of surface wave propagation and polarization mismatch. In this paper design techniques have been summarized for suppression of surface waves in microstrip patch antenna. Artificial dielectrics designed using EBGs have been proposed. The EBG structures thus proposed can be most suitable to suppress surface wave reduction.","PeriodicalId":218079,"journal":{"name":"2017 3rd International Conference on Computational Intelligence & Communication Technology (CICT)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117222833","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 : 2017-02-01DOI: 10.1109/CIACT.2017.7977331
Manu, Aarti Goel
Dual modulus play important role in increasing the complexity of decomposing values into factors as compared to single modulus. This paper is based on RSA algorithm. Proposed encryption algorithm is more secure as compared to RSA algorithm since it uses dual modulus. This algorithm uses double encryption and decryption using double private and public keys to provide security against Brute-force attacks. Therefore, if an intruder detects a single key of cryptosystem even then it is not possible to decrypt the message. The basic motivation behind this paper is that in conventional RSA algorithm if we can factor modulus (n) into its prime numbers then we can generate private key. So in order to remove this weakness we can use dual modulus and improve the security of the system substantially.
{"title":"Encryption algorithm using dual modulus","authors":"Manu, Aarti Goel","doi":"10.1109/CIACT.2017.7977331","DOIUrl":"https://doi.org/10.1109/CIACT.2017.7977331","url":null,"abstract":"Dual modulus play important role in increasing the complexity of decomposing values into factors as compared to single modulus. This paper is based on RSA algorithm. Proposed encryption algorithm is more secure as compared to RSA algorithm since it uses dual modulus. This algorithm uses double encryption and decryption using double private and public keys to provide security against Brute-force attacks. Therefore, if an intruder detects a single key of cryptosystem even then it is not possible to decrypt the message. The basic motivation behind this paper is that in conventional RSA algorithm if we can factor modulus (n) into its prime numbers then we can generate private key. So in order to remove this weakness we can use dual modulus and improve the security of the system substantially.","PeriodicalId":218079,"journal":{"name":"2017 3rd International Conference on Computational Intelligence & Communication Technology (CICT)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121201551","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 : 2017-02-01DOI: 10.1109/CIACT.2017.7977300
L. Gagnani, K. Wandra, H. Chhinkaniwala
Classification is one of the widely used technique for data mining of dataset and is done using soft computing approach. Here a novel method called SSO-ELS is proposed for classification of datasets. In this method there is hybridization of Simplified Swarm Optimization (SSO) with ELS (Exchange Local Search), Particle Swarm Optimization (PSO) and Support Vector Machines(SVM) approach. This is done to resolve the issue of selection of hyper parameters in SVM. The selection of hyper parameters in SVM plays a crucial rule which is done by the PSO-SSO approach. This approach has two phases: In first phase best initial parameters of SVM are calculated using SSO with ELS approach and then the best parameters are fed into SVM using PSO in second phase. Brief review of classification methods is discussed. Experiments on UCI datasets indicate that the proposed SSO-PSO-SVM achieves better results than CS-PSO-SVM with respect to classification accuracy and F-measure.
分类是数据集挖掘中应用最广泛的技术之一，采用软计算方法进行分类。本文提出了一种新的数据集分类方法——SSO-ELS。该方法将简化群算法与ELS (Exchange Local Search)、粒子群算法(Particle Swarm Optimization, PSO)和支持向量机算法(Support Vector Machines, SVM)相结合。这样做是为了解决支持向量机的超参数选择问题。支持向量机中超参数的选择起着至关重要的作用，而PSO-SSO方法就是其中的关键。该方法分为两个阶段:第一阶段采用单点登录和ELS方法计算支持向量机的最佳初始参数，第二阶段采用粒子群算法将最佳参数输入支持向量机。简要回顾了分类方法。在UCI数据集上的实验表明，本文提出的SSO-PSO-SVM在分类精度和f测度方面都优于CS-PSO-SVM。
{"title":"Classification optimization using PSO-SSO based support vector machine","authors":"L. Gagnani, K. Wandra, H. Chhinkaniwala","doi":"10.1109/CIACT.2017.7977300","DOIUrl":"https://doi.org/10.1109/CIACT.2017.7977300","url":null,"abstract":"Classification is one of the widely used technique for data mining of dataset and is done using soft computing approach. Here a novel method called SSO-ELS is proposed for classification of datasets. In this method there is hybridization of Simplified Swarm Optimization (SSO) with ELS (Exchange Local Search), Particle Swarm Optimization (PSO) and Support Vector Machines(SVM) approach. This is done to resolve the issue of selection of hyper parameters in SVM. The selection of hyper parameters in SVM plays a crucial rule which is done by the PSO-SSO approach. This approach has two phases: In first phase best initial parameters of SVM are calculated using SSO with ELS approach and then the best parameters are fed into SVM using PSO in second phase. Brief review of classification methods is discussed. Experiments on UCI datasets indicate that the proposed SSO-PSO-SVM achieves better results than CS-PSO-SVM with respect to classification accuracy and F-measure.","PeriodicalId":218079,"journal":{"name":"2017 3rd International Conference on Computational Intelligence & Communication Technology (CICT)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131480142","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 : 2017-02-01DOI: 10.1109/CIACT.2017.7977347
Cao Mei, Z. Li
Adaptive sequential square root Kalman filtering (ASSRKF) algorithm is purposed to measure slip rate of wheel tractor online. The filtering process is formulated as a process of recursive the Kalman state model, where signals from wheel speed sensors, angular acceleration, GPS and accelerometer are fused. The principal advantages of combining sequential processing with square root algorithm are enhancing numerical accuracy and lowering storage requirements, thus removing the limitation of the computing capabilities of the embedded control system on the Kalman filter algorithm. On the basis of the sequential square root algorithm, the paper further propose formulas for the parallel fusion of data and adaptive filtering, so that the phenomenon of covariance matrix being unable to be inversed is avoided and real-time wheel slip rate can be obtained without the statistical law of the prior error. Both the simulation and the experimental results indicate that those presented in this paper are efficient.
{"title":"Sequential square root filtering for measuring tractor driving wheel slip rate","authors":"Cao Mei, Z. Li","doi":"10.1109/CIACT.2017.7977347","DOIUrl":"https://doi.org/10.1109/CIACT.2017.7977347","url":null,"abstract":"Adaptive sequential square root Kalman filtering (ASSRKF) algorithm is purposed to measure slip rate of wheel tractor online. The filtering process is formulated as a process of recursive the Kalman state model, where signals from wheel speed sensors, angular acceleration, GPS and accelerometer are fused. The principal advantages of combining sequential processing with square root algorithm are enhancing numerical accuracy and lowering storage requirements, thus removing the limitation of the computing capabilities of the embedded control system on the Kalman filter algorithm. On the basis of the sequential square root algorithm, the paper further propose formulas for the parallel fusion of data and adaptive filtering, so that the phenomenon of covariance matrix being unable to be inversed is avoided and real-time wheel slip rate can be obtained without the statistical law of the prior error. Both the simulation and the experimental results indicate that those presented in this paper are efficient.","PeriodicalId":218079,"journal":{"name":"2017 3rd International Conference on Computational Intelligence & Communication Technology (CICT)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130910646","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 : 2017-02-01DOI: 10.1109/CIACT.2017.7977280
M. Parashar, Swati Rajput, H. Dubey, M. Pandit
This paper presents a new powerful Bird Swarm Algorithm (BSA) for optimization. BSA basically works on the swarm intelligence and interactions among the birds. The concept behind this algorithm is the exploitation and exploration of optimum solution for a given problem based on foraging, vigilance and flight behavior. Formulation of BSA includes four search strategies associated with five simplified rules. Mathematically models the behavior of bird swarm is utilized for solution of various mathematical functions. To validate the effectiveness of BSA simulations have been performed on various numerical functions and ELD problems. The results obtained by BSA have been also compared with other Nature-Inspired algorithms. The performance of BSA on the convergence rate to obtain the optimal result on changing the parameter is also observed. Statistical comparison of results affirms the superiority of BSA over other algorithms reported in recent literatures.
{"title":"Optimization of benchmark functions using a nature inspired bird swarm algorithm","authors":"M. Parashar, Swati Rajput, H. Dubey, M. Pandit","doi":"10.1109/CIACT.2017.7977280","DOIUrl":"https://doi.org/10.1109/CIACT.2017.7977280","url":null,"abstract":"This paper presents a new powerful Bird Swarm Algorithm (BSA) for optimization. BSA basically works on the swarm intelligence and interactions among the birds. The concept behind this algorithm is the exploitation and exploration of optimum solution for a given problem based on foraging, vigilance and flight behavior. Formulation of BSA includes four search strategies associated with five simplified rules. Mathematically models the behavior of bird swarm is utilized for solution of various mathematical functions. To validate the effectiveness of BSA simulations have been performed on various numerical functions and ELD problems. The results obtained by BSA have been also compared with other Nature-Inspired algorithms. The performance of BSA on the convergence rate to obtain the optimal result on changing the parameter is also observed. Statistical comparison of results affirms the superiority of BSA over other algorithms reported in recent literatures.","PeriodicalId":218079,"journal":{"name":"2017 3rd International Conference on Computational Intelligence & Communication Technology (CICT)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126729657","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 : 2017-02-01DOI: 10.1109/CIACT.2017.7977371
N. Akhtar, Vasim Ahamad, Hira Javed
A least significant bit (LSB) Steganography is mainly characterized by its hiding capacity and imperceptibility which is measured by Peak Signal to Noise Ratio (PSNR). There is a trade-off between these two factors. In this paper, an improved LSB Steganography which uses modulus function for data hiding method has been proposed and implemented which is better than previous methods in imperceptibility keeping the hiding capacity same. The proposed Steganography method breaks the secret data into two components. Each component is hidden into cover image pixels using modulo function. Repetition in secret data component is also considered. Results show that the proposed method is better than existing methods unless there is high randomness in secret data.
{"title":"A compressed LSB steganography method","authors":"N. Akhtar, Vasim Ahamad, Hira Javed","doi":"10.1109/CIACT.2017.7977371","DOIUrl":"https://doi.org/10.1109/CIACT.2017.7977371","url":null,"abstract":"A least significant bit (LSB) Steganography is mainly characterized by its hiding capacity and imperceptibility which is measured by Peak Signal to Noise Ratio (PSNR). There is a trade-off between these two factors. In this paper, an improved LSB Steganography which uses modulus function for data hiding method has been proposed and implemented which is better than previous methods in imperceptibility keeping the hiding capacity same. The proposed Steganography method breaks the secret data into two components. Each component is hidden into cover image pixels using modulo function. Repetition in secret data component is also considered. Results show that the proposed method is better than existing methods unless there is high randomness in secret data.","PeriodicalId":218079,"journal":{"name":"2017 3rd International Conference on Computational Intelligence & Communication Technology (CICT)","volume":"308 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124392814","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
扫码关注我们
求助内容：
应助结果提醒方式：