Pub Date : 2017-05-24DOI: 10.1504/IJAISC.2017.10005159
Shruti Jain
AkT (protein kinase B) is a central signalling molecule in the phosphatidylinositol 3-kinase (PI3K) pathway that is frequently activated in human cancer. AkT promotes cell survival/death by activating or deactivating different proteins. In this paper a model was designed using parametric or non parametric distribution analysis. Anderson Darling adjustment values was calculated using maximum likelihood and least square estimators as parametric function in which normal, Kaplan Meier and Herd Johnson tests were done for different distribution functions for ten cominations of TNF/EGF and insulin. For non-parametric analysis: survival and hazard plots were plotted using Kaplan Meier estimator.
{"title":"Parametric and non parametric distribution analysis of AkT for cell survival/death","authors":"Shruti Jain","doi":"10.1504/IJAISC.2017.10005159","DOIUrl":"https://doi.org/10.1504/IJAISC.2017.10005159","url":null,"abstract":"AkT (protein kinase B) is a central signalling molecule in the phosphatidylinositol 3-kinase (PI3K) pathway that is frequently activated in human cancer. AkT promotes cell survival/death by activating or deactivating different proteins. In this paper a model was designed using parametric or non parametric distribution analysis. Anderson Darling adjustment values was calculated using maximum likelihood and least square estimators as parametric function in which normal, Kaplan Meier and Herd Johnson tests were done for different distribution functions for ten cominations of TNF/EGF and insulin. For non-parametric analysis: survival and hazard plots were plotted using Kaplan Meier estimator.","PeriodicalId":364571,"journal":{"name":"Int. J. Artif. Intell. Soft Comput.","volume":"276 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124286092","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-24DOI: 10.1504/IJAISC.2017.10005160
Mohammed Nejja, A. Yousfi
This paper aims to shed light on a mechanism that will be used to exploit topical context information improving the accuracy of the automatic spell checking system. This study aims at solving the problem encountered by the auto correct spell checking system, which resides in the fact that the requested solution might be located in the last position. We have implemented a set of techniques in order to build a context oriented spelling corrector and by the end of this work the designed corrector will essentially be using a dictionary that contains a distribution of probability of a word occurrence in various contexts. This latter is constructed by bringing a collection of documents available via the internet.
{"title":"Context's impact on the automatic spelling correction","authors":"Mohammed Nejja, A. Yousfi","doi":"10.1504/IJAISC.2017.10005160","DOIUrl":"https://doi.org/10.1504/IJAISC.2017.10005160","url":null,"abstract":"This paper aims to shed light on a mechanism that will be used to exploit topical context information improving the accuracy of the automatic spell checking system. This study aims at solving the problem encountered by the auto correct spell checking system, which resides in the fact that the requested solution might be located in the last position. We have implemented a set of techniques in order to build a context oriented spelling corrector and by the end of this work the designed corrector will essentially be using a dictionary that contains a distribution of probability of a word occurrence in various contexts. This latter is constructed by bringing a collection of documents available via the internet.","PeriodicalId":364571,"journal":{"name":"Int. J. Artif. Intell. Soft Comput.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133980847","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-24DOI: 10.1504/IJAISC.2017.10005154
G. Jayanthi, V. Uma
Knowledge engineering is the systematic self-disciplined set of activities involved in design and development of knowledge-based systems. Abstraction of the real world into codified information is the objective of knowledge representation (KR). The survey of various works of researchers in the domain of spatio-temporal knowledge representation for reasoning real world actions in geographic applications is presented. Geographic event attributed spatial entity (GEASE) knowledge-base that will aid in reasoning events causing the spatial change in geographic features over the period of time is proposed. GEASE knowledge-base describing a spatial entity by considering the temporal event as an attribute is constructed to infer events that cause geographical changes. As a result, the significance of the proposed knowledgebase is illustrated by evaluating event based queries on synthetic dataset. Finally, we conclude the work with direction to enhance the logical formulation for its implementation on real datasets in future.
{"title":"A qualitative inference method for prediction of geographic process using spatial and temporal relations","authors":"G. Jayanthi, V. Uma","doi":"10.1504/IJAISC.2017.10005154","DOIUrl":"https://doi.org/10.1504/IJAISC.2017.10005154","url":null,"abstract":"Knowledge engineering is the systematic self-disciplined set of activities involved in design and development of knowledge-based systems. Abstraction of the real world into codified information is the objective of knowledge representation (KR). The survey of various works of researchers in the domain of spatio-temporal knowledge representation for reasoning real world actions in geographic applications is presented. Geographic event attributed spatial entity (GEASE) knowledge-base that will aid in reasoning events causing the spatial change in geographic features over the period of time is proposed. GEASE knowledge-base describing a spatial entity by considering the temporal event as an attribute is constructed to infer events that cause geographical changes. As a result, the significance of the proposed knowledgebase is illustrated by evaluating event based queries on synthetic dataset. Finally, we conclude the work with direction to enhance the logical formulation for its implementation on real datasets in future.","PeriodicalId":364571,"journal":{"name":"Int. J. Artif. Intell. Soft Comput.","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116857357","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-24DOI: 10.1504/IJAISC.2017.10005155
Abdelghani Bouziane, D. Bouchiha, Noureddine Doumi, M. Malki
Question answering system (QAS) is essential to satisfy the need to query information available in various formats, including structured data (ontology, databases) or unstructured data (document, web). The QAS provides a correct response to the question asked by a user in natural language. QAS uses natural language processing (NLP) techniques to interface with the system user. In this paper, we survey various QAS such as Natural Language Interfacing to DataBases (NLIDB), ontology-based question answering and question answering systems for unstructured data. We give also statistics and analysis. This can help researchers to choose an appropriate solution to their issues. In case of insufficiency, they can propose new systems for complex queries and adapt or reuse QAS techniques for specific research issues. We give also our point of view on how can QAS deal with Arabic linked data.
{"title":"Question answering systems: the story till the Arabic linked data","authors":"Abdelghani Bouziane, D. Bouchiha, Noureddine Doumi, M. Malki","doi":"10.1504/IJAISC.2017.10005155","DOIUrl":"https://doi.org/10.1504/IJAISC.2017.10005155","url":null,"abstract":"Question answering system (QAS) is essential to satisfy the need to query information available in various formats, including structured data (ontology, databases) or unstructured data (document, web). The QAS provides a correct response to the question asked by a user in natural language. QAS uses natural language processing (NLP) techniques to interface with the system user. In this paper, we survey various QAS such as Natural Language Interfacing to DataBases (NLIDB), ontology-based question answering and question answering systems for unstructured data. We give also statistics and analysis. This can help researchers to choose an appropriate solution to their issues. In case of insufficiency, they can propose new systems for complex queries and adapt or reuse QAS techniques for specific research issues. We give also our point of view on how can QAS deal with Arabic linked data.","PeriodicalId":364571,"journal":{"name":"Int. J. Artif. Intell. Soft Comput.","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130113287","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 : 2015-07-01DOI: 10.1504/IJAISC.2015.070636
Pranav Dass, S. Jadon, Harish Sharma, Jagdish Chand Bansal, K. Nygard
Artificial bee colony ABC optimisation algorithm is relatively a recent, fast and easy to implement population-based meta heuristic for optimisation. ABC has been proved a competitive algorithm with some popular swarm intelligence-based algorithms such as particle swarm optimisation, firefly algorithm and ant colony optimisation. However, it is observed that ABC algorithm is better at exploration but poor at exploitation. Due to large step size, the solution search equation of ABC has enough chance to skip the optimum. In order to balance this, ABC is hybridised with a local search called as classical unidimensional search CUS. The proposed algorithm is named as hybridised ABC HABC. In HABC, best solution of each iteration is further exploited in both its positive and negative direction in a predefined range which enhances the exploitation in ABC. The experiments are carried out on 15 test problems of different complexities and dimensions in order to prove the efficiency of proposed algorithm and compared with ABC. The results shows that hybridisation of CUS with ABC improves the performance of ABC.
{"title":"Hybridisation of classical unidimensional search with ABC to improve exploitation capability","authors":"Pranav Dass, S. Jadon, Harish Sharma, Jagdish Chand Bansal, K. Nygard","doi":"10.1504/IJAISC.2015.070636","DOIUrl":"https://doi.org/10.1504/IJAISC.2015.070636","url":null,"abstract":"Artificial bee colony ABC optimisation algorithm is relatively a recent, fast and easy to implement population-based meta heuristic for optimisation. ABC has been proved a competitive algorithm with some popular swarm intelligence-based algorithms such as particle swarm optimisation, firefly algorithm and ant colony optimisation. However, it is observed that ABC algorithm is better at exploration but poor at exploitation. Due to large step size, the solution search equation of ABC has enough chance to skip the optimum. In order to balance this, ABC is hybridised with a local search called as classical unidimensional search CUS. The proposed algorithm is named as hybridised ABC HABC. In HABC, best solution of each iteration is further exploited in both its positive and negative direction in a predefined range which enhances the exploitation in ABC. The experiments are carried out on 15 test problems of different complexities and dimensions in order to prove the efficiency of proposed algorithm and compared with ABC. The results shows that hybridisation of CUS with ABC improves the performance of ABC.","PeriodicalId":364571,"journal":{"name":"Int. J. Artif. Intell. Soft Comput.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128931567","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 : 2015-07-01DOI: 10.1504/IJAISC.2015.070631
G. M. Nasira, T. Balaji
The present work considers multifacility location problems with circular area constraints having interactions between sources and destinations. A detailed literature survey reveals that a little attention has been paid to problem involving area constraints. Mathematical formulation and the analytical solutions have been obtained by using Kuhn-Tucker theory. The mathematical solution procedure is very complex and time consuming. Hence, an attempt has been made to get the solution of a complex, constrained multifacility location problem using artificial neural networks ANN. With the help of numerical examples, it has been established that within the acceptable limits resilient back-propagation Rprop model compares well with those obtained through analytical method.
{"title":"Solving Euclidean multifacility location problems under circular area constraints using Rprop","authors":"G. M. Nasira, T. Balaji","doi":"10.1504/IJAISC.2015.070631","DOIUrl":"https://doi.org/10.1504/IJAISC.2015.070631","url":null,"abstract":"The present work considers multifacility location problems with circular area constraints having interactions between sources and destinations. A detailed literature survey reveals that a little attention has been paid to problem involving area constraints. Mathematical formulation and the analytical solutions have been obtained by using Kuhn-Tucker theory. The mathematical solution procedure is very complex and time consuming. Hence, an attempt has been made to get the solution of a complex, constrained multifacility location problem using artificial neural networks ANN. With the help of numerical examples, it has been established that within the acceptable limits resilient back-propagation Rprop model compares well with those obtained through analytical method.","PeriodicalId":364571,"journal":{"name":"Int. J. Artif. Intell. Soft Comput.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126069762","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 : 2015-07-01DOI: 10.1504/IJAISC.2015.070634
Wojdan Alsaeedan, M. Menai
Natural language processing NLP is an area dealing with computational methods for achieving human-like language processing. Traditionally, NLP research has been focused on developing efficient and robust algorithms to treat most NLP tasks, including syntactic and semantic analysis, grammar induction, summary and text generation, document clustering and machine translation. Swarm intelligence SI methods are effective to do so, since they have been successfully applied for many real-world problems. Recently, NLP and SI have been active areas of research, joined together more than once to solve problems in NLP field. This paper presents a review of recent developments of SI methods in NLP. It shows that only a few NLP tasks and applications were tackled by using SI-based algorithms. These mainly include text document clustering and classification, text summarisation, word sense disambiguation, information retrieval, and speaker recognition. This study also shows that four SI-based algorithms were examined in NLP field, including ant colony optimisation ACO, particle swarm optimisation PSO, bee swarm optimisation BSO, and firefly algorithm FA, emphasising ACO and PSO as the most investigated algorithms in this field.
{"title":"Swarm intelligence for natural language processing","authors":"Wojdan Alsaeedan, M. Menai","doi":"10.1504/IJAISC.2015.070634","DOIUrl":"https://doi.org/10.1504/IJAISC.2015.070634","url":null,"abstract":"Natural language processing NLP is an area dealing with computational methods for achieving human-like language processing. Traditionally, NLP research has been focused on developing efficient and robust algorithms to treat most NLP tasks, including syntactic and semantic analysis, grammar induction, summary and text generation, document clustering and machine translation. Swarm intelligence SI methods are effective to do so, since they have been successfully applied for many real-world problems. Recently, NLP and SI have been active areas of research, joined together more than once to solve problems in NLP field. This paper presents a review of recent developments of SI methods in NLP. It shows that only a few NLP tasks and applications were tackled by using SI-based algorithms. These mainly include text document clustering and classification, text summarisation, word sense disambiguation, information retrieval, and speaker recognition. This study also shows that four SI-based algorithms were examined in NLP field, including ant colony optimisation ACO, particle swarm optimisation PSO, bee swarm optimisation BSO, and firefly algorithm FA, emphasising ACO and PSO as the most investigated algorithms in this field.","PeriodicalId":364571,"journal":{"name":"Int. J. Artif. Intell. Soft Comput.","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124798160","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 : 2015-07-01DOI: 10.1504/IJAISC.2015.070633
B. Chaurasia, R. S. Tomar, S. Verma
In this paper, an HMM-based mechanism for evaluating trust in VANETs has been proposed. VANETs are characterised by the ephemeral nature of the neighborhood. Interaction with fresh neighbours at short intervals of time renders cryptographic mechanisms message intensive due to their repeated requirements. Moreover, an authenticated vehicle may strategically change its behaviour to maximise its driving comfort or other gains. This requires context aware trust dynamic computation mechanism to characterise a vehicle's behaviour and to reduce the excessive cryptographic overhead. In VANETs, vehicles communicate critical safety messages in addition to other messages and a change in behaviour can lead to collision. In the present work, a trust model in which beta model works in conjunction with HMM has been employed. Simulation results show that the time taken by the scheme is significantly less and transmission over the shared wireless channel is in the order of milliseconds.
{"title":"Using trust for lightweight communication in VANETs","authors":"B. Chaurasia, R. S. Tomar, S. Verma","doi":"10.1504/IJAISC.2015.070633","DOIUrl":"https://doi.org/10.1504/IJAISC.2015.070633","url":null,"abstract":"In this paper, an HMM-based mechanism for evaluating trust in VANETs has been proposed. VANETs are characterised by the ephemeral nature of the neighborhood. Interaction with fresh neighbours at short intervals of time renders cryptographic mechanisms message intensive due to their repeated requirements. Moreover, an authenticated vehicle may strategically change its behaviour to maximise its driving comfort or other gains. This requires context aware trust dynamic computation mechanism to characterise a vehicle's behaviour and to reduce the excessive cryptographic overhead. In VANETs, vehicles communicate critical safety messages in addition to other messages and a change in behaviour can lead to collision. In the present work, a trust model in which beta model works in conjunction with HMM has been employed. Simulation results show that the time taken by the scheme is significantly less and transmission over the shared wireless channel is in the order of milliseconds.","PeriodicalId":364571,"journal":{"name":"Int. J. Artif. Intell. Soft Comput.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133388655","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 : 2015-07-01DOI: 10.1504/IJAISC.2015.070638
G. Kaur, J. Dhar, Rangan K. Guha
The forecasting of stock market problem from the available data is quite often of uncertain nature, hence the stock market prediction is a very challenging and difficult task. In this paper, we have investigated the predictability of stock market of Bombay Stock Exchange BSE30, Hang Sang China Stock Index HS, Japan Stock Index NIKKEI and Taiwan Weighted Index TWI with adaptive network-based fuzzy inference system ANFIS combined with subtractive clustering technique. In this process, we compared stock markets with variable numbers of data clusters. Optimised subtractive clustering is used to cluster the data and create fuzzy membership functions. Finally, a hybrid learning algorithm has been used to combine least square method and back propagation gradient-decent method for training the fuzzy inference system. This paper represents a state of the art for ANFIS application to forecast stock market index.
{"title":"A hybrid approach to forecast stock market index","authors":"G. Kaur, J. Dhar, Rangan K. Guha","doi":"10.1504/IJAISC.2015.070638","DOIUrl":"https://doi.org/10.1504/IJAISC.2015.070638","url":null,"abstract":"The forecasting of stock market problem from the available data is quite often of uncertain nature, hence the stock market prediction is a very challenging and difficult task. In this paper, we have investigated the predictability of stock market of Bombay Stock Exchange BSE30, Hang Sang China Stock Index HS, Japan Stock Index NIKKEI and Taiwan Weighted Index TWI with adaptive network-based fuzzy inference system ANFIS combined with subtractive clustering technique. In this process, we compared stock markets with variable numbers of data clusters. Optimised subtractive clustering is used to cluster the data and create fuzzy membership functions. Finally, a hybrid learning algorithm has been used to combine least square method and back propagation gradient-decent method for training the fuzzy inference system. This paper represents a state of the art for ANFIS application to forecast stock market index.","PeriodicalId":364571,"journal":{"name":"Int. J. Artif. Intell. Soft Comput.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129217575","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 : 2015-02-01DOI: 10.1504/IJAISC.2015.067527
A. Aissaoui, M. Abid, A. Tahour, A. C. Megherbi
The application of artificial intelligence has become an important topic in electrical machines control. This paper presents an application of neuro-fuzzy NF control for synchronous motor SM speed. The NF has the advantages of expert knowledge of the fuzzy inference system and the learning capabilities of neural networks. A neuro-fuzzy controller of the motor speed is then designed and simulated. An asymptotically stable observer is designed to overcome the problem of speed sensor and is obtained without affecting the overall system response. Digital simulation results show that the designed NF speed controller realises a good dynamic behaviour of the motor, a perfect speed tracking with no overshoot and a good rejection of load disturbances.
{"title":"Synchronous motor speed control based on ANFIS methodology and sliding mode observer","authors":"A. Aissaoui, M. Abid, A. Tahour, A. C. Megherbi","doi":"10.1504/IJAISC.2015.067527","DOIUrl":"https://doi.org/10.1504/IJAISC.2015.067527","url":null,"abstract":"The application of artificial intelligence has become an important topic in electrical machines control. This paper presents an application of neuro-fuzzy NF control for synchronous motor SM speed. The NF has the advantages of expert knowledge of the fuzzy inference system and the learning capabilities of neural networks. A neuro-fuzzy controller of the motor speed is then designed and simulated. An asymptotically stable observer is designed to overcome the problem of speed sensor and is obtained without affecting the overall system response. Digital simulation results show that the designed NF speed controller realises a good dynamic behaviour of the motor, a perfect speed tracking with no overshoot and a good rejection of load disturbances.","PeriodicalId":364571,"journal":{"name":"Int. J. Artif. Intell. Soft Comput.","volume":"145 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121149159","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
扫码关注我们
求助内容：
应助结果提醒方式：