Pub Date : 2012-12-31DOI: 10.1109/ICCICT.2012.6398090
M. Kamath, A. Parab, A. Salyankar, S. Dholay
Visual cryptography (VC) schemes encrypt a secret image into two or more cover images, called shares. The secret image can be reconstructed by stacking the shares together, with no complex cryptographic calculations. This paper proposes a new VC scheme for color images. The shares generated are similar to the cover images, thereby reducing the suspicion of data encryption. The proposed scheme makes use of Jarvis error filter, a key table and specialized tables for coding. High visual quality is achieved as up to 50 percent of the secret image can be recovered.
{"title":"Extended visual cryptography for color images using coding tables","authors":"M. Kamath, A. Parab, A. Salyankar, S. Dholay","doi":"10.1109/ICCICT.2012.6398090","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398090","url":null,"abstract":"Visual cryptography (VC) schemes encrypt a secret image into two or more cover images, called shares. The secret image can be reconstructed by stacking the shares together, with no complex cryptographic calculations. This paper proposes a new VC scheme for color images. The shares generated are similar to the cover images, thereby reducing the suspicion of data encryption. The proposed scheme makes use of Jarvis error filter, a key table and specialized tables for coding. High visual quality is achieved as up to 50 percent of the secret image can be recovered.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"14 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":"132404406","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.6398198
B. Patro, J. K. Panigrahi, S. Mandal
A two-stage CMOS Voltage Controlled Ring Oscillator (VCRO) with very low power consumption has been designed in 45 nm CMOS process which operates at 1-V supply voltage. The circuit is simulated in GPDK 45 nm technology in Cadence environment. The simulation result shows wide tuning range from 6 GHz to 17 GHz and the oscillator can be used for electronic warfare application. It has also very low power consumption of about 3 μW. The phase noise of this ring oscillator is found to be -78 dBc/Hz @ 10 MHz offset which can be improved by using more number of stages.
{"title":"A 6–17 GHz linear wide tuning range and low power ring oscillator in 45nm CMOS process for electronic warfare","authors":"B. Patro, J. K. Panigrahi, S. Mandal","doi":"10.1109/ICCICT.2012.6398198","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398198","url":null,"abstract":"A two-stage CMOS Voltage Controlled Ring Oscillator (VCRO) with very low power consumption has been designed in 45 nm CMOS process which operates at 1-V supply voltage. The circuit is simulated in GPDK 45 nm technology in Cadence environment. The simulation result shows wide tuning range from 6 GHz to 17 GHz and the oscillator can be used for electronic warfare application. It has also very low power consumption of about 3 μW. The phase noise of this ring oscillator is found to be -78 dBc/Hz @ 10 MHz offset which can be improved by using more number of stages.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"147 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":"132798255","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.6398117
S. Chatterjee, J. K. Bag, M. Samadder
In wireless communication, handoff has become an important topic of research. A mobile station (MS) requires handoff when it travels out of the coverage area of its current access point (AP) and tries to associate with another AP. But handoff failure probability provides a serious barrier for such services to be made available to mobile platforms. Throughout the last few years plenty of research had been done to reduce handoff failure probability, whereas very few of them can be applied for an irregular (haphazard) motion of MS. In this paper, we are going to implement a new handoff scheme which is applicable for both regular and irregular motion of MS. We will find the minimum time interval (T) that the MS should stay within the handoff region (the particular area within a cell where the handoff is initiated and performed). We will repeat the scanning process number of times at different points of MS trajectory within the handoff region until the total scanning time exceeds the fixed time interval (T) and by doing so we can find out the most significant AP. Our simulation results show the effectiveness of our proposed scheme in practical field.
{"title":"Reducing handover failure probability by repetitive scanning process","authors":"S. Chatterjee, J. K. Bag, M. Samadder","doi":"10.1109/ICCICT.2012.6398117","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398117","url":null,"abstract":"In wireless communication, handoff has become an important topic of research. A mobile station (MS) requires handoff when it travels out of the coverage area of its current access point (AP) and tries to associate with another AP. But handoff failure probability provides a serious barrier for such services to be made available to mobile platforms. Throughout the last few years plenty of research had been done to reduce handoff failure probability, whereas very few of them can be applied for an irregular (haphazard) motion of MS. In this paper, we are going to implement a new handoff scheme which is applicable for both regular and irregular motion of MS. We will find the minimum time interval (T) that the MS should stay within the handoff region (the particular area within a cell where the handoff is initiated and performed). We will repeat the scanning process number of times at different points of MS trajectory within the handoff region until the total scanning time exceeds the fixed time interval (T) and by doing so we can find out the most significant AP. Our simulation results show the effectiveness of our proposed scheme in practical field.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"46 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":"130812822","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.6398159
D. Singh, S. Meher
Saliency detection is one of the core modules which is incorporated in various industrial applications such as computer vision, object based surveillance, content adaptive data delivery for low data rate systems. Saliency map represents the significance of objects in the scene. As in a visual scene all objects do not get equal attention. Objects which are different from their surroundings, automatically get more visual importance. Hardware based eye tracker devices are commercially available but the cost is comparatively very high. So to match the gaze attention, various algorithms are explored by several researchers. In this paper, multiscale phase spectrum based efficient saliency detection method is proposed. The proposed method is performing better by yielding better results than other methods. Four state-of-art of salient object detection techniques are analyzed along with the ground truth and compared against the proposed method for experimental evaluation.
{"title":"A novel approach for saliency detection based on multiscale phase spectrum","authors":"D. Singh, S. Meher","doi":"10.1109/ICCICT.2012.6398159","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398159","url":null,"abstract":"Saliency detection is one of the core modules which is incorporated in various industrial applications such as computer vision, object based surveillance, content adaptive data delivery for low data rate systems. Saliency map represents the significance of objects in the scene. As in a visual scene all objects do not get equal attention. Objects which are different from their surroundings, automatically get more visual importance. Hardware based eye tracker devices are commercially available but the cost is comparatively very high. So to match the gaze attention, various algorithms are explored by several researchers. In this paper, multiscale phase spectrum based efficient saliency detection method is proposed. The proposed method is performing better by yielding better results than other methods. Four state-of-art of salient object detection techniques are analyzed along with the ground truth and compared against the proposed method for experimental evaluation.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"179 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":"115226013","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.6398208
R. Doriya, P. Chakraborty, G. Nandi
This paper gives a framework to offer assistance to low cost ROS (Robot Operating System) supported heterogeneous robots in a large environment through cloud. To build such a system `Robot-Cloud' is prepared which extends the functionality of a robot. A `Robot-Cloud' is designed and implemented with components like cloud controller, ROS master node, storage unit, Map-reduce computing cluster and robotic services. In this system every robot is facilitated with ROS capability that helps to provide abstraction over hardware, heterogeneity and communication over TCP/IP. All the robots communicate with a master node present at the cloud controller to avail communication with other robots and to request services from the cloud. Our system supports all three basic service models i.e. Saas, PaaS and IaaS by incorporating typical SOA (Service Oriented Architecture) functionality. This approach can also be utilized to achieve a common goal for the networked robots. Finally, some simulation results are given to support the claimed framework.
{"title":"‘Robot-Cloud’: A framework to assist heterogeneous low cost robots","authors":"R. Doriya, P. Chakraborty, G. Nandi","doi":"10.1109/ICCICT.2012.6398208","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398208","url":null,"abstract":"This paper gives a framework to offer assistance to low cost ROS (Robot Operating System) supported heterogeneous robots in a large environment through cloud. To build such a system `Robot-Cloud' is prepared which extends the functionality of a robot. A `Robot-Cloud' is designed and implemented with components like cloud controller, ROS master node, storage unit, Map-reduce computing cluster and robotic services. In this system every robot is facilitated with ROS capability that helps to provide abstraction over hardware, heterogeneity and communication over TCP/IP. All the robots communicate with a master node present at the cloud controller to avail communication with other robots and to request services from the cloud. Our system supports all three basic service models i.e. Saas, PaaS and IaaS by incorporating typical SOA (Service Oriented Architecture) functionality. This approach can also be utilized to achieve a common goal for the networked robots. Finally, some simulation results are given to support the claimed framework.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"42 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":"114542399","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.6398121
H. Jayashree, V. P. Sai Shruthi
Design and Performance verification of Ternary CMOS SRAM is presented in this paper. Ternary SRAM is designed in 180nm, 90nm & 65nm technology process. The Ternary SRAM cell consists of two cross coupled Ternary inverters. READ and WRITE operations of the Ternary SRAM cell are performed with the help of Sense Amplifier, Tritline Conditioning circuits and Fast Decoders using TSPICE. The proposed work can be used for Low Power Application as the Fast Decoders use less number of Transistors compared to the conventional Decoders. The Ternary SRAM array module (1X1) in 65 nm technology consumes only 0.608mW power and data access time is about 9.88ns.
{"title":"Ternary SRAM for low power applications","authors":"H. Jayashree, V. P. Sai Shruthi","doi":"10.1109/ICCICT.2012.6398121","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398121","url":null,"abstract":"Design and Performance verification of Ternary CMOS SRAM is presented in this paper. Ternary SRAM is designed in 180nm, 90nm & 65nm technology process. The Ternary SRAM cell consists of two cross coupled Ternary inverters. READ and WRITE operations of the Ternary SRAM cell are performed with the help of Sense Amplifier, Tritline Conditioning circuits and Fast Decoders using TSPICE. The proposed work can be used for Low Power Application as the Fast Decoders use less number of Transistors compared to the conventional Decoders. The Ternary SRAM array module (1X1) in 65 nm technology consumes only 0.608mW power and data access time is about 9.88ns.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"24 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":"128169720","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.6398221
S. Mishra, S. Sawarkar
In this paper various techniques for low bit rate video coding are studied and implemented. The selection of an optimal regular-shaped pattern set for very low bit-rate video coding, focusing on moving regions has been the objective of much recent research in order to try and improve bit-rate efficiency. An approach to Variable Size Block Matching is also implemented, based on the binary partitioning of blocks. If a particular block does not allow for accurate motion compensation, then it is split into two using the horizontal or vertical line that achieves the maximum reduction in motion compensation error. This method causes partitioning to occur along motion boundaries, thus substantially reducing blocking artifacts. In addition, small blocks are placed in regions of complex motion, while large blocks cover regions of uniform motion. Also the paper is a review of the block matching algorithms used for motion estimation in video compression. It implements and compares 7 different types of block matching algorithms that range from the very basic Exhaustive Search to the recent fast adaptive algorithms like Adaptive Rood Pattern Search.
{"title":"Various techniques for low bit rate video coding","authors":"S. Mishra, S. Sawarkar","doi":"10.1109/ICCICT.2012.6398221","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398221","url":null,"abstract":"In this paper various techniques for low bit rate video coding are studied and implemented. The selection of an optimal regular-shaped pattern set for very low bit-rate video coding, focusing on moving regions has been the objective of much recent research in order to try and improve bit-rate efficiency. An approach to Variable Size Block Matching is also implemented, based on the binary partitioning of blocks. If a particular block does not allow for accurate motion compensation, then it is split into two using the horizontal or vertical line that achieves the maximum reduction in motion compensation error. This method causes partitioning to occur along motion boundaries, thus substantially reducing blocking artifacts. In addition, small blocks are placed in regions of complex motion, while large blocks cover regions of uniform motion. Also the paper is a review of the block matching algorithms used for motion estimation in video compression. It implements and compares 7 different types of block matching algorithms that range from the very basic Exhaustive Search to the recent fast adaptive algorithms like Adaptive Rood Pattern Search.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"129 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":"127141754","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.6398222
H. B. Kekre, Kavita Sonawane
This paper explains the effectiveness of average feature vector used as compared to a single query image feature vector to be fired to the CBIR designed using bins approach based on the partitioning of the equalized histograms of R, G and B planes of images. The feature vectors of dimension 27 are extracted into bins holding the statistical information of first 4 centralize absolute moments of R, G and B colors separately. Three different similarity measures are used in this paper for comparing the query image and database images namely Absolute distance, Euclidean distance and Cosine correlation distance. Experimentation of this approach is demonstrated for image database of 2000 BMP images containing 100 images from 20 different classes. Three parameters are used namely PRCP, LSRR and Longest String to evaluate the performance of the approaches used in this paper for CBIR.
{"title":"Performance improvement using average query fired to bins of four statistical moments for CBIR","authors":"H. B. Kekre, Kavita Sonawane","doi":"10.1109/ICCICT.2012.6398222","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398222","url":null,"abstract":"This paper explains the effectiveness of average feature vector used as compared to a single query image feature vector to be fired to the CBIR designed using bins approach based on the partitioning of the equalized histograms of R, G and B planes of images. The feature vectors of dimension 27 are extracted into bins holding the statistical information of first 4 centralize absolute moments of R, G and B colors separately. Three different similarity measures are used in this paper for comparing the query image and database images namely Absolute distance, Euclidean distance and Cosine correlation distance. Experimentation of this approach is demonstrated for image database of 2000 BMP images containing 100 images from 20 different classes. Three parameters are used namely PRCP, LSRR and Longest String to evaluate the performance of the approaches used in this paper for CBIR.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"72 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":"127270783","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.6398126
K. Sawant, R. Kumar, A. Gaikwad
The design of this paper represents the novel cpw-fed circular square corner fractal antenna with varying notch-band frequency characteristics. The position and width of the notch-band can be adjusted in the entire operating band. A prototype of the antenna has been designed on FR4-Epoxy substrate dielectric constant 4.4 and thickness h=1.53 mm with a N-shape slot in coplanar waveguide feed of length L = 7.4 mm and slot width W = 2.8 mm. The experimental result of this antenna exhibits ultra wide band characteristics from frequency 3.1 GHz to 15.0 GHz. The notch in operating band helps to reduce the interference with the frequency bands of Wireless Local Area Network (WLAN). The simulated and experimental return losses are found in good agreement. The experimental radiation of this antenna in azimuth plane is nearly omni-directional. This proposed cpw-fed circular square corner fractal antenna with varying notch-band frequency characteristics can thus be used for Ultra wide band (UWB) system, microwave imaging, precision position system, and radar tracking system.
{"title":"A novel CPW-FED circular square-corner fractal antenna with varying notch-band for UWB applications","authors":"K. Sawant, R. Kumar, A. Gaikwad","doi":"10.1109/ICCICT.2012.6398126","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398126","url":null,"abstract":"The design of this paper represents the novel cpw-fed circular square corner fractal antenna with varying notch-band frequency characteristics. The position and width of the notch-band can be adjusted in the entire operating band. A prototype of the antenna has been designed on FR4-Epoxy substrate dielectric constant 4.4 and thickness h=1.53 mm with a N-shape slot in coplanar waveguide feed of length L = 7.4 mm and slot width W = 2.8 mm. The experimental result of this antenna exhibits ultra wide band characteristics from frequency 3.1 GHz to 15.0 GHz. The notch in operating band helps to reduce the interference with the frequency bands of Wireless Local Area Network (WLAN). The simulated and experimental return losses are found in good agreement. The experimental radiation of this antenna in azimuth plane is nearly omni-directional. This proposed cpw-fed circular square corner fractal antenna with varying notch-band frequency characteristics can thus be used for Ultra wide band (UWB) system, microwave imaging, precision position system, and radar tracking system.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"42 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":"130160359","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.6398093
Rahul Dubey, D. Agrawal
Biometrics (or biometric authentication) assigns to the confirmation of humans by their biological features. Computer science, biometrics to be specific, is used as an aspect of determination and access control. It is also used to determine individuals in groups that are under examination. Handwriting is one of the most widely used biometric systems for authentication of person as well as document. Online and offline signature is existing in person identification and authentication problems. Offline signature categorizes the signature into two classes: genuine and forged. In this paper, we discuss various features of offline signature recognition and verification process. We review and compare existing techniques, their results and methods of feature extraction.
{"title":"Comparative analysis of off-line signature recognition","authors":"Rahul Dubey, D. Agrawal","doi":"10.1109/ICCICT.2012.6398093","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398093","url":null,"abstract":"Biometrics (or biometric authentication) assigns to the confirmation of humans by their biological features. Computer science, biometrics to be specific, is used as an aspect of determination and access control. It is also used to determine individuals in groups that are under examination. Handwriting is one of the most widely used biometric systems for authentication of person as well as document. Online and offline signature is existing in person identification and authentication problems. Offline signature categorizes the signature into two classes: genuine and forged. In this paper, we discuss various features of offline signature recognition and verification process. We review and compare existing techniques, their results and methods of feature extraction.","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":"128984260","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
扫码关注我们
求助内容：
应助结果提醒方式：