Welcome to the ICEMIS 2015, our International Conference on Engineering and MIS. We are delighted that this conference, is organized by the International Association of Researchers (IARES), technically sponsored by ICPS at ACM, USA and hosted by the Istanbul Kemerburgaz University, Turkey. The ICEMIS 2015 includes participation by professionals from 30 countries, presenting 120 papers, together with 3 key-note speakers who will look at the academia's responsibility to acknowledge the engineering and MIS groups and labs over world.
{"title":"Proceedings of the The International Conference on Engineering & MIS 2015","authors":"Shadi A. Aljawarneh, Bassam Al-Shargabi","doi":"10.1145/2832987","DOIUrl":"https://doi.org/10.1145/2832987","url":null,"abstract":"Welcome to the ICEMIS 2015, our International Conference on Engineering and MIS. We are delighted that this conference, is organized by the International Association of Researchers (IARES), technically sponsored by ICPS at ACM, USA and hosted by the Istanbul Kemerburgaz University, Turkey. The ICEMIS 2015 includes participation by professionals from 30 countries, presenting 120 papers, together with 3 key-note speakers who will look at the academia's responsibility to acknowledge the engineering and MIS groups and labs over world.","PeriodicalId":416001,"journal":{"name":"Proceedings of the The International Conference on Engineering & MIS 2015","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123633647","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}
V. Radhakrishna, Puligadda Veereswara Kumar, V. Janaki
The problem of mining frequent patterns in a static database is studied extensively in the literature by many researchers. Conventional frequent pattern algorithms are not applicable to find frequent patterns from the temporal database. Temporal database is a database which can store past, present and future information. A temporal relation may be viewed as a database of time invariant and time variant relation instances. The objective of this research is to come up with a novel approach so as to find the temporal association patterns similar to a given reference support sequence and user defined threshold using the concept of Venn diagrams. The proposed approach scans the temporal database only once to find the temporal association patterns and hence reduces the huge overhead incurred when the database is scanned multiple times.
{"title":"A Novel Approach for Mining Similarity Profiled Temporal Association Patterns Using Venn Diagrams","authors":"V. Radhakrishna, Puligadda Veereswara Kumar, V. Janaki","doi":"10.1145/2832987.2833071","DOIUrl":"https://doi.org/10.1145/2832987.2833071","url":null,"abstract":"The problem of mining frequent patterns in a static database is studied extensively in the literature by many researchers. Conventional frequent pattern algorithms are not applicable to find frequent patterns from the temporal database. Temporal database is a database which can store past, present and future information. A temporal relation may be viewed as a database of time invariant and time variant relation instances. The objective of this research is to come up with a novel approach so as to find the temporal association patterns similar to a given reference support sequence and user defined threshold using the concept of Venn diagrams. The proposed approach scans the temporal database only once to find the temporal association patterns and hence reduces the huge overhead incurred when the database is scanned multiple times.","PeriodicalId":416001,"journal":{"name":"Proceedings of the The International Conference on Engineering & MIS 2015","volume":"216 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124695779","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}
This paper will present in details the concept of block turbo design in Algebraic Geometric (AG) codes constructed from Hermitian curves defined over finite fields, and the iterative decoding of the constructed block turbo codes using a High Input-High Output (HIHO) decoding technique based on Sakata's algorithm with Majority Voting (MV) technique and Chase-Pyndiah's Algorithm to extract a soft output from the hard output of the AG decoder. Then will present the simulation results of Bit-Error-Rate (BER) performance of Algebraic Geometric- Block Turbo Codes (AG-BTCs) compared with the BER performance of Reed Solomon- Block Turbo Codes (RS-BTCs) of about same size and relatively similar rate over different finite fields using Binary Phase Shift Keying (BPSK) modulation scheme.
{"title":"Performance Evaluation of AG Block Turbo Codes over Fading Channels Using BPSK","authors":"Omar A. Alzubi","doi":"10.1145/2832987.2833044","DOIUrl":"https://doi.org/10.1145/2832987.2833044","url":null,"abstract":"This paper will present in details the concept of block turbo design in Algebraic Geometric (AG) codes constructed from Hermitian curves defined over finite fields, and the iterative decoding of the constructed block turbo codes using a High Input-High Output (HIHO) decoding technique based on Sakata's algorithm with Majority Voting (MV) technique and Chase-Pyndiah's Algorithm to extract a soft output from the hard output of the AG decoder. Then will present the simulation results of Bit-Error-Rate (BER) performance of Algebraic Geometric- Block Turbo Codes (AG-BTCs) compared with the BER performance of Reed Solomon- Block Turbo Codes (RS-BTCs) of about same size and relatively similar rate over different finite fields using Binary Phase Shift Keying (BPSK) modulation scheme.","PeriodicalId":416001,"journal":{"name":"Proceedings of the The International Conference on Engineering & MIS 2015","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128238413","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}
Clustering text data streams is an unsupervised learning process which requires handling data streams. In the current work, we find the pair wise distance between customer transactions using the transaction similarity measure and obtain corresponding pair wise distance matrix. This pair wise distance matrix is then used to cluster the data streams such as customer transactions which are generated continuously in super markets and stored in to the database. For clustering, customer transactions, we use the k-means clustering algorithm. The input to k-means algorithm is the distance matrix in contrast to conventional approach which does not use the distance matrix. Finally, we define the proposed distance measure and validate it using the case study. We compare the results obtained using this approach with the one obtained using conventional k-means.
{"title":"An Approach for Clustering Text Data Streams Using K-means and Ternary Feature Vector Based Similarity Measure","authors":"M. PhridviRaj, C. V. Rao","doi":"10.1145/2832987.2833081","DOIUrl":"https://doi.org/10.1145/2832987.2833081","url":null,"abstract":"Clustering text data streams is an unsupervised learning process which requires handling data streams. In the current work, we find the pair wise distance between customer transactions using the transaction similarity measure and obtain corresponding pair wise distance matrix. This pair wise distance matrix is then used to cluster the data streams such as customer transactions which are generated continuously in super markets and stored in to the database. For clustering, customer transactions, we use the k-means clustering algorithm. The input to k-means algorithm is the distance matrix in contrast to conventional approach which does not use the distance matrix. Finally, we define the proposed distance measure and validate it using the case study. We compare the results obtained using this approach with the one obtained using conventional k-means.","PeriodicalId":416001,"journal":{"name":"Proceedings of the The International Conference on Engineering & MIS 2015","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128364595","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}
The MR image texture contains a rich source of information which consists of entities that characterize brightness, color, slope, size and other characteristics. Features extraction are identifying relevant features leads to faster, easier, and better to understand images. Feature extraction process affects significantly the quality of the classification process. Accordingly, select representative features effect on classification accuracy. So, principle component analysis (PCA) used to reduce number of features. MRI classification is a computational method used to find patterns and develop classification schemes for data in very huge datasets. In this paper, we use two well-known algorithms neural network (NN) and support vector machine (SVM) for classification of MRI of the human brain. The extracted texture features passed to NN and SVM. The classifiers have been used to classify MRI as abnormal or normal. We use a large benchmark dataset of 710 MRI brain images obtained from Harvard medical school. The experimental results show that our approach achieved was 99.29 % classification accuracy achieved by NN and 97.32 % by SVM with cross-validation 10. And 99.58 % achieved by NN and 97.09 % SVM by with percentage split with 66%.
{"title":"Performance Impact of Texture Features on MRI Image Classification","authors":"A. Al-Badarneh, Ali Alrazqi, Hassan M. Najadat","doi":"10.1145/2832987.2833063","DOIUrl":"https://doi.org/10.1145/2832987.2833063","url":null,"abstract":"The MR image texture contains a rich source of information which consists of entities that characterize brightness, color, slope, size and other characteristics. Features extraction are identifying relevant features leads to faster, easier, and better to understand images. Feature extraction process affects significantly the quality of the classification process. Accordingly, select representative features effect on classification accuracy. So, principle component analysis (PCA) used to reduce number of features. MRI classification is a computational method used to find patterns and develop classification schemes for data in very huge datasets. In this paper, we use two well-known algorithms neural network (NN) and support vector machine (SVM) for classification of MRI of the human brain. The extracted texture features passed to NN and SVM. The classifiers have been used to classify MRI as abnormal or normal. We use a large benchmark dataset of 710 MRI brain images obtained from Harvard medical school. The experimental results show that our approach achieved was 99.29 % classification accuracy achieved by NN and 97.32 % by SVM with cross-validation 10. And 99.58 % achieved by NN and 97.09 % SVM by with percentage split with 66%.","PeriodicalId":416001,"journal":{"name":"Proceedings of the The International Conference on Engineering & MIS 2015","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122428323","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}
Building secure software is challenging, time-consuming, and expensive. Software vulnerability prediction models that identify vulnerable software components are usually used to focus security efforts, with the aim of helping to reduce the time and effort needed to secure software. Existing vulnerability prediction models use process or product metrics and machine learning techniques to identify vulnerable software components. Cross project vulnerability prediction plays a significant role in appraising the most likely vulnerable software components, specifically for new or inactive projects. Little effort has been spent to deliver clear guidelines on how to choose the training data for project vulnerability prediction. In this work, we present an empirical study aiming at clarifying how useful cross project prediction techniques in predicting software vulnerabilities. Our study employs the classification provided by different machine learning techniques to improve the detection of vulnerable components. We have elaborately compared the prediction performance of five well-known classifiers. The study is conducted on a publicly available dataset of several PHP open source web applications and in the context of cross project vulnerability prediction, which represents one of the main challenges in the vulnerability prediction field.
{"title":"Towards Cross Project Vulnerability Prediction in Open Source Web Applications","authors":"I. Abunadi, Mamdouh Alenezi","doi":"10.1145/2832987.2833051","DOIUrl":"https://doi.org/10.1145/2832987.2833051","url":null,"abstract":"Building secure software is challenging, time-consuming, and expensive. Software vulnerability prediction models that identify vulnerable software components are usually used to focus security efforts, with the aim of helping to reduce the time and effort needed to secure software. Existing vulnerability prediction models use process or product metrics and machine learning techniques to identify vulnerable software components. Cross project vulnerability prediction plays a significant role in appraising the most likely vulnerable software components, specifically for new or inactive projects. Little effort has been spent to deliver clear guidelines on how to choose the training data for project vulnerability prediction. In this work, we present an empirical study aiming at clarifying how useful cross project prediction techniques in predicting software vulnerabilities. Our study employs the classification provided by different machine learning techniques to improve the detection of vulnerable components. We have elaborately compared the prediction performance of five well-known classifiers. The study is conducted on a publicly available dataset of several PHP open source web applications and in the context of cross project vulnerability prediction, which represents one of the main challenges in the vulnerability prediction field.","PeriodicalId":416001,"journal":{"name":"Proceedings of the The International Conference on Engineering & MIS 2015","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133361032","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}
Approximately 15% of the government's Gross Domestic Products (GDP) is spent on public procurement [1]. Therefore, accountability and transparency in public procurement is very important. For the regulation of public expenditures and effective use of the budget, not only public procurements but also efficient use of infrastructure that make up the system for public procurements should be considered. As a result, the importance of the electronic procurement processes is emphasized in this thesis. Public Procurement Authority (PPA) and the State Procurement and Supply Office (SPSO) responsible for public tenders in the Republic of Turkey are two foundations affiliated to the Ministry of Finance. However, in public procurement, both institutions have their own system, own business processes and legal obligations. Yet is it a privilege to have two different systems? To find the answer to this question, interoperable based Public electronic Procurement (PeP) system and current PeP system are compared with the cost analysis study for the Republic of Turkey.
{"title":"Cost Anaylsis of Interoperable Based E-Procurement System in the Republic of Turkey","authors":"M. Imamoglu, M. Rehan","doi":"10.1145/2832987.2832999","DOIUrl":"https://doi.org/10.1145/2832987.2832999","url":null,"abstract":"Approximately 15% of the government's Gross Domestic Products (GDP) is spent on public procurement [1]. Therefore, accountability and transparency in public procurement is very important. For the regulation of public expenditures and effective use of the budget, not only public procurements but also efficient use of infrastructure that make up the system for public procurements should be considered. As a result, the importance of the electronic procurement processes is emphasized in this thesis. Public Procurement Authority (PPA) and the State Procurement and Supply Office (SPSO) responsible for public tenders in the Republic of Turkey are two foundations affiliated to the Ministry of Finance. However, in public procurement, both institutions have their own system, own business processes and legal obligations. Yet is it a privilege to have two different systems? To find the answer to this question, interoperable based Public electronic Procurement (PeP) system and current PeP system are compared with the cost analysis study for the Republic of Turkey.","PeriodicalId":416001,"journal":{"name":"Proceedings of the The International Conference on Engineering & MIS 2015","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134125754","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}
M. Shamsuddoha, Md. Shariful Alam, Syed Ali Asif, Shadi A. Aljawarneh, K. Sakib, A. Imran
High availability and low service expenditure has enabled cloud computing to become popular to be used in providing large number of software services. However, supporting a large collection of software together with data storage present new threats to the cloud in terms load imbalance and service failures. This paper proposes CLBS-3, a threetier Load balancing Schema (LBS) for the cloud preserving low communication overhead and fault tolerance. Next, it provides a mechanism to recover from a failed condition and excessive load within short time and low network traffic. Performance analysis reveal desirable service delivery speed of 11.40 to 84.43 seconds. Also the less time taken to recover from a failure ensures that the service is consistent and reliable. The experimentation of the proposed framework on cloud platform with web enabled software services yield desirable performance.
{"title":"CLBS-3: A Three-Tier Load Balancer for ensuring Fault-Tolerance of Software running in Open-Source Cloud","authors":"M. Shamsuddoha, Md. Shariful Alam, Syed Ali Asif, Shadi A. Aljawarneh, K. Sakib, A. Imran","doi":"10.1145/2832987.2833068","DOIUrl":"https://doi.org/10.1145/2832987.2833068","url":null,"abstract":"High availability and low service expenditure has enabled cloud computing to become popular to be used in providing large number of software services. However, supporting a large collection of software together with data storage present new threats to the cloud in terms load imbalance and service failures. This paper proposes CLBS-3, a threetier Load balancing Schema (LBS) for the cloud preserving low communication overhead and fault tolerance. Next, it provides a mechanism to recover from a failed condition and excessive load within short time and low network traffic. Performance analysis reveal desirable service delivery speed of 11.40 to 84.43 seconds. Also the less time taken to recover from a failure ensures that the service is consistent and reliable. The experimentation of the proposed framework on cloud platform with web enabled software services yield desirable performance.","PeriodicalId":416001,"journal":{"name":"Proceedings of the The International Conference on Engineering & MIS 2015","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134346583","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}
Safia Djedri, D. Le Cerf, A. Boucherit, R. Issaadi
The importance of the formulation of emulsions in the various industries is steadily increasing, while it affected only the area of cosmetics. It is now in the pharmaceutical, petroleum, paint and others. Surfactants and polymers are the two most important additives in the formulation of emulsions (water in oil or oil in water). Their interactions modify significantly the surface properties and rheology of these systems. The control of these properties has become a major sauced of researcher laboratories Our study is related to the petroleum field, where we intend to develop stable emulsions (microemulsion) with interfacial tensions as low as possible with appropriate rheological properties. We have been able to prepare microemulsions with interfacial tensions of the order of 10−4 mN /m but the viscosities were comparable to that of water [1]. To improve the rheological properties, we undertook to study the influence of the addition of the biopolymer in these microemulsions in order to achieve viscosities in the range of 200 mPa in a way to conserve the values of interfacial tension. In this work, we present the results obtained with the following biopolymers hydroxyethyl cellulose and hydroxyethyl hydrophobic modified, discussing particularly the mode of introduction of these biopolymers.
{"title":"Effect of the Addition of Biopolymers in Micellar Systems","authors":"Safia Djedri, D. Le Cerf, A. Boucherit, R. Issaadi","doi":"10.1145/2832987.2832991","DOIUrl":"https://doi.org/10.1145/2832987.2832991","url":null,"abstract":"The importance of the formulation of emulsions in the various industries is steadily increasing, while it affected only the area of cosmetics. It is now in the pharmaceutical, petroleum, paint and others. Surfactants and polymers are the two most important additives in the formulation of emulsions (water in oil or oil in water). Their interactions modify significantly the surface properties and rheology of these systems. The control of these properties has become a major sauced of researcher laboratories Our study is related to the petroleum field, where we intend to develop stable emulsions (microemulsion) with interfacial tensions as low as possible with appropriate rheological properties. We have been able to prepare microemulsions with interfacial tensions of the order of 10−4 mN /m but the viscosities were comparable to that of water [1]. To improve the rheological properties, we undertook to study the influence of the addition of the biopolymer in these microemulsions in order to achieve viscosities in the range of 200 mPa in a way to conserve the values of interfacial tension. In this work, we present the results obtained with the following biopolymers hydroxyethyl cellulose and hydroxyethyl hydrophobic modified, discussing particularly the mode of introduction of these biopolymers.","PeriodicalId":416001,"journal":{"name":"Proceedings of the The International Conference on Engineering & MIS 2015","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133543892","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}
A. O. Mohammed, Ziad A. Abdelnabi, Abdelsalam M. Maatuk, Abdalmunam Abdalla
Software defects are categorized into two main types: Syntax and Semantic defects. Syntax defects are easily to capture using compliers (or interpreters) that programming languages have. However, compliers are incapable to detect semantic defects, and this makes programmers re-read the source code a number of times to figure out where the defects locations are. Semantic defects are unable to be detected by compilers, as they are logical errors, and need the code file to be inspected carefully to catch them. This paper presents an approach to help programmers in discovering semantic defects in object oriented programming. As software code reading techniques play the most important role in capturing semantic defects, we have conducted a number of controlled experiments using three reading techniques, in order to test their efficiency and effectiveness.
{"title":"An Experimental Study on Detecting Semantic Defects in Object-Oriented Programs using Software Reading Techniques","authors":"A. O. Mohammed, Ziad A. Abdelnabi, Abdelsalam M. Maatuk, Abdalmunam Abdalla","doi":"10.1145/2832987.2833025","DOIUrl":"https://doi.org/10.1145/2832987.2833025","url":null,"abstract":"Software defects are categorized into two main types: Syntax and Semantic defects. Syntax defects are easily to capture using compliers (or interpreters) that programming languages have. However, compliers are incapable to detect semantic defects, and this makes programmers re-read the source code a number of times to figure out where the defects locations are. Semantic defects are unable to be detected by compilers, as they are logical errors, and need the code file to be inspected carefully to catch them. This paper presents an approach to help programmers in discovering semantic defects in object oriented programming. As software code reading techniques play the most important role in capturing semantic defects, we have conducted a number of controlled experiments using three reading techniques, in order to test their efficiency and effectiveness.","PeriodicalId":416001,"journal":{"name":"Proceedings of the The International Conference on Engineering & MIS 2015","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116281757","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
扫码关注我们
求助内容：
应助结果提醒方式：