Pub Date : 2018-10-01DOI: 10.1109/ICTC.2018.8539508
Yuki Yoshida, Yoshihiro Ito
IoT (Internet of Things) that everything is connected to the Internet and communicates is beginning to spread, and network control is required to respond to the rapid increase in traffic volume by IoT. However, it is difficult to realize such control with only existing protocols, and it takes time and cost to reform the protocol. Therefore, reference [1] suggests using IoT devices as SDN equipment and proposes TCP multi-pathization method with SDN which selects paths based on packet length and traffic volume of each path.On the other hand, due to the upgraded performance of IoT devices, it is expected to use Web services even on IoT devices, and it is conceivable to apply the [1] method to Web services. However, reference [1] does not validate the effectiveness of using Web services. In this paper, we aim to investigate the applicability of [1] method to Web services, and measure and compare the HTTP throughput and the response time by experiment. Experimental results show that this method is suitable for using Web services.
万物互联互通的物联网(Internet of Things)开始普及，需要网络控制来应对物联网带来的流量的快速增长。然而，仅依靠现有协议很难实现这种控制，并且对协议进行改革需要时间和成本。因此文献[1]建议使用物联网设备作为SDN设备，并提出了TCP多路径化方法，通过SDN根据每条路径的数据包长度和流量选择路径。另一方面，由于物联网设备性能的提升，甚至在物联网设备上也有望使用Web服务，可以想象将[1]方法应用于Web服务。但是，参考文献[1]并没有验证使用Web服务的有效性。本文旨在研究[1]方法在Web服务中的适用性，并通过实验对HTTP吞吐量和响应时间进行测量和比较。实验结果表明，该方法适用于Web服务的使用。
{"title":"Application of TCP Multi-Pathization Method with SDN by IoT Devices to Web Service","authors":"Yuki Yoshida, Yoshihiro Ito","doi":"10.1109/ICTC.2018.8539508","DOIUrl":"https://doi.org/10.1109/ICTC.2018.8539508","url":null,"abstract":"IoT (Internet of Things) that everything is connected to the Internet and communicates is beginning to spread, and network control is required to respond to the rapid increase in traffic volume by IoT. However, it is difficult to realize such control with only existing protocols, and it takes time and cost to reform the protocol. Therefore, reference [1] suggests using IoT devices as SDN equipment and proposes TCP multi-pathization method with SDN which selects paths based on packet length and traffic volume of each path.On the other hand, due to the upgraded performance of IoT devices, it is expected to use Web services even on IoT devices, and it is conceivable to apply the [1] method to Web services. However, reference [1] does not validate the effectiveness of using Web services. In this paper, we aim to investigate the applicability of [1] method to Web services, and measure and compare the HTTP throughput and the response time by experiment. Experimental results show that this method is suitable for using Web services.","PeriodicalId":417962,"journal":{"name":"2018 International Conference on Information and Communication Technology Convergence (ICTC)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121368297","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 : 2018-10-01DOI: 10.1109/ICTC.2018.8539694
J. Ko, Kyeongrok Kim, Jae-Hyun Kim
A golf shot pattern analyzer, which can derive a golf ball speed, a launch angle, and a spin, measures parameters using a high frequency radar or a high speed camera. But it is difficult to measure a carry distance of golf ball moving several tens of meters. Therefore, the carry distance of golf ball is calculated by various variables such as an initial velocity of golf ball, a launch angle, a spin rate, etc. In this paper, we calculate the carry distance of golf ball based on an Artificial Neural Network (ANN). The ANN model uses five dependent variables (club speed, attack angle, golf ball speed, launch angle, and spin rate) as input variables. A structure of the ANN model consists of one input layer, four hidden layers, and one output layer. Hidden nodes of the hidden layer are composed of 10, 20, 20, and 20 nodes, respectively. A Root Mean Square Error (RMSE) is used for performance evaluation and the RMSE of the ANN model is 0.8.
{"title":"A Design and Implementaion of Carry Distance Prediction Model using Artificial Neural Network","authors":"J. Ko, Kyeongrok Kim, Jae-Hyun Kim","doi":"10.1109/ICTC.2018.8539694","DOIUrl":"https://doi.org/10.1109/ICTC.2018.8539694","url":null,"abstract":"A golf shot pattern analyzer, which can derive a golf ball speed, a launch angle, and a spin, measures parameters using a high frequency radar or a high speed camera. But it is difficult to measure a carry distance of golf ball moving several tens of meters. Therefore, the carry distance of golf ball is calculated by various variables such as an initial velocity of golf ball, a launch angle, a spin rate, etc. In this paper, we calculate the carry distance of golf ball based on an Artificial Neural Network (ANN). The ANN model uses five dependent variables (club speed, attack angle, golf ball speed, launch angle, and spin rate) as input variables. A structure of the ANN model consists of one input layer, four hidden layers, and one output layer. Hidden nodes of the hidden layer are composed of 10, 20, 20, and 20 nodes, respectively. A Root Mean Square Error (RMSE) is used for performance evaluation and the RMSE of the ANN model is 0.8.","PeriodicalId":417962,"journal":{"name":"2018 International Conference on Information and Communication Technology Convergence (ICTC)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121405904","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 : 2018-10-01DOI: 10.1109/ICTC.2018.8539498
Lakju Sung, Sangmi Noh, D. Cho
As millimeter-wave (mmWave) communication based on massive multiple input multiple output (MIMO) system has promised as a new technology, beamforming techniques are studied actively to overcome high path-loss. Since antenna element patterns and beam patterns are distorted because of mutual coupling between antennas, it is important to consider practical antenna element radiation pattern when beamforming are studied and used to reflect practical environment. By knowing practical antenna element patterns, mutual coupling problems can be solved and beamforming techniques can be studied more flexibly considering practical environments. It is, however, very difficult to measure antenna element patterns because of small peak gain compared to beam gain. Therefore, we propose an antenna element pattern estimation algorithm based on array beam pattern which can be measured relatively easily.
{"title":"Antenna Element Pattern Estimation based on Array Beam Pattern","authors":"Lakju Sung, Sangmi Noh, D. Cho","doi":"10.1109/ICTC.2018.8539498","DOIUrl":"https://doi.org/10.1109/ICTC.2018.8539498","url":null,"abstract":"As millimeter-wave (mmWave) communication based on massive multiple input multiple output (MIMO) system has promised as a new technology, beamforming techniques are studied actively to overcome high path-loss. Since antenna element patterns and beam patterns are distorted because of mutual coupling between antennas, it is important to consider practical antenna element radiation pattern when beamforming are studied and used to reflect practical environment. By knowing practical antenna element patterns, mutual coupling problems can be solved and beamforming techniques can be studied more flexibly considering practical environments. It is, however, very difficult to measure antenna element patterns because of small peak gain compared to beam gain. Therefore, we propose an antenna element pattern estimation algorithm based on array beam pattern which can be measured relatively easily.","PeriodicalId":417962,"journal":{"name":"2018 International Conference on Information and Communication Technology Convergence (ICTC)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121891811","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 : 2018-10-01DOI: 10.1109/ICTC.2018.8539696
Muhammad Hanif, Choonhwa Lee
In the past decade, there has been a boom in the volume of data and in the popularity of cloud applications with industry and academia keenly interested in big data analytics, streaming application, and social networking applications. This led to the emergence of real-time distributed stream processing systems such as Flink, Storm, Dataflow, and Samza. These systems process complex queries on streaming data sets to be distributed across multiple worker nodes in a cluster. Few of them provide adequate supports to adapt the topologies of stream processing tasks to changing input workload. We present an intelligent and efficient topology adjustment scheme which allow Flink framework to refine its topology on the basis of incoming workload. It is designed to increase the overall performance by making the refining of topology robust according to incoming workload streams on the fly, while maintaining SLA constraints. Apache Flink distributed processing engine is used as testbed in the paper. Our preliminary results indicate that the proposed system outperforms the existing default framework.
{"title":"An Efficient Topology Refining Scheme for Apache Flink","authors":"Muhammad Hanif, Choonhwa Lee","doi":"10.1109/ICTC.2018.8539696","DOIUrl":"https://doi.org/10.1109/ICTC.2018.8539696","url":null,"abstract":"In the past decade, there has been a boom in the volume of data and in the popularity of cloud applications with industry and academia keenly interested in big data analytics, streaming application, and social networking applications. This led to the emergence of real-time distributed stream processing systems such as Flink, Storm, Dataflow, and Samza. These systems process complex queries on streaming data sets to be distributed across multiple worker nodes in a cluster. Few of them provide adequate supports to adapt the topologies of stream processing tasks to changing input workload. We present an intelligent and efficient topology adjustment scheme which allow Flink framework to refine its topology on the basis of incoming workload. It is designed to increase the overall performance by making the refining of topology robust according to incoming workload streams on the fly, while maintaining SLA constraints. Apache Flink distributed processing engine is used as testbed in the paper. Our preliminary results indicate that the proposed system outperforms the existing default framework.","PeriodicalId":417962,"journal":{"name":"2018 International Conference on Information and Communication Technology Convergence (ICTC)","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120893478","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 : 2018-10-01DOI: 10.1109/ICTC.2018.8539628
Seong-Ho Park, I. Jung, Hyun-Chool Shin
We analyzed the electroencephalogram (EEG) spectral distribution during anesthesia. Especially, the spectral characteristics of alpha band(8~12Hz) at the frontal head were investigated. Using skewness and kurtosis, the asymmetry of spectral distribution was quantified. A set of EEG data from 10 subjects was obtained during general anesthesia with Propofol (dose rate of 12mg/kg/h). We observed distinct changes in spatial distribution of EEG spectrum near loss and recovery of consciousness. Also, spectral asymmetry was quantitatively measured in terms of skewness and kurtosis. These findings can be used for developing measures of the depth of anesthesia.
{"title":"Spectral asymmetry of EEG signals in transition from conscious to unconscious state","authors":"Seong-Ho Park, I. Jung, Hyun-Chool Shin","doi":"10.1109/ICTC.2018.8539628","DOIUrl":"https://doi.org/10.1109/ICTC.2018.8539628","url":null,"abstract":"We analyzed the electroencephalogram (EEG) spectral distribution during anesthesia. Especially, the spectral characteristics of alpha band(8~12Hz) at the frontal head were investigated. Using skewness and kurtosis, the asymmetry of spectral distribution was quantified. A set of EEG data from 10 subjects was obtained during general anesthesia with Propofol (dose rate of 12mg/kg/h). We observed distinct changes in spatial distribution of EEG spectrum near loss and recovery of consciousness. Also, spectral asymmetry was quantitatively measured in terms of skewness and kurtosis. These findings can be used for developing measures of the depth of anesthesia.","PeriodicalId":417962,"journal":{"name":"2018 International Conference on Information and Communication Technology Convergence (ICTC)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124079244","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 : 2018-10-01DOI: 10.1109/ICTC.2018.8539680
Jongsung Kim, Myung-Gyu Kim
In this paper, an cost-effective, highly accurate 3D articulated human motion analysis system is proposed. In the proposed system, a single low-cost RGB-D sensor captures a color image and depth one of human motion. Then, a deep learning-based 2D motion analysis process accurately estimates intermediate 2D articulated human motion from the color image. Finally, a color-to-depth warping-based 3D motion transform process effectively compute final 3D articulated human motion from the depth image. The proposed system is cost-effective but highly accurate. Experimental results show that the proposed system outperforms the commercial system using the same RGB-D sensor when compared in terms of accuracy.
{"title":"3D Articulated Human Motion Analysis System Using a Single Low-Cost RGB-D Sensor","authors":"Jongsung Kim, Myung-Gyu Kim","doi":"10.1109/ICTC.2018.8539680","DOIUrl":"https://doi.org/10.1109/ICTC.2018.8539680","url":null,"abstract":"In this paper, an cost-effective, highly accurate 3D articulated human motion analysis system is proposed. In the proposed system, a single low-cost RGB-D sensor captures a color image and depth one of human motion. Then, a deep learning-based 2D motion analysis process accurately estimates intermediate 2D articulated human motion from the color image. Finally, a color-to-depth warping-based 3D motion transform process effectively compute final 3D articulated human motion from the depth image. The proposed system is cost-effective but highly accurate. Experimental results show that the proposed system outperforms the commercial system using the same RGB-D sensor when compared in terms of accuracy.","PeriodicalId":417962,"journal":{"name":"2018 International Conference on Information and Communication Technology Convergence (ICTC)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124144633","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 : 2018-10-01DOI: 10.1109/ICTC.2018.8539655
Jung-Bin Kim, C. Sin
This paper investigates the impact of mutual coupling (MC) on the performance of direction of arrival (DoA) estimation based on multiple signal classification (MUSIC) algorithm with uniform linear array (ULA). Among various schemes for compensating MC, two widely used ones are compared in the sense of root mean squire error (RMSE); The one is estimating the mutual coupling coefficients and the other is ignoring boundary antennas of ULA. It is shown that the former one is superior to the later in low signal-to-noise ratio (SNR) regimes and/or a number of samples is small, but vice versa as SNR and/or the number of samples increase.
{"title":"Impact of Mutual Coupling on Performance of DoA Estimation using MUSIC","authors":"Jung-Bin Kim, C. Sin","doi":"10.1109/ICTC.2018.8539655","DOIUrl":"https://doi.org/10.1109/ICTC.2018.8539655","url":null,"abstract":"This paper investigates the impact of mutual coupling (MC) on the performance of direction of arrival (DoA) estimation based on multiple signal classification (MUSIC) algorithm with uniform linear array (ULA). Among various schemes for compensating MC, two widely used ones are compared in the sense of root mean squire error (RMSE); The one is estimating the mutual coupling coefficients and the other is ignoring boundary antennas of ULA. It is shown that the former one is superior to the later in low signal-to-noise ratio (SNR) regimes and/or a number of samples is small, but vice versa as SNR and/or the number of samples increase.","PeriodicalId":417962,"journal":{"name":"2018 International Conference on Information and Communication Technology Convergence (ICTC)","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122653317","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 : 2018-10-01DOI: 10.1109/ICTC.2018.8539601
HyunYong Lee, Byung-Tak Lee
For stable and successful use of grid-connected PV (photovoltaic) plants, it is quite necessary to know the expected power from PV plants in advance. However, forecasting PV output power accurately is difficult in practical cases where uncertainties are unavoidable. In this paper, we propose a confidence-aware forecasting system that produces a point forecast together with its confidence information. Our system classifies forecast outputs into confident forecasts and non-confident forecasts using the confidence information. Then, the confident forecast is used directly and the non-confident forecast is replaced by its lower bound, which is desirable for conservative scheduling of existing power plants. Through the experiments, we show that MAPE (maximum absolute percentage error) of the confident forecasts and the non-confident forecasts are 9.8% and 21.5%, respectively. We also show that the lower bound is lower than actual value in over 95% of the non-confident forecasts. The results show that our approach is good to classify forecasts into confident forecasts and non-confident forecasts and to produce effective lower bounds.
{"title":"Bayesian Deep Learning-based Confidence-aware Solar Irradiance Forecasting System","authors":"HyunYong Lee, Byung-Tak Lee","doi":"10.1109/ICTC.2018.8539601","DOIUrl":"https://doi.org/10.1109/ICTC.2018.8539601","url":null,"abstract":"For stable and successful use of grid-connected PV (photovoltaic) plants, it is quite necessary to know the expected power from PV plants in advance. However, forecasting PV output power accurately is difficult in practical cases where uncertainties are unavoidable. In this paper, we propose a confidence-aware forecasting system that produces a point forecast together with its confidence information. Our system classifies forecast outputs into confident forecasts and non-confident forecasts using the confidence information. Then, the confident forecast is used directly and the non-confident forecast is replaced by its lower bound, which is desirable for conservative scheduling of existing power plants. Through the experiments, we show that MAPE (maximum absolute percentage error) of the confident forecasts and the non-confident forecasts are 9.8% and 21.5%, respectively. We also show that the lower bound is lower than actual value in over 95% of the non-confident forecasts. The results show that our approach is good to classify forecasts into confident forecasts and non-confident forecasts and to produce effective lower bounds.","PeriodicalId":417962,"journal":{"name":"2018 International Conference on Information and Communication Technology Convergence (ICTC)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128399783","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 : 2018-10-01DOI: 10.1109/ICTC.2018.8539491
Zhilin Fu, Satya Chan, Sooyoung Kim
In this paper, we propose a complexity reduced soft interference cancellation minimum mean squared error (SIC-MMSE) detection scheme for coded massive MIMO systems. The presented method works efficiently when the channel matrix becomes asymptotically orthogonal with a sufficiently large number of receive antennas at the base station. With such a characteristic, the conventional SIC-MMSE detection method can be simplified to a layer independent matrix inversion process, and further complexity reduction is achieved by introducing the Neumann series expansion (NSE) method. The simulation results investigated in this paper reveal that the proposed method can efficiently reduce the complexity without appreciable performance degradation.
{"title":"Efficient SIC-MMSE Detection Using Neumann Series Expansion","authors":"Zhilin Fu, Satya Chan, Sooyoung Kim","doi":"10.1109/ICTC.2018.8539491","DOIUrl":"https://doi.org/10.1109/ICTC.2018.8539491","url":null,"abstract":"In this paper, we propose a complexity reduced soft interference cancellation minimum mean squared error (SIC-MMSE) detection scheme for coded massive MIMO systems. The presented method works efficiently when the channel matrix becomes asymptotically orthogonal with a sufficiently large number of receive antennas at the base station. With such a characteristic, the conventional SIC-MMSE detection method can be simplified to a layer independent matrix inversion process, and further complexity reduction is achieved by introducing the Neumann series expansion (NSE) method. The simulation results investigated in this paper reveal that the proposed method can efficiently reduce the complexity without appreciable performance degradation.","PeriodicalId":417962,"journal":{"name":"2018 International Conference on Information and Communication Technology Convergence (ICTC)","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128587572","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 : 2018-10-01DOI: 10.1109/ICTC.2018.8539438
Sooyoung Jang, Mikyong Han
The needs for training agent with high dimensional continuous action spaces will increase as the robot hardware such as robotic arms and humanoid robots are becoming more and more sophisticated. However, it is difficult and time-consuming task. To tackle the problem, we combine reward shaping and curriculum learning. More specifically, the rewards are provided to the agent for every step it takes and the difficulty of the problem gradually increases depending on the agent learning. Both reward function and curriculum are designed to make the agent achieve its objective. The simulation results demonstrate that the proposed scheme outperforms the comparisons.
{"title":"Combining Reward Shaping and Curriculum Learning for Training Agents with High Dimensional Continuous Action Spaces","authors":"Sooyoung Jang, Mikyong Han","doi":"10.1109/ICTC.2018.8539438","DOIUrl":"https://doi.org/10.1109/ICTC.2018.8539438","url":null,"abstract":"The needs for training agent with high dimensional continuous action spaces will increase as the robot hardware such as robotic arms and humanoid robots are becoming more and more sophisticated. However, it is difficult and time-consuming task. To tackle the problem, we combine reward shaping and curriculum learning. More specifically, the rewards are provided to the agent for every step it takes and the difficulty of the problem gradually increases depending on the agent learning. Both reward function and curriculum are designed to make the agent achieve its objective. The simulation results demonstrate that the proposed scheme outperforms the comparisons.","PeriodicalId":417962,"journal":{"name":"2018 International Conference on Information and Communication Technology Convergence (ICTC)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129424256","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
扫码关注我们
求助内容：
应助结果提醒方式：