Part of speech (POS) tagging is the task of labeling each word in a sentence with its appropriate syntactic category called part of speech. POS tagging is a very important preprocessing task for language processing activities. This paper reports about task of POS tagging for Bengali using support vector machine (SVM). The POS tagger has been developed using a tagset of 26 POS tags, defined for the Indian languages. The system makes use of the different contextual information of the words along with the variety of features that are helpful in predicting the various POS classes. The POS tagger has been trained, and tested with the 72,341, and 20 K wordforms, respectively. Experimental results show the effectiveness of the proposed SVM based POS tagger with an accuracy of 86.84%. Results show that the lexicon, named entity recognizer and different word suffixes are effective in handling the unknown word problems and improve the accuracy of the POS tagger significantly. Comparative evaluation results have demonstrated that this SVM based system outperforms the three existing systems based on the hidden markov model (HMM), maximum entropy (ME) and conditional random field (CRF).
{"title":"Part of Speech Tagging in Bengali Using Support Vector Machine","authors":"Asif Ekbal, Sivaji Bandyopadhyay","doi":"10.1109/ICIT.2008.12","DOIUrl":"https://doi.org/10.1109/ICIT.2008.12","url":null,"abstract":"Part of speech (POS) tagging is the task of labeling each word in a sentence with its appropriate syntactic category called part of speech. POS tagging is a very important preprocessing task for language processing activities. This paper reports about task of POS tagging for Bengali using support vector machine (SVM). The POS tagger has been developed using a tagset of 26 POS tags, defined for the Indian languages. The system makes use of the different contextual information of the words along with the variety of features that are helpful in predicting the various POS classes. The POS tagger has been trained, and tested with the 72,341, and 20 K wordforms, respectively. Experimental results show the effectiveness of the proposed SVM based POS tagger with an accuracy of 86.84%. Results show that the lexicon, named entity recognizer and different word suffixes are effective in handling the unknown word problems and improve the accuracy of the POS tagger significantly. Comparative evaluation results have demonstrated that this SVM based system outperforms the three existing systems based on the hidden markov model (HMM), maximum entropy (ME) and conditional random field (CRF).","PeriodicalId":184201,"journal":{"name":"2008 International Conference on Information Technology","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117247619","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 presents hardware architecture to perform the basic arithmetic operation addition using cellular automata (CA). This age old problem of addition were previously solved by ripple circuit or carry look ahead circuit or by using a combination of them. Each of these circuits is purely combinational in nature and their complexity is centered on the number of logic gates and the associated gate delays. On the contrary, in our CA based design the complexity is mainly centered on the number of clock cycles required to finish the computation instead of the gate delays.
{"title":"Implementation of Basic Arithmetic Operations Using Cellular Automaton","authors":"P. Choudhury, Sudhakar Sahoo, Mithun Chakraborty","doi":"10.1109/ICIT.2008.18","DOIUrl":"https://doi.org/10.1109/ICIT.2008.18","url":null,"abstract":"This paper presents hardware architecture to perform the basic arithmetic operation addition using cellular automata (CA). This age old problem of addition were previously solved by ripple circuit or carry look ahead circuit or by using a combination of them. Each of these circuits is purely combinational in nature and their complexity is centered on the number of logic gates and the associated gate delays. On the contrary, in our CA based design the complexity is mainly centered on the number of clock cycles required to finish the computation instead of the gate delays.","PeriodicalId":184201,"journal":{"name":"2008 International Conference on Information Technology","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129484772","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}
Given a connected, weighted, and undirected graph, the minimum routing cost spanning tree problem seeks on this graph a spanning tree of minimum routing cost, where routing cost is defined as the sum of the costs of all the paths connecting two distinct vertices in a spanning tree. In this paper we have proposed a perturbation based local search for this problem. We have compared our approach against three methods reported in the literature - two genetic algorithms and a stochastic hill climber.Computational results show the effectiveness of our approach.
{"title":"A New Heuristic for the Minimum Routing Cost Spanning Tree Problem","authors":"Alok Singh","doi":"10.1109/ICIT.2008.16","DOIUrl":"https://doi.org/10.1109/ICIT.2008.16","url":null,"abstract":"Given a connected, weighted, and undirected graph, the minimum routing cost spanning tree problem seeks on this graph a spanning tree of minimum routing cost, where routing cost is defined as the sum of the costs of all the paths connecting two distinct vertices in a spanning tree. In this paper we have proposed a perturbation based local search for this problem. We have compared our approach against three methods reported in the literature - two genetic algorithms and a stochastic hill climber.Computational results show the effectiveness of our approach.","PeriodicalId":184201,"journal":{"name":"2008 International Conference on Information Technology","volume":"90 29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129848982","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}
In resent years, research has taken an interest in design of approximation algorithms due to the requirement of these algorithms for solving many problems of science and engineering like system modeling, identification of plants, controller design, fault detection, computer security, prediction of data sets etc. The area of Artificial Immune System (AIS) is emerging as an active and attractive field involving models, techniques and applications of greater diversity. In this paper a new optimization algorithm based on AIS is developed. The proposed algorithm has been suitably applied to develop practical applications like design of a new model for efficient approximation of nonlinear functions and identification of nonlinear systems in noisy environments. Simulation study of few benchmark function approximation and system identification problems are carried out to show superior performance of the proposed model over the standard methods in terms of response matching, accuracy of identification and convergence speed achieved.
{"title":"Development of a New Optimization Algorithm Based on Artificial Immune System and Its Application","authors":"S. Nanda, G. Panda, B. Majhi, Prakash Tha","doi":"10.1109/ICIT.2008.20","DOIUrl":"https://doi.org/10.1109/ICIT.2008.20","url":null,"abstract":"In resent years, research has taken an interest in design of approximation algorithms due to the requirement of these algorithms for solving many problems of science and engineering like system modeling, identification of plants, controller design, fault detection, computer security, prediction of data sets etc. The area of Artificial Immune System (AIS) is emerging as an active and attractive field involving models, techniques and applications of greater diversity. In this paper a new optimization algorithm based on AIS is developed. The proposed algorithm has been suitably applied to develop practical applications like design of a new model for efficient approximation of nonlinear functions and identification of nonlinear systems in noisy environments. Simulation study of few benchmark function approximation and system identification problems are carried out to show superior performance of the proposed model over the standard methods in terms of response matching, accuracy of identification and convergence speed achieved.","PeriodicalId":184201,"journal":{"name":"2008 International Conference on Information Technology","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129567900","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 hidden Markov model (HMM) based approach is proposed for recognition of offline handwritten Devanagari words. The histogram of chain-code directions in the image-strips, scanned from left to right by a sliding window, is used as the feature vector. A continuous density HMM is proposed to recognize a word image. In our approach the states of the HMM are not determined a priori, but are determined automatically based on a database of handwritten word images. A handwritten word image is assumed to be a string of several image frame primitives. These are in fact the states of the proposed HMM and are found using a certain mixture distribution. One HMM is constructed for each word. To classify an unknown word image, its class conditional probability for each HMM is computed. The class that gives highest such probability is finally selected.
{"title":"Offline Handwritten Devanagari Word Recognition: A Holistic Approach Based on Directional Chain Code Feature and HMM","authors":"Bikash Shaw, S. K. Parui, M. Shridhar","doi":"10.1109/ICIT.2008.33","DOIUrl":"https://doi.org/10.1109/ICIT.2008.33","url":null,"abstract":"A hidden Markov model (HMM) based approach is proposed for recognition of offline handwritten Devanagari words. The histogram of chain-code directions in the image-strips, scanned from left to right by a sliding window, is used as the feature vector. A continuous density HMM is proposed to recognize a word image. In our approach the states of the HMM are not determined a priori, but are determined automatically based on a database of handwritten word images. A handwritten word image is assumed to be a string of several image frame primitives. These are in fact the states of the proposed HMM and are found using a certain mixture distribution. One HMM is constructed for each word. To classify an unknown word image, its class conditional probability for each HMM is computed. The class that gives highest such probability is finally selected.","PeriodicalId":184201,"journal":{"name":"2008 International Conference on Information Technology","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130699272","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}
In this paper, role of technology in education sector has been highlighted. Using technology in education sector has tremendous impact on social and public life. These aspects have been discussed in the paper with an example of e-Shishu. Based on the framework of action adopted at World Education forum at Dakar (Senegal) in April 2000 to attain six specific goals relating to education for all and United Nations¿ millennium development goal (MDG) of achieving Universal primary Education by 2015, Govt of India have initiated a framework of programs called Sarva Sikhya Abhiyan (SSA) from 2002-03. SSA envisages to achieve Universal enrolment, Universal retention and Universal achievement apart from bridging all social and gender gaps at primary level by 2007 and elementary level by 2010. Development of useful indications based on reliable data and evidence are critical first steps not only in policy formulation but also in planning and implementation of any program. Under SSA, there are two separate methods to assess the problems of elementary education. They are VER & DISE. Village Education Registers records names of all pre school, in-school and out of school children of a village and are to be updated every year at the village level. VER is to be referred to bring all out of school children to school so as to ensure Universal enrolment. District information system on education (DISE) is meant to record various details about all schools with respect to infrastructure, teachers and students. DISE is extensively needed to close the gaps in infrastructure and teacher position. DISE is collected across all states & the data is fed to software maintained at Govt of India level. District report cards and school report cards are generated every year on basis of the data fed.
{"title":"Social and Public Impact of ICT Enabled Education","authors":"S. Das, S. Mohapatra","doi":"10.1109/ICIT.2008.19","DOIUrl":"https://doi.org/10.1109/ICIT.2008.19","url":null,"abstract":"In this paper, role of technology in education sector has been highlighted. Using technology in education sector has tremendous impact on social and public life. These aspects have been discussed in the paper with an example of e-Shishu. Based on the framework of action adopted at World Education forum at Dakar (Senegal) in April 2000 to attain six specific goals relating to education for all and United Nations¿ millennium development goal (MDG) of achieving Universal primary Education by 2015, Govt of India have initiated a framework of programs called Sarva Sikhya Abhiyan (SSA) from 2002-03. SSA envisages to achieve Universal enrolment, Universal retention and Universal achievement apart from bridging all social and gender gaps at primary level by 2007 and elementary level by 2010. Development of useful indications based on reliable data and evidence are critical first steps not only in policy formulation but also in planning and implementation of any program. Under SSA, there are two separate methods to assess the problems of elementary education. They are VER & DISE. Village Education Registers records names of all pre school, in-school and out of school children of a village and are to be updated every year at the village level. VER is to be referred to bring all out of school children to school so as to ensure Universal enrolment. District information system on education (DISE) is meant to record various details about all schools with respect to infrastructure, teachers and students. DISE is extensively needed to close the gaps in infrastructure and teacher position. DISE is collected across all states & the data is fed to software maintained at Govt of India level. District report cards and school report cards are generated every year on basis of the data fed.","PeriodicalId":184201,"journal":{"name":"2008 International Conference on Information Technology","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130436548","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}
Browsing on a mobile device becomes tedious for a user because a very few number of hits can be presented to the user though its limited display area at a time and users have to scroll a lot to see search hits on the screen. Traditionally, the search engines generate the initial search results in the form of text snippets. In this paper, we present a syntactic sentence compression method, which eliminates less important and redundant constituents from text snippets for making room for displaying more number of search results in a given limited display area and facilitating information access to limited display area devices.
{"title":"Syntactic Sentence Compression: Facilitating Web Browsing on Mobile Devices","authors":"K. Sarkar","doi":"10.1109/ICIT.2008.23","DOIUrl":"https://doi.org/10.1109/ICIT.2008.23","url":null,"abstract":"Browsing on a mobile device becomes tedious for a user because a very few number of hits can be presented to the user though its limited display area at a time and users have to scroll a lot to see search hits on the screen. Traditionally, the search engines generate the initial search results in the form of text snippets. In this paper, we present a syntactic sentence compression method, which eliminates less important and redundant constituents from text snippets for making room for displaying more number of search results in a given limited display area and facilitating information access to limited display area devices.","PeriodicalId":184201,"journal":{"name":"2008 International Conference on Information Technology","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125732063","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 is a research study of indirect financial impact of phishing announcements on firm value. Using about 3,000 phishing announcements, we showed that phishing has significant negative influence on firms regardless of company size. With regard to attacks on holding and subsidiary companies, we also discovered that the impact on holding companies is significantly higher. We believe that our research can enrich literature in the fields of phishing research and encourage future research in the area of information security.
{"title":"Assessment of Phishing Announcements on Market Value of Firms","authors":"I. Bose, A. Leung","doi":"10.1109/ICIT.2008.37","DOIUrl":"https://doi.org/10.1109/ICIT.2008.37","url":null,"abstract":"This is a research study of indirect financial impact of phishing announcements on firm value. Using about 3,000 phishing announcements, we showed that phishing has significant negative influence on firms regardless of company size. With regard to attacks on holding and subsidiary companies, we also discovered that the impact on holding companies is significantly higher. We believe that our research can enrich literature in the fields of phishing research and encourage future research in the area of information security.","PeriodicalId":184201,"journal":{"name":"2008 International Conference on Information Technology","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121719489","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}
Agent-oriented software, in spite of its increased complexity levels, emphasize on social ability, autonomy, reactivity, adaptability, intelligence, learning, proactivity, goal-oriented and mobility. In general the complexity of the software agent is divided into two aspects; computational complexity and psychological complexity and they should be measured on both concrete aspects. The fact of high computational complexity leads to a weak performance indicates the importance of correctness in complexity measurements. Hence the concept of complexity metrics validation plays a significant role in the complexity measurement theory. This work describes a standard procedure for validating complexity metrics of agent-based systems. The validation procedure narrated in this paper uses the method proposed by Weyuker. The nine axioms of Weyuker are used to determine the effectiveness of various complexity metrics of agent-based systems. The result defines the extent of satisfaction of validation axioms in case of agent complexity metrics.
{"title":"Validation of Complexity Metrics of Agent-Based Systems Using Weyuker's Axioms","authors":"D. Ponnurangam, N. Saravanan, K. Satheskumar","doi":"10.1109/ICIT.2008.59","DOIUrl":"https://doi.org/10.1109/ICIT.2008.59","url":null,"abstract":"Agent-oriented software, in spite of its increased complexity levels, emphasize on social ability, autonomy, reactivity, adaptability, intelligence, learning, proactivity, goal-oriented and mobility. In general the complexity of the software agent is divided into two aspects; computational complexity and psychological complexity and they should be measured on both concrete aspects. The fact of high computational complexity leads to a weak performance indicates the importance of correctness in complexity measurements. Hence the concept of complexity metrics validation plays a significant role in the complexity measurement theory. This work describes a standard procedure for validating complexity metrics of agent-based systems. The validation procedure narrated in this paper uses the method proposed by Weyuker. The nine axioms of Weyuker are used to determine the effectiveness of various complexity metrics of agent-based systems. The result defines the extent of satisfaction of validation axioms in case of agent complexity metrics.","PeriodicalId":184201,"journal":{"name":"2008 International Conference on Information Technology","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121803475","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}
B. R. Meher, Mattaparthi Venkata Satish Kumar, K. Sen
The conformational dynamics of HIV-1 protease (HIV-pr) is known to be essential for ligand binding and determination of cavity size, which changes with several common physiological parameters like temperature, pressure, pH conditions and of course the protein backbone mutations. In this work, the effect of pressure on the conformation and dynamics of HIV-pr was studied in silico at 1 bar (0.987 atm) and 3 Kbar pressure conditions. It can be seen from the literature that protein containing significant number of hydrophobic residues would expose its hydrophobic groups to the solvent exposed area under high pressure conditions, which eventually changes the dynamics and hence conformation of the protein. From our observations, the dynamics studies showed that, although the collective dynamics is restricted under pressure this is not true for some specific residues. From the secondary structure analysis it was observed that turns and bends are favored under high pressure at the expense of ¿-helices and ß-sheets resulting in the reduction of structural variability. Solvent accessible surface (SAS) area of both the low and high pressure simulations showed significant differences. It was also observed that with the elevation in pressure, the hydrophobic effect is decreased. All these conformational changes at high pressure condition may have a special impact on the binding affinity of drugs to the active site region, which may have a direct/indirect effect on the drug resistance behavior of HIV-pr.
HIV-1蛋白酶(HIV-pr)的构象动力学对于配体结合和空腔大小的确定至关重要，空腔大小随几个常见的生理参数(如温度、压力、pH条件，当然还有蛋白质主干突变)而变化。本研究在1 bar (0.987 atm)和3 Kbar压力条件下，在硅片上研究了压力对HIV-pr构象和动力学的影响。从文献中可以看出，含有大量疏水残基的蛋白质在高压条件下会将其疏水基团暴露在溶剂暴露区，最终改变蛋白质的动力学，从而改变蛋白质的构象。从我们的观察来看，动力学研究表明，虽然集体动力学在压力下受到限制，但对于某些特定残留物并不适用。从二级结构分析中可以观察到，在高压下，转弯和弯曲是有利的，以牺牲¿-螺旋和ß-片为代价，从而减少了结构变异性。溶剂可及表面(SAS)面积在低压和高压模拟中均有显著差异。还观察到，随着压力的升高，疏水效应减弱。所有这些高压条件下的构象变化都可能对药物与活性位点区域的结合亲和力产生特殊的影响，这可能对HIV-pr的耐药行为产生直接或间接的影响。
{"title":"Pressure Induced Conformational Dynamics of HIV-1 Protease: A Molecular Dynamics Simulation Study","authors":"B. R. Meher, Mattaparthi Venkata Satish Kumar, K. Sen","doi":"10.1109/ICIT.2008.39","DOIUrl":"https://doi.org/10.1109/ICIT.2008.39","url":null,"abstract":"The conformational dynamics of HIV-1 protease (HIV-pr) is known to be essential for ligand binding and determination of cavity size, which changes with several common physiological parameters like temperature, pressure, pH conditions and of course the protein backbone mutations. In this work, the effect of pressure on the conformation and dynamics of HIV-pr was studied in silico at 1 bar (0.987 atm) and 3 Kbar pressure conditions. It can be seen from the literature that protein containing significant number of hydrophobic residues would expose its hydrophobic groups to the solvent exposed area under high pressure conditions, which eventually changes the dynamics and hence conformation of the protein. From our observations, the dynamics studies showed that, although the collective dynamics is restricted under pressure this is not true for some specific residues. From the secondary structure analysis it was observed that turns and bends are favored under high pressure at the expense of ¿-helices and ß-sheets resulting in the reduction of structural variability. Solvent accessible surface (SAS) area of both the low and high pressure simulations showed significant differences. It was also observed that with the elevation in pressure, the hydrophobic effect is decreased. All these conformational changes at high pressure condition may have a special impact on the binding affinity of drugs to the active site region, which may have a direct/indirect effect on the drug resistance behavior of HIV-pr.","PeriodicalId":184201,"journal":{"name":"2008 International Conference on Information Technology","volume":"179 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132302714","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
扫码关注我们
求助内容：
应助结果提醒方式：