Pub Date : 2017-05-01DOI: 10.1109/ICEMIS.2017.8273023
Omar Ben Maaouia, M. Jemni, Hazem Fkaier, C. Cérin
The rapid growth in demand for Information Technologies (IT) resources has led to the creation of large-scale data centers. These latter consume an enormous amount of electrical energy, resulting in high operating costs and carbon dioxide emissions. Moreover, modern Cloud computing environments should provide a high quality of service (QoS) for their customers. Thus, energy consumption has become a major concern for the widespread deployment of Cloud data centers. The growing importance for parallel applications in the Cloud introduces significant challenges in reducing energy consumption from hosted servers. With Cloud, customers can transparently access to virtually unlimited resources. The volunteer computing paradigm has become increasingly important, where the saved resources on each personal machine are shared thanks to the will of their customers. Cloud and volunteer paradigms have recently been seen as complementary technologies to better exploit the use of local resources. This paper presents the most well-known research in the literature on the minimization of energy consumption in traditional Cloud computing as well as in the volunteer one. A novel approach, based on searching shortest path in a graph, is also introduced.
{"title":"Towards optimizing energy consumption in Cloud","authors":"Omar Ben Maaouia, M. Jemni, Hazem Fkaier, C. Cérin","doi":"10.1109/ICEMIS.2017.8273023","DOIUrl":"https://doi.org/10.1109/ICEMIS.2017.8273023","url":null,"abstract":"The rapid growth in demand for Information Technologies (IT) resources has led to the creation of large-scale data centers. These latter consume an enormous amount of electrical energy, resulting in high operating costs and carbon dioxide emissions. Moreover, modern Cloud computing environments should provide a high quality of service (QoS) for their customers. Thus, energy consumption has become a major concern for the widespread deployment of Cloud data centers. The growing importance for parallel applications in the Cloud introduces significant challenges in reducing energy consumption from hosted servers. With Cloud, customers can transparently access to virtually unlimited resources. The volunteer computing paradigm has become increasingly important, where the saved resources on each personal machine are shared thanks to the will of their customers. Cloud and volunteer paradigms have recently been seen as complementary technologies to better exploit the use of local resources. This paper presents the most well-known research in the literature on the minimization of energy consumption in traditional Cloud computing as well as in the volunteer one. A novel approach, based on searching shortest path in a graph, is also introduced.","PeriodicalId":117908,"journal":{"name":"2017 International Conference on Engineering & MIS (ICEMIS)","volume":"153 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114427492","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-05-01DOI: 10.1109/ICEMIS.2017.8273101
Aravind Cheruvu, V. Radhakrishna, N. Rajasekhar
Euclidean distance measure is widely adopted distance measure to find the distance between any two vectors. In this paper, we extend the use of Euclidean distance to the context of normal distribution based temporal pattern mining. The similarity between any two patterns is computed by using the probability vectors of corresponding temporal patterns. These temporal patterns in our case are expressed as probability vector sequences. The probabilities are found from computed normal scores of patterns considering a given reference and using probability chart. The work in this paper is restricted to introducing the approach of mining patterns using the proposed dissimilarity measure.
{"title":"Using normal distribution to retrieve temporal associations by Euclidean distance","authors":"Aravind Cheruvu, V. Radhakrishna, N. Rajasekhar","doi":"10.1109/ICEMIS.2017.8273101","DOIUrl":"https://doi.org/10.1109/ICEMIS.2017.8273101","url":null,"abstract":"Euclidean distance measure is widely adopted distance measure to find the distance between any two vectors. In this paper, we extend the use of Euclidean distance to the context of normal distribution based temporal pattern mining. The similarity between any two patterns is computed by using the probability vectors of corresponding temporal patterns. These temporal patterns in our case are expressed as probability vector sequences. The probabilities are found from computed normal scores of patterns considering a given reference and using probability chart. The work in this paper is restricted to introducing the approach of mining patterns using the proposed dissimilarity measure.","PeriodicalId":117908,"journal":{"name":"2017 International Conference on Engineering & MIS (ICEMIS)","volume":"450 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116188018","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-05-01DOI: 10.1109/ICEMIS.2017.8272974
Elouaer Leila, Zitouni Naoufel, A. Mami
Recently, the modelling of industrial systems with Bond Graph is widely used. This graphical approach simplifies the description of dynamic behaviour of physical systems. For this purpose, we use this method to modelise the system of water treatment by (Ultra Violet) UV lamp. The UV lamp is powered by photovoltaic (PV) energy via an electronic ballast consisting of a DC / DC converter, a DC / AC converter and a resonant circuit (RLC).in this work we introduce the complicated UV lamp model and the water disinfection kinetics, where the radiant energy flux emitted by the dischargegas lamp and the arc voltage are a complex functions of the current and time. The 20 Sim Software is chosen to the simulation in a simple graphical way.
{"title":"Modelling of the water treatment system by Bond Graph","authors":"Elouaer Leila, Zitouni Naoufel, A. Mami","doi":"10.1109/ICEMIS.2017.8272974","DOIUrl":"https://doi.org/10.1109/ICEMIS.2017.8272974","url":null,"abstract":"Recently, the modelling of industrial systems with Bond Graph is widely used. This graphical approach simplifies the description of dynamic behaviour of physical systems. For this purpose, we use this method to modelise the system of water treatment by (Ultra Violet) UV lamp. The UV lamp is powered by photovoltaic (PV) energy via an electronic ballast consisting of a DC / DC converter, a DC / AC converter and a resonant circuit (RLC).in this work we introduce the complicated UV lamp model and the water disinfection kinetics, where the radiant energy flux emitted by the dischargegas lamp and the arc voltage are a complex functions of the current and time. The 20 Sim Software is chosen to the simulation in a simple graphical way.","PeriodicalId":117908,"journal":{"name":"2017 International Conference on Engineering & MIS (ICEMIS)","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122092392","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-05-01DOI: 10.1109/ICEMIS.2017.8273086
O. E. Meslouhi, M. Benaddy, B. E. Habil, M. E. Ouali, S. Krit, Zineb El Garrai, Khalid Nassiri
The objective of low-resolution face recognition is to identify faces in an uncontrolled situations like from small size or poor quality images with varying pose, illumination, expression, etc. Most existing approaches use features of just one type. In this work, we propose a robust low face recognition technique based on unimodal features fusion, which is more discriminative than using only one feature modality. Features of each facial image are extracted using three steps: i) both Gabor filters and Histogram of Oriented Gradients (HOG) descriptor are calculated. ii) the size of these features is reduced using the Linear Discriminant Analysis (LDA) method in order to remove redundant information. iii) the reduced features are combined using Discriminant Correlation Analysis (DCA) method. To achieve the recognition task, a Support Vectors Machine Classifier, is used. Performance of the proposed method will be measured using the AR database.
{"title":"Low-resolution face recognition using unimodal data fusion","authors":"O. E. Meslouhi, M. Benaddy, B. E. Habil, M. E. Ouali, S. Krit, Zineb El Garrai, Khalid Nassiri","doi":"10.1109/ICEMIS.2017.8273086","DOIUrl":"https://doi.org/10.1109/ICEMIS.2017.8273086","url":null,"abstract":"The objective of low-resolution face recognition is to identify faces in an uncontrolled situations like from small size or poor quality images with varying pose, illumination, expression, etc. Most existing approaches use features of just one type. In this work, we propose a robust low face recognition technique based on unimodal features fusion, which is more discriminative than using only one feature modality. Features of each facial image are extracted using three steps: i) both Gabor filters and Histogram of Oriented Gradients (HOG) descriptor are calculated. ii) the size of these features is reduced using the Linear Discriminant Analysis (LDA) method in order to remove redundant information. iii) the reduced features are combined using Discriminant Correlation Analysis (DCA) method. To achieve the recognition task, a Support Vectors Machine Classifier, is used. Performance of the proposed method will be measured using the AR database.","PeriodicalId":117908,"journal":{"name":"2017 International Conference on Engineering & MIS (ICEMIS)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124755393","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-05-01DOI: 10.1109/ICEMIS.2017.8273045
N. Alimi, Anissa Sghaier, Mohsen Machhout, R. Tourki
Due to its shortest key-length, Hyperelliptic Curve Cryptography (HECC) is considered as a promising Public Key Cryptography solution for securing future resource-constrained embedded systems. However, its mathematical complexity, compared to the Elliptic Curve Cryptography (ECC), is slowing down its standardization. In this paper, we try to fairly explore different hardware architectures of ECC and HECC under the same level of security through parallelizing modular arithmetic layer operations. Speed and cost results of the implemented curve-based cryptographic accelerators showed that without specific optimization, ECC still outperform HECC.
{"title":"Exploring the design space of curve-based cryptographic accelerators","authors":"N. Alimi, Anissa Sghaier, Mohsen Machhout, R. Tourki","doi":"10.1109/ICEMIS.2017.8273045","DOIUrl":"https://doi.org/10.1109/ICEMIS.2017.8273045","url":null,"abstract":"Due to its shortest key-length, Hyperelliptic Curve Cryptography (HECC) is considered as a promising Public Key Cryptography solution for securing future resource-constrained embedded systems. However, its mathematical complexity, compared to the Elliptic Curve Cryptography (ECC), is slowing down its standardization. In this paper, we try to fairly explore different hardware architectures of ECC and HECC under the same level of security through parallelizing modular arithmetic layer operations. Speed and cost results of the implemented curve-based cryptographic accelerators showed that without specific optimization, ECC still outperform HECC.","PeriodicalId":117908,"journal":{"name":"2017 International Conference on Engineering & MIS (ICEMIS)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131087535","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-05-01DOI: 10.1109/ICEMIS.2017.8273097
V. Radhakrishna, Shadi A. Aljawarneh, V. Janaki, P.V. Kumar
This research addresses the design of a novel dissimilarity measure for mining similar patterns from time stamped temporal databases applying the concept of standard score and normal distribution. The basic idea behind the design of dissimilarity measure is to use and transform supports to z-space and compute the probability of z-score of temporal patterns. The probability is obtained using normal distribution chart. The objective has been to design a normal distribution based dissimilarity measure which can be used to discover all valid similarity-profiled temporal association patterns.
{"title":"Looking into the possibility for designing normal distribution based dissimilarity measure to discover time profiled association patterns","authors":"V. Radhakrishna, Shadi A. Aljawarneh, V. Janaki, P.V. Kumar","doi":"10.1109/ICEMIS.2017.8273097","DOIUrl":"https://doi.org/10.1109/ICEMIS.2017.8273097","url":null,"abstract":"This research addresses the design of a novel dissimilarity measure for mining similar patterns from time stamped temporal databases applying the concept of standard score and normal distribution. The basic idea behind the design of dissimilarity measure is to use and transform supports to z-space and compute the probability of z-score of temporal patterns. The probability is obtained using normal distribution chart. The objective has been to design a normal distribution based dissimilarity measure which can be used to discover all valid similarity-profiled temporal association patterns.","PeriodicalId":117908,"journal":{"name":"2017 International Conference on Engineering & MIS (ICEMIS)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132470872","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-05-01DOI: 10.1109/ICEMIS.2017.8273056
A. Charrada, A. Samet
We investigate in this paper, the estimation of LTE downlink time-varying channel in high-speed environment. We develop, using Support Vector Machine Regression (SVR), an extended algorithm to jointly estimate the complex-valued channel frequency response in time and frequency domains from the transmission of reference signals. This method integrates first channel estimation at reference signals and then interpolation at data symbols through the 2D-SVR interpolation technique. Performances in terms of Bit Error Rate (BER) and Mean Square Error (MSE) are demonstrated via simulation for LTE Downlink with 500 Km/h mobile velocity joint with 64-QAM modulation.
{"title":"Time-varying channel environment estimation based on 2D-SVR interpolation","authors":"A. Charrada, A. Samet","doi":"10.1109/ICEMIS.2017.8273056","DOIUrl":"https://doi.org/10.1109/ICEMIS.2017.8273056","url":null,"abstract":"We investigate in this paper, the estimation of LTE downlink time-varying channel in high-speed environment. We develop, using Support Vector Machine Regression (SVR), an extended algorithm to jointly estimate the complex-valued channel frequency response in time and frequency domains from the transmission of reference signals. This method integrates first channel estimation at reference signals and then interpolation at data symbols through the 2D-SVR interpolation technique. Performances in terms of Bit Error Rate (BER) and Mean Square Error (MSE) are demonstrated via simulation for LTE Downlink with 500 Km/h mobile velocity joint with 64-QAM modulation.","PeriodicalId":117908,"journal":{"name":"2017 International Conference on Engineering & MIS (ICEMIS)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121404759","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-05-01DOI: 10.1109/ICEMIS.2017.8273020
Mohamed Lazhar Bellagha, M. Labidi, M. Maraoui
The number of speakers is generally greater in broadcast news, therefore speakers frequently occur under varying acoustic conditions. This makes the audio stream contain many speaker turns. Given the small amount of data available (short speech segments), segmentation techniques are not known for their robustness. To address the problems associated with the high number of speaker interventions, we propose an unsupervised speaker segmentation approach that has the advantage of high accuracy of model-selection-based methods. In this approach we use the adapted Gaussian mixture models (GMM) to describe the speaker's characteristics. Experimental results on several journalistic programs show that the proposed method significantly improves segmentation and therefore reduces the diarization error.
{"title":"Speaker segmentation using adapted GMMs","authors":"Mohamed Lazhar Bellagha, M. Labidi, M. Maraoui","doi":"10.1109/ICEMIS.2017.8273020","DOIUrl":"https://doi.org/10.1109/ICEMIS.2017.8273020","url":null,"abstract":"The number of speakers is generally greater in broadcast news, therefore speakers frequently occur under varying acoustic conditions. This makes the audio stream contain many speaker turns. Given the small amount of data available (short speech segments), segmentation techniques are not known for their robustness. To address the problems associated with the high number of speaker interventions, we propose an unsupervised speaker segmentation approach that has the advantage of high accuracy of model-selection-based methods. In this approach we use the adapted Gaussian mixture models (GMM) to describe the speaker's characteristics. Experimental results on several journalistic programs show that the proposed method significantly improves segmentation and therefore reduces the diarization error.","PeriodicalId":117908,"journal":{"name":"2017 International Conference on Engineering & MIS (ICEMIS)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114212091","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-05-01DOI: 10.1109/ICEMIS.2017.8273011
S. Salem, L. Cheniti-Belcadhi, R. Braham
Knowledge assessment can be defined as the process to describe, collect and provide useful information to make decision concerning leaner progress and various approaches of learning to be adopted. The assessment of questions with open and short answers, where the learner has to develop a response going of some words to 5 lines, constitutes a type of complex assessment technique. In this paper, we present an approach which can assist tutors in assessment of questions with open and short response by using concept maps for the answers and semantic similarity measures between the texts. This short answer assessment is based on the reference response prepared by the tutor. Following a knowledge base generation starting from the important concepts of the learner and tutor answers, we propose to compare them with a similarity measure to calculate and deliver a final score to the answer.
{"title":"A concept map based scenario for assessment of short and open answer questions","authors":"S. Salem, L. Cheniti-Belcadhi, R. Braham","doi":"10.1109/ICEMIS.2017.8273011","DOIUrl":"https://doi.org/10.1109/ICEMIS.2017.8273011","url":null,"abstract":"Knowledge assessment can be defined as the process to describe, collect and provide useful information to make decision concerning leaner progress and various approaches of learning to be adopted. The assessment of questions with open and short answers, where the learner has to develop a response going of some words to 5 lines, constitutes a type of complex assessment technique. In this paper, we present an approach which can assist tutors in assessment of questions with open and short response by using concept maps for the answers and semantic similarity measures between the texts. This short answer assessment is based on the reference response prepared by the tutor. Following a knowledge base generation starting from the important concepts of the learner and tutor answers, we propose to compare them with a similarity measure to calculate and deliver a final score to the answer.","PeriodicalId":117908,"journal":{"name":"2017 International Conference on Engineering & MIS (ICEMIS)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116113735","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-05-01DOI: 10.1109/ICEMIS.2017.8273083
Amel Ben Lazreg, Anis Ben Arbia, H. Youssef
This paper introduces an Industrial Cloudlet Network (ICN) architecture based on distributed smart services. The proposed architecture is expected to provide synchronization and lower latency between Cloud server and industrial End point devices connected to Cloudlets. The main goals are 1-to maintain efficient synchronized communications between Cloud and End point industrial devices, 2- to alleviate the problem of high latency with low bandwidth, 3- to permit to the end point to be connected to the Cloud even in offline mode status and 4- to allow connectivity to some old industrial equipment to Cloud server. In ICN, Cloudlet deploys limited internal resources such as memory and storage space but it embeds more computing capabilities and better communication processes than the industrial end point. In addition, Cloudlet's location is close to the industrial endpoint, which is not the case for the Cloud server. Thus, Cloudlet offers low latency and high bandwidth communication. In our case, the Cloudlet is used to recuperate crucial industrial parameters from the endpoint and to relay it to the Cloud server. In particular extreme cases, Cloudlet can made some local decisions in order to discard waiting processing time. In our work, we tested our solution with CPG Company (Company of Phosphates of Gafsa). Experimental results are discussed in the experimental section of this paper.
{"title":"A synchronized offline cloudlet architecture","authors":"Amel Ben Lazreg, Anis Ben Arbia, H. Youssef","doi":"10.1109/ICEMIS.2017.8273083","DOIUrl":"https://doi.org/10.1109/ICEMIS.2017.8273083","url":null,"abstract":"This paper introduces an Industrial Cloudlet Network (ICN) architecture based on distributed smart services. The proposed architecture is expected to provide synchronization and lower latency between Cloud server and industrial End point devices connected to Cloudlets. The main goals are 1-to maintain efficient synchronized communications between Cloud and End point industrial devices, 2- to alleviate the problem of high latency with low bandwidth, 3- to permit to the end point to be connected to the Cloud even in offline mode status and 4- to allow connectivity to some old industrial equipment to Cloud server. In ICN, Cloudlet deploys limited internal resources such as memory and storage space but it embeds more computing capabilities and better communication processes than the industrial end point. In addition, Cloudlet's location is close to the industrial endpoint, which is not the case for the Cloud server. Thus, Cloudlet offers low latency and high bandwidth communication. In our case, the Cloudlet is used to recuperate crucial industrial parameters from the endpoint and to relay it to the Cloud server. In particular extreme cases, Cloudlet can made some local decisions in order to discard waiting processing time. In our work, we tested our solution with CPG Company (Company of Phosphates of Gafsa). Experimental results are discussed in the experimental section of this paper.","PeriodicalId":117908,"journal":{"name":"2017 International Conference on Engineering & MIS (ICEMIS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114062207","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
扫码关注我们
求助内容：
应助结果提醒方式：