Pub Date : 2001-03-04DOI: 10.1109/BIBE.2001.974435
M. Raymer, L. Kuhn, W. Punch
A key element of bioinformatics research is the extraction of meaningful information from large experimental data sets. Various approaches, including statistical and graph theoretical methods, data mining, and computational pattern recognition, have been applied to this task with varying degrees of success. We have previously shown that a genetic algorithm coupled with a k-nearest-neighbors classifier performs well in extracting information about protein-water binding from X-ray crystallographic protein structure data. Using a novel classifier based on the Bayes discriminant function, we present a hybrid algorithm that employs feature selection and extraction to isolate salient features from large biological data sets. The effectiveness of this algorithm is demonstrated on various biological and medical data sets.
{"title":"Knowledge discovery in biological data sets using a hybrid Bayes classifier/evolutionary algorithm","authors":"M. Raymer, L. Kuhn, W. Punch","doi":"10.1109/BIBE.2001.974435","DOIUrl":"https://doi.org/10.1109/BIBE.2001.974435","url":null,"abstract":"A key element of bioinformatics research is the extraction of meaningful information from large experimental data sets. Various approaches, including statistical and graph theoretical methods, data mining, and computational pattern recognition, have been applied to this task with varying degrees of success. We have previously shown that a genetic algorithm coupled with a k-nearest-neighbors classifier performs well in extracting information about protein-water binding from X-ray crystallographic protein structure data. Using a novel classifier based on the Bayes discriminant function, we present a hybrid algorithm that employs feature selection and extraction to isolate salient features from large biological data sets. The effectiveness of this algorithm is demonstrated on various biological and medical data sets.","PeriodicalId":405124,"journal":{"name":"Proceedings 2nd Annual IEEE International Symposium on Bioinformatics and Bioengineering (BIBE 2001)","volume":"222 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124399242","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 : 2001-03-04DOI: 10.1109/BIBE.2001.974413
V. Markowitz, T. Topaloglou
In this paper we present a method for applying data warehouse and on-line analytical processing concepts to gene expression data management. This method has been employed in developing the data management system that is used to host Gene Logic's GeneExpress(R) database products.
{"title":"Applying data warehouse concepts to gene expression data management","authors":"V. Markowitz, T. Topaloglou","doi":"10.1109/BIBE.2001.974413","DOIUrl":"https://doi.org/10.1109/BIBE.2001.974413","url":null,"abstract":"In this paper we present a method for applying data warehouse and on-line analytical processing concepts to gene expression data management. This method has been employed in developing the data management system that is used to host Gene Logic's GeneExpress(R) database products.","PeriodicalId":405124,"journal":{"name":"Proceedings 2nd Annual IEEE International Symposium on Bioinformatics and Bioengineering (BIBE 2001)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128543061","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 : 2001-03-04DOI: 10.1109/BIBE.2001.974415
Martin T. Swain, A. J. Brooks, G. Kemp
We present an automated method for constructing 3D models of class II MHC structures that uses constraint logic programming to select side-chain conformations. The resulting models are used by a "peptide threading" program that attempts to predict peptides from a protein sequence that will bind strongly to particular MHC alleles. This method follows a comparative modelling approach in basing the model structures on experimentally determined MHC-peptide structures. However, constraints are used to ease open the peptide binding groove so that the modelled MHC structure is a less specific fit for the co-crystallised peptide in the starting structure. Preliminary results indicate that MHC models that have been constructed in this way enable the peptide threading program to make binding predictions that are comparable with those obtained when using experimentally determined MHC structures.
{"title":"An automated approach to modelling class II MHC alleles and predicting peptide binding","authors":"Martin T. Swain, A. J. Brooks, G. Kemp","doi":"10.1109/BIBE.2001.974415","DOIUrl":"https://doi.org/10.1109/BIBE.2001.974415","url":null,"abstract":"We present an automated method for constructing 3D models of class II MHC structures that uses constraint logic programming to select side-chain conformations. The resulting models are used by a \"peptide threading\" program that attempts to predict peptides from a protein sequence that will bind strongly to particular MHC alleles. This method follows a comparative modelling approach in basing the model structures on experimentally determined MHC-peptide structures. However, constraints are used to ease open the peptide binding groove so that the modelled MHC structure is a less specific fit for the co-crystallised peptide in the starting structure. Preliminary results indicate that MHC models that have been constructed in this way enable the peptide threading program to make binding predictions that are comparable with those obtained when using experimentally determined MHC structures.","PeriodicalId":405124,"journal":{"name":"Proceedings 2nd Annual IEEE International Symposium on Bioinformatics and Bioengineering (BIBE 2001)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125395871","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 : 2001-03-04DOI: 10.1109/BIBE.2001.974406
J. Gilder, M. Raymer, T. Doom
Molecular visualization programs are available on many platforms. They allow a user to visualize and manipulate molecular structures. PocketMol provides the same functionality on a Pocket PC handheld computer. Using standard protein data bank (pdb) files, the user can move, rotate, and scale a protein to explore its structure and function. The user can choose from a standard backbone view or a simplified view using only alpha carbon atoms. PocketMolGX uses the Microsoft Game API to provide fast animation that is quite smooth. PocketMol is designed as an aid for those wishing to explore or demonstrate protein structures without the availability of a full-size computer.
{"title":"PocketMol: a molecular visualization tool for the Pocket PC","authors":"J. Gilder, M. Raymer, T. Doom","doi":"10.1109/BIBE.2001.974406","DOIUrl":"https://doi.org/10.1109/BIBE.2001.974406","url":null,"abstract":"Molecular visualization programs are available on many platforms. They allow a user to visualize and manipulate molecular structures. PocketMol provides the same functionality on a Pocket PC handheld computer. Using standard protein data bank (pdb) files, the user can move, rotate, and scale a protein to explore its structure and function. The user can choose from a standard backbone view or a simplified view using only alpha carbon atoms. PocketMolGX uses the Microsoft Game API to provide fast animation that is quite smooth. PocketMol is designed as an aid for those wishing to explore or demonstrate protein structures without the availability of a full-size computer.","PeriodicalId":405124,"journal":{"name":"Proceedings 2nd Annual IEEE International Symposium on Bioinformatics and Bioengineering (BIBE 2001)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116203697","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 : 2001-03-04DOI: 10.1109/BIBE.2001.974428
Samuel Ieong, M. Kao, T. Lam, W. Sung, S. Yiu
In this paper we investigate the computational problem of predicting RNA secondary structures that allow any kinds of pseudoknots. The general belief is that allowing pseudoknots makes the problem very difficult. Existing polynomial-time algorithms, which aim at structures that optimize some energy functions, can only handle a certain types of pseudoknots. In this paper we initiate the study of approximation algorithms for handling all kinds of pseudoknots. We focus on predicting RNA secondary structures with a maximum number of stacking pairs and obtain two approximation algorithms with worst-case approximation ratios of 1/2 and 1/3 for planar and general secondary structures, respectively. Furthermore, we prove that allowing pseudoknots would make the problem of maximizing the number of stacking pairs on planar secondary structure to be NP-hard. This result should be contrasted with the recent NP-hard results on psuedoknots which are based on optimizing some peculiar energy functions.
{"title":"Predicting RNA secondary structures with arbitrary pseudoknots by maximizing the number of stacking pairs","authors":"Samuel Ieong, M. Kao, T. Lam, W. Sung, S. Yiu","doi":"10.1109/BIBE.2001.974428","DOIUrl":"https://doi.org/10.1109/BIBE.2001.974428","url":null,"abstract":"In this paper we investigate the computational problem of predicting RNA secondary structures that allow any kinds of pseudoknots. The general belief is that allowing pseudoknots makes the problem very difficult. Existing polynomial-time algorithms, which aim at structures that optimize some energy functions, can only handle a certain types of pseudoknots. In this paper we initiate the study of approximation algorithms for handling all kinds of pseudoknots. We focus on predicting RNA secondary structures with a maximum number of stacking pairs and obtain two approximation algorithms with worst-case approximation ratios of 1/2 and 1/3 for planar and general secondary structures, respectively. Furthermore, we prove that allowing pseudoknots would make the problem of maximizing the number of stacking pairs on planar secondary structure to be NP-hard. This result should be contrasted with the recent NP-hard results on psuedoknots which are based on optimizing some peculiar energy functions.","PeriodicalId":405124,"journal":{"name":"Proceedings 2nd Annual IEEE International Symposium on Bioinformatics and Bioengineering (BIBE 2001)","volume":"1976 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130274658","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 : 2001-03-04DOI: 10.1109/BIBE.2001.974423
Liangyou Chen, H. Jamil
Similar to most scientific studies, biological analyses demand a great deal of computations and simulations involving sophisticated tools that are often found geographically distributed over the Internet. A worldwide effort in genomics research has resulted in a powerful collection of publicly available sequence analysis tools. These tools often require specialized local services and domain knowledge to function correctly, rendering them unlikely candidates for integration into remote database applications. Thus, integration of heterogeneous "functions" still remains an open problem. Providing a reasonable framework for seamless integration of these tools with database query engines will enable application developers to exploit and harness the power of these effective analysis tools. In this paper, we present an integration framework for such tools by enabling access to them in a user transparent way as part of database queries. In our system, such online tools are abstracted as remote user defined functions (RUDF). An extended SQL DDL language, called the Internet Function Definition Language (IFDL), is presented for the specification and definition of RUDFs. The interface between database system and the Internet is implemented using a layer based on a language called the Hypertext Query Language (HTQL). The separation of IFDL, DDL, HTQL and SQL DML offers several optimization opportunities and makes it possible to develop an architecture for interoperability of heterogeneous databases with RUDFs in more simple and efficient ways.
{"title":"Supporting remote user defined functions in heterogeneous biological databases","authors":"Liangyou Chen, H. Jamil","doi":"10.1109/BIBE.2001.974423","DOIUrl":"https://doi.org/10.1109/BIBE.2001.974423","url":null,"abstract":"Similar to most scientific studies, biological analyses demand a great deal of computations and simulations involving sophisticated tools that are often found geographically distributed over the Internet. A worldwide effort in genomics research has resulted in a powerful collection of publicly available sequence analysis tools. These tools often require specialized local services and domain knowledge to function correctly, rendering them unlikely candidates for integration into remote database applications. Thus, integration of heterogeneous \"functions\" still remains an open problem. Providing a reasonable framework for seamless integration of these tools with database query engines will enable application developers to exploit and harness the power of these effective analysis tools. In this paper, we present an integration framework for such tools by enabling access to them in a user transparent way as part of database queries. In our system, such online tools are abstracted as remote user defined functions (RUDF). An extended SQL DDL language, called the Internet Function Definition Language (IFDL), is presented for the specification and definition of RUDFs. The interface between database system and the Internet is implemented using a layer based on a language called the Hypertext Query Language (HTQL). The separation of IFDL, DDL, HTQL and SQL DML offers several optimization opportunities and makes it possible to develop an architecture for interoperability of heterogeneous databases with RUDFs in more simple and efficient ways.","PeriodicalId":405124,"journal":{"name":"Proceedings 2nd Annual IEEE International Symposium on Bioinformatics and Bioengineering (BIBE 2001)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122441828","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 : 2001-03-04DOI: 10.1109/BIBE.2001.974408
B. Eckman, Z. Lacroix, L. Raschid
Today, scientific data is inevitably digitized, stored in a variety of heterogeneous formats, and is accessible over the Internet. Scientists need to access an integrated view of multiple remote or local heterogeneous data sources. They then integrate the results of complex queries and apply further analysis and visualization to support the task of scientific discovery. Building a digital library for scientific discovery requires accessing and manipulating data extracted from flat files or databases, documents retrieved from the Web, as well as data that is locally materialized in warehouses or is generated by software. We consider several tasks to provide optimized and seamless integration of biomolecular data. Challenges to be addressed include capturing and representing source capabilities; developing a methodology to acquire and represent metadata about source contents and access costs; and decision support to select sources and capabilities using cost based and semantic knowledge, and generating low cost query evaluation plans.
{"title":"Optimized seamless integration of biomolecular data","authors":"B. Eckman, Z. Lacroix, L. Raschid","doi":"10.1109/BIBE.2001.974408","DOIUrl":"https://doi.org/10.1109/BIBE.2001.974408","url":null,"abstract":"Today, scientific data is inevitably digitized, stored in a variety of heterogeneous formats, and is accessible over the Internet. Scientists need to access an integrated view of multiple remote or local heterogeneous data sources. They then integrate the results of complex queries and apply further analysis and visualization to support the task of scientific discovery. Building a digital library for scientific discovery requires accessing and manipulating data extracted from flat files or databases, documents retrieved from the Web, as well as data that is locally materialized in warehouses or is generated by software. We consider several tasks to provide optimized and seamless integration of biomolecular data. Challenges to be addressed include capturing and representing source capabilities; developing a methodology to acquire and represent metadata about source contents and access costs; and decision support to select sources and capabilities using cost based and semantic knowledge, and generating low cost query evaluation plans.","PeriodicalId":405124,"journal":{"name":"Proceedings 2nd Annual IEEE International Symposium on Bioinformatics and Bioengineering (BIBE 2001)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123904418","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 : 2001-03-04DOI: 10.1109/BIBE.2001.974434
N. Bourbakis, D. Kavraki
This paper presents the navigation methodology employed by an intelligent assistant (agent) for people with disabilities. In particular, the intelligent assistant, called Tyflos, would help a visually impaired user to be partially independent and able to walk and work in a 3D dynamic environment. The Tyflos system carries two vision cameras and captures images from the surrounding 3D environment, either by the user's command or in a continuous mode (video), then it converts these images into verbal descriptions for each image into a verbal communication with the user. In other words the system plays the role of human assistant, who describes to the user the 3D visual environment.
{"title":"An intelligent assistant for navigation of visually impaired people","authors":"N. Bourbakis, D. Kavraki","doi":"10.1109/BIBE.2001.974434","DOIUrl":"https://doi.org/10.1109/BIBE.2001.974434","url":null,"abstract":"This paper presents the navigation methodology employed by an intelligent assistant (agent) for people with disabilities. In particular, the intelligent assistant, called Tyflos, would help a visually impaired user to be partially independent and able to walk and work in a 3D dynamic environment. The Tyflos system carries two vision cameras and captures images from the surrounding 3D environment, either by the user's command or in a continuous mode (video), then it converts these images into verbal descriptions for each image into a verbal communication with the user. In other words the system plays the role of human assistant, who describes to the user the 3D visual environment.","PeriodicalId":405124,"journal":{"name":"Proceedings 2nd Annual IEEE International Symposium on Bioinformatics and Bioengineering (BIBE 2001)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133252508","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 : 2001-03-04DOI: 10.1109/BIBE.2001.974417
K. Cheung, Yang Liu, Anuj Kumar, M. Snyder, M. Gerstein, P. Miller
As the eXtensible Markup Language (XML) becomes a popular or standard language for exchanging data over the Internet/Web, there are a growing number of genome Web sites that make their data available in XML format. Publishing genomic data in XML format alone would not be that useful if there is a lack of development of software applications that could take advantage of the XML technology to process these XML-formatted data. This paper illustrates the usefulness of XML in representing and interoperating genomic data between two different data sources (Snyder's laboratory at Yale and SGD at Stanford). In particular, we compare the locations of transposon insertions in the yeast DNA sequences that have been identified by BLAST searches with the chromosomal locations of the yeast open reading frames (ORFs) stored in SGD. Such a comparison allows us to characterize the transposon insertions by indicating whether they fall into any ORFs (which may potentially encode proteins that possess essential biological functions). To implement this XML-based interoperation, we used NCBIs "blastall" (which gives an XML output option) and SGD's yeast nucleotide sequence dataset to establish a local blast server. Also, we converted the SGD's ORF location data file (which is available in tab-delimited formal) into an XML document based on the BIOML (BIOpolymer Markup Language) standard.
{"title":"An XML application for genomic data interoperation","authors":"K. Cheung, Yang Liu, Anuj Kumar, M. Snyder, M. Gerstein, P. Miller","doi":"10.1109/BIBE.2001.974417","DOIUrl":"https://doi.org/10.1109/BIBE.2001.974417","url":null,"abstract":"As the eXtensible Markup Language (XML) becomes a popular or standard language for exchanging data over the Internet/Web, there are a growing number of genome Web sites that make their data available in XML format. Publishing genomic data in XML format alone would not be that useful if there is a lack of development of software applications that could take advantage of the XML technology to process these XML-formatted data. This paper illustrates the usefulness of XML in representing and interoperating genomic data between two different data sources (Snyder's laboratory at Yale and SGD at Stanford). In particular, we compare the locations of transposon insertions in the yeast DNA sequences that have been identified by BLAST searches with the chromosomal locations of the yeast open reading frames (ORFs) stored in SGD. Such a comparison allows us to characterize the transposon insertions by indicating whether they fall into any ORFs (which may potentially encode proteins that possess essential biological functions). To implement this XML-based interoperation, we used NCBIs \"blastall\" (which gives an XML output option) and SGD's yeast nucleotide sequence dataset to establish a local blast server. Also, we converted the SGD's ORF location data file (which is available in tab-delimited formal) into an XML document based on the BIOML (BIOpolymer Markup Language) standard.","PeriodicalId":405124,"journal":{"name":"Proceedings 2nd Annual IEEE International Symposium on Bioinformatics and Bioengineering (BIBE 2001)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123548942","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 : 2001-03-04DOI: 10.1109/BIBE.2001.974419
Michale E. Brandt
Despite significant progress over the past several decades in neural research there still remains an ingrained tendency to approach the field using overly reductionistic as well as linear theories and methods. We are just beginning to appreciate the complexity of the brain. A further shift in our "consciousness" about neural dynamics is needed to take the next steps in brain research. We need to use more reflexively what we have learned about the nonlinear dynamical and complex nature of the brain to attempt to "bootstrap" our own thinking processes about neural science itself.
{"title":"Thinking nonlinearly about brain dynamics: a neurocommentary","authors":"Michale E. Brandt","doi":"10.1109/BIBE.2001.974419","DOIUrl":"https://doi.org/10.1109/BIBE.2001.974419","url":null,"abstract":"Despite significant progress over the past several decades in neural research there still remains an ingrained tendency to approach the field using overly reductionistic as well as linear theories and methods. We are just beginning to appreciate the complexity of the brain. A further shift in our \"consciousness\" about neural dynamics is needed to take the next steps in brain research. We need to use more reflexively what we have learned about the nonlinear dynamical and complex nature of the brain to attempt to \"bootstrap\" our own thinking processes about neural science itself.","PeriodicalId":405124,"journal":{"name":"Proceedings 2nd Annual IEEE International Symposium on Bioinformatics and Bioengineering (BIBE 2001)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116278264","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
扫码关注我们
求助内容：
应助结果提醒方式：