Pub Date : 2016-09-01DOI: 10.1109/ICNIDC.2016.7974611
Weibao He, Qianfang Xu, Bo Xiao
Given a network, community detection aims at finding all dense sub-graphs. Removing edges across different communities (border edges) is classic and effective. However, most of existing methods have high computing spends or suffer in the quality of resulting communities. In this paper, we propose a community detection algorithm: Edge Pruning (EP), with the fundamental idea of removing most possible border edges. To find out features of border edges, we first propose a method to measure the interplay between two nodes with a social tie, call Nodes Force Model. Second, since a node is influenced by all its connected nodes (neighbors), we discuss three possible situations of neighbors and compute their influence. Third, we study border edges, and find out their local features. With total influence and local features, we conclude a method to judge border edges. Edge Pruning has two advantages: (1) Detect communities with high quality (2) Low time complexity. Experimental results on real networks and synthetic networks demonstrate that Edge Pruning not only effectively detects communities with high quality, but also runs efficiently.
{"title":"Edge pruning based community detection","authors":"Weibao He, Qianfang Xu, Bo Xiao","doi":"10.1109/ICNIDC.2016.7974611","DOIUrl":"https://doi.org/10.1109/ICNIDC.2016.7974611","url":null,"abstract":"Given a network, community detection aims at finding all dense sub-graphs. Removing edges across different communities (border edges) is classic and effective. However, most of existing methods have high computing spends or suffer in the quality of resulting communities. In this paper, we propose a community detection algorithm: Edge Pruning (EP), with the fundamental idea of removing most possible border edges. To find out features of border edges, we first propose a method to measure the interplay between two nodes with a social tie, call Nodes Force Model. Second, since a node is influenced by all its connected nodes (neighbors), we discuss three possible situations of neighbors and compute their influence. Third, we study border edges, and find out their local features. With total influence and local features, we conclude a method to judge border edges. Edge Pruning has two advantages: (1) Detect communities with high quality (2) Low time complexity. Experimental results on real networks and synthetic networks demonstrate that Edge Pruning not only effectively detects communities with high quality, but also runs efficiently.","PeriodicalId":439987,"journal":{"name":"2016 IEEE International Conference on Network Infrastructure and Digital Content (IC-NIDC)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116412003","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 : 2016-09-01DOI: 10.1109/ICNIDC.2016.7974600
Benle Su, Yumei Wang, Yu Liu
Along with the rapid development of bandwidth and easier access into the Internet, online video traffics have been increasing dramatically and attracting a huge number of customers. Predicting the video popularity is of great importance for various applications, such as precise advertisement delivery, reasonable cache allocation, video recommendation and etc. In this paper, we observe the relationship between video lifetime and video popularity and find that longer lifetime usually means stronger future popularity. So we introduce video lifetime as a coefficient in the popularity prediction model and propose a multi-linear model based on the historical view count, future burst state and video lifetime to predict future video popularity. Our model is validated with the data extracted from Youku, a popular video service provider in China, and it is proved to outperform a state-of-the-art baseline model with a 1.58% reduction of the relative prediction errors.
{"title":"A new popularity prediction model based on lifetime forecast of online videos","authors":"Benle Su, Yumei Wang, Yu Liu","doi":"10.1109/ICNIDC.2016.7974600","DOIUrl":"https://doi.org/10.1109/ICNIDC.2016.7974600","url":null,"abstract":"Along with the rapid development of bandwidth and easier access into the Internet, online video traffics have been increasing dramatically and attracting a huge number of customers. Predicting the video popularity is of great importance for various applications, such as precise advertisement delivery, reasonable cache allocation, video recommendation and etc. In this paper, we observe the relationship between video lifetime and video popularity and find that longer lifetime usually means stronger future popularity. So we introduce video lifetime as a coefficient in the popularity prediction model and propose a multi-linear model based on the historical view count, future burst state and video lifetime to predict future video popularity. Our model is validated with the data extracted from Youku, a popular video service provider in China, and it is proved to outperform a state-of-the-art baseline model with a 1.58% reduction of the relative prediction errors.","PeriodicalId":439987,"journal":{"name":"2016 IEEE International Conference on Network Infrastructure and Digital Content (IC-NIDC)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134506632","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 : 2016-09-01DOI: 10.1109/ICNIDC.2016.7974601
Hai Huang, Bingcai Han
With the development of virtual reality technology, the visualization of electromagnetic environment has become a hot research topic. However, the research on the electromagnetic environment of the polar environment is relatively rare. This paper focuses on 3D visualization of electromagnetic environment in snow and ice environment. Geographical environment is created from DEM data, and Longley-Rice model tuned for ice and snow environment is used to predict the electromagnetic propagation in coverage area. Based on the geographical environment and coverage prediction, a visualization system is established, which could provide a basic reference for the electromagnetic visualization in polar areas.
{"title":"A 3D electromagnetic visualization system in snow and ice environment","authors":"Hai Huang, Bingcai Han","doi":"10.1109/ICNIDC.2016.7974601","DOIUrl":"https://doi.org/10.1109/ICNIDC.2016.7974601","url":null,"abstract":"With the development of virtual reality technology, the visualization of electromagnetic environment has become a hot research topic. However, the research on the electromagnetic environment of the polar environment is relatively rare. This paper focuses on 3D visualization of electromagnetic environment in snow and ice environment. Geographical environment is created from DEM data, and Longley-Rice model tuned for ice and snow environment is used to predict the electromagnetic propagation in coverage area. Based on the geographical environment and coverage prediction, a visualization system is established, which could provide a basic reference for the electromagnetic visualization in polar areas.","PeriodicalId":439987,"journal":{"name":"2016 IEEE International Conference on Network Infrastructure and Digital Content (IC-NIDC)","volume":"287 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133527822","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 : 2016-09-01DOI: 10.1109/ICNIDC.2016.7974590
Zhonghao Lu, Kai Li, Jing Wang, Jingyu Wang, Q. Qi
Nowadays, in order to guarantee both system performance and power efficiency, the resistance of nonlinear distortion produced by power amplifier (PA) has been a key issue in the wireless communication research. The traditional predistortion methods require prior knowledge of the amplitude, phase or bandwidth of the input signal, which is not very practical in the real world. To overcome it, we put forward a framework for compensating a nonlinear memoryless system in a semi-blind way. In this framework, by making use of the feedback branch, a nonlinear equation can be established to describe the input-output relations for the nonlinear system, and the gain of compensator can be iteratively obtained through solving this nonlinear equation with Newton method. Simulations are provided in order to verify the performance of this proposed framework and algorithm, where Saleh model is used as benchmark. Compared with traditional frameworks using the least mean square (LMS) algorithm similarly, our framework can achieve better performance in terms of mean square error (MSE) and latency without compromising the compensation effect.
{"title":"Semi-blind compensation method for addressing memoryless nonlinearities","authors":"Zhonghao Lu, Kai Li, Jing Wang, Jingyu Wang, Q. Qi","doi":"10.1109/ICNIDC.2016.7974590","DOIUrl":"https://doi.org/10.1109/ICNIDC.2016.7974590","url":null,"abstract":"Nowadays, in order to guarantee both system performance and power efficiency, the resistance of nonlinear distortion produced by power amplifier (PA) has been a key issue in the wireless communication research. The traditional predistortion methods require prior knowledge of the amplitude, phase or bandwidth of the input signal, which is not very practical in the real world. To overcome it, we put forward a framework for compensating a nonlinear memoryless system in a semi-blind way. In this framework, by making use of the feedback branch, a nonlinear equation can be established to describe the input-output relations for the nonlinear system, and the gain of compensator can be iteratively obtained through solving this nonlinear equation with Newton method. Simulations are provided in order to verify the performance of this proposed framework and algorithm, where Saleh model is used as benchmark. Compared with traditional frameworks using the least mean square (LMS) algorithm similarly, our framework can achieve better performance in terms of mean square error (MSE) and latency without compromising the compensation effect.","PeriodicalId":439987,"journal":{"name":"2016 IEEE International Conference on Network Infrastructure and Digital Content (IC-NIDC)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116738347","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 : 2016-09-01DOI: 10.1109/ICNIDC.2016.7974584
Gang Liu, Yanyao Bian, Yanqiu Wang
This paper presents a novel humming feature extraction algorithm based on locality statistical analysis to tackle the problem of the instability of humming features in the query by humming (QBH) system. By carrying out statistics to humming notes sequences in both longitudinal vocal range distribution and horizontal temporal variation distribution, we can obtain the locality statistical humming features. And we concatenate several features using the idea of N-gram to improve feature discrimination. In the framework of QBH based on Locality Sensitive Hashing (LSH), the proposed method has achieves 86% top-1 rate and 92% top-5 rate in the experiment, indicating the effectiveness of the method.
{"title":"Humming feature extraction based on locality statistical analysis","authors":"Gang Liu, Yanyao Bian, Yanqiu Wang","doi":"10.1109/ICNIDC.2016.7974584","DOIUrl":"https://doi.org/10.1109/ICNIDC.2016.7974584","url":null,"abstract":"This paper presents a novel humming feature extraction algorithm based on locality statistical analysis to tackle the problem of the instability of humming features in the query by humming (QBH) system. By carrying out statistics to humming notes sequences in both longitudinal vocal range distribution and horizontal temporal variation distribution, we can obtain the locality statistical humming features. And we concatenate several features using the idea of N-gram to improve feature discrimination. In the framework of QBH based on Locality Sensitive Hashing (LSH), the proposed method has achieves 86% top-1 rate and 92% top-5 rate in the experiment, indicating the effectiveness of the method.","PeriodicalId":439987,"journal":{"name":"2016 IEEE International Conference on Network Infrastructure and Digital Content (IC-NIDC)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125601870","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 : 2016-09-01DOI: 10.1109/ICNIDC.2016.7974615
Seunghyun Kim, Joong-Sik Kim, Whoiyul Kim
This paper proposes an algorithm for parking assist system. It detects a parking slot and estimates the pose of the parking slot. User touches the parking slot that wants to park at the display showing rear view. Then, an ROI is set based on the touch point. Parking slot is detected in the ROI using Hough transform. NCC (Normalized Cross Correlation) is used to get the pose of parking slot. It successfully detects parking slot and estimates the pose. But, there is a problem due to the scene change causing variation of parking slot at rear view when vehicle enters the parking slot. To solve this problem, the process of pose estimation is separated into phase 1 and phase 2 according to applied template shape.
{"title":"A method of detecting parking slot in hough space and pose estimation using rear view image for autonomous parking system","authors":"Seunghyun Kim, Joong-Sik Kim, Whoiyul Kim","doi":"10.1109/ICNIDC.2016.7974615","DOIUrl":"https://doi.org/10.1109/ICNIDC.2016.7974615","url":null,"abstract":"This paper proposes an algorithm for parking assist system. It detects a parking slot and estimates the pose of the parking slot. User touches the parking slot that wants to park at the display showing rear view. Then, an ROI is set based on the touch point. Parking slot is detected in the ROI using Hough transform. NCC (Normalized Cross Correlation) is used to get the pose of parking slot. It successfully detects parking slot and estimates the pose. But, there is a problem due to the scene change causing variation of parking slot at rear view when vehicle enters the parking slot. To solve this problem, the process of pose estimation is separated into phase 1 and phase 2 according to applied template shape.","PeriodicalId":439987,"journal":{"name":"2016 IEEE International Conference on Network Infrastructure and Digital Content (IC-NIDC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129587131","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 : 2016-09-01DOI: 10.1109/ICNIDC.2016.7974620
Eun Chong Lee, S. Cho
In this paper, an adaptive thresholding algorithm for detecting multi-human using an impulse radio ultra-wideband (IR-UWB) radar is proposed. The magnitude of the received signal shows trend of decreasing with the increasing number of the people in the interesting area of a radar owing to the scattering by the multi-human. Conventional multi-human detection algorithms do not consider this effect. To detect multi-human more correctly, the threshold should be adjusted by the number of humans. The adaptive thresholding algorithm adjusts the threshold values based on the estimated number of human using the variance of received signal.
{"title":"Performande enhancement of multi-human detection using an IR-UWB radar by an adaptive thresholding algorithm","authors":"Eun Chong Lee, S. Cho","doi":"10.1109/ICNIDC.2016.7974620","DOIUrl":"https://doi.org/10.1109/ICNIDC.2016.7974620","url":null,"abstract":"In this paper, an adaptive thresholding algorithm for detecting multi-human using an impulse radio ultra-wideband (IR-UWB) radar is proposed. The magnitude of the received signal shows trend of decreasing with the increasing number of the people in the interesting area of a radar owing to the scattering by the multi-human. Conventional multi-human detection algorithms do not consider this effect. To detect multi-human more correctly, the threshold should be adjusted by the number of humans. The adaptive thresholding algorithm adjusts the threshold values based on the estimated number of human using the variance of received signal.","PeriodicalId":439987,"journal":{"name":"2016 IEEE International Conference on Network Infrastructure and Digital Content (IC-NIDC)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129797692","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 : 2016-09-01DOI: 10.1109/ICNIDC.2016.7974550
Shucong Jia, Z. Fadlullah, N. Kato, Lin Zhang
After disasters, communication infrastructures in disaster-affected areas may fail due to physical damages or power outages. Unmanned aerial vehicles (UAVs) can act as flying base stations to satisfy the communication requirements of people in disaster-affected areas. For the purpose of increasing the data transmission rate and saving energy consumption of wireless telecommunication terminals (WTs), UAV mobility can be exploited to provide good channel conditions between UAVs and WTs. In this paper, a UAV with path length limitation is considered to provide communication service to WTs in a disaster area, a part of WTs can communicate with the UAV directly, and other WT communication with the UAV indirectly through D2D relay transmissions to reduce the UAV path length. Aiming at decreasing the total energy consumption of WTs, a novel UAV-aided data communicate method, ECO-UDC, is introduced. Extensive simulations demonstrate that ECO-UDC can reduce the energy consumption of WTs by approximately 30%–40% compared to the benchmark method.
{"title":"ECO-UDC: An energy efficient data collection method for disaster area networks","authors":"Shucong Jia, Z. Fadlullah, N. Kato, Lin Zhang","doi":"10.1109/ICNIDC.2016.7974550","DOIUrl":"https://doi.org/10.1109/ICNIDC.2016.7974550","url":null,"abstract":"After disasters, communication infrastructures in disaster-affected areas may fail due to physical damages or power outages. Unmanned aerial vehicles (UAVs) can act as flying base stations to satisfy the communication requirements of people in disaster-affected areas. For the purpose of increasing the data transmission rate and saving energy consumption of wireless telecommunication terminals (WTs), UAV mobility can be exploited to provide good channel conditions between UAVs and WTs. In this paper, a UAV with path length limitation is considered to provide communication service to WTs in a disaster area, a part of WTs can communicate with the UAV directly, and other WT communication with the UAV indirectly through D2D relay transmissions to reduce the UAV path length. Aiming at decreasing the total energy consumption of WTs, a novel UAV-aided data communicate method, ECO-UDC, is introduced. Extensive simulations demonstrate that ECO-UDC can reduce the energy consumption of WTs by approximately 30%–40% compared to the benchmark method.","PeriodicalId":439987,"journal":{"name":"2016 IEEE International Conference on Network Infrastructure and Digital Content (IC-NIDC)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126305532","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 : 2016-09-01DOI: 10.1109/ICNIDC.2016.7974603
Cun Wang, Zhengmin Li, Xiaohong Huang, Pei Zhang
The average path length of the Internet autonomous system (AS) level topology was decreasing slightly in the last decade. Researches had shown that the average AS path length of the Internet was about 3.9 hops until 2012. However this inference was based on BGP routing tables collected from some vantage points that cannot cover the whole Internet. Researchers had also developed different methods to infer AS paths of the Internet, the easiest method considered the shortest paths as AS paths, but the reality is the ASes have self-defined routing policies which lead to a longer path than the shortest path. Other methods improved the inference accuracy. But they were also time consuming and difficult to be used in large scale. To explore the average AS path length of the Internet, we developed a new method to infer AS paths in a comparatively complete AS level topology. The core of this method was a path decision algorithm that simulated the packet transiting process for each AS in the Internet. The inference paths generated from this method were called as decision paths. The experimental results indicated that the decision paths were close to the actual AS paths especially for the path length distribution. At last, we discussed the effect of the incompleteness of peering links in the topology and inferred the average AS path length of the whole Internet using decision paths.
{"title":"Inferring the average as path length of the Internet","authors":"Cun Wang, Zhengmin Li, Xiaohong Huang, Pei Zhang","doi":"10.1109/ICNIDC.2016.7974603","DOIUrl":"https://doi.org/10.1109/ICNIDC.2016.7974603","url":null,"abstract":"The average path length of the Internet autonomous system (AS) level topology was decreasing slightly in the last decade. Researches had shown that the average AS path length of the Internet was about 3.9 hops until 2012. However this inference was based on BGP routing tables collected from some vantage points that cannot cover the whole Internet. Researchers had also developed different methods to infer AS paths of the Internet, the easiest method considered the shortest paths as AS paths, but the reality is the ASes have self-defined routing policies which lead to a longer path than the shortest path. Other methods improved the inference accuracy. But they were also time consuming and difficult to be used in large scale. To explore the average AS path length of the Internet, we developed a new method to infer AS paths in a comparatively complete AS level topology. The core of this method was a path decision algorithm that simulated the packet transiting process for each AS in the Internet. The inference paths generated from this method were called as decision paths. The experimental results indicated that the decision paths were close to the actual AS paths especially for the path length distribution. At last, we discussed the effect of the incompleteness of peering links in the topology and inferred the average AS path length of the whole Internet using decision paths.","PeriodicalId":439987,"journal":{"name":"2016 IEEE International Conference on Network Infrastructure and Digital Content (IC-NIDC)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126428992","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 : 2016-09-01DOI: 10.1109/ICNIDC.2016.7974535
Weicheng Liao, Jun Gu, Xinyu Gu, Di Wu, Cong Guo
In the future Ultra Dense Network (UDN), deploying new small cells within macro cells is a solution to improve the User Data Rate (UDR). How and where to deploy the small cells are the questions network operator is facing. The paper presents strategies based on stochastic geometry and user behavior analysis to solve the problems separately. A smartphone dataset that reflects real-time network conditions is analyzed, based on which a process is conducted and results are demonstrated to give advice for network suppliers.
{"title":"Future network deployment strategy based on user behavior analysis and stochastic geometry","authors":"Weicheng Liao, Jun Gu, Xinyu Gu, Di Wu, Cong Guo","doi":"10.1109/ICNIDC.2016.7974535","DOIUrl":"https://doi.org/10.1109/ICNIDC.2016.7974535","url":null,"abstract":"In the future Ultra Dense Network (UDN), deploying new small cells within macro cells is a solution to improve the User Data Rate (UDR). How and where to deploy the small cells are the questions network operator is facing. The paper presents strategies based on stochastic geometry and user behavior analysis to solve the problems separately. A smartphone dataset that reflects real-time network conditions is analyzed, based on which a process is conducted and results are demonstrated to give advice for network suppliers.","PeriodicalId":439987,"journal":{"name":"2016 IEEE International Conference on Network Infrastructure and Digital Content (IC-NIDC)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121303327","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
扫码关注我们
求助内容：
应助结果提醒方式：