SDN is wildly studied as it enables new services and enhances existing services for telecom operators. Operators with large-scale optical transport networks might tend to operate newly-built SDN networks and legacy transport networks in parallel and gradually retire legacy devices. This study proposes a mediator approach to fulfill bandwidth adjustment demand with both SDN-ready and legacy devices. We applied the proposed approach to large-scale networks. The experiment result shows that this approach is feasible and brings higher hit ratio.
{"title":"Mediating between OpenFlow and legacy transport networks for bandwidth on-demand Services","authors":"Chuan Yin, Tsan-Chang Kuo, Tai-Yuan Li, Min-Chia Chang, Been-Huang Liao","doi":"10.1109/APNOMS.2014.6996529","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996529","url":null,"abstract":"SDN is wildly studied as it enables new services and enhances existing services for telecom operators. Operators with large-scale optical transport networks might tend to operate newly-built SDN networks and legacy transport networks in parallel and gradually retire legacy devices. This study proposes a mediator approach to fulfill bandwidth adjustment demand with both SDN-ready and legacy devices. We applied the proposed approach to large-scale networks. The experiment result shows that this approach is feasible and brings higher hit ratio.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121471976","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 : 2014-12-29DOI: 10.1109/APNOMS.2014.6996584
Chih-Hsuan Tang, Yen-Keui Chen Chen, Li-Chun Wang
Due to the exploded demand for mobile traffic and diverse service type, flexible mobile networks with high capacity is drawing lots of research efforts. Distributed large scale (DLS) MIMO has superiority over centralized large scale MIMO and separated small cells due to lower signal loss to users and central control. In this paper, we present a self-optimization method for Cloud RAN based DLS MIMO. The method includes network dimensioning and antenna clustering with adaptability to the migration of hardware/virtualization technology and user over time. Other advantages are easing the process for dimensioning and optimization, requiring fewer antennas, and less demand for controller & baseband computing power due to the characteristic of low complexity.
随着移动通信需求的爆炸式增长和业务类型的多样化，高容量的灵活移动网络正成为人们研究的热点。分布式大规模MIMO (Distributed large scale, DLS)比集中式大规模MIMO和分离小小区MIMO具有较低的用户信号损失和集中控制的优势。本文提出了一种基于云RAN的DLS MIMO自优化方法。该方法包括网络维度和天线聚类，具有适应硬件/虚拟化技术和用户随时间迁移的能力。其他优点是简化了尺寸和优化过程，需要更少的天线，由于低复杂性的特点，对控制器和基带计算能力的需求更少。
{"title":"Self-optimized cloud RAN based smart zone","authors":"Chih-Hsuan Tang, Yen-Keui Chen Chen, Li-Chun Wang","doi":"10.1109/APNOMS.2014.6996584","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996584","url":null,"abstract":"Due to the exploded demand for mobile traffic and diverse service type, flexible mobile networks with high capacity is drawing lots of research efforts. Distributed large scale (DLS) MIMO has superiority over centralized large scale MIMO and separated small cells due to lower signal loss to users and central control. In this paper, we present a self-optimization method for Cloud RAN based DLS MIMO. The method includes network dimensioning and antenna clustering with adaptability to the migration of hardware/virtualization technology and user over time. Other advantages are easing the process for dimensioning and optimization, requiring fewer antennas, and less demand for controller & baseband computing power due to the characteristic of low complexity.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116750989","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 : 2014-12-29DOI: 10.1109/APNOMS.2014.6996578
Weiming Li, Yilin Yan, Hao Tu, Jia Xu
Sensitive information leaking of network servers attacked by malwares or hackers is a serious security risk of Internet. The paper presents a dynamic taint tracking based method to automatically detect sensitive data leaking. The method automatically tags sensitive data as taint data and monitors the propagation of taint data in memory. If the sensitive data is sent by sockets or written into files, the method will alert and record detail leaking context. The whole process does not need modifying the network server source code or relying on particular server programming languages. The research is useful to improve security of all kinds of network. In the experiment part, successfully detecting the OpenSSL Heartbleed attack proves the effectiveness of the method.
{"title":"A dynamic taint tracking based method to detect sensitive information leaking","authors":"Weiming Li, Yilin Yan, Hao Tu, Jia Xu","doi":"10.1109/APNOMS.2014.6996578","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996578","url":null,"abstract":"Sensitive information leaking of network servers attacked by malwares or hackers is a serious security risk of Internet. The paper presents a dynamic taint tracking based method to automatically detect sensitive data leaking. The method automatically tags sensitive data as taint data and monitors the propagation of taint data in memory. If the sensitive data is sent by sockets or written into files, the method will alert and record detail leaking context. The whole process does not need modifying the network server source code or relying on particular server programming languages. The research is useful to improve security of all kinds of network. In the experiment part, successfully detecting the OpenSSL Heartbleed attack proves the effectiveness of the method.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124975575","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 : 2014-12-29DOI: 10.1109/APNOMS.2014.6996604
Taeyeol Jeong, Sin-Seok Seo, J. Chung, Bernard Niyonteze, Jae-Hyoung Yoo, J. W. Hong
In this paper we propose a data center traffic engineering method based on multi-objective optimization. We define a problem of traffic engineering in data center networks as a multi-objective optimization problem with two contrary objectives: load balancing and energy saving. Traffic engineering models for load balancing and energy saving are represented as a linear programming equation. Our simulation results show that the proposed method enables data center operators to change the relative importance between load balancing and energy saving. We also show the traffic engineering results with the predefined upper bound of maximum link utilization and energy cost in response to service requirements and energy OPEX. The contributions of proposed traffic engineering method are (a) to minimize both maximum link utilization and energy cost simultaneously; (b) to minimize maximum link utilization with upper bound of energy cost; and (c) to minimize energy cost with upper bound of maximum link utilization.
{"title":"Multi-objective optimization-based traffic engineering for data center networks","authors":"Taeyeol Jeong, Sin-Seok Seo, J. Chung, Bernard Niyonteze, Jae-Hyoung Yoo, J. W. Hong","doi":"10.1109/APNOMS.2014.6996604","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996604","url":null,"abstract":"In this paper we propose a data center traffic engineering method based on multi-objective optimization. We define a problem of traffic engineering in data center networks as a multi-objective optimization problem with two contrary objectives: load balancing and energy saving. Traffic engineering models for load balancing and energy saving are represented as a linear programming equation. Our simulation results show that the proposed method enables data center operators to change the relative importance between load balancing and energy saving. We also show the traffic engineering results with the predefined upper bound of maximum link utilization and energy cost in response to service requirements and energy OPEX. The contributions of proposed traffic engineering method are (a) to minimize both maximum link utilization and energy cost simultaneously; (b) to minimize maximum link utilization with upper bound of energy cost; and (c) to minimize energy cost with upper bound of maximum link utilization.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"333 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122716719","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 : 2014-12-29DOI: 10.1109/APNOMS.2014.6996549
Hang Zhou, Yang Yang, Xue-song Qiu, Zhipeng Gao
In the management of WSNs, the mechanism of fault detection and location based on active probing has been widely applied. The main optimal direction of active probing is to maximize the coverage of nodes in the network by sending minimal set of probes from probe stations. Therefore, before probing, selecting optimizational station set to improve reachable rates of probed nodes has significant influence on detection effect of active probing. In this paper, we propose an optimizational strategy of probe station selection (PSS) by Genetic Algorithm (GA) and achieve the improvement of confirmed achievable rates of probed nodes. Meanwhile, lower runtime cost and more reasonable usage of energy are reached.
{"title":"The strategy of probe station selection of active probing in WSNs","authors":"Hang Zhou, Yang Yang, Xue-song Qiu, Zhipeng Gao","doi":"10.1109/APNOMS.2014.6996549","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996549","url":null,"abstract":"In the management of WSNs, the mechanism of fault detection and location based on active probing has been widely applied. The main optimal direction of active probing is to maximize the coverage of nodes in the network by sending minimal set of probes from probe stations. Therefore, before probing, selecting optimizational station set to improve reachable rates of probed nodes has significant influence on detection effect of active probing. In this paper, we propose an optimizational strategy of probe station selection (PSS) by Genetic Algorithm (GA) and achieve the improvement of confirmed achievable rates of probed nodes. Meanwhile, lower runtime cost and more reasonable usage of energy are reached.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131388195","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 : 2014-12-29DOI: 10.1109/APNOMS.2014.6996595
Chengyuan Wang, Xin Li, Fan Li, Huimei Lu
Vehicular ad hoc network(VANET) is increasingly studied recently due to its promising benefits to the urban life. The roadside unit(RSU) is one of the most important components for VANET. An effective deployment of RSUs will enhance the efficiency of the data delivery in VANET. In this paper, we propose to address the RSU deployment problem by formulating it as a mobility clustering problem. We adopt affinity propagation(AP) algorithm to capture the spatial temporal mobility influence in different time period. The union set of the obtained clustering centers which have the maximum influence to its cluster members is then the solution to RSU deployment. To validate our proposed deployment scheme, we evaluate the performance of the network with the deployed RSUs in terms of delivery ratio, average delay and hop count by adapting the conventional GPSR to VANET as the routing protocol. The simulation results show our proposed approach achieves near optimal solutions with much lower complexity compared to the exhaustive method.
{"title":"A mobility clustering-based roadside units deployment for VANET","authors":"Chengyuan Wang, Xin Li, Fan Li, Huimei Lu","doi":"10.1109/APNOMS.2014.6996595","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996595","url":null,"abstract":"Vehicular ad hoc network(VANET) is increasingly studied recently due to its promising benefits to the urban life. The roadside unit(RSU) is one of the most important components for VANET. An effective deployment of RSUs will enhance the efficiency of the data delivery in VANET. In this paper, we propose to address the RSU deployment problem by formulating it as a mobility clustering problem. We adopt affinity propagation(AP) algorithm to capture the spatial temporal mobility influence in different time period. The union set of the obtained clustering centers which have the maximum influence to its cluster members is then the solution to RSU deployment. To validate our proposed deployment scheme, we evaluate the performance of the network with the deployed RSUs in terms of delivery ratio, average delay and hop count by adapting the conventional GPSR to VANET as the routing protocol. The simulation results show our proposed approach achieves near optimal solutions with much lower complexity compared to the exhaustive method.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132795833","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 ubiquitous stub environments, it is a critical challenge to select an optimal set of devices to accomplish a graph-based ubiquitous service and execute it continuously. The mobility of devices, the diverse access technologies and underlying path quality have a great influence on the user experience. Thus, we put forward a hierarchical model and a novel selection function considering the synergetic effect between devices. Then we elaborate a Synergy-aware Selection Mechanism (SSM) which includes three modules: service launch, device selection and service maintenance. We design a distributed core algorithm to integrate the devices and a dynamic updating weight method. The simulation results show that Synergy-aware Selection Mechanism can select a set of executive devices to ensure the service quality, continuity and smoothness. It improves the performance in the perceived experience and the number of service reelections.
{"title":"Synergy-aware selection mechanism for high quality and sustainability of ubiquitous services","authors":"Xiyue Mao, Lanlan Rui, Shao-Yong Guo, Xue-song Qiu","doi":"10.1109/APNOMS.2014.6996542","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996542","url":null,"abstract":"In ubiquitous stub environments, it is a critical challenge to select an optimal set of devices to accomplish a graph-based ubiquitous service and execute it continuously. The mobility of devices, the diverse access technologies and underlying path quality have a great influence on the user experience. Thus, we put forward a hierarchical model and a novel selection function considering the synergetic effect between devices. Then we elaborate a Synergy-aware Selection Mechanism (SSM) which includes three modules: service launch, device selection and service maintenance. We design a distributed core algorithm to integrate the devices and a dynamic updating weight method. The simulation results show that Synergy-aware Selection Mechanism can select a set of executive devices to ensure the service quality, continuity and smoothness. It improves the performance in the perceived experience and the number of service reelections.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133694987","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 : 2014-12-29DOI: 10.1109/APNOMS.2014.6996568
Ruiyi Wang, Yang Geng, Yifan Ding, Yang Yang, Wenjing Li
In order to assess the quality of experience (QoE) of HTTP video streaming, the model of three levels of quality of service (QoS): network QoS, application QoS and QoE, is employed in this paper. We mainly study the effects of pause position, and therefore propose two new application performance metrics: location of each pause and time interval of pauses. We first focus on the buffer behaviors of the video player, and correlate the application QoS with the network QoS, based on the analytical model and mathematical model. Then the subjective tests and experiments are carried out to assess how application performance metrics affect the QoE, and the Back Propagation Neural Net (BPNN) is established to map the application QoS to the QoE. This paper reveals that the pauses in the front part of the video, as well as the shorter time interval of pauses, have a higher negative effect on QoE of HTTP video streaming.
{"title":"Assessing the quality of experience of HTTP video streaming considering the effects of pause position","authors":"Ruiyi Wang, Yang Geng, Yifan Ding, Yang Yang, Wenjing Li","doi":"10.1109/APNOMS.2014.6996568","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996568","url":null,"abstract":"In order to assess the quality of experience (QoE) of HTTP video streaming, the model of three levels of quality of service (QoS): network QoS, application QoS and QoE, is employed in this paper. We mainly study the effects of pause position, and therefore propose two new application performance metrics: location of each pause and time interval of pauses. We first focus on the buffer behaviors of the video player, and correlate the application QoS with the network QoS, based on the analytical model and mathematical model. Then the subjective tests and experiments are carried out to assess how application performance metrics affect the QoE, and the Back Propagation Neural Net (BPNN) is established to map the application QoS to the QoE. This paper reveals that the pauses in the front part of the video, as well as the shorter time interval of pauses, have a higher negative effect on QoE of HTTP video streaming.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133027224","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 : 2014-12-29DOI: 10.1109/APNOMS.2014.6996556
Masahisa Tamura, Ken Iizawa, M. Maeda, Jun Kato, Tatsuo Kumano, Y. Nomura, T. Ozawa
As the amount of data flowing in the network increases and as the number of applications having complex traffic patterns increases as well, packet data analysis is becoming all the more important for improving the quality of communications and facilitating troubleshooting. In particular, demand for the storage and analysis of individual items of packet data is increasing in addition to analysis based on statistical information to enable a detailed diagnosis of phenomena that have occurred on the network and at terminals. This paper proposes distributed object storage that can achieve both high-throughput storage of packet data and high-speed session searching. Specifically, we propose and evaluate a system for storing small-size data such as packet data with high throughput while deleting old data and conducting searches, and compare the storage performance of the proposed system with that of other distributed storage systems, and present the results of evaluating search performance for typical search patterns.
{"title":"Distributed object storage toward storage and usage of packet data in a high-speed network","authors":"Masahisa Tamura, Ken Iizawa, M. Maeda, Jun Kato, Tatsuo Kumano, Y. Nomura, T. Ozawa","doi":"10.1109/APNOMS.2014.6996556","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996556","url":null,"abstract":"As the amount of data flowing in the network increases and as the number of applications having complex traffic patterns increases as well, packet data analysis is becoming all the more important for improving the quality of communications and facilitating troubleshooting. In particular, demand for the storage and analysis of individual items of packet data is increasing in addition to analysis based on statistical information to enable a detailed diagnosis of phenomena that have occurred on the network and at terminals. This paper proposes distributed object storage that can achieve both high-throughput storage of packet data and high-speed session searching. Specifically, we propose and evaluate a system for storing small-size data such as packet data with high throughput while deleting old data and conducting searches, and compare the storage performance of the proposed system with that of other distributed storage systems, and present the results of evaluating search performance for typical search patterns.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"147 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133818130","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 : 2014-12-29DOI: 10.1109/APNOMS.2014.6996104
Chi-Hua Chen, Ta-Sheng Kuan, Kuen-Rong Lo
The real-time traffic information estimation is an important issue for Intelligent Transportation System (ITS). Compared to traditional methods, the traffic information estimations from cellular network data are readily available, more cost-effective, and easier to deploy and maintain. In this paper, a vehicle speed estimation method is proposed to analyze the voice call signals (i.e., Call Arrival (CA) and Handover (HO)) from cellular networks. Some numerical models are proposed to estimate traffic flow according to HOs and estimate traffic density according to CAs. Then the estimated traffic flow and estimated traffic density are adopted to calculate the estimated vehicle speed. The experimental results show the accuracy of proposed vehicle speed estimation method is 89.75%. Therefore, this method is suitable to be adopted to obtain real-time traffic information for road user.
{"title":"A vehicle speed estimation method based on using voice call signals","authors":"Chi-Hua Chen, Ta-Sheng Kuan, Kuen-Rong Lo","doi":"10.1109/APNOMS.2014.6996104","DOIUrl":"https://doi.org/10.1109/APNOMS.2014.6996104","url":null,"abstract":"The real-time traffic information estimation is an important issue for Intelligent Transportation System (ITS). Compared to traditional methods, the traffic information estimations from cellular network data are readily available, more cost-effective, and easier to deploy and maintain. In this paper, a vehicle speed estimation method is proposed to analyze the voice call signals (i.e., Call Arrival (CA) and Handover (HO)) from cellular networks. Some numerical models are proposed to estimate traffic flow according to HOs and estimate traffic density according to CAs. Then the estimated traffic flow and estimated traffic density are adopted to calculate the estimated vehicle speed. The experimental results show the accuracy of proposed vehicle speed estimation method is 89.75%. Therefore, this method is suitable to be adopted to obtain real-time traffic information for road user.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126544496","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
扫码关注我们
求助内容：
应助结果提醒方式：