{"title":"A study on trust factors in a multimedia service environment","authors":"S. Moon, Sungkwan Jung, S. Jung","doi":"10.1109/ICOIN.2018.8343086","DOIUrl":"https://doi.org/10.1109/ICOIN.2018.8343086","url":null,"abstract":"As information and communication technologies evolve, it becomes easier to enjoy multimedia content on multimedia service platforms via the web. Interactions between entities on social multimedia service platforms such as YouTube and Facebook “Watch” are different from those on platforms that have been used earlier. A user who exploits the multimedia service platforms can not only consume multimedia content, but also act as a multimedia generator by producing or uploading multimedia content. In the situation, multimedia content that has not been properly validated can be supplied and consumed indiscriminately. Under this circumstance, utilizing the concept of trust can be a good solution to establish a healthy multimedia service environment. In this paper, we suggest considerable trust relationships in a multimedia service environment. For each trust relationship, we propose sets of influential trust factors that can be inferred from data and metadata. To show the possibility of measurement for the influential trust factors, we describe how the data and metadata can be exploited.","PeriodicalId":228799,"journal":{"name":"2018 International Conference on Information Networking (ICOIN)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133186593","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}
Sangmin Lee, Kuyju Kim, Jina Kang, Hyoungshick Kim
{"title":"Bypassing DRM protection in e-book applications on Android","authors":"Sangmin Lee, Kuyju Kim, Jina Kang, Hyoungshick Kim","doi":"10.1109/ICOIN.2018.8343109","DOIUrl":"https://doi.org/10.1109/ICOIN.2018.8343109","url":null,"abstract":"Digital Rights Management (DRM) technologies allow content owners to protect their rights from illegal use of the digital contents (e.g., duplicating electrical resources). DRM technologies have commonly been used in the electronically published books (e-books) industry. In this paper, we introduce a general framework that can bypass the DRM protection deployed on e-book applications on Android. To demonstrate the feasibility of the proposed approach, we applied our approach to three popular e-book DRM applications (Kyobo Book Center, Ridibooks e-book, Interpark e-book) and demonstrated that it is possible to circumvent their DRM protection solutions in a semi-automated way. Also, we recommend several practical ways to develop secure DRM implementations for e-book applications.","PeriodicalId":228799,"journal":{"name":"2018 International Conference on Information Networking (ICOIN)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131768143","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}
N. Didenko, D. Skripnuk, O. Mirolyubova, V. Merkulov, V. Sevashkin, E. Samylovskaya
{"title":"System of econometric equations of the world market of natural gas","authors":"N. Didenko, D. Skripnuk, O. Mirolyubova, V. Merkulov, V. Sevashkin, E. Samylovskaya","doi":"10.1109/ICOIN.2018.8343113","DOIUrl":"https://doi.org/10.1109/ICOIN.2018.8343113","url":null,"abstract":"The article presents the approach to modelling the global natural gas market. As endogenous variables of the model, evaluating the world market, three variables are selected: world exports, world natural gas production, world market natural gas price. As exogenous variables in the model the following are selected: world natural gas imports; world proven natural gas reserves; global demand for natural gas; gas segment employment; global liquefied natural gas prices; the cost of transporting gas; investments in the gas segment; gas production by the OPEC countries. The article proposes the methodology of creating econometric models of the natural gas market and describes the provisions for the modeling procedure. The model of the natural gas market consists of three interdependent econometric equations, each of which is autoregressive distributed lags model (ADL-model). The article presents the structural form of the system of econometric equations in which one equation has more than one endogenous variable. The transition from structural form to reduced form of a system of econometric equations is demonstrated. In the reduced form each equation has only one endogenous variable. The testing of the system of econometric equations is performed. The article presents the solution of the system of econometric equations. The results of the model solution are used to predict world exports, world natural gas production, world market natural gas prices until 2030.","PeriodicalId":228799,"journal":{"name":"2018 International Conference on Information Networking (ICOIN)","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124064161","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}
{"title":"Cognition for enhanced biometrie authentication","authors":"N. Zivic, C. Ruland","doi":"10.1109/ICOIN.2018.8343117","DOIUrl":"https://doi.org/10.1109/ICOIN.2018.8343117","url":null,"abstract":"Enhanced authentication of biometrie images is presented, with additional improved quality of the image in sense of improved error correction. The algorithm is based on the idea on synergic effect of channel coding and cryptographic mechanisms used for authentication, e.g. Message Authentication Codes. The algorithm is not limited on image processing, but used for biometrie authentication as a study case. Simulation results show the measure of a gained image quality.","PeriodicalId":228799,"journal":{"name":"2018 International Conference on Information Networking (ICOIN)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121282275","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}
{"title":"Data compression and prediction using machine learning for industrial IoT","authors":"Jun-Su Park, Hyunjae Park, Young-June Choi","doi":"10.1109/ICOIN.2018.8343232","DOIUrl":"https://doi.org/10.1109/ICOIN.2018.8343232","url":null,"abstract":"Industrial IoT generates big data that is useful for getting insight from data analysis but storing all the data is a burden. To resolve it, we propose to compress the industrial data using neural network regression into a representative vector with lossy compression. For efficiency of the compression, we use the divide-and-conquer method such that the industrial data can be handled by the chunk size of data. Through our experiments, we verify that industrial data is represented by a function and predicted with high accuracy.","PeriodicalId":228799,"journal":{"name":"2018 International Conference on Information Networking (ICOIN)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115825756","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}
Sunjun Hwang, K. Kim, Yejin Kim, Junhui Kim, Mi‐seong Park, Soohyun Park, Joongheon Kim
{"title":"High-dimensional statistical supervised learning for extracting information in steganography","authors":"Sunjun Hwang, K. Kim, Yejin Kim, Junhui Kim, Mi‐seong Park, Soohyun Park, Joongheon Kim","doi":"10.1109/ICOIN.2018.8343252","DOIUrl":"https://doi.org/10.1109/ICOIN.2018.8343252","url":null,"abstract":"One of major research topics in digital steganography is the methods which can avoid information loss while the image files experience distortion. The image distortion may lead to the key value distortion, and eventually, it becomes very hard to get correct information from the distorted images. Therefore, this paper proposes a scheme which encodes and decodes the given images with high-dimensional regression-based supervised learning. With this proposed method, several original messages are embedded in a file; and high-dimensional regression-based supervised learning conducts for extracting exact one final message from the several original messages where every single original message is not same with the final message. In this case, if attackers read some messages from the image, it is hard to extract our final message.","PeriodicalId":228799,"journal":{"name":"2018 International Conference on Information Networking (ICOIN)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128059650","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}
O. Kim, Nguyen H. Tran, Vandung Nguyen, Sun Moo Kang, C. Hong
{"title":"Cooperative between V2C and V2V charging: Less range anxiety and more charged EVs","authors":"O. Kim, Nguyen H. Tran, Vandung Nguyen, Sun Moo Kang, C. Hong","doi":"10.1109/ICOIN.2018.8343205","DOIUrl":"https://doi.org/10.1109/ICOIN.2018.8343205","url":null,"abstract":"Recent years have witnessed a rapidly growth in the number of vehicles on road. It causes environment pollution. Both scientist and companies have paid attention to electric vehicles (EVs) as a clean energy to reduce the oil demands and gas emissions. On the other hand, autonomous electric vehicles have been seen as cutting-edge technology. Self-driving vehicles, and vehicle ride-sharing offered by autonomous EVs are transportation services that have surged quickly. However, use of EVs spread steadily these days because of range anxiety problem and limited charging spots. To overcome these problems, we introduce a novel algorithm for charging problem. Unlike current works, charging strategies are tackled to make the cooperation between V2C and V2V efficiently by proposing an algorithm developed based on the matching theory, then it can offer the sufficient supplier for EVs requested charging service. Simulation results show that the proposed matching based algorithm outperforms the V2C and V2V approaches by 50 % in term of the number of charged EVs. In addition, the range anxiety under our proposal is halved compared with two charging mechanism V2C approach.","PeriodicalId":228799,"journal":{"name":"2018 International Conference on Information Networking (ICOIN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128133251","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}
{"title":"Optimal placement considering interference in multiple ad hoc networks","authors":"Riku Ohmiya, Hiroyasu Obata, T. Murase","doi":"10.1109/ICOIN.2018.8343208","DOIUrl":"https://doi.org/10.1109/ICOIN.2018.8343208","url":null,"abstract":"Densely located multiple ad hoc networks have been not well studied in terms of throughput characteristics or by considering the capture effect or radio interference, which is a function between the distance of networks. A study discussing a very simple two ad hoc network model is evaluated in terms of whether parallel transfers can improve the total throughput. It is expected that more complicated characteristics will appear in more than three multiple interference sources, i.e., more than three ad hoc networks. In this research, we will investigate the throughput characteristics of network locations for three-ad hoc networks. Then, based on this characteristic, we propose and evaluate a heuristic method obtaining the best location where the maximum throughput is achieved, for any number of ad hoc networks. The results show that the proposed method provides a good approximation, with only 4% error from the exact best solution.","PeriodicalId":228799,"journal":{"name":"2018 International Conference on Information Networking (ICOIN)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127113584","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}
{"title":"Application of convolutional neural networks for visibility estimation of CCTV images","authors":"A. Giyenko, A. Palvanov, Younglm Cho","doi":"10.1109/ICOIN.2018.8343247","DOIUrl":"https://doi.org/10.1109/ICOIN.2018.8343247","url":null,"abstract":"In this paper we discuss the possibility of application of a Convolutional Neural Network for visual atmospheric visibility estimation. A system utilizing such a neural network can greatly benefit a smart city by providing real time localized visibility data across all highways and roads by utilizing a dense network of traffic and security cameras that exist in most developed urban areas. To achieve this, we implemented a Convolutional Neural Network with 3 convolution layers and trained it on a data set taken from CCTV cameras in South Korea. This approach allowed us achieve accuracy above 84%. In the paper we describe the network structure and training process, as well as some final thoughts on the next steps in our research.","PeriodicalId":228799,"journal":{"name":"2018 International Conference on Information Networking (ICOIN)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123650180","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}
{"title":"PTDU: Public transit system based framework of data upload in urban crowd sensing","authors":"Zhenlong Peng, Jian An, Xiaolin Gui, Tianjie Wu","doi":"10.1109/ICOIN.2018.8343258","DOIUrl":"https://doi.org/10.1109/ICOIN.2018.8343258","url":null,"abstract":"How to achieve effective data transmission between different participators based on their opportunistic communication is always a hot research topic in Crowd sensing (CS). Public transit system(PTS), as a city infrastructure, has several obvious advantages, such as predictable bus mobility, large coverage area, and stable interaction time to deliver non-real time information. In this paper, we propose a new framework to improve the performance of data delivery by PTS. Firstly, several bus stops are selected to set WIFI access point (AP) according to their coverage utility values. Secondly, the trip prediction tables (TPT) of participators can be established in this framework on the basis of the records collected when the participators get on and off the buses. When a passenger gets on a bus, his probable route can be speculated out based on TPT. Thirdly, before being transferred, every task is marked with a task title, which includes an objective address, data size, and maybe the reward etc. All the potential users can receive the task title and decide whether to participate in the task, and then according to TPT, the best suitable participators can be chosen out to relay the data. At last, we adopt two uploading schemes: Directly Waiting for Upload scheme (DWU) and Prediction and Context based Greedy Uploading scheme (PCGU). The results show that averagely, PCGU consumes 68.5 minutes which is 81% less than the scheduled time, while DWU consumes 49.5 minutes which is 86.3 % less than the scheduled time.","PeriodicalId":228799,"journal":{"name":"2018 International Conference on Information Networking (ICOIN)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122125518","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}