{"title":"Constructing Military Smartphone Usage Criterion of Cloud-DEFSOP for Mobile Security","authors":"Tien-Sheng Lin, I. Lin, Fang-Yie Leu","doi":"10.1109/IMIS.2015.90","DOIUrl":"https://doi.org/10.1109/IMIS.2015.90","url":null,"abstract":"Currently, several cloud security threats on smartphones can be found. They often cause users serious financial loss or bring bad reputation to a company or a institute. To detect malicious behaviors on the smartphones, Taiwan military office sets up a measure on cloud-based instruction detection to prevent mobile devices from possible attacks, for example, phishing and man-in-the-middle attacks. This study designs information security measures which are derived from digital evidence forensics standard operating procedure (DEFSOP) and construct military smartphone usage criterion. In cloud computing, digital forensics on smartphones deals with device-related preservation, identification, collection, record and interpretation of digital evidences. In order to keep the original digital evidences on the smartphone so as to be accepted by court judge, the identification process needs to be legal since the integrity of forensic result will be the major referenced evidences in the court. Basically, the process that we developed in the previous study satisfies the principle of ISO 27001. But our newly developed mobile DEFSOP has met ISO 27037 with IACC principle, including integrity, accuracy, consistency, and compliance.","PeriodicalId":144834,"journal":{"name":"2015 9th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123514075","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":"Security Analysis of Openstack Keystone","authors":"Baojiang Cui, Tao Xi","doi":"10.1109/IMIS.2015.44","DOIUrl":"https://doi.org/10.1109/IMIS.2015.44","url":null,"abstract":"As a base platform of cloud computing, Open Stack's has getting more and more attention. Keystone is the key component of Open Stack, we analyze the security issues of Keystone and find some vulnerabilities of it and then, we propose a new authentication model using both symmetric encryption and asymmetric encryption. Through the security test of new model, it is proved that the new model is much safer than the original one.","PeriodicalId":144834,"journal":{"name":"2015 9th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123120993","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":"NTFS Directory Index Analysis for Computer Forensics","authors":"Gyusang Cho","doi":"10.1109/IMIS.2015.68","DOIUrl":"https://doi.org/10.1109/IMIS.2015.68","url":null,"abstract":"This work provides a forensic analysis method for a directory index in NTFS file system. NTFS employed B-tree indexing for providing efficient storage of many files and fast lookups, which changes in a structure of the directory index when files are operated. As a forensic view point, we observe behaviors of the B-tree to analyze files that once existed in the directory. However, it is difficult to analyze the allocated index entry when the file commands are executed. So, this work treats a forensic method for a directory index, especially when there are a large number of files in the directory. The index entry records are naturally expanded, then we examine how the index entry records are configured in the index tree. And we provide information that how the directory index nodes are changed and how the index entries remain traces in the index entry record with a computer forensic point of view when the files are deleted.","PeriodicalId":144834,"journal":{"name":"2015 9th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117221046","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":"JSON Sensor Signatures (JSS): End-to-End Integrity Protection from Constrained Device to IoT Application","authors":"H. C. Pöhls","doi":"10.1109/IMIS.2015.48","DOIUrl":"https://doi.org/10.1109/IMIS.2015.48","url":null,"abstract":"Integrity of sensor readings or actuator commands is of paramount importance for a secure operation in the Internet-of-Things (IoT). Data from sensors might be stored, forwarded and processed by many different intermediate systems. In this paper we apply digital signatures to achieve end-to-end message level integrity for data in JSON. JSON has become very popular to represent data in the upper layers of the IoT domain. By signing JSON on the constrained device we extend the end-to-end integrity protection starting from the constrained device to any entity in the IoT data-processing chain. Just the JSON message's contents including the enveloped signature and the data must be preserved. We reached our design goal to keep the original data accessible by legacy parsers. Hence, signing does not break parsing. We implemented an elliptic curve based signature algorithm on a class 1 (following RFC 7228) constrained device (Zolertia Z1: 16-bit, MSP 430). Furthermore, we describe the challenges of end-to-end integrity when crossing from IoT to the Web and applications.","PeriodicalId":144834,"journal":{"name":"2015 9th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126662759","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":"The Relationship of Companies Social Connection and SEOs","authors":"Mei-Hua Liao, Li-Wen Chen, Saburo Horimoto","doi":"10.1109/IMIS.2015.81","DOIUrl":"https://doi.org/10.1109/IMIS.2015.81","url":null,"abstract":"This study investigates the relationship between social networks of seasoned equity offerings (SEOs) and the subscription fads of SEOs. The purpose of this study is to identify the following association. The strong connections between SEOs firms and underwriters have more information than others. But the SEOs firms with strong connections have not better long term performance than the others.","PeriodicalId":144834,"journal":{"name":"2015 9th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115354967","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}
Tetsuya Oda, Yi Liu, Keita Matsuo, Shinji Sakamoto, Makoto Ikeda, L. Barolli
{"title":"Experimental Results of a CentOS-Based Ad-Hoc Network Testbed Considering LoS Scenario","authors":"Tetsuya Oda, Yi Liu, Keita Matsuo, Shinji Sakamoto, Makoto Ikeda, L. Barolli","doi":"10.1109/IMIS.2015.6","DOIUrl":"https://doi.org/10.1109/IMIS.2015.6","url":null,"abstract":"In recent years, Ad-hoc Networks have an increased attention on covering rural areas due to the possibility of usage of low-cost and high-performance terminals, without having to depend on the network infrastructure. So routing algorithms are very important for operation of Ad-hoc Networks. In this paper, we present the implementation of a Cent OS-based testbed for Ad-hoc Networks. We analyze the performance of Optimized Link State Routing (OLSR) protocol in an indoor scenario. For evaluation we considered the throughput metric. The experimental results show that the nodes in the testbed were communicating smoothly.","PeriodicalId":144834,"journal":{"name":"2015 9th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130663242","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":"Double K-Folds in SVM","authors":"F. Chang, Hsing-Chung Chen, Hsiang-Chuan Liu","doi":"10.1109/IMIS.2015.59","DOIUrl":"https://doi.org/10.1109/IMIS.2015.59","url":null,"abstract":"In the K-folds cross validation process for Support Vector Machine (SVM) arguments determination, checking data has taken part in the seeking of the arguments values, hence the prediction accuracy tested by checking data is not independent. To avoid this condition, double K-folds are proposed in this study. (K-1)-folds are used for data training for the best SVM arguments determination, and the Kth fold is reserved for data checking. There are 10 data sets are used to check the proposed double K-folds methods. Without doubt, the learning accuracy in K-folds is better than that in double K-folds. However, it indicated that the results of double K-folds are almost as good as those of traditional K-folds.","PeriodicalId":144834,"journal":{"name":"2015 9th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126289306","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":"Towards Energy Efficient Scheduling for Online Tasks in Cloud Data Centers Based on DVFS","authors":"Weicheng Huai, Wei Huang, Shi Jin, Zhuzhong Qian","doi":"10.1109/IMIS.2015.35","DOIUrl":"https://doi.org/10.1109/IMIS.2015.35","url":null,"abstract":"Energy efficient task scheduling is an important issue in cloud data centers. Dynamic Voltage Frequency Scaling (DVFS), which can make the processors work at suitable frequency, is an effective method to achieve power saving since the frequency could be automatically adjusted dynamically. However, the existing DVFS-oriented performance model does not suit many applications' computing paradigm in the cloud data centers. Meanwhile, the existing DVFS-oriented power consumption model have a lack of accuracy, and this situation makes it inefficient to achieve power saving. In this paper, we conduct extensive experiments in a real cluster testbed, and propose new DVFS-oriented performance and power consumption models, while taking into account both the frequency and utilization of the processors. Based on the models, we present a Power-aware Threshold Unit (PTU) algorithm to schedule the online tasks dynamically in cloud data center. The PTU algorithm is based on the fact that data centers are organized by rack-sized unit. The basic idea is to make a trade off between the power consumption and set up time of serves under a designated granularity. To the best of our knowledge, we are the first to propose the new characterization models and problem. We carry out extensive real experiments on a cluster which consists of several multicore servers, and the results show that the new DVFS-oriented performance and power consumption models are accurate. The experiment results show that our PTU algorithm can achieve considerable energy saving.","PeriodicalId":144834,"journal":{"name":"2015 9th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133993588","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":"A New Uighur Automatic Summarization Method","authors":"Xiaodong Yan","doi":"10.1109/IMIS.2015.60","DOIUrl":"https://doi.org/10.1109/IMIS.2015.60","url":null,"abstract":"Research on automatic summarization becomes a hot spot in natural language processing. With the rapid development of the Internet, a lot of Uighur website and communications platform has also been established and improved. Uighur network text increased sharply. How to effectively use the text is face to people. A method for Uighur automatic summarization is proposed in this paper which is based on sub-theme division and weight value is given in it. And by experiments, we find that it can get good precision and recall rates than traditional method on statistics.","PeriodicalId":144834,"journal":{"name":"2015 9th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134052910","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}
Donald Elmazi, Tetsuya Oda, Shinji Sakamoto, Evjola Spaho, L. Barolli, F. Xhafa
{"title":"Friedman Test for Analysing WMNs: A Comparison Study for Genetic Algorithms and Simulated Annealing","authors":"Donald Elmazi, Tetsuya Oda, Shinji Sakamoto, Evjola Spaho, L. Barolli, F. Xhafa","doi":"10.1109/IMIS.2015.28","DOIUrl":"https://doi.org/10.1109/IMIS.2015.28","url":null,"abstract":"In this paper, we deal with connectivity and coverage problem in Wireless Mesh Networks (WMNs). We used Friedman test to check if we can compare Genetic Algorithm (GA) and Simulated Annealing (SA). We found out that GA and SA have differences in their performance. Then, we used the implemented systems WMN-GA and WMN-SA to evaluate and compare the performance of the systems for different distributions of mesh clients in terms of Size of Giant Component (SGC) and Number of Covered Mesh Clients (NCMC). The simulation results show that for Uniform distribution the WMN-SA performs better than WMN-GA. For Normal distribution, for big radius of communication distance, the WMN-GA has the best performance. For Exponential distribution, the WMN-SA performs better than WMN-GA for all communication distances. For Weibull distribution, the WMN-SA has better performance than WMN-GA.","PeriodicalId":144834,"journal":{"name":"2015 9th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing","volume":"259 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132274076","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}