Pub Date : 2017-05-01DOI: 10.1109/ICEMIS.2017.8273028
Hassene Bedoui, Mohsen Maraoui, K. B. Othman
In this work, the problem of diagnosis of uncertain nonlinear systems is tackled. The method is to use the interval analysis approach to estimate state vectors that are uncertain at the base. This approach assumes that uncertainty is random and with unknown probability distribution, except the upper and lower bounds of uncertainties are known. systems are designed by fuzzy models. An estimated interval of each model is calculated to deduce thereafter an estimate of the overall system. If the system is safe, the estimated measures, will be in the form of an interval includes the real outputs. Otherwise, it indicates a faulty functioning system.
{"title":"Diagnosis of uncertain fuzzy systems","authors":"Hassene Bedoui, Mohsen Maraoui, K. B. Othman","doi":"10.1109/ICEMIS.2017.8273028","DOIUrl":"https://doi.org/10.1109/ICEMIS.2017.8273028","url":null,"abstract":"In this work, the problem of diagnosis of uncertain nonlinear systems is tackled. The method is to use the interval analysis approach to estimate state vectors that are uncertain at the base. This approach assumes that uncertainty is random and with unknown probability distribution, except the upper and lower bounds of uncertainties are known. systems are designed by fuzzy models. An estimated interval of each model is calculated to deduce thereafter an estimate of the overall system. If the system is safe, the estimated measures, will be in the form of an interval includes the real outputs. Otherwise, it indicates a faulty functioning system.","PeriodicalId":117908,"journal":{"name":"2017 International Conference on Engineering & MIS (ICEMIS)","volume":"35 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":"130720055","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.8273052
Randa Khemiri, F. Sayadi, Haythem Bahri, Marwa Chouchene, Mohamed Atri
With the rapid development of multimedia technologies and network communication, the parallel architecture such as the Graphic Processing Unit (GPU) is introduced in high-performance computing. But, how to program this GPU and how to obtain the best execution time remains usually an art. In this paper, a search study is performed on the Thread and the Block number that leads to a Prediction Unit of 64×64 (PU64) computation in the High Efficiency Video Coding (HEVC). It is proposed through the Compute Unified Device Architecture (CUDA). This method is described to optimize the GPU execution time. Experimental results show that the best Grid topology chosen to run the GPU kernel is obtained for 128 Block and 32 Thread. This proposed repartition gives the minimum GPU execution time compared to the CPU one, where the speed-up obtained here is around 50%.
{"title":"Execution-time optimization based on thread and block repartitions on a graphic processing unit","authors":"Randa Khemiri, F. Sayadi, Haythem Bahri, Marwa Chouchene, Mohamed Atri","doi":"10.1109/ICEMIS.2017.8273052","DOIUrl":"https://doi.org/10.1109/ICEMIS.2017.8273052","url":null,"abstract":"With the rapid development of multimedia technologies and network communication, the parallel architecture such as the Graphic Processing Unit (GPU) is introduced in high-performance computing. But, how to program this GPU and how to obtain the best execution time remains usually an art. In this paper, a search study is performed on the Thread and the Block number that leads to a Prediction Unit of 64×64 (PU64) computation in the High Efficiency Video Coding (HEVC). It is proposed through the Compute Unified Device Architecture (CUDA). This method is described to optimize the GPU execution time. Experimental results show that the best Grid topology chosen to run the GPU kernel is obtained for 128 Block and 32 Thread. This proposed repartition gives the minimum GPU execution time compared to the CPU one, where the speed-up obtained here is around 50%.","PeriodicalId":117908,"journal":{"name":"2017 International Conference on Engineering & MIS (ICEMIS)","volume":"1 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":"128704928","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.8273016
Bilel Marzouki, O. Driss, K. Ghédira
In the manufacturing systems, The scheduling problem consists in assigning operations on a set of available resources in order to achieve defined objectives. The Flexible Job shop Scheduling Problem (FJSP) is an extension of classical Job shop Scheduling Problem (JSP) such that each operation can be processed on different machine and its processing time depends on the used machine. This paper proposes a model named Chemical Reaction Optimization with Greedy algorithm (CROG-FJSP) to solve the FJSP in order to minimize the maximum completion time (Makespan). Experiments are performed on benchmark instances proposed in the literature to evaluate the performance of our model.
{"title":"Chemical reaction optimization metaheuristic with greedy algorithm for flexible job shop scheduling problem","authors":"Bilel Marzouki, O. Driss, K. Ghédira","doi":"10.1109/ICEMIS.2017.8273016","DOIUrl":"https://doi.org/10.1109/ICEMIS.2017.8273016","url":null,"abstract":"In the manufacturing systems, The scheduling problem consists in assigning operations on a set of available resources in order to achieve defined objectives. The Flexible Job shop Scheduling Problem (FJSP) is an extension of classical Job shop Scheduling Problem (JSP) such that each operation can be processed on different machine and its processing time depends on the used machine. This paper proposes a model named Chemical Reaction Optimization with Greedy algorithm (CROG-FJSP) to solve the FJSP in order to minimize the maximum completion time (Makespan). Experiments are performed on benchmark instances proposed in the literature to evaluate the performance of our model.","PeriodicalId":117908,"journal":{"name":"2017 International Conference on Engineering & MIS (ICEMIS)","volume":"30 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":"127256697","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.8273096
L. Kechiche, L. Touil, B. Ouni
Embedded-system designers are focusing today on multimedia applications with an almost insatiable demand for low-cost and high performance. Generally, the majority of video applications need to execute parallel tasks with simultaneous access to the memory. In fact, these parallel tasks have different bandwidth requirements that have to be satisfied separately when granting access to the memory. In this paper, a general purpose architecture for video applications is proposed. This architecture satisfies the parallel access to the memory with different bandwidth requirements. The suggested solution is based on a multi port memory controller with the bandwidth guarantee priority access as an arbitration algorithm to guarantee QoS requirements. We demonstrate the important role of this solution in multi-video applications when multiple bandwidths are required. The proposed architecture is implemented using the Xilinx Virtex-5 FPGA.
{"title":"SOPC for real time multi-video treatments with QoS requirements","authors":"L. Kechiche, L. Touil, B. Ouni","doi":"10.1109/ICEMIS.2017.8273096","DOIUrl":"https://doi.org/10.1109/ICEMIS.2017.8273096","url":null,"abstract":"Embedded-system designers are focusing today on multimedia applications with an almost insatiable demand for low-cost and high performance. Generally, the majority of video applications need to execute parallel tasks with simultaneous access to the memory. In fact, these parallel tasks have different bandwidth requirements that have to be satisfied separately when granting access to the memory. In this paper, a general purpose architecture for video applications is proposed. This architecture satisfies the parallel access to the memory with different bandwidth requirements. The suggested solution is based on a multi port memory controller with the bandwidth guarantee priority access as an arbitration algorithm to guarantee QoS requirements. We demonstrate the important role of this solution in multi-video applications when multiple bandwidths are required. The proposed architecture is implemented using the Xilinx Virtex-5 FPGA.","PeriodicalId":117908,"journal":{"name":"2017 International Conference on Engineering & MIS (ICEMIS)","volume":" 39","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114053342","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.8273108
Sinda El-Gharbi, M. Tekaya, M. Hammami, B. Mechri
The olive fruit was rich in antioxidants such as phenolic compounds. These compounds will allow a good preservation of the olive oil over time. Indeed, olive quality parameters, such as the concentration of phenols and the free sugar composition are responsible for the nutritional value and fruit taste as well of the nutritional quality of the olive oil. In this context, the present study was carried out on the effect of storage time on the biochemical properties of fruits from ZARAZI cultivar. The results showed that (phenolic fraction, free sugars …) are influenced by storage time. Furthermore, the present data revealed great changes in the total polyphenols, in particular ortho-diphenols, and thus a reduction in of the soluble carbohydrates. The results of this work are promoters to suggest that conservation has a negative effect on the biochemical properties of the olive fruits.
{"title":"Effect of storage time on biochemical quality of olive fruits from Tunisian Zarazi cultivar: Physiological properties of olive fruits affected by storage","authors":"Sinda El-Gharbi, M. Tekaya, M. Hammami, B. Mechri","doi":"10.1109/ICEMIS.2017.8273108","DOIUrl":"https://doi.org/10.1109/ICEMIS.2017.8273108","url":null,"abstract":"The olive fruit was rich in antioxidants such as phenolic compounds. These compounds will allow a good preservation of the olive oil over time. Indeed, olive quality parameters, such as the concentration of phenols and the free sugar composition are responsible for the nutritional value and fruit taste as well of the nutritional quality of the olive oil. In this context, the present study was carried out on the effect of storage time on the biochemical properties of fruits from ZARAZI cultivar. The results showed that (phenolic fraction, free sugars …) are influenced by storage time. Furthermore, the present data revealed great changes in the total polyphenols, in particular ortho-diphenols, and thus a reduction in of the soluble carbohydrates. The results of this work are promoters to suggest that conservation has a negative effect on the biochemical properties of the olive fruits.","PeriodicalId":117908,"journal":{"name":"2017 International Conference on Engineering & MIS (ICEMIS)","volume":"86 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114026516","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.8273064
Elhem Techini, Z. Sakka, M. Bouhlel
This paper presents a noise robust technique for arabic automatic speech recognition engine. The technique is based on Cepstral Mean and Variance Normalization (CMVN) plus Auto Regressive Moving Average (ARMA) filtering which is called MVA. MVA used as a post-processing module to Mel Frequency Cepstral Coefficients (MFCC), Relative Spectral-Perceptual Linear Prediction (RASTA-PLP) and Power Normalized Cepstral Coefficients (PNCC) features to improve the recognition accuracy. While an isolated Arabic word engine was designed and developed using the Hidden Markov Model (HMM) to perform the recognition process at the back-end. Experimental results on the Arabic database demonstrate that our method provides substantial improvements in recognition accuracy for all features. The results also demonstrate that RASTA-PLP outperforms PNCC and MFCC features for word correction and word accuracy.
{"title":"Robust front-end based on MVA processing for Arabic speech recognition","authors":"Elhem Techini, Z. Sakka, M. Bouhlel","doi":"10.1109/ICEMIS.2017.8273064","DOIUrl":"https://doi.org/10.1109/ICEMIS.2017.8273064","url":null,"abstract":"This paper presents a noise robust technique for arabic automatic speech recognition engine. The technique is based on Cepstral Mean and Variance Normalization (CMVN) plus Auto Regressive Moving Average (ARMA) filtering which is called MVA. MVA used as a post-processing module to Mel Frequency Cepstral Coefficients (MFCC), Relative Spectral-Perceptual Linear Prediction (RASTA-PLP) and Power Normalized Cepstral Coefficients (PNCC) features to improve the recognition accuracy. While an isolated Arabic word engine was designed and developed using the Hidden Markov Model (HMM) to perform the recognition process at the back-end. Experimental results on the Arabic database demonstrate that our method provides substantial improvements in recognition accuracy for all features. The results also demonstrate that RASTA-PLP outperforms PNCC and MFCC features for word correction and word accuracy.","PeriodicalId":117908,"journal":{"name":"2017 International Conference on Engineering & MIS (ICEMIS)","volume":"77 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":"127034339","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.8272985
M. Harrabi, O. Driss, K. Ghédira
The Job shop scheduling problem with generic time lags is a generalization of the job shop problem. It is defined as a job shop problem with minimal and maximal delays between starting times of operations of different jobs. In this paper, we propose a combination of genetic algorithm and tabu search to solve Job Shop Problem with Generic Time Lags. Benchmark instances are used to investigate the performance of the proposed metaheuristic. The results show that the proposed combination of metaheuristics improves the efficiency.
{"title":"Combining genetic algorithm and tabu search metaheuristic for job shop scheduling problem with generic time lags","authors":"M. Harrabi, O. Driss, K. Ghédira","doi":"10.1109/ICEMIS.2017.8272985","DOIUrl":"https://doi.org/10.1109/ICEMIS.2017.8272985","url":null,"abstract":"The Job shop scheduling problem with generic time lags is a generalization of the job shop problem. It is defined as a job shop problem with minimal and maximal delays between starting times of operations of different jobs. In this paper, we propose a combination of genetic algorithm and tabu search to solve Job Shop Problem with Generic Time Lags. Benchmark instances are used to investigate the performance of the proposed metaheuristic. The results show that the proposed combination of metaheuristics improves the efficiency.","PeriodicalId":117908,"journal":{"name":"2017 International Conference on Engineering & MIS (ICEMIS)","volume":"22 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":"122992373","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.8272992
Hamdi Boukamcha, Mohamed Atri, F. Smach
Calibration of the internal and external parameters of a stereo vision camera is a well-known research problem in the computer vision. Usually, to get accurate 3D results the camera should be manually calibrate accurately as well. This paper proposes a robust approach to Auto Calibration stereo camera Without intervention of the user. There are several methods and techniques of calibration that have been proven, in this work we exploiting the geometric constraint, namely, the epipolar geometry. We specifically focuses to use 7 techniques for Features Extraction (SURF, BRISK, FAST, FREAK, MinEigen, MSERF, SIFT), however tries to establish the correspondences between points extracted in stereo images with Various Matching Techniques (SSD, SAD, Hamming). Then we exploits the Fundamental Matrix to estimate the epipolar Line by choosing the perfect Eight-point algorithms (Norm8Point, LMedS, RANSAC, MSAC, LTS). A large number of experiments have been carried out, and very good results have been obtained by Comparison & choice the perfect technique in every stage.
{"title":"Robust auto calibration technique for stereo camera","authors":"Hamdi Boukamcha, Mohamed Atri, F. Smach","doi":"10.1109/ICEMIS.2017.8272992","DOIUrl":"https://doi.org/10.1109/ICEMIS.2017.8272992","url":null,"abstract":"Calibration of the internal and external parameters of a stereo vision camera is a well-known research problem in the computer vision. Usually, to get accurate 3D results the camera should be manually calibrate accurately as well. This paper proposes a robust approach to Auto Calibration stereo camera Without intervention of the user. There are several methods and techniques of calibration that have been proven, in this work we exploiting the geometric constraint, namely, the epipolar geometry. We specifically focuses to use 7 techniques for Features Extraction (SURF, BRISK, FAST, FREAK, MinEigen, MSERF, SIFT), however tries to establish the correspondences between points extracted in stereo images with Various Matching Techniques (SSD, SAD, Hamming). Then we exploits the Fundamental Matrix to estimate the epipolar Line by choosing the perfect Eight-point algorithms (Norm8Point, LMedS, RANSAC, MSAC, LTS). A large number of experiments have been carried out, and very good results have been obtained by Comparison & choice the perfect technique in every stage.","PeriodicalId":117908,"journal":{"name":"2017 International Conference on Engineering & MIS (ICEMIS)","volume":"271 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":"121446131","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.8272960
S. Bani-Mohammad
Contiguous sub-mesh allocation usually suffers from the degrading effects of processor fragmentation as it requires that the processors that are allocated to a job request should be contiguous and have the same topology as the network connecting these processors. In non-contiguous allocation, the size and shape constraint affects on the system performance in terms of parameters such as job turnaround time and system utilization. Most recent non-contiguous allocation strategies suggested for 2D mesh multiconputers change the orientation of the job request when allocation fails for the original job request, and hence the system performance is improved. To generalize this restricted rotation, we propose in this paper, a new noncontiguous allocation strategy for 2D mesh multicomputers, referred to as All Request Shapes Greedy Available Busy List (ARSGABL for short), which considers all possible request shapes when attempting allocation for a job request. ARSGABL depends on the non-contiguous allocation strategy proposed in [20] for selecting an allocation sub-mesh. Results from extensive simulations under a variety of system loads and different job sizes confirm that the ARSGABL strategy improves system performance in terms of the average turnaround times of jobs.
{"title":"All request shapes non-contiguous submesh allocation strategy for 2D mesh multicomputer","authors":"S. Bani-Mohammad","doi":"10.1109/ICEMIS.2017.8272960","DOIUrl":"https://doi.org/10.1109/ICEMIS.2017.8272960","url":null,"abstract":"Contiguous sub-mesh allocation usually suffers from the degrading effects of processor fragmentation as it requires that the processors that are allocated to a job request should be contiguous and have the same topology as the network connecting these processors. In non-contiguous allocation, the size and shape constraint affects on the system performance in terms of parameters such as job turnaround time and system utilization. Most recent non-contiguous allocation strategies suggested for 2D mesh multiconputers change the orientation of the job request when allocation fails for the original job request, and hence the system performance is improved. To generalize this restricted rotation, we propose in this paper, a new noncontiguous allocation strategy for 2D mesh multicomputers, referred to as All Request Shapes Greedy Available Busy List (ARSGABL for short), which considers all possible request shapes when attempting allocation for a job request. ARSGABL depends on the non-contiguous allocation strategy proposed in [20] for selecting an allocation sub-mesh. Results from extensive simulations under a variety of system loads and different job sizes confirm that the ARSGABL strategy improves system performance in terms of the average turnaround times of jobs.","PeriodicalId":117908,"journal":{"name":"2017 International Conference on Engineering & MIS (ICEMIS)","volume":"31 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":"128634382","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.8273018
Safa Maraoui, A. Krifa, Kais Bouzrara
This article focuses on modeling and identification of a LTI system represented by Meixner-like functions. However a significant reduction of this model is subject to an optimal choice of Meixner-like pole. An iterative algorithm based on the Newton-Raphson's approximation technique and evolutionary method are proposed for the optimization of the Meixner-like pole from input/output measurements. The effectiveness of this method is tested on numerical example.
{"title":"Optimal expansions of Meixner-like model","authors":"Safa Maraoui, A. Krifa, Kais Bouzrara","doi":"10.1109/ICEMIS.2017.8273018","DOIUrl":"https://doi.org/10.1109/ICEMIS.2017.8273018","url":null,"abstract":"This article focuses on modeling and identification of a LTI system represented by Meixner-like functions. However a significant reduction of this model is subject to an optimal choice of Meixner-like pole. An iterative algorithm based on the Newton-Raphson's approximation technique and evolutionary method are proposed for the optimization of the Meixner-like pole from input/output measurements. The effectiveness of this method is tested on numerical example.","PeriodicalId":117908,"journal":{"name":"2017 International Conference on Engineering & MIS (ICEMIS)","volume":"47 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":"128643643","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
扫码关注我们
求助内容：
应助结果提醒方式：