Pub Date : 2009-06-14DOI: 10.1109/ICCW.2009.5208083
T. Kim, H. Choi
An extraction of important features in cancer cell image analysis is a key process in grading renal cell carcinoma. In this study, we applied three-dimensional (3D) texture feature extraction methods to cancer cell nuclei images and evaluated the validity of them for computerized cell nuclei grading. Individual images of 1,800 cell nuclei were extracted from 8 classes of renal cell carcinomas (RCCs) tissues using confocal laser scanning microscopy (CLSM). First, we extracted the chromatin texture quantitatively by calculating 3D gray-level co-occurrence matrices (3D GLCM) and 3D run length matrices (3D GLRLM). To demonstrate the suitability of 3D texture features for grading, we had performed a principal component analysis to reduce feature dimensionality, then, we also performed discriminant analysis as statistical classifier. Finally this result was compared with the result of classification using several optimized features that extracted from stepwise features selection. Additionally AUC (area under curve) analysis was performed for the grade 2 and 3 cell images. Three dimensional texture features have potential for use as fundamental elements in developing a new nuclear grading system with accurate diagnosis and predicting prognosis.
{"title":"Computerized Renal Cell Carcinoma Nuclear Grading Using 3D Textural Features","authors":"T. Kim, H. Choi","doi":"10.1109/ICCW.2009.5208083","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208083","url":null,"abstract":"An extraction of important features in cancer cell image analysis is a key process in grading renal cell carcinoma. In this study, we applied three-dimensional (3D) texture feature extraction methods to cancer cell nuclei images and evaluated the validity of them for computerized cell nuclei grading. Individual images of 1,800 cell nuclei were extracted from 8 classes of renal cell carcinomas (RCCs) tissues using confocal laser scanning microscopy (CLSM). First, we extracted the chromatin texture quantitatively by calculating 3D gray-level co-occurrence matrices (3D GLCM) and 3D run length matrices (3D GLRLM). To demonstrate the suitability of 3D texture features for grading, we had performed a principal component analysis to reduce feature dimensionality, then, we also performed discriminant analysis as statistical classifier. Finally this result was compared with the result of classification using several optimized features that extracted from stepwise features selection. Additionally AUC (area under curve) analysis was performed for the grade 2 and 3 cell images. Three dimensional texture features have potential for use as fundamental elements in developing a new nuclear grading system with accurate diagnosis and predicting prognosis.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127386897","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 : 2009-06-14DOI: 10.1109/ICCW.2009.5208110
S. Andreev, Zsolt Saffer, Alexey Anisimov
In this paper we conduct a delay analysis of IEEE 802.16 wireless metropolitan area network. In particular, we address the overall message delay, which consists of the reservation and scheduling components. Unicast polling is used for bandwidth reservation and round-robin scheduling is applied at the base station. A discrete-time analytical model is developed with general independent and identically distributed arrivals during a time slot. The model enables asymmetric traffic flows and different message sizes at the subscriber stations. The exact mean overall delay is obtained for the nrtPS service flow in the scenario when the base station splits the subscriber stations into individually polled groups. The analytical model is verified by means of simulation.
{"title":"Overall Delay Analysis of IEEE 802.16 Network","authors":"S. Andreev, Zsolt Saffer, Alexey Anisimov","doi":"10.1109/ICCW.2009.5208110","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208110","url":null,"abstract":"In this paper we conduct a delay analysis of IEEE 802.16 wireless metropolitan area network. In particular, we address the overall message delay, which consists of the reservation and scheduling components. Unicast polling is used for bandwidth reservation and round-robin scheduling is applied at the base station. A discrete-time analytical model is developed with general independent and identically distributed arrivals during a time slot. The model enables asymmetric traffic flows and different message sizes at the subscriber stations. The exact mean overall delay is obtained for the nrtPS service flow in the scenario when the base station splits the subscriber stations into individually polled groups. The analytical model is verified by means of simulation.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126276739","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 : 2009-06-14DOI: 10.1109/ICCW.2009.5208039
M. Yamada, T. Yazaki, Nobuhito Matsuyama, Takehisa Hayashi
We introduce two approaches for power saving routers, which are the power efficient designing and the power saving designing. Power efficient designing enables a high performance router at low power consumption. As a part of power efficient designing, we have integrated ASICs/FPGAs of routers and developed a scalable central architecture. Additionally, we used new high speed memories and high speed interfaces such as a SerDes. As a result, the whole power consumption of our router adopting power efficient designing was reduced over 50% compared to conventional routers. Power saving designing is an approach to cut down wasted power consumption. Two major aspects belong to power saving designing, which are static performance control and dynamic performance control. We have been studying on static performance control, such as power cutting technology per port or module, and power saving mode by frequency switching. We were successful in saving 10-20% of power compared to conventional routers using this power saving mode by frequency switching. Furthermore, we introduce the dynamic performance control as a promising power saving approach for next generation routers. The router controls its performance dynamically according to the amount of received traffic. We show two technologies needed for this approach, which are the dynamically performance controllable router architecture/circuit, and the traffic monitoring/predicting technology. We consider that working on these technologies will save more power.
{"title":"Power Efficient Approach and Performance Control for Routers","authors":"M. Yamada, T. Yazaki, Nobuhito Matsuyama, Takehisa Hayashi","doi":"10.1109/ICCW.2009.5208039","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208039","url":null,"abstract":"We introduce two approaches for power saving routers, which are the power efficient designing and the power saving designing. Power efficient designing enables a high performance router at low power consumption. As a part of power efficient designing, we have integrated ASICs/FPGAs of routers and developed a scalable central architecture. Additionally, we used new high speed memories and high speed interfaces such as a SerDes. As a result, the whole power consumption of our router adopting power efficient designing was reduced over 50% compared to conventional routers. Power saving designing is an approach to cut down wasted power consumption. Two major aspects belong to power saving designing, which are static performance control and dynamic performance control. We have been studying on static performance control, such as power cutting technology per port or module, and power saving mode by frequency switching. We were successful in saving 10-20% of power compared to conventional routers using this power saving mode by frequency switching. Furthermore, we introduce the dynamic performance control as a promising power saving approach for next generation routers. The router controls its performance dynamically according to the amount of received traffic. We show two technologies needed for this approach, which are the dynamically performance controllable router architecture/circuit, and the traffic monitoring/predicting technology. We consider that working on these technologies will save more power.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125426167","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 : 2009-06-14DOI: 10.1109/ICCW.2009.5207973
M. Kodama, G. Hasegawa, M. Murata
With increase in the heterogeneity and complexity of the Internet, many problems have emerged in the traditional TCP Reno. Against the problem, we have proposed a new bandwidth- based TCP congestion control mechanism, TCP Symbiosis. Unlike the recent works on delay-based and hybrid congestion control, TCP Symbiosis relies on the bandwidth measurement to control the congestion window size. Although we have confirmed that TCP Symbiosis has the effectiveness in terms of average throughput, stability, and scalability to the bandwidth-delay product, the throughput of TCP Symbiosis highly depends on the measurement results of available bandwidth. In this paper, we redesign TCP Symbiosis to deal with the measurement error and noise of the available bandwidth. First, we propose the dynamic parameter setting algorithm based on the variance of the measured available bandwidth. Second, for the purpose of absorbing the ill-effect of environmental change, we propose to add self-induced oscillation to the congestion window size of TCP connection. We confirm the effectiveness of the proposed methods through ns-2 simulation experiments.
{"title":"Bandwidth-Based Congestion Control for TCP: Measurement Noise-Aware Parameter Settings and Self-Induced Oscillation","authors":"M. Kodama, G. Hasegawa, M. Murata","doi":"10.1109/ICCW.2009.5207973","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5207973","url":null,"abstract":"With increase in the heterogeneity and complexity of the Internet, many problems have emerged in the traditional TCP Reno. Against the problem, we have proposed a new bandwidth- based TCP congestion control mechanism, TCP Symbiosis. Unlike the recent works on delay-based and hybrid congestion control, TCP Symbiosis relies on the bandwidth measurement to control the congestion window size. Although we have confirmed that TCP Symbiosis has the effectiveness in terms of average throughput, stability, and scalability to the bandwidth-delay product, the throughput of TCP Symbiosis highly depends on the measurement results of available bandwidth. In this paper, we redesign TCP Symbiosis to deal with the measurement error and noise of the available bandwidth. First, we propose the dynamic parameter setting algorithm based on the variance of the measured available bandwidth. Second, for the purpose of absorbing the ill-effect of environmental change, we propose to add self-induced oscillation to the congestion window size of TCP connection. We confirm the effectiveness of the proposed methods through ns-2 simulation experiments.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"137 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125945486","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 : 2009-06-14DOI: 10.1109/ICCW.2009.5208062
Suyang Ju, Joseph B. Evans
This paper introduces a novel mobility-aware routing protocol (MARP) for mobile, cognitive ad-hoc networks. Traditional routing protocols trigger the routing updates after the nodes detect the route failure. Even if the link condition is getting worse which means the link is likely to break in the future, the nodes will still transmit the packets along the current path. MARP uses cognitive techniques to predict when the link is likely to break so that it can inform the previous hop to trigger the routing updates before the link breaks. In this way, the nodes are aware of the physical topology changes. Based on simulation results, MARP can increase overall performance of the network significantly.
{"title":"Mobility-Aware Routing Protocol for Mobile Ad-Hoc Networks","authors":"Suyang Ju, Joseph B. Evans","doi":"10.1109/ICCW.2009.5208062","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208062","url":null,"abstract":"This paper introduces a novel mobility-aware routing protocol (MARP) for mobile, cognitive ad-hoc networks. Traditional routing protocols trigger the routing updates after the nodes detect the route failure. Even if the link condition is getting worse which means the link is likely to break in the future, the nodes will still transmit the packets along the current path. MARP uses cognitive techniques to predict when the link is likely to break so that it can inform the previous hop to trigger the routing updates before the link breaks. In this way, the nodes are aware of the physical topology changes. Based on simulation results, MARP can increase overall performance of the network significantly.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121694535","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 : 2009-06-14DOI: 10.1109/ICCW.2009.5208052
J. Misic, V. Mišić
In this paper we investigate the performance of a cognitive personal area network (CPAN) in which the duration of spectrum sensing done by a node is proportional to the number of packets previously transmitted by that node. We show that the operation of a node in this setup can be modeled as a gated exhaustive round-robin system with vacations, and analyze the performance of the system. The impact of the value of the penalty factor, which determines the duration of sensing activity with respect to transmission, on packet access delay is discussed in detail.
{"title":"Sensing After Transmission in Cognitive Wireless Personal Area Networks","authors":"J. Misic, V. Mišić","doi":"10.1109/ICCW.2009.5208052","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5208052","url":null,"abstract":"In this paper we investigate the performance of a cognitive personal area network (CPAN) in which the duration of spectrum sensing done by a node is proportional to the number of packets previously transmitted by that node. We show that the operation of a node in this setup can be modeled as a gated exhaustive round-robin system with vacations, and analyze the performance of the system. The impact of the value of the penalty factor, which determines the duration of sensing activity with respect to transmission, on packet access delay is discussed in detail.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129106210","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 : 2009-06-14DOI: 10.1109/ICCW.2009.5207988
M. Nicoli, D. Fontanella
Knowledge of node locations is desired in many types of wireless sensor network (WSN) technologies. Cooperative localization has been proved to provide self-calibration in the WSN even in presence of sparse reference nodes and noisy range estimates, as it relies on redundancy exploiting all the available inter-node measurements. In this paper we consider cooperative localization based on time-of-arrival (TOA) inter-node ranging. We analyze the Cramer-Rao bound on the positioning accuracy for one/two dimensional regular network topologies. The aim is to obtain some understanding of the behavior of localization accuracy for varying system settings, as a base for future evaluations of more realistic random network deployments.
{"title":"Fundamental Performance Limits of TOA-Based Cooperative Localization","authors":"M. Nicoli, D. Fontanella","doi":"10.1109/ICCW.2009.5207988","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5207988","url":null,"abstract":"Knowledge of node locations is desired in many types of wireless sensor network (WSN) technologies. Cooperative localization has been proved to provide self-calibration in the WSN even in presence of sparse reference nodes and noisy range estimates, as it relies on redundancy exploiting all the available inter-node measurements. In this paper we consider cooperative localization based on time-of-arrival (TOA) inter-node ranging. We analyze the Cramer-Rao bound on the positioning accuracy for one/two dimensional regular network topologies. The aim is to obtain some understanding of the behavior of localization accuracy for varying system settings, as a base for future evaluations of more realistic random network deployments.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126594589","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 : 2009-06-14DOI: 10.1109/ICCW.2009.5207961
K. Nguyen, B. Jaumard
Current Internet is operated based on interdomain routers executing interdomain routing protocols interconnecting nodes of various autonomous systems. Due to new requirements of traffic in the core Internet, next generation routers with enhanced memory capacity and computing resources, distributed across a very high speed switching fabric are developed in order to replace the currently used interdomain routers. An essential requirement for these routers is to redesign the current routing and signaling software modules, traditionally with centralized architectures, which do not scale in order to fully exploit such an advanced router hardware architecture. This paper discusses a first distributed BGP architecture for next generation routers, aiming at increasing the scalability and resiliency. The proposed architecture is based on a set of BGP processes running on a set of control cards of a router. The distributed processes cooperate in a manner that internally exploits the distributed hardware architecture of next generation router, while maintaining the behavior of a single routing protocol process communicating with its peers in the network. The proposed architecture improves both the overall performance and the resiliency of routers in the presence of faults.
{"title":"A Scalable and Distributed Architecture for BGP in Next Generation Routers","authors":"K. Nguyen, B. Jaumard","doi":"10.1109/ICCW.2009.5207961","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5207961","url":null,"abstract":"Current Internet is operated based on interdomain routers executing interdomain routing protocols interconnecting nodes of various autonomous systems. Due to new requirements of traffic in the core Internet, next generation routers with enhanced memory capacity and computing resources, distributed across a very high speed switching fabric are developed in order to replace the currently used interdomain routers. An essential requirement for these routers is to redesign the current routing and signaling software modules, traditionally with centralized architectures, which do not scale in order to fully exploit such an advanced router hardware architecture. This paper discusses a first distributed BGP architecture for next generation routers, aiming at increasing the scalability and resiliency. The proposed architecture is based on a set of BGP processes running on a set of control cards of a router. The distributed processes cooperate in a manner that internally exploits the distributed hardware architecture of next generation router, while maintaining the behavior of a single routing protocol process communicating with its peers in the network. The proposed architecture improves both the overall performance and the resiliency of routers in the presence of faults.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128872882","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 : 2009-06-14DOI: 10.1109/ICCW.2009.5207990
D. Dardari, Y. Karisan, S. Gezici, A. A. D’amico, U. Mengali
Cognitive radio is a promising paradigm for efficient utilization of the radio spectrum due to its capability to sense environmental conditions and adapt its communication and localization features. In this paper, the theoretical limits on time-of-arrival estimation for cognitive radio localization systems are derived in the presence of interference. In addition, an optimal spectrum allocation strategy which provides the best ranging accuracy limits is proposed. The strategy accounts for the constraints from the sensed interference level as well as from the regulatory emission mask. Numerical results are presented to illustrate the improvements that can be achieved by the proposed approach.
{"title":"Performance Limits on Ranging with Cognitive Radio","authors":"D. Dardari, Y. Karisan, S. Gezici, A. A. D’amico, U. Mengali","doi":"10.1109/ICCW.2009.5207990","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5207990","url":null,"abstract":"Cognitive radio is a promising paradigm for efficient utilization of the radio spectrum due to its capability to sense environmental conditions and adapt its communication and localization features. In this paper, the theoretical limits on time-of-arrival estimation for cognitive radio localization systems are derived in the presence of interference. In addition, an optimal spectrum allocation strategy which provides the best ranging accuracy limits is proposed. The strategy accounts for the constraints from the sensed interference level as well as from the regulatory emission mask. Numerical results are presented to illustrate the improvements that can be achieved by the proposed approach.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"5 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133245496","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 : 2009-06-14DOI: 10.1109/ICCW.2009.5207979
I. Houidi, Wajdi Louati, D. Zeghlache, S. Baucke
This paper explores description and clustering techniques for virtual networks provisioning from shared physical resources. The contribution consists of a virtual resource description schema to specify properties and relations between virtual resources and a conceptual clustering technique to facilitate matching and discovery. Conceptual clustering provides a hierarchical classification of virtual resources and concept descriptions for clusters. Performance results benefits of conceptual clustering for resource matching are reported.
{"title":"Virtual Resource Description and Clustering for Virtual Network Discovery","authors":"I. Houidi, Wajdi Louati, D. Zeghlache, S. Baucke","doi":"10.1109/ICCW.2009.5207979","DOIUrl":"https://doi.org/10.1109/ICCW.2009.5207979","url":null,"abstract":"This paper explores description and clustering techniques for virtual networks provisioning from shared physical resources. The contribution consists of a virtual resource description schema to specify properties and relations between virtual resources and a conceptual clustering technique to facilitate matching and discovery. Conceptual clustering provides a hierarchical classification of virtual resources and concept descriptions for clusters. Performance results benefits of conceptual clustering for resource matching are reported.","PeriodicalId":271067,"journal":{"name":"2009 IEEE International Conference on Communications Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133622441","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
扫码关注我们
求助内容：
应助结果提醒方式：