Concept maps have been used to assist learners as an effective learning method in identifying relationships between information, especially when teaching materials have many topics or concepts. However, making a manual concept map is a long and tedious task. It is time-consuming and demands an intensive effort in reading the full content and reasoning the relationships among concepts. Due to this inefficiency, many studies are carried out to develop intelligent algorithms using several data mining techniques. In this research, the authors aim at improving Text Analysis-Association Rules Mining (TA-ARM) algorithm using the weighted K-nearest neighbors (KNN) algorithm instead of the traditional KNN. The weighted KNN is expected to optimize the classification accuracy, which will, eventually, enhance the quality of the generated concept map.
{"title":"Improving an AI-Based Algorithm to Automatically Generate Concept Maps","authors":"Sara Alomari, S. Abdullah","doi":"10.5539/cis.v12n4p72","DOIUrl":"https://doi.org/10.5539/cis.v12n4p72","url":null,"abstract":"Concept maps have been used to assist learners as an effective learning method in identifying relationships between information, especially when teaching materials have many topics or concepts. However, making a manual concept map is a long and tedious task. It is time-consuming and demands an intensive effort in reading the full content and reasoning the relationships among concepts. Due to this inefficiency, many studies are carried out to develop intelligent algorithms using several data mining techniques. In this research, the authors aim at improving Text Analysis-Association Rules Mining (TA-ARM) algorithm using the weighted K-nearest neighbors (KNN) algorithm instead of the traditional KNN. The weighted KNN is expected to optimize the classification accuracy, which will, eventually, enhance the quality of the generated concept map.","PeriodicalId":14676,"journal":{"name":"J. Chem. Inf. Comput. Sci.","volume":"81 8","pages":"72-83"},"PeriodicalIF":0.0,"publicationDate":"2019-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91498153","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 establishment of the multimedia session is crucial in the WebRTC architecture before media and data transmission. The preliminary bi-directional flow provides the network with all the information needed in order to control and manage the communication between end-users. This control includes the setup, management, and teardown of a session and the definition, and the modification of multiple features that will be enabled in the ongoing session. This is performed by a mechanism named Signaling. In this work, we will use the formal verification to increase confidence in our SDL model by checking the consistency and reliability of the WebRTC Peer to Peer system. The verification and validation are proved the most efficient tools to avoid errors and defects in the concurrent system designs. Indeed, by using model-checking techniques we will verify if the WebRTC system adheres to standards if it performs the selected functions in the correct manner. To achieve that, we will first translate the SDL model to an intermediate format IF that will be retranslated to a Promela Model. Second, using the SPIN model checker, we will verify the general correctness of the model before checking if the desired properties are satisfied using the Linear Temporal Logic (LTL).
{"title":"Model Checking of WebRTC Peer to Peer System","authors":"A. Hamzaoui, Hicham Bensaid, A. En-Nouaary","doi":"10.5539/cis.v12n4p56","DOIUrl":"https://doi.org/10.5539/cis.v12n4p56","url":null,"abstract":"The establishment of the multimedia session is crucial in the WebRTC architecture before media and data transmission. The preliminary bi-directional flow provides the network with all the information needed in order to control and manage the communication between end-users. This control includes the setup, management, and teardown of a session and the definition, and the modification of multiple features that will be enabled in the ongoing session. This is performed by a mechanism named Signaling. In this work, we will use the formal verification to increase confidence in our SDL model by checking the consistency and reliability of the WebRTC Peer to Peer system. The verification and validation are proved the most efficient tools to avoid errors and defects in the concurrent system designs. Indeed, by using model-checking techniques we will verify if the WebRTC system adheres to standards if it performs the selected functions in the correct manner. To achieve that, we will first translate the SDL model to an intermediate format IF that will be retranslated to a Promela Model. Second, using the SPIN model checker, we will verify the general correctness of the model before checking if the desired properties are satisfied using the Linear Temporal Logic (LTL).","PeriodicalId":14676,"journal":{"name":"J. Chem. Inf. Comput. Sci.","volume":"9 1","pages":"56-71"},"PeriodicalIF":0.0,"publicationDate":"2019-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74437639","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 purpose of this paper is to explore the impact of the cloud technology on current research information systems (CRIS). Based on an overview of published literature and on empirical evidence from surveys, the paper presents main characteristics, delivery models, service levels and general benefits of cloud computing. The second part assesses how the cloud computing challenges the research information management, from three angles: networking, specific benefits, and the ingestion of data in the cloud. The third part describes three aspects of the implementation of current research systems in the clouds, i.e. service models, requirements and potential risks and barriers. The paper concludes with some perspectives for future work. The paper is written for CRIS administrators and users, in order to improve research information management and to contribute to future development and implementation of these systems, but also for scholars and students who want to have detailed knowledge on this topic.
{"title":"Research Intelligence (CRIS) and the Cloud: A Review","authors":"Otmane Azeroual, Joachim Schöpfel","doi":"10.5539/cis.v12n4p40","DOIUrl":"https://doi.org/10.5539/cis.v12n4p40","url":null,"abstract":"The purpose of this paper is to explore the impact of the cloud technology on current research information systems (CRIS). Based on an overview of published literature and on empirical evidence from surveys, the paper presents main characteristics, delivery models, service levels and general benefits of cloud computing. The second part assesses how the cloud computing challenges the research information management, from three angles: networking, specific benefits, and the ingestion of data in the cloud. The third part describes three aspects of the implementation of current research systems in the clouds, i.e. service models, requirements and potential risks and barriers. The paper concludes with some perspectives for future work. The paper is written for CRIS administrators and users, in order to improve research information management and to contribute to future development and implementation of these systems, but also for scholars and students who want to have detailed knowledge on this topic.","PeriodicalId":14676,"journal":{"name":"J. Chem. Inf. Comput. Sci.","volume":"1 1","pages":"40-55"},"PeriodicalIF":0.0,"publicationDate":"2019-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75394857","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 mathematical basics of graph modeling and paradigm programming of applied systems (AS) are presented. The vertices of graph are been the functional elements of the systems and the arcs define the connections between them. The graph is represented by an adjacency and reach ability matrix. A number of graph of program structures and their representation by mathematical operations (unions, connections, differences, etc.) are shown. Given the characteristics of graph structures, complexes, units, and systems created from the modules of the graph. The method of modeling the system on the graph of modules, which describe in the programming languages (LP) and calling them with operations (link, assembling, building, etc.). The standard of configuration (2012) Assembly of heterogeneous software elements in AS of different fields of knowledge is made. Brief descriptions of modern and future programming paradigms for formal theoretical creation of systems from service-components for Internet in the near future are given.
{"title":"The Theory Graph Modeling and Programming Systems from Module Elements to the Application Areas","authors":"E. Lavrischeva","doi":"10.5539/cis.v12n4p20","DOIUrl":"https://doi.org/10.5539/cis.v12n4p20","url":null,"abstract":"The mathematical basics of graph modeling and paradigm programming of applied systems (AS) are presented. The vertices of graph are been the functional elements of the systems and the arcs define the connections between them. The graph is represented by an adjacency and reach ability matrix. A number of graph of program structures and their representation by mathematical operations (unions, connections, differences, etc.) are shown. Given the characteristics of graph structures, complexes, units, and systems created from the modules of the graph. The method of modeling the system on the graph of modules, which describe in the programming languages (LP) and calling them with operations (link, assembling, building, etc.). The standard of configuration (2012) Assembly of heterogeneous software elements in AS of different fields of knowledge is made. Brief descriptions of modern and future programming paradigms for formal theoretical creation of systems from service-components for Internet in the near future are given.","PeriodicalId":14676,"journal":{"name":"J. Chem. Inf. Comput. Sci.","volume":"76 1","pages":"20-39"},"PeriodicalIF":0.0,"publicationDate":"2019-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86706749","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}
Archiving and digital document management in educational institutions are not amply studied despite the active use of technologies for these purposes. In this research, a qualitative descriptive case study has been conducted to examine how digital archiving and document management are organised at Taibah University to address the needs of researchers, professors, administrators and students as well as to guarantee secure storage of and access to data. The selection of the case study design has allowed for in-depth analyses of the strategy for managing and archiving data in the selected institution. The interpretation of data with reference to the previously formulated propositions have indicated that Taibah University follows a certain strategy for managing electronic documents, but they do not use a unique data management system. Furthermore, archiving is applied only to a limited number of documents and security of stored data is guaranteed according to the University’s policies.
{"title":"Archiving and Document Management at Taibah University: A Case Study","authors":"J. Alokluk","doi":"10.5539/cis.v12n4p11","DOIUrl":"https://doi.org/10.5539/cis.v12n4p11","url":null,"abstract":"Archiving and digital document management in educational institutions are not amply studied despite the active use of technologies for these purposes. In this research, a qualitative descriptive case study has been conducted to examine how digital archiving and document management are organised at Taibah University to address the needs of researchers, professors, administrators and students as well as to guarantee secure storage of and access to data. The selection of the case study design has allowed for in-depth analyses of the strategy for managing and archiving data in the selected institution. The interpretation of data with reference to the previously formulated propositions have indicated that Taibah University follows a certain strategy for managing electronic documents, but they do not use a unique data management system. Furthermore, archiving is applied only to a limited number of documents and security of stored data is guaranteed according to the University’s policies.","PeriodicalId":14676,"journal":{"name":"J. Chem. Inf. Comput. Sci.","volume":"5 1","pages":"11-19"},"PeriodicalIF":0.0,"publicationDate":"2019-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82479801","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}
Road traffic crashes are a public health issue due to their terrible impact on individuals, communities, and countries. Studies affirmed that vehicle speed is a major contributor to crash likelihood and severity. At the same time, they identified Automated Speed Enforcement (ASE) systems, namely speed cameras, as a highly effective measure to reduce excessive and inappropriate speed, and thus improving road safety. However, identifying optimum sites for fixed speed camera placement stays an open issue in the literature, although it is a key factor that guarantees the efficiency of such ASE systems. This paper describes a predictive framework of speed camera locations using a classification algorithm that can predict, for each section of a given road network, its pertinence as a speed camera location. First, we identify a set of features as predictors of the classification algorithm, that we have argued their goodness through correlation tests. Second, for training our algorithm, data from road controlled sections, corresponding to existing speed cameras, is exploited. Each section class reflects the contribution level of the ASE system (good, neutral, or bad) to road safety. Third, as a proofof-concept, the framework has been implemented and deployed on the Moroccan road network. The results showed that Random Forest classifier is the best performing model attaining an accuracy of 95% and a precision of 88%. Further, a tool was developed to visualize updated classification results on a Moroccan road network map to support authorities in their decision making process.
{"title":"A Predictive Framework of Speed Camera Locations for Road Safety","authors":"Asmae Rhanizar, Z. E. Akkaoui","doi":"10.5539/cis.v12n3p92","DOIUrl":"https://doi.org/10.5539/cis.v12n3p92","url":null,"abstract":"Road traffic crashes are a public health issue due to their terrible impact on individuals, communities, and countries. Studies affirmed that vehicle speed is a major contributor to crash likelihood and severity. At the same time, they identified Automated Speed Enforcement (ASE) systems, namely speed cameras, as a highly effective measure to reduce excessive and inappropriate speed, and thus improving road safety. However, identifying optimum sites for fixed speed camera placement stays an open issue in the literature, although it is a key factor that guarantees the efficiency of such ASE systems. This paper describes a predictive framework of speed camera locations using a classification algorithm that can predict, for each section of a given road network, its pertinence as a speed camera location. First, we identify a set of features as predictors of the classification algorithm, that we have argued their goodness through correlation tests. Second, for training our algorithm, data from road controlled sections, corresponding to existing speed cameras, is exploited. Each section class reflects the contribution level of the ASE system (good, neutral, or bad) to road safety. Third, as a proofof-concept, the framework has been implemented and deployed on the Moroccan road network. The results showed that Random Forest classifier is the best performing model attaining an accuracy of 95% and a precision of 88%. Further, a tool was developed to visualize updated classification results on a Moroccan road network map to support authorities in their decision making process.","PeriodicalId":14676,"journal":{"name":"J. Chem. Inf. Comput. Sci.","volume":"6 1","pages":"92-103"},"PeriodicalIF":0.0,"publicationDate":"2019-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81999397","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}
Quantum computing is a field that aims to exploit the principles of superposition and entanglement to perform computations. By using quantum bits (qubits) a quantum computer is able to perform certain tasks more efficiently when compared to classical computers. While applied quantum computing is still in its early stages, quantum algorithms on simulated quantum computers have already been applied to certain problems in epidemics modeling and image processing. Furthermore, companies like Google and IBM continue to develop new quantum computers with an increasing number of qubits. While much progress has been made in the recent years, the so called ”quantum supremacy”has not yet been achieved, and quantum computing appears to be still unsuitable for most applications in biomedical sciences.
{"title":"Quantum Computing in the Biomedical Sciences; A Brief Introduction into Concepts and Applications","authors":"Casper van der Kerk, Attila Csala, A. Zwinderman","doi":"10.5539/cis.v12n3p104","DOIUrl":"https://doi.org/10.5539/cis.v12n3p104","url":null,"abstract":"Quantum computing is a field that aims to exploit the principles of superposition and entanglement to perform computations. By using quantum bits (qubits) a quantum computer is able to perform certain tasks more efficiently when compared to classical computers. While applied quantum computing is still in its early stages, quantum algorithms on simulated quantum computers have already been applied to certain problems in epidemics modeling and image processing. Furthermore, companies like Google and IBM continue to develop new quantum computers with an increasing number of qubits. While much progress has been made in the recent years, the so called ”quantum supremacy”has not yet been achieved, and quantum computing appears to be still unsuitable for most applications in biomedical sciences.","PeriodicalId":14676,"journal":{"name":"J. Chem. Inf. Comput. Sci.","volume":"26 1","pages":"104-116"},"PeriodicalIF":0.0,"publicationDate":"2019-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81472165","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}
Many optimization problems can be reduced to the maximum flow problem in a network. However, the maximum flow problem is equivalent to the problem of the minimum cut, as shown by Fulkerson and Ford (Fulkerson & Ford, 1956). There are several algorithms of the graph’s cut, such as the Ford-Fulkerson algorithm (Ford & Fulkerson, 1962), the Edmonds-Karp algorithm (Edmonds & Karp, 1972) or the Goldberg-Tarjan algorithm (Goldberg & Tarjan, 1988). In this paper, we study the parallel computation of the Edmonds-Karp algorithm which is an optimized version of the Ford-Fulkerson algorithm. Indeed, this algorithm, when executed on large graphs, can be extremely slow, with a complexity of the order of O|V|.|E|2 (where |V| designates the number of vertices and |E| designates the number of the edges of the graph). So why we are studying its implementation on inexpensive parallel platforms such as OpenMp and GP-GPU. Our work also highlights the limits for parallel computing on this algorithm.
{"title":"Modeling the Parallelization of the Edmonds-Karp Algorithm and Application","authors":"A. Chaibou, Ousmane Moussa Tessa, Oumarou Sié","doi":"10.5539/cis.v12n3p81","DOIUrl":"https://doi.org/10.5539/cis.v12n3p81","url":null,"abstract":"Many optimization problems can be reduced to the maximum flow problem in a network. However, the maximum flow problem is equivalent to the problem of the minimum cut, as shown by Fulkerson and Ford (Fulkerson & Ford, 1956). There are several algorithms of the graph’s cut, such as the Ford-Fulkerson algorithm (Ford & Fulkerson, 1962), the Edmonds-Karp algorithm (Edmonds & Karp, 1972) or the Goldberg-Tarjan algorithm (Goldberg & Tarjan, 1988). In this paper, we study the parallel computation of the Edmonds-Karp algorithm which is an optimized version of the Ford-Fulkerson algorithm. Indeed, this algorithm, when executed on large graphs, can be extremely slow, with a complexity of the order of O|V|.|E|2 (where |V| designates the number of vertices and |E| designates the number of the edges of the graph). So why we are studying its implementation on inexpensive parallel platforms such as OpenMp and GP-GPU. Our work also highlights the limits for parallel computing on this algorithm.","PeriodicalId":14676,"journal":{"name":"J. Chem. Inf. Comput. Sci.","volume":"34 1","pages":"81-91"},"PeriodicalIF":0.0,"publicationDate":"2019-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77028209","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}
Fused Deposition Modeling (FDM) technology in 3D printing has beendeveloped for many years. In this paper, a robot FDM 3D printingsystem is proposed and the nozzle temperature control issue isfocused primarily. The temperature measurement adopts a data driven modeling method andthe parameters of the measurement model are trained by the particle swarm optimization algorithm. A practical temperature control method is presented in which thetemperature control of nozzle is divided into two periods. Duringthe temperature flying period, the heating voltage is givenaccording to the current temperature value and its varying trend. In thefalling time of nozzle temperature, the corresponding controlvoltage value is provided correspondingly. Based on this practical control strategy, a partdesigned with Solidworks software is printed using the robot FDM printing system which validates theeffectiveness of the practical temperature control method.
{"title":"Practical Nozzle Temperature Control Method for Robot FDM Printing System","authors":"Yijian Liu, Ming Chen, Jihong Chen","doi":"10.5539/cis.v12n3p21","DOIUrl":"https://doi.org/10.5539/cis.v12n3p21","url":null,"abstract":"Fused Deposition Modeling (FDM) technology in 3D printing has beendeveloped for many years. In this paper, a robot FDM 3D printingsystem is proposed and the nozzle temperature control issue isfocused primarily. The temperature measurement adopts a data driven modeling method andthe parameters of the measurement model are trained by the particle swarm optimization algorithm. A practical temperature control method is presented in which thetemperature control of nozzle is divided into two periods. Duringthe temperature flying period, the heating voltage is givenaccording to the current temperature value and its varying trend. In thefalling time of nozzle temperature, the corresponding controlvoltage value is provided correspondingly. Based on this practical control strategy, a partdesigned with Solidworks software is printed using the robot FDM printing system which validates theeffectiveness of the practical temperature control method.","PeriodicalId":14676,"journal":{"name":"J. Chem. Inf. Comput. Sci.","volume":"101 1","pages":"21-26"},"PeriodicalIF":0.0,"publicationDate":"2019-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74442080","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}
Jason Earl Thomas, Ryan P. Galligher, M. L. Thomas, Gordon C. Galligher
As the world continues to grow and embrace technology ransomware is growing problem. When ransomware encrypts storage sytems, systems shutdown, productivity grinds to a halt, and serious long-term damage takes place. As this is a known problem many firms have developed functionality to address ransomware issues in key security technologies such as intrusion protection systems. Many firms, especially smaller ones, may not have access to these technologies or perhaps the integration of these technologies might not yet be possible due ot varying circumstances. Regardless, ransomware must still be addressed as cyber miscreants actually target weak and unprotected environment. Even without tools that automate and aggregrate security capability, systems administrators can use systems utilities, applications, and digital forensic techniques to detect ransomware and defend their environemnts. This paper explores the literature regarding ransomware attacks, discusses current issues on how ransomware might be addressed, and presents recommendations to detect and investigate ransomware infection.
{"title":"Enterprise Cybersecurity: Investigating and Detecting Ransomware Infections Using Digital Forensic Techniques","authors":"Jason Earl Thomas, Ryan P. Galligher, M. L. Thomas, Gordon C. Galligher","doi":"10.5539/cis.v12n3p72","DOIUrl":"https://doi.org/10.5539/cis.v12n3p72","url":null,"abstract":"As the world continues to grow and embrace technology ransomware is growing problem. When ransomware encrypts storage sytems, systems shutdown, productivity grinds to a halt, and serious long-term damage takes place. As this is a known problem many firms have developed functionality to address ransomware issues in key security technologies such as intrusion protection systems. Many firms, especially smaller ones, may not have access to these technologies or perhaps the integration of these technologies might not yet be possible due ot varying circumstances. Regardless, ransomware must still be addressed as cyber miscreants actually target weak and unprotected environment. Even without tools that automate and aggregrate security capability, systems administrators can use systems utilities, applications, and digital forensic techniques to detect ransomware and defend their environemnts. This paper explores the literature regarding ransomware attacks, discusses current issues on how ransomware might be addressed, and presents recommendations to detect and investigate ransomware infection.","PeriodicalId":14676,"journal":{"name":"J. Chem. Inf. Comput. Sci.","volume":"66 1","pages":"72-80"},"PeriodicalIF":0.0,"publicationDate":"2019-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84038168","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
扫码关注我们
求助内容：
应助结果提醒方式：