Pub Date : 2016-10-01DOI: 10.1109/COMPCOMM.2016.7924661
Kittisak Kerdprasop, Nittaya Kerdprasop
This paper aims to apply statistical and the tree-based data mining techniques to build a model for predicting the movement of Thailand stock price index (SET). Predictors are stock price indexes of Hong Kong Hang Seng (HSI) and Nikkei 225. We also incorporate the index difference from the previous day closing price of HSI and Nikkei as additional predictors. The positive or negative movement of SET compared to the earlier closing index is a binary signal that is constructed and used as a target for our model. The co-movement among SET, HSI, and Nikkei is a short term detection in that it captures intra-day association. The original built model is manipulated to be concise and comprehensible through the application of feature subset selection techniques. We finally obtain a concise tree model to forecast index movement with accuracy as high as 70%.
{"title":"A short term co-movement detection of financial data","authors":"Kittisak Kerdprasop, Nittaya Kerdprasop","doi":"10.1109/COMPCOMM.2016.7924661","DOIUrl":"https://doi.org/10.1109/COMPCOMM.2016.7924661","url":null,"abstract":"This paper aims to apply statistical and the tree-based data mining techniques to build a model for predicting the movement of Thailand stock price index (SET). Predictors are stock price indexes of Hong Kong Hang Seng (HSI) and Nikkei 225. We also incorporate the index difference from the previous day closing price of HSI and Nikkei as additional predictors. The positive or negative movement of SET compared to the earlier closing index is a binary signal that is constructed and used as a target for our model. The co-movement among SET, HSI, and Nikkei is a short term detection in that it captures intra-day association. The original built model is manipulated to be concise and comprehensible through the application of feature subset selection techniques. We finally obtain a concise tree model to forecast index movement with accuracy as high as 70%.","PeriodicalId":210833,"journal":{"name":"2016 2nd IEEE International Conference on Computer and Communications (ICCC)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126078158","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-10-01DOI: 10.1109/COMPCOMM.2016.7924732
Zhang Li, Li Shenming, Shi Daixing, Chengyong Liu
Aiming at how to apply the state feedback predictive control algorithm to track the set value, a new RMPC(Robust Model Predictive Control) is proposed for tracking system. Firstly, the conversion method between the output set value and the corresponding steady target state is given. Then,the Luenberge state observer is designed, which has the stability performance index constraints. The parameters of observer is adjusted until it meets the performance index. Thirdly, the output tracking and predictive control algorithm is designed. Finally, a simulation example shows the feasibility of the proposed method.
{"title":"Target tracking method of Robust Model Predictive Control","authors":"Zhang Li, Li Shenming, Shi Daixing, Chengyong Liu","doi":"10.1109/COMPCOMM.2016.7924732","DOIUrl":"https://doi.org/10.1109/COMPCOMM.2016.7924732","url":null,"abstract":"Aiming at how to apply the state feedback predictive control algorithm to track the set value, a new RMPC(Robust Model Predictive Control) is proposed for tracking system. Firstly, the conversion method between the output set value and the corresponding steady target state is given. Then,the Luenberge state observer is designed, which has the stability performance index constraints. The parameters of observer is adjusted until it meets the performance index. Thirdly, the output tracking and predictive control algorithm is designed. Finally, a simulation example shows the feasibility of the proposed method.","PeriodicalId":210833,"journal":{"name":"2016 2nd IEEE International Conference on Computer and Communications (ICCC)","volume":"605 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123248827","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-10-01DOI: 10.1109/COMPCOMM.2016.7924850
Gongjin Lan, Ziyun Luo, Qi Hao
This paper presents a virtual reality (VR) system for the real-time teleconference. We develop a distributed depth sensors system that can reconstruct 3D images of users, and create a panorama image of the conference room in real time. As a result, users at remote locations can have a teleconference in a virtual environment by wearing VR headsets. The contributions of this work include development of a two-level sensor calibration and data fusion scheme; improvement of image quality through the point-to-mesh conversion; development of a distributed sensing and computing architecture. The developed system is advantageous in low cost, scalability for extension, and high performance in VR reconstruction. The developed system has been validated through a number of experiments.
{"title":"Development of a virtual reality teleconference system using distributed depth sensors","authors":"Gongjin Lan, Ziyun Luo, Qi Hao","doi":"10.1109/COMPCOMM.2016.7924850","DOIUrl":"https://doi.org/10.1109/COMPCOMM.2016.7924850","url":null,"abstract":"This paper presents a virtual reality (VR) system for the real-time teleconference. We develop a distributed depth sensors system that can reconstruct 3D images of users, and create a panorama image of the conference room in real time. As a result, users at remote locations can have a teleconference in a virtual environment by wearing VR headsets. The contributions of this work include development of a two-level sensor calibration and data fusion scheme; improvement of image quality through the point-to-mesh conversion; development of a distributed sensing and computing architecture. The developed system is advantageous in low cost, scalability for extension, and high performance in VR reconstruction. The developed system has been validated through a number of experiments.","PeriodicalId":210833,"journal":{"name":"2016 2nd IEEE International Conference on Computer and Communications (ICCC)","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125274993","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-10-01DOI: 10.1109/COMPCOMM.2016.7925094
Chaoyang Li, Andrew Rosen, A. Bourgeois
Many security and reliability applications require guaranteed k-coverage of an area at all times. As a result, k-coverage has attracted much attention in the past decade, but most of the previous work on k-coverage has focused on traditional scalar sensors instead of camera sensors. Camera sensors qualify as vector sensors because cameras from different positions can form various views of the target. The sensing quality of camera sensors depends on the angle between the facing direction of the target and the viewing direction of the camera. The concept of full-view coverage [1] is of great significance because it ensures both the detection and recognition of a target. A target experiences full-view coverage if, regardless of the direction it faces, it is always in view of a camera. At the same time, the camera's viewing direction should be sufficiently close to the direction the target faces [1]. This research intends to investigate a special case of k-coverage called k-full-view-coverage. This case is where the target is in an over-deployed camera sensor network and k disjoint subsets of cameras are able to provide full-view coverage of the target. The two proposed algorithms aim to k-full-view cover both a single target and a given area based on equilateral triangle displacement.
{"title":"On k-full-view-coverage-algorithms in camera sensor networks","authors":"Chaoyang Li, Andrew Rosen, A. Bourgeois","doi":"10.1109/COMPCOMM.2016.7925094","DOIUrl":"https://doi.org/10.1109/COMPCOMM.2016.7925094","url":null,"abstract":"Many security and reliability applications require guaranteed k-coverage of an area at all times. As a result, k-coverage has attracted much attention in the past decade, but most of the previous work on k-coverage has focused on traditional scalar sensors instead of camera sensors. Camera sensors qualify as vector sensors because cameras from different positions can form various views of the target. The sensing quality of camera sensors depends on the angle between the facing direction of the target and the viewing direction of the camera. The concept of full-view coverage [1] is of great significance because it ensures both the detection and recognition of a target. A target experiences full-view coverage if, regardless of the direction it faces, it is always in view of a camera. At the same time, the camera's viewing direction should be sufficiently close to the direction the target faces [1]. This research intends to investigate a special case of k-coverage called k-full-view-coverage. This case is where the target is in an over-deployed camera sensor network and k disjoint subsets of cameras are able to provide full-view coverage of the target. The two proposed algorithms aim to k-full-view cover both a single target and a given area based on equilateral triangle displacement.","PeriodicalId":210833,"journal":{"name":"2016 2nd IEEE International Conference on Computer and Communications (ICCC)","volume":"78 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114945829","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-10-01DOI: 10.1109/COMPCOMM.2016.7925243
Yanbin Song, Dan Jin, Qiang Zhang, Guangxu Liu
With the wide access of new energy electric power, the development of microgrid system, and business carried out in the demand side management and monitoring of electric information, more complex application systems with different functions keep increasing in the smart distribution network. So, it will be very significant to analysis the communication demands and bandwidth calculation method based on typical business characteristics in distribution network. Meanwhile, classify business data according to distribution network typical business features has some referential significance for improving communication bandwidth scheduling mode and distribution network communication capability.
{"title":"Business communication demands and analysis of bandwidth calculation in distribution network","authors":"Yanbin Song, Dan Jin, Qiang Zhang, Guangxu Liu","doi":"10.1109/COMPCOMM.2016.7925243","DOIUrl":"https://doi.org/10.1109/COMPCOMM.2016.7925243","url":null,"abstract":"With the wide access of new energy electric power, the development of microgrid system, and business carried out in the demand side management and monitoring of electric information, more complex application systems with different functions keep increasing in the smart distribution network. So, it will be very significant to analysis the communication demands and bandwidth calculation method based on typical business characteristics in distribution network. Meanwhile, classify business data according to distribution network typical business features has some referential significance for improving communication bandwidth scheduling mode and distribution network communication capability.","PeriodicalId":210833,"journal":{"name":"2016 2nd IEEE International Conference on Computer and Communications (ICCC)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114947148","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-10-01DOI: 10.1109/COMPCOMM.2016.7925087
Liang Gui-sen, Ren Chen, Dai Bin, Zhu Shun-zhi
In this paper, a novel cross-layer and distance-based broadcasting protocol called as Remediable Broadcasting Protocol (RBP) has been proposed to avoid the Broadcast Storm in Vehicular Ad hoc Network(VANET). In RBP, some potential forwarders greedily contend to retransmit the packets and the protocol elects the forwarders as quickly as possible without considering the redundant retransmission temporarily. When the winner sends the packet successfully, the retransmissions of other candidate forwarders will be cancelled or the packets which send to the sending queue by the candidate forwarders will be deleted to reduce the broadcast redundancy efficiently. Simulation results show that the protocol is better than others in reachability, saved rebroadcast, dissemination rate and single-hop packet reception ratio.
{"title":"A Remediable Broadcasting Protocol for Vehicular Ad hoc Network","authors":"Liang Gui-sen, Ren Chen, Dai Bin, Zhu Shun-zhi","doi":"10.1109/COMPCOMM.2016.7925087","DOIUrl":"https://doi.org/10.1109/COMPCOMM.2016.7925087","url":null,"abstract":"In this paper, a novel cross-layer and distance-based broadcasting protocol called as Remediable Broadcasting Protocol (RBP) has been proposed to avoid the Broadcast Storm in Vehicular Ad hoc Network(VANET). In RBP, some potential forwarders greedily contend to retransmit the packets and the protocol elects the forwarders as quickly as possible without considering the redundant retransmission temporarily. When the winner sends the packet successfully, the retransmissions of other candidate forwarders will be cancelled or the packets which send to the sending queue by the candidate forwarders will be deleted to reduce the broadcast redundancy efficiently. Simulation results show that the protocol is better than others in reachability, saved rebroadcast, dissemination rate and single-hop packet reception ratio.","PeriodicalId":210833,"journal":{"name":"2016 2nd IEEE International Conference on Computer and Communications (ICCC)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115036167","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-10-01DOI: 10.1109/COMPCOMM.2016.7924785
L. Cai, Kang Li, Wang Wei, Han Zhixiong
In the era of digital information, digital orthophoto map (DOM) has been considered as the ideal image background for the GIS database of geographic information, how to produce DOM effectively and accurately is an urgent problem to be solved. Aerial photogrammetry assisted by POS system requires only a small amount of ground control points, it has important significance to improve the production efficiency of DOM and to reduce the cost. In this paper, we take the DOM production of Han Cheng area on a scale of 1∶2000 as an example to introduce the technical process and method of DOM production auxiliary by POS system. Through accuracy analysis, it shows that it can reach the required accuracy requirements only through a small number of ground control points by using POS data.
{"title":"Application of POS technology in fast making DOM from digital aerial images","authors":"L. Cai, Kang Li, Wang Wei, Han Zhixiong","doi":"10.1109/COMPCOMM.2016.7924785","DOIUrl":"https://doi.org/10.1109/COMPCOMM.2016.7924785","url":null,"abstract":"In the era of digital information, digital orthophoto map (DOM) has been considered as the ideal image background for the GIS database of geographic information, how to produce DOM effectively and accurately is an urgent problem to be solved. Aerial photogrammetry assisted by POS system requires only a small amount of ground control points, it has important significance to improve the production efficiency of DOM and to reduce the cost. In this paper, we take the DOM production of Han Cheng area on a scale of 1∶2000 as an example to introduce the technical process and method of DOM production auxiliary by POS system. Through accuracy analysis, it shows that it can reach the required accuracy requirements only through a small number of ground control points by using POS data.","PeriodicalId":210833,"journal":{"name":"2016 2nd IEEE International Conference on Computer and Communications (ICCC)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115560355","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-10-01DOI: 10.1109/COMPCOMM.2016.7925003
H. U. Gul, Y. Kai
This paper presents an alternate recursive state estimator of moving horizon estimation as compared to the conventional state estimator of Kalman filtering. The state estimator estimates the position set, velocity set and attitude data of the dynamic aerial vehicle. In the first scenario, the available data for processing are the measurement set from accelerometers assembly, gyroscope triad, and global positioning system (GPS) from the low cost inertial measuring unit (IMU). The GPS position and GPS velocity measurements are the aiding source as well the comparison reference of the computed solution of the dynamic aerial vehicle (DAV). In the second scenario receding window discrete time state estimator, extended for non-linear vehicle navigation application is implemented using the deterministic cost function of least squares, for integrated filtering. The receding data window approach uses the past measurements samples over the horizon as the tuning parameter of the moving horizon state estimator. The moving horizon state estimator is evaluated offline in the numerical experiment including the flight testing data collected. The flight test on a small aerial vehicle with all the sensors, GPS receiver, power systems instrumented onboard is considered for this paper. Matlab platform is used to simulate the noise environment and implementing the algorithms. This paper designed algorithm results reveals that proposed moving horizon estimator is faster in convergence in the presence of large initialization errors, linearization errors and outliers as compared to the reference filter i.e. EKF tested online and offline.
{"title":"Moving window recursive filtering for integrated navigation performance enhancement","authors":"H. U. Gul, Y. Kai","doi":"10.1109/COMPCOMM.2016.7925003","DOIUrl":"https://doi.org/10.1109/COMPCOMM.2016.7925003","url":null,"abstract":"This paper presents an alternate recursive state estimator of moving horizon estimation as compared to the conventional state estimator of Kalman filtering. The state estimator estimates the position set, velocity set and attitude data of the dynamic aerial vehicle. In the first scenario, the available data for processing are the measurement set from accelerometers assembly, gyroscope triad, and global positioning system (GPS) from the low cost inertial measuring unit (IMU). The GPS position and GPS velocity measurements are the aiding source as well the comparison reference of the computed solution of the dynamic aerial vehicle (DAV). In the second scenario receding window discrete time state estimator, extended for non-linear vehicle navigation application is implemented using the deterministic cost function of least squares, for integrated filtering. The receding data window approach uses the past measurements samples over the horizon as the tuning parameter of the moving horizon state estimator. The moving horizon state estimator is evaluated offline in the numerical experiment including the flight testing data collected. The flight test on a small aerial vehicle with all the sensors, GPS receiver, power systems instrumented onboard is considered for this paper. Matlab platform is used to simulate the noise environment and implementing the algorithms. This paper designed algorithm results reveals that proposed moving horizon estimator is faster in convergence in the presence of large initialization errors, linearization errors and outliers as compared to the reference filter i.e. EKF tested online and offline.","PeriodicalId":210833,"journal":{"name":"2016 2nd IEEE International Conference on Computer and Communications (ICCC)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116427362","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-10-01DOI: 10.1109/COMPCOMM.2016.7924858
Wang Zhi-shan, Li Jie, Feng Chao-kun, Guo Xiao-guang
By researching about PJND (Perceptible Just Noticeable Difference) theory, this paper established an evaluation method of head up display readability based on PJND, combined with the characteristic of head up display. By simulation, this paper got some disciplinary results that how the chromaticity of background, interferences (specular reflection, diffuse reflection and glare) impacts the readability of head up display. Simulation result shows that, the differences between background chromaticity and object chromaticity bigger, head up display needs a lower luminance contrast; when the environment luminance is constant and the interferences increase, we need a bigger luminance contrast to satisfy the readability; when the environment luminance and luminance contrast are all constant, to satisfy the readability, the maximum of the interference is limited.
{"title":"A new method to evaluate the readability of head up display","authors":"Wang Zhi-shan, Li Jie, Feng Chao-kun, Guo Xiao-guang","doi":"10.1109/COMPCOMM.2016.7924858","DOIUrl":"https://doi.org/10.1109/COMPCOMM.2016.7924858","url":null,"abstract":"By researching about PJND (Perceptible Just Noticeable Difference) theory, this paper established an evaluation method of head up display readability based on PJND, combined with the characteristic of head up display. By simulation, this paper got some disciplinary results that how the chromaticity of background, interferences (specular reflection, diffuse reflection and glare) impacts the readability of head up display. Simulation result shows that, the differences between background chromaticity and object chromaticity bigger, head up display needs a lower luminance contrast; when the environment luminance is constant and the interferences increase, we need a bigger luminance contrast to satisfy the readability; when the environment luminance and luminance contrast are all constant, to satisfy the readability, the maximum of the interference is limited.","PeriodicalId":210833,"journal":{"name":"2016 2nd IEEE International Conference on Computer and Communications (ICCC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122834124","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}
Penetration test is one of the most used SQL Injection Vulnerability (SQLIV) testing technology. Focused on the insufficiency of test accuracy problem in SQLIV black-box penetration test process, we discuss the limitation of the traditional approaches based on test case library enumerating methods and propose a SQLIV Penetration Test approach based on Finite State Machine (SPT-FSM). The proposed approach establishes FSM based on the states corresponding to different SQLIV penetration test cases, map the statuses of test cases and their relevant responses, and analyzes the transition regularity of the established FSM for the testing of SQLIV with dynamic nature and states transition characteristics. We conduct experiments about the proposed approach and compare it with a popular state-of-the-art benchmarking tool. The experimental results show that the proposed approach can effectively improve the accuracy of SQLIV penetration test by reducing False Negatives (FN) and False Positives (FP).
{"title":"Exposing SQL Injection Vulnerability through Penetration Test based on Finite State Machine","authors":"Lei Liu, Jing Xu, Chenkai Guo, Jiehui Kang, Sihan Xu, Biao Zhang","doi":"10.1109/COMPCOMM.2016.7924889","DOIUrl":"https://doi.org/10.1109/COMPCOMM.2016.7924889","url":null,"abstract":"Penetration test is one of the most used SQL Injection Vulnerability (SQLIV) testing technology. Focused on the insufficiency of test accuracy problem in SQLIV black-box penetration test process, we discuss the limitation of the traditional approaches based on test case library enumerating methods and propose a SQLIV Penetration Test approach based on Finite State Machine (SPT-FSM). The proposed approach establishes FSM based on the states corresponding to different SQLIV penetration test cases, map the statuses of test cases and their relevant responses, and analyzes the transition regularity of the established FSM for the testing of SQLIV with dynamic nature and states transition characteristics. We conduct experiments about the proposed approach and compare it with a popular state-of-the-art benchmarking tool. The experimental results show that the proposed approach can effectively improve the accuracy of SQLIV penetration test by reducing False Negatives (FN) and False Positives (FP).","PeriodicalId":210833,"journal":{"name":"2016 2nd IEEE International Conference on Computer and Communications (ICCC)","volume":"178 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128416567","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
扫码关注我们
求助内容：
应助结果提醒方式：