Pub Date : 2000-11-08DOI: 10.1109/BIBE.2000.889604
Mohammed J. Zaki, Shanrong Jin, C. Bystroff
In this paper, we develop data mining techniques to predict 3D contact potentials among protein residues (or amino acids) based on the hierarchical nucleation-propagation model of protein folding. We apply a hybrid approach, using a hidden Markov model (HMM) to extract folding initiation sites, and then apply association mining to discover contact potentials. The new hybrid approach achieves accuracy results better than those reported previously.
{"title":"Mining residue contacts in proteins using local structure predictions","authors":"Mohammed J. Zaki, Shanrong Jin, C. Bystroff","doi":"10.1109/BIBE.2000.889604","DOIUrl":"https://doi.org/10.1109/BIBE.2000.889604","url":null,"abstract":"In this paper, we develop data mining techniques to predict 3D contact potentials among protein residues (or amino acids) based on the hierarchical nucleation-propagation model of protein folding. We apply a hybrid approach, using a hidden Markov model (HMM) to extract folding initiation sites, and then apply association mining to discover contact potentials. The new hybrid approach achieves accuracy results better than those reported previously.","PeriodicalId":196846,"journal":{"name":"Proceedings IEEE International Symposium on Bio-Informatics and Biomedical Engineering","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122754272","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 : 2000-11-08DOI: 10.1109/BIBE.2000.889599
A. Skourikhine
We have developed a self-adaptive genetic algorithm (GA) for a maximum-likelihood reconstruction of phylogenetic trees using nucleotide sequence data. It resulted in a faster reconstruction of the trees with less computing power and automatic self-adjustment of settings of the optimization algorithm parameters. We focused on the use of GAs with self-adaptive control parameters and GA integration with phylogenetic tree representations. The developed technique is applicable to any nucleotide sequences inferring evolutionary relationships between organisms.
{"title":"Phylogenetic tree reconstruction using self-adaptive genetic algorithm","authors":"A. Skourikhine","doi":"10.1109/BIBE.2000.889599","DOIUrl":"https://doi.org/10.1109/BIBE.2000.889599","url":null,"abstract":"We have developed a self-adaptive genetic algorithm (GA) for a maximum-likelihood reconstruction of phylogenetic trees using nucleotide sequence data. It resulted in a faster reconstruction of the trees with less computing power and automatic self-adjustment of settings of the optimization algorithm parameters. We focused on the use of GAs with self-adaptive control parameters and GA integration with phylogenetic tree representations. The developed technique is applicable to any nucleotide sequences inferring evolutionary relationships between organisms.","PeriodicalId":196846,"journal":{"name":"Proceedings IEEE International Symposium on Bio-Informatics and Biomedical Engineering","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117083391","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 : 2000-11-08DOI: 10.1109/BIBE.2000.889631
J. Boston, J. Antaki, M. Simaan
This paper describes a hierarchical control structure to regulate the operation of turbo-hydrodynamic heart assist devices. The goal of the controller is to provide performance that satisfies as many clinical constraints as possible, consistent with the amount and validity of hemodynamic measurements available. Local control algorithms built into the devices maintain pump speed at a reference value, and the primary problem addressed by the hierarchical controller is to determine the desired reference. At the top of the hierarchy is a supervisor that maintains a model of the pump and the patient and continuously evaluates the available estimates of hemodynamic variables, reliability of the patient model, past history of the patient, and validity of the information available. Depending on this evaluation, the supervisor uses either heuristic criteria or a multi-objective optimization algorithm to determine the reference speed. It also evaluates the operating status of the device.
{"title":"Hierarchical control for artificial hearts","authors":"J. Boston, J. Antaki, M. Simaan","doi":"10.1109/BIBE.2000.889631","DOIUrl":"https://doi.org/10.1109/BIBE.2000.889631","url":null,"abstract":"This paper describes a hierarchical control structure to regulate the operation of turbo-hydrodynamic heart assist devices. The goal of the controller is to provide performance that satisfies as many clinical constraints as possible, consistent with the amount and validity of hemodynamic measurements available. Local control algorithms built into the devices maintain pump speed at a reference value, and the primary problem addressed by the hierarchical controller is to determine the desired reference. At the top of the hierarchy is a supervisor that maintains a model of the pump and the patient and continuously evaluates the available estimates of hemodynamic variables, reliability of the patient model, past history of the patient, and validity of the information available. Depending on this evaluation, the supervisor uses either heuristic criteria or a multi-objective optimization algorithm to determine the reference speed. It also evaluates the operating status of the device.","PeriodicalId":196846,"journal":{"name":"Proceedings IEEE International Symposium on Bio-Informatics and Biomedical Engineering","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116856169","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 : 2000-11-08DOI: 10.1109/BIBE.2000.889628
Xun Wang, William G. Wee
A divide and conquer strategy in the deformable contour method is presented. An initial inside closed contour is divided into segments, and these segments are allowed to deform separately preserving segments' connectivity. A deformable contour algorithm is adapted to each contour segment movement. A maximum area threshold, A/sub max/, is used to stop these outward contour segment marchings. Clear and blur contour points are then identified, and the whole contour is repartitioned into clear, blur, and gap segments. A bi-directional searching method is then recursively applied to each, blur, or gap segment until a final contour is sought. At this point, a search for contour within contour segment is undertaken so that the inner most contour can be searched. At all times, a global snake type performance index is used to find each local contour segment. Experiments have shown that the method has the capability of moving a contour into the neighboring region of the solution contour by overcoming all the above inhomogeneous interior, and of adapting each contour segment searching operation to different local difficulties, through a contour partition and repartition scheme in searching for a final solution. These experiments include ultrasound images of pig heart, MRI brain images, and MRI knee images having complex shapes and/or with gaps, inhomogeneous interior and contour region brightness distributions.
{"title":"A divide and conquer deformable contour method","authors":"Xun Wang, William G. Wee","doi":"10.1109/BIBE.2000.889628","DOIUrl":"https://doi.org/10.1109/BIBE.2000.889628","url":null,"abstract":"A divide and conquer strategy in the deformable contour method is presented. An initial inside closed contour is divided into segments, and these segments are allowed to deform separately preserving segments' connectivity. A deformable contour algorithm is adapted to each contour segment movement. A maximum area threshold, A/sub max/, is used to stop these outward contour segment marchings. Clear and blur contour points are then identified, and the whole contour is repartitioned into clear, blur, and gap segments. A bi-directional searching method is then recursively applied to each, blur, or gap segment until a final contour is sought. At this point, a search for contour within contour segment is undertaken so that the inner most contour can be searched. At all times, a global snake type performance index is used to find each local contour segment. Experiments have shown that the method has the capability of moving a contour into the neighboring region of the solution contour by overcoming all the above inhomogeneous interior, and of adapting each contour segment searching operation to different local difficulties, through a contour partition and repartition scheme in searching for a final solution. These experiments include ultrasound images of pig heart, MRI brain images, and MRI knee images having complex shapes and/or with gaps, inhomogeneous interior and contour region brightness distributions.","PeriodicalId":196846,"journal":{"name":"Proceedings IEEE International Symposium on Bio-Informatics and Biomedical Engineering","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124530564","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 : 2000-11-08DOI: 10.1109/BIBE.2000.889630
R. Sepulchre, M. Gérard, B. Marchand, D. Prieels
Pencil Beam Scanning is a dynamic beam delivery system developed at IBA s.a. for proton therapy. The radiation field necessary to reach in a fast and robust way a prescribed 3D dose distribution is obtained by accurately controlling both the extraction of the beam from a 235 MeV accelerator and the motion of the beam spot thanks to scanning magnets. Compared to existing beam delivery systems, the hardware of the PBS system is considerably simplified while offering the possibility of accurate delivery and short treatment time. The simplification in hardware is compensated for by advanced actuation, which is the topic of the present paper.
{"title":"Pencil beam scanning: a dynamical approach to proton therapy","authors":"R. Sepulchre, M. Gérard, B. Marchand, D. Prieels","doi":"10.1109/BIBE.2000.889630","DOIUrl":"https://doi.org/10.1109/BIBE.2000.889630","url":null,"abstract":"Pencil Beam Scanning is a dynamic beam delivery system developed at IBA s.a. for proton therapy. The radiation field necessary to reach in a fast and robust way a prescribed 3D dose distribution is obtained by accurately controlling both the extraction of the beam from a 235 MeV accelerator and the motion of the beam spot thanks to scanning magnets. Compared to existing beam delivery systems, the hardware of the PBS system is considerably simplified while offering the possibility of accurate delivery and short treatment time. The simplification in hardware is compensated for by advanced actuation, which is the topic of the present paper.","PeriodicalId":196846,"journal":{"name":"Proceedings IEEE International Symposium on Bio-Informatics and Biomedical Engineering","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126273367","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 : 2000-11-08DOI: 10.1109/BIBE.2000.889600
E. Hibbs
This paper discusses a combinatorial analog method of attacking the overall challenge in scientific computation - to accurately and quickly performs several types of multidimensional digital and analog computations. The paper presents a challenge to break the historical binary-driven computational paradigm. The resultant recommendation is for an electromagnetic DNA computing synchro using the intrinsic quantum properties of DNA.
{"title":"Futuristic combinatorial analog computing systems: the DNA synchro solution","authors":"E. Hibbs","doi":"10.1109/BIBE.2000.889600","DOIUrl":"https://doi.org/10.1109/BIBE.2000.889600","url":null,"abstract":"This paper discusses a combinatorial analog method of attacking the overall challenge in scientific computation - to accurately and quickly performs several types of multidimensional digital and analog computations. The paper presents a challenge to break the historical binary-driven computational paradigm. The resultant recommendation is for an electromagnetic DNA computing synchro using the intrinsic quantum properties of DNA.","PeriodicalId":196846,"journal":{"name":"Proceedings IEEE International Symposium on Bio-Informatics and Biomedical Engineering","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116315416","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 : 2000-11-08DOI: 10.1109/BIBE.2000.889616
J. S. Mertoguno, N. Bourbakis
Presents the basic design and the simulation of a low level multi-layer vision processor that emulates to some degree the functional behavior of a human retina. This retina-like multi-layer processor is the lower part of an autonomous self-organized vision system, called Kydon, which could be used on visually impaired people with a damaged visual cerebral cortex. The retina-like processor consists of four major layers, where each is an array processor that performs a certain set of low level vision tasks, such as smoothing and light adaptation, edge detection, segmentation, line recognition and region-graph generation. At each layer the array processor is a 2-D array of kxm hexagonal identical autonomous cells that simultaneously execute certain tasks. Thus, in this paper the hardware design and the entire simulation of the retina-like processor with illustrative examples are provided.
{"title":"A digital retina-like low level vision processor","authors":"J. S. Mertoguno, N. Bourbakis","doi":"10.1109/BIBE.2000.889616","DOIUrl":"https://doi.org/10.1109/BIBE.2000.889616","url":null,"abstract":"Presents the basic design and the simulation of a low level multi-layer vision processor that emulates to some degree the functional behavior of a human retina. This retina-like multi-layer processor is the lower part of an autonomous self-organized vision system, called Kydon, which could be used on visually impaired people with a damaged visual cerebral cortex. The retina-like processor consists of four major layers, where each is an array processor that performs a certain set of low level vision tasks, such as smoothing and light adaptation, edge detection, segmentation, line recognition and region-graph generation. At each layer the array processor is a 2-D array of kxm hexagonal identical autonomous cells that simultaneously execute certain tasks. Thus, in this paper the hardware design and the entire simulation of the retina-like processor with illustrative examples are provided.","PeriodicalId":196846,"journal":{"name":"Proceedings IEEE International Symposium on Bio-Informatics and Biomedical Engineering","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114216148","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 : 2000-11-08DOI: 10.1109/BIBE.2000.889596
Hannu (TT) Toivonen, P. Onkamo, Kari Vasko, V. Ollikainen, P. Sevon, H. Mannila, J. Kere
Genetic markers are being increasingly utilized in gene mapping. The discovery of associations between markers and patient phenotypes - such as a disease status - enables the identification of potential disease gene loci. The rationale is that, in diseases with a reasonable genetic contribution, diseased individuals are more likely to have associated marker alleles near the disease susceptibility gene than control individuals. We describe a new gene mapping method-haplotype pattern mining (HPM) - that is based on discovering recurrent marker patterns. We define a class of useful haplotype patterns in genetic case-control data, give an algorithm for finding disease-associated haplotypes, and show how to use them to identify disease susceptibility loci. Experimental studies show that the method has good localization power in data sets with large degrees of phenocopies and with lots of missing and erroneous data. We also demonstrate how the method can be used to discover several genes simultaneously.
{"title":"Gene mapping by haplotype pattern mining","authors":"Hannu (TT) Toivonen, P. Onkamo, Kari Vasko, V. Ollikainen, P. Sevon, H. Mannila, J. Kere","doi":"10.1109/BIBE.2000.889596","DOIUrl":"https://doi.org/10.1109/BIBE.2000.889596","url":null,"abstract":"Genetic markers are being increasingly utilized in gene mapping. The discovery of associations between markers and patient phenotypes - such as a disease status - enables the identification of potential disease gene loci. The rationale is that, in diseases with a reasonable genetic contribution, diseased individuals are more likely to have associated marker alleles near the disease susceptibility gene than control individuals. We describe a new gene mapping method-haplotype pattern mining (HPM) - that is based on discovering recurrent marker patterns. We define a class of useful haplotype patterns in genetic case-control data, give an algorithm for finding disease-associated haplotypes, and show how to use them to identify disease susceptibility loci. Experimental studies show that the method has good localization power in data sets with large degrees of phenocopies and with lots of missing and erroneous data. We also demonstrate how the method can be used to discover several genes simultaneously.","PeriodicalId":196846,"journal":{"name":"Proceedings IEEE International Symposium on Bio-Informatics and Biomedical Engineering","volume":"282 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114838655","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 : 2000-11-08DOI: 10.1109/BIBE.2000.889629
H. El-Samad, M. Khammash
In the technological and engineering sciences feedback control methods have been studied and applied extensively to man-made systems. Recently, there has been an increasing interest as to the applicability of feedback and control theory to the life sciences. In a previous paper (H. El-Samad et al., "Calcium homeostasis: a feedback control point of view," Proceedings of the 2000 American Control Conference, Chicago, Il, June 2000), the applicability of control theory to the analysis of calcium homeostasis was investigated. A mathematical model for this homeostatic mechanism was derived. Here, the authors provide an overview of this model, and then use it to study a pathological condition of the calcium regulatory mechanism in dairy cows. The clinical condition studied is referred to as parturient paresis (milk fever) and is the result of severe hypocalcemia at the time of parturition. The authors show that their mathematical feedback model for calcium homeostasis exhibits dynamic behavior that can correspond to milk fever. They then present a rigorous mathematical result that guarantees the presence of milk fever-like dynamics for a range of model parameters.
在技术和工程科学中，反馈控制方法得到了广泛的研究和应用。最近，人们对反馈和控制理论在生命科学中的适用性越来越感兴趣。在之前的一篇论文中(H. El-Samad et al.，“钙稳态:反馈控制点”，2000年美国控制会议论文集，芝加哥，伊利诺伊州，2000年6月)，研究了控制论对钙稳态分析的适用性。推导了这种自稳态机制的数学模型。本文将对该模型进行概述，并利用该模型研究奶牛病理状态下钙的调节机制。所研究的临床状况被称为分娩轻瘫(乳热)，是分娩时严重低钙血症的结果。作者表明，他们的钙稳态数学反馈模型显示出与牛奶热相对应的动态行为。然后，他们提出了一个严格的数学结果，以保证在一系列模型参数中存在类似牛奶热的动力学。
{"title":"Feedback analysis of calcium homeostasis and parturient paresis","authors":"H. El-Samad, M. Khammash","doi":"10.1109/BIBE.2000.889629","DOIUrl":"https://doi.org/10.1109/BIBE.2000.889629","url":null,"abstract":"In the technological and engineering sciences feedback control methods have been studied and applied extensively to man-made systems. Recently, there has been an increasing interest as to the applicability of feedback and control theory to the life sciences. In a previous paper (H. El-Samad et al., \"Calcium homeostasis: a feedback control point of view,\" Proceedings of the 2000 American Control Conference, Chicago, Il, June 2000), the applicability of control theory to the analysis of calcium homeostasis was investigated. A mathematical model for this homeostatic mechanism was derived. Here, the authors provide an overview of this model, and then use it to study a pathological condition of the calcium regulatory mechanism in dairy cows. The clinical condition studied is referred to as parturient paresis (milk fever) and is the result of severe hypocalcemia at the time of parturition. The authors show that their mathematical feedback model for calcium homeostasis exhibits dynamic behavior that can correspond to milk fever. They then present a rigorous mathematical result that guarantees the presence of milk fever-like dynamics for a range of model parameters.","PeriodicalId":196846,"journal":{"name":"Proceedings IEEE International Symposium on Bio-Informatics and Biomedical Engineering","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125333676","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 : 2000-11-08DOI: 10.1109/BIBE.2000.889584
G. Kemp, N. Angelopoulos, P. Gray
Developments in our ability to integrate and analyse the data held in existing heterogeneous data resources can lead to an increase in our understanding of biological function at all levels. However, supporting ad-hoc queries across multiple data resources and correlating the data retrieved from these is still difficult. To address this, we are building a mediator based on the functional data model database, P/FDM, which integrates access to heterogeneous, distributed biological databases, while making use of existing search engines and indexes, without infringing on the autonomy of the underlying databases. Central to our design philosophy is the use of schemas. We have adopted a federated architecture with a five-level schema, arising from the use of the ANSI-SPARC three-level schema to describe both the existing autonomous data resources and the mediator itself. We describe the use of mapping functions and list comprehensions in query splitting, producing execution plans, code generation and result fusion. We give an example of cross-database querying involving data held locally in P/FDM systems and external data in the Sequence Retrieval System (SRS).
{"title":"A schema-based approach to building a bioinformatics database federation","authors":"G. Kemp, N. Angelopoulos, P. Gray","doi":"10.1109/BIBE.2000.889584","DOIUrl":"https://doi.org/10.1109/BIBE.2000.889584","url":null,"abstract":"Developments in our ability to integrate and analyse the data held in existing heterogeneous data resources can lead to an increase in our understanding of biological function at all levels. However, supporting ad-hoc queries across multiple data resources and correlating the data retrieved from these is still difficult. To address this, we are building a mediator based on the functional data model database, P/FDM, which integrates access to heterogeneous, distributed biological databases, while making use of existing search engines and indexes, without infringing on the autonomy of the underlying databases. Central to our design philosophy is the use of schemas. We have adopted a federated architecture with a five-level schema, arising from the use of the ANSI-SPARC three-level schema to describe both the existing autonomous data resources and the mediator itself. We describe the use of mapping functions and list comprehensions in query splitting, producing execution plans, code generation and result fusion. We give an example of cross-database querying involving data held locally in P/FDM systems and external data in the Sequence Retrieval System (SRS).","PeriodicalId":196846,"journal":{"name":"Proceedings IEEE International Symposium on Bio-Informatics and Biomedical Engineering","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120845832","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
扫码关注我们
求助内容：
应助结果提醒方式：