Pub Date : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723919
T. Chakraborty, A. Mukhopadhyay, I. Saha Misra, S. Sanyal
The performance of wireless LANs is greatly affected by path loss, RF interference and other sources of signal attenuation in addition to network congestion. The primary factors involved in effective real-time communication, namely delay and loss, must be within certain controlled limits in such a scenario. In this paper, we analyze the various factors driving IEEE 802.11b access points through extensive simulations and thereafter develop an optimization technique to configure the parameters of the Access Point. We simulate our test bed scenario and apply the developed algorithm. Finally, we implement the configured parameters in our testbed to provide optimum Voice over IP (VoIP) performance. Simulation and measured results have been included.
{"title":"Optimization technique for configuring IEEE 802.11b access point parameters to improve VoIP performance","authors":"T. Chakraborty, A. Mukhopadhyay, I. Saha Misra, S. Sanyal","doi":"10.1109/ICCITECHN.2010.5723919","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723919","url":null,"abstract":"The performance of wireless LANs is greatly affected by path loss, RF interference and other sources of signal attenuation in addition to network congestion. The primary factors involved in effective real-time communication, namely delay and loss, must be within certain controlled limits in such a scenario. In this paper, we analyze the various factors driving IEEE 802.11b access points through extensive simulations and thereafter develop an optimization technique to configure the parameters of the Access Point. We simulate our test bed scenario and apply the developed algorithm. Finally, we implement the configured parameters in our testbed to provide optimum Voice over IP (VoIP) performance. Simulation and measured results have been included.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114301409","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 : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723895
S. U. Ahmed, M. Shahjahan, K. Murase
In this paper, a faster supervised algorithm (BPfast) for the neural network training is proposed that maximizes the derivative of sigmoid activation function during back-propagation (BP) training. BP adjusts the weights of neural network with minimizing an error function. Due to the presence of derivative information in the weight update rule, BP goes to ‘premature saturation’ that slows down the training convergence. In the saturation region, the derivative information tends to zero. To overcome the problem, BPfast maximizes the derivative of activation function together with minimizing the error function. BPfast is tested on five real world benchmark problems such as breast cancer, diabetes, heart disease, Australian credit card, and horse. BPfast exhibits faster convergence and good generalization ability over standard BP algorithm.
{"title":"Maximization of the gradient function for efficient neural network training","authors":"S. U. Ahmed, M. Shahjahan, K. Murase","doi":"10.1109/ICCITECHN.2010.5723895","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723895","url":null,"abstract":"In this paper, a faster supervised algorithm (BPfast) for the neural network training is proposed that maximizes the derivative of sigmoid activation function during back-propagation (BP) training. BP adjusts the weights of neural network with minimizing an error function. Due to the presence of derivative information in the weight update rule, BP goes to ‘premature saturation’ that slows down the training convergence. In the saturation region, the derivative information tends to zero. To overcome the problem, BPfast maximizes the derivative of activation function together with minimizing the error function. BPfast is tested on five real world benchmark problems such as breast cancer, diabetes, heart disease, Australian credit card, and horse. BPfast exhibits faster convergence and good generalization ability over standard BP algorithm.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123429006","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 : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723832
S. Banik, M. Anwer, A. Khan
Soft computing forecasting tools play an important role to forecast many complicated systems. In this paper, an effort has been made to use soft computing approaches to predict Dhaka daily temperatures for the period of 28 February 1945 to 27 August 2006. We have selected the fuzzy neuro model, the neuro genetic algorithm model as soft computing techniques. To compare results, a popular time series statistical technique, namely autoregressive moving average model is selected and based on error analysis, a suitable model to predict temperature for Dhaka city is proposed. The performance comparisons of different models due to root mean square error, correlation coefficient and coefficient of determination between observed and predicted temperatures indicate that the neuro genetic algorithm model predicts temperatures with maximum accuracy, followed by the fuzzy neuro model. Our believe findings of this paper will be useful for those who are interested about Bangladeshi important atmospheric parameter, namely temperature.
{"title":"Soft computing models to predict daily temperature of Dhaka","authors":"S. Banik, M. Anwer, A. Khan","doi":"10.1109/ICCITECHN.2010.5723832","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723832","url":null,"abstract":"Soft computing forecasting tools play an important role to forecast many complicated systems. In this paper, an effort has been made to use soft computing approaches to predict Dhaka daily temperatures for the period of 28 February 1945 to 27 August 2006. We have selected the fuzzy neuro model, the neuro genetic algorithm model as soft computing techniques. To compare results, a popular time series statistical technique, namely autoregressive moving average model is selected and based on error analysis, a suitable model to predict temperature for Dhaka city is proposed. The performance comparisons of different models due to root mean square error, correlation coefficient and coefficient of determination between observed and predicted temperatures indicate that the neuro genetic algorithm model predicts temperatures with maximum accuracy, followed by the fuzzy neuro model. Our believe findings of this paper will be useful for those who are interested about Bangladeshi important atmospheric parameter, namely temperature.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123538890","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 : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723877
M. Shoyaib, M. Abdullah-Al-Wadud, Jo Moo Youl, Muhammad Mahbub Alam, O. Chae
We introduce a facial expression recognition method, which incorporates a weight to the Local Binary Pattern (LBP), and generates solid expression features. Furthermore, we use Adaboost to select a small set of prominent features, which is used by the Support Vector Machine (SVM) to classify facial expressions efficiently. Experimental results demonstrate that our method outperforms the state-of-the-art methods in terms of both accuracy and complexities.
{"title":"Facial expression recognition based on a weighted Local Binary Pattern","authors":"M. Shoyaib, M. Abdullah-Al-Wadud, Jo Moo Youl, Muhammad Mahbub Alam, O. Chae","doi":"10.1109/ICCITECHN.2010.5723877","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723877","url":null,"abstract":"We introduce a facial expression recognition method, which incorporates a weight to the Local Binary Pattern (LBP), and generates solid expression features. Furthermore, we use Adaboost to select a small set of prominent features, which is used by the Support Vector Machine (SVM) to classify facial expressions efficiently. Experimental results demonstrate that our method outperforms the state-of-the-art methods in terms of both accuracy and complexities.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125179035","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 : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723878
M. A. Wahid, M. Kaykobad, M. Hasan
Given a set of n points in the plane, the problem of computing the circular ordering of the points about a viewpoint v and efficiently maintaining this ordering information as v moves is well defined in computer graphics and animation. Each of the unique circular ordering in respect to v is called as view. In this paper, our task is to generalize this idea for 3D point set and to propose a kinetic data structure named Kinetic Neighborhood Graph to maintain the view dynamically with efficiency O(mλs(n2)), locality O(1) and responsiveness O(m).
{"title":"Kinetisation of view of 3D point set","authors":"M. A. Wahid, M. Kaykobad, M. Hasan","doi":"10.1109/ICCITECHN.2010.5723878","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723878","url":null,"abstract":"Given a set of n points in the plane, the problem of computing the circular ordering of the points about a viewpoint v and efficiently maintaining this ordering information as v moves is well defined in computer graphics and animation. Each of the unique circular ordering in respect to v is called as view. In this paper, our task is to generalize this idea for 3D point set and to propose a kinetic data structure named Kinetic Neighborhood Graph to maintain the view dynamically with efficiency O(mλs(n2)), locality O(1) and responsiveness O(m).","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130018838","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 : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723839
M. M. Rahaman, Anindya Das, M. Z. Nayen, Md. Saidur Rahman
This paper describes several feature extraction techniques, which will facilitate Automatic Speech Recognition (ASR) for Bangla speech. These techniques are applied on different sound-packets, which are essentially segments of Bangla speech. The key temporal regions in a sound-packet that contain vital information about the speech signal are identified. Some novel feature extraction methods are developed using the information contained within these key regions. It has been observed that a single feature cannot provide enough information to achieve successful automatic speech recognition; rather a combination of the features can be used effectively to increase the accuracy.
{"title":"Special feature extraction techniques for Bangla speech","authors":"M. M. Rahaman, Anindya Das, M. Z. Nayen, Md. Saidur Rahman","doi":"10.1109/ICCITECHN.2010.5723839","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723839","url":null,"abstract":"This paper describes several feature extraction techniques, which will facilitate Automatic Speech Recognition (ASR) for Bangla speech. These techniques are applied on different sound-packets, which are essentially segments of Bangla speech. The key temporal regions in a sound-packet that contain vital information about the speech signal are identified. Some novel feature extraction methods are developed using the information contained within these key regions. It has been observed that a single feature cannot provide enough information to achieve successful automatic speech recognition; rather a combination of the features can be used effectively to increase the accuracy.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128477986","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 : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723901
Javed Hossain, M. Ashraful Amin
This paper presents a simple and computationally efficient method for plant species recognition using leaf image. This method works only for the plants with broad flat leaves which are more or less two dimensional in nature. The method consists of five major parts. First, images of leaf are acquired with digital camera or scanners. Then the user selects the base point of the leaf and a few reference points on the leaf blades. Based on these points the leaf shape is extracted from the background and a binary image is produced. After that the leaf is aligned horizontally with its base point on the left of the image. Then several morphological features, such as eccentricity, area, perimeter, major axis, minor axis, equivalent diameter, convex area and extent, are extracted. A unique set of features are extracted from the leaves by slicing across the major axis and parallel to the minor axis. Then the feature pointes are normalized by taking the ratio of the slice lengths and leaf lengths (major axis). These features are used as inputs to the probabilistic neural network. The network was trained with 1200 simple leaves from 30 different plant species. The proposed method has been tested using ten-fold cross-validation technique and the system shows 91.41% average recognition accuracy.
{"title":"Leaf shape identification based plant biometrics","authors":"Javed Hossain, M. Ashraful Amin","doi":"10.1109/ICCITECHN.2010.5723901","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723901","url":null,"abstract":"This paper presents a simple and computationally efficient method for plant species recognition using leaf image. This method works only for the plants with broad flat leaves which are more or less two dimensional in nature. The method consists of five major parts. First, images of leaf are acquired with digital camera or scanners. Then the user selects the base point of the leaf and a few reference points on the leaf blades. Based on these points the leaf shape is extracted from the background and a binary image is produced. After that the leaf is aligned horizontally with its base point on the left of the image. Then several morphological features, such as eccentricity, area, perimeter, major axis, minor axis, equivalent diameter, convex area and extent, are extracted. A unique set of features are extracted from the leaves by slicing across the major axis and parallel to the minor axis. Then the feature pointes are normalized by taking the ratio of the slice lengths and leaf lengths (major axis). These features are used as inputs to the probabilistic neural network. The network was trained with 1200 simple leaves from 30 different plant species. The proposed method has been tested using ten-fold cross-validation technique and the system shows 91.41% average recognition accuracy.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121284671","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 : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723881
Faisal Mohsin
For many years the only known passive circuit elements were resistor, inductor and capacitor. In 1971, Leon Chua showed using argument that there should exist another passive element which he named memristor. It is basically a resistor whose resistance increases when current flows through it from one direction and decreases when current flows from the other direction. After 37 years researchers of HP became able to build world's first working memristor and surprised the electronics community. Chua proved that the characteristics of a memristor cannot be simulated using resistor, capacitor and inductor only and hence it is a fundamental element. Many new types of circuits can be built using memristor in it. But as it is a very new element so the no. of circuits is only a few. As memristor can have many resistance levels, we can use some discrete value as different logic level and thus can use in multivalued logic system. In this paper a method has been shown to achieve those different levels. Using this method we can use an array of memristor for making a non-volatile multivalued data storage system‥
{"title":"A multivalued storage system using memristor","authors":"Faisal Mohsin","doi":"10.1109/ICCITECHN.2010.5723881","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723881","url":null,"abstract":"For many years the only known passive circuit elements were resistor, inductor and capacitor. In 1971, Leon Chua showed using argument that there should exist another passive element which he named memristor. It is basically a resistor whose resistance increases when current flows through it from one direction and decreases when current flows from the other direction. After 37 years researchers of HP became able to build world's first working memristor and surprised the electronics community. Chua proved that the characteristics of a memristor cannot be simulated using resistor, capacitor and inductor only and hence it is a fundamental element. Many new types of circuits can be built using memristor in it. But as it is a very new element so the no. of circuits is only a few. As memristor can have many resistance levels, we can use some discrete value as different logic level and thus can use in multivalued logic system. In this paper a method has been shown to achieve those different levels. Using this method we can use an array of memristor for making a non-volatile multivalued data storage system‥","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133759884","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 : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723844
S. M. Kamruzzaman, M. S. Alam
In this paper, we propose a dynamic TDMA slot reservation (DTSR) protocol for cognitive radio ad hoc networks. Quality of Service (QoS) guarantee plays a critically important role in such networks. We consider the problem of providing QoS guarantee to users as well as to maintain the most efficient use of scarce bandwidth resources. A dynamic frame length expansion and shrinking scheme that controls the excessive increase of unassigned slots has been proposed. This method efficiently utilizes the channel bandwidth by assigning unused slots to new neighboring nodes and increasing the frame length when the number of slots in the frame is insufficient to support the neighboring nodes. It also shrinks the frame length in an effective way. Our proposed scheme, which provides both QoS guarantee and efficient resource utilization, be employed to optimize the channel spatial reuse and maximize the system throughput. Extensive simulation results show that the proposed mechanism achieves significant performance improvement in multichannel cognitive radio ad hoc networks.
{"title":"Dynamic TDMA slot reservation protocol for cognitive radio ad hoc networks","authors":"S. M. Kamruzzaman, M. S. Alam","doi":"10.1109/ICCITECHN.2010.5723844","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723844","url":null,"abstract":"In this paper, we propose a dynamic TDMA slot reservation (DTSR) protocol for cognitive radio ad hoc networks. Quality of Service (QoS) guarantee plays a critically important role in such networks. We consider the problem of providing QoS guarantee to users as well as to maintain the most efficient use of scarce bandwidth resources. A dynamic frame length expansion and shrinking scheme that controls the excessive increase of unassigned slots has been proposed. This method efficiently utilizes the channel bandwidth by assigning unused slots to new neighboring nodes and increasing the frame length when the number of slots in the frame is insufficient to support the neighboring nodes. It also shrinks the frame length in an effective way. Our proposed scheme, which provides both QoS guarantee and efficient resource utilization, be employed to optimize the channel spatial reuse and maximize the system throughput. Extensive simulation results show that the proposed mechanism achieves significant performance improvement in multichannel cognitive radio ad hoc networks.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133528843","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 : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723872
Md. Motaharul Islam, M. M. Hassan, E. Huh
IP based Wireless Sensor Networks (IP-WSN) are gaining importance for its broad range of applications in health-care, home automation, environmental monitoring, security & safety and industrial automation. In all of these applications mobility in sensor network with special attention to energy efficiency is a major issue to be addressed. Host based mobility management protocol is inherently unsuitable for energy inefficient IPWSN. So network-based mobility management protocol can be an alternative to the mobility supported IP-WSN. In this paper we propose a mobility supported IP-WSN protocol based on PMIPv6 called Sensor Proxy Mobile IPv6 (SPMIPv6). We present its architecture, message formats and also analyze its performance considering signaling cost and mobility cost. Our analyses show that the proposed scheme reduces the signaling cost by 67% and 60% as well as reduces mobility cost by 55% and 60% with comparison to MIPv6 and PMIPv6 respectively.
{"title":"Sensor Proxy Mobile IPv6 (SPMIPv6) - A framework of mobility supported IP-WSN","authors":"Md. Motaharul Islam, M. M. Hassan, E. Huh","doi":"10.1109/ICCITECHN.2010.5723872","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723872","url":null,"abstract":"IP based Wireless Sensor Networks (IP-WSN) are gaining importance for its broad range of applications in health-care, home automation, environmental monitoring, security & safety and industrial automation. In all of these applications mobility in sensor network with special attention to energy efficiency is a major issue to be addressed. Host based mobility management protocol is inherently unsuitable for energy inefficient IPWSN. So network-based mobility management protocol can be an alternative to the mobility supported IP-WSN. In this paper we propose a mobility supported IP-WSN protocol based on PMIPv6 called Sensor Proxy Mobile IPv6 (SPMIPv6). We present its architecture, message formats and also analyze its performance considering signaling cost and mobility cost. Our analyses show that the proposed scheme reduces the signaling cost by 67% and 60% as well as reduces mobility cost by 55% and 60% with comparison to MIPv6 and PMIPv6 respectively.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134179531","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
扫码关注我们
求助内容：
应助结果提醒方式：