Shang-nan Yin, Ho-Seok Kang, Zhi-Guo Chen, Sung-Ryul Kim
{"title":"A malware detection system based on heterogeneous information network","authors":"Shang-nan Yin, Ho-Seok Kang, Zhi-Guo Chen, Sung-Ryul Kim","doi":"10.1145/3264746.3264784","DOIUrl":"https://doi.org/10.1145/3264746.3264784","url":null,"abstract":"In this era of information networks, more and more malware (malicious software) poses a serious threat to security. How to detect malware attacks in a timely and effective manner becomes particularly important. The increasingly sophisticated malware calls for new defense technologies to detect and combat novelty attack and threats. In this paper, we propose a novel malware detection method that not only depends on API calls, further analyze the relationship between them and creates higher-level semantics to avoid attackers evading detection. We construct a heterogeneous information network (HIN) through their rich relationships between software and related APIs, and then use meta-path-based methods to describe the semantic relevance to software and APIs. We use each meta-path to calculate similarities between software and aggregate different similarities with Multi-kernel Learning (MKL) to construct a malware detection system. We collected real sample data and conducted a comprehensive experiment. Through experiments we have obtained a relatively high detection rate and a relatively low false detection rate, shows the effectiveness of our proposed method.","PeriodicalId":186790,"journal":{"name":"Proceedings of the 2018 Conference on Research in Adaptive and Convergent Systems","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117062391","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}
C. Shih, Chang-Min Yang, Wei-Lun Su, Pei-Kuei Tsung
{"title":"OSAMIC","authors":"C. Shih, Chang-Min Yang, Wei-Lun Su, Pei-Kuei Tsung","doi":"10.1145/3264746.3264755","DOIUrl":"https://doi.org/10.1145/3264746.3264755","url":null,"abstract":"Many embedded real-time systems have dynamic computation workloads to interact with physical processes. Combining imprecise computation and run-time mode change provides both flexible and effective computation outcomes. However, it requires complex schedulability analysis to guarantee its robustness. In this paper, we study the workload and online schedulability analysis for realtime workload for safety critical applications on heterogeneous multi-core platforms. We extend the traditional schedulability analysis and develop a new analysis for the multi-mode systems, called Online Schedulability Analysis of Real-Time Mode Change on Heterogeneous Multi-Core Platforms (OSAMIC). By generalizing the deadline based schedulability analysis, we developed an online sufficient schedulability analysis to reduce the time complexity. Two algorithms are developed to compute the offset to minimize the delay for CPU and GPU workloads. The evaluation results show that the proposed algorithm can shorten the offset up to 82.27% for preemptive workloads and to 339 ms when the task utilization is 0.5 for non-preemptive workloads.","PeriodicalId":186790,"journal":{"name":"Proceedings of the 2018 Conference on Research in Adaptive and Convergent Systems","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115111952","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":"Scheduling algorithms for dynamical real-time tasks on multiprocessor systems","authors":"Chin-Fu Kuo, Yung-Feng Lu","doi":"10.1145/3264746.3264758","DOIUrl":"https://doi.org/10.1145/3264746.3264758","url":null,"abstract":"The purpose of this paper is to study the task scheduling problem of dynamical task sets on the system with DVS multiprocessor. A new task can arrive in the system and the system must do the admission test for the task. If the test is satisfied, the task will be accepted and then it can leave after an interval of execution. In this paper, we propose two kinds of admission control algorithms for the situations when the timing information about the departure time of an executing task is known. The Intuitive Admission Control Algorithm (IACA) is proposed to solve the problem of admission control where the departure time of a task is not known until the end of the active interval for its last job. The Positive Admission Control Algorithm (PACA) for the admission control where the departure time of a task is not known until the execution of its last job is finished. Besides, the related properties are presented and proved. A series of experiments were conducted to evaluate the proposed algorithms. From the experimental results, we can observe that the proposed algorithms with the Best Fit heuristic can reject fewer tasks than that with the First Fit and Worst Fit heuristics. Besides, if the departure time of a task can be known early, the information will be helpful to improve the rejected task numbers.","PeriodicalId":186790,"journal":{"name":"Proceedings of the 2018 Conference on Research in Adaptive and Convergent Systems","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129552956","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 prototype of a self-motion training system based on deep convolutional neural network and multiple FAMirror","authors":"Ki Yeol Baek, In Su Kim, J. Jang, Soon Ki Jung","doi":"10.1145/3264746.3264788","DOIUrl":"https://doi.org/10.1145/3264746.3264788","url":null,"abstract":"With the development of deep learning methods, there has been a significant development in motion and speech recognition technologies, which have become common methods in Human-Computer Interaction (HCI). In addition, a mirror-metaphor is something that can be easily found around us, and it has become one of the displays for augmented reality as it enables participants to observe themselves. This paper proposes a prototype of self-motion training AR system based on these two important aspects. In the self-motion training system, we propose a method to represent one motion as one image. This method enables faster deep learning and motion recognition. For a self-motion training system, there are two essential requirements. One is that the participants should have the ability to observe their motion as well as a reference motion model, and it should be possible to correct their motion by comparing with the reference model. The other requirement is that the system could recognize a participant's motion from among various motion models in a database. Here, we introduce the configuration of a self-motion training system based on AR and its implementation details. In addition, the system examines the accuracy of the participant's motion with a reference motion model.","PeriodicalId":186790,"journal":{"name":"Proceedings of the 2018 Conference on Research in Adaptive and Convergent Systems","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115875845","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 design and development of integrated interface for provision BMC framework","authors":"J. An, Chanyeong Kim, Younghwan Kim","doi":"10.1145/3264746.3264809","DOIUrl":"https://doi.org/10.1145/3264746.3264809","url":null,"abstract":"BMC, which is equipped with a server or general computer, operates for the system management between system management software and hardware platform. The aim of this research is to suggest the integrated interface to enable to customize BMC firmware images when building it as well as accessibility and efficiency of the server control and management. The integrated interface provides an open BMC framework and allow control and management of each server with a single management screen. It also enables to change an approach method per device unit to be flexible to changes in each server environment.","PeriodicalId":186790,"journal":{"name":"Proceedings of the 2018 Conference on Research in Adaptive and Convergent Systems","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128946105","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}
Yongcheon Park, Jeongmin Park, Eunkyong Lee, Kyoungchul Lee, Jiman Hong
{"title":"Deep learning based customer product rating prediction model","authors":"Yongcheon Park, Jeongmin Park, Eunkyong Lee, Kyoungchul Lee, Jiman Hong","doi":"10.1145/3264746.3264814","DOIUrl":"https://doi.org/10.1145/3264746.3264814","url":null,"abstract":"Customers' review data on the items purchased at online shopping malls is actively produced and shared by potential customers in the future. The collected review data is accumulated in text format in the Database, and collective intelligence is used. In this paper, we present a deep learning model that predicts the ratings of customers' products by learning cumulative review data.","PeriodicalId":186790,"journal":{"name":"Proceedings of the 2018 Conference on Research in Adaptive and Convergent Systems","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132726316","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}
J. Mun, Youjeong Jang, Seong‐Ho Son, Hyeun Joong Yoon, John Kim
{"title":"A SSLBP-based feature extraction framework to detect bones from knee MRI scans","authors":"J. Mun, Youjeong Jang, Seong‐Ho Son, Hyeun Joong Yoon, John Kim","doi":"10.1145/3264746.3264778","DOIUrl":"https://doi.org/10.1145/3264746.3264778","url":null,"abstract":"The medical industry is currently working on a fully autonomous surgical system, which is considered a novel modality to go beyond technical limitations of conventional surgery. In order to apply an autonomous surgical system to knees, one of the primarily responsible areas for supporting the total weight of human body, accurate segmentation of bones from knee Magnetic Resonance Imaging (MRI) scans plays a crucial role. In this paper, we propose employing the Scale Space Local Binary Pattern (SSLBP) feature extraction, a variant of local binary pattern extractions, for detecting bones from knee images. The experimental results demonstrate that the proposed method has an average accuracy rate of 96.10% with an average MCC rate of 88.26%, which significantly outperforms existing intensity-based methods such as fuzzy c-means clustering and deep feature extraction method.","PeriodicalId":186790,"journal":{"name":"Proceedings of the 2018 Conference on Research in Adaptive and Convergent Systems","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116787224","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":"On isolation-driven automated module decomposition","authors":"T. Cerný, Filip Sedlisky, M. Donahoo","doi":"10.1145/3264746.3264756","DOIUrl":"https://doi.org/10.1145/3264746.3264756","url":null,"abstract":"Contemporary enterprise systems focus primarily on performance and development/maintenance costs. Dealing with cyber-threats and system compromise is relegated to good coding (i.e., defensive programming) and secure environment (e.g., patched OS, firewalls, etc.). This approach, while a necessary start, is not sufficient. Such security relies on no missteps, and compromise only need a single flaw; consequently, we must design for compromise and mitigate its impact. One approach is to utilize fine-grained modularization and isolation. In such a system, decomposition ensures that compromise of a single module presents limited and known risk to data/resource theft and denial. We propose mechanisms for automating such modular composition and consider its system performance impact.","PeriodicalId":186790,"journal":{"name":"Proceedings of the 2018 Conference on Research in Adaptive and Convergent Systems","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127337857","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":"Timestamp-based hot/cold data identification scheme for solid state drives","authors":"Nguyen-Van Hiep, Jen-Wei Hsieh","doi":"10.1145/3264746.3264790","DOIUrl":"https://doi.org/10.1145/3264746.3264790","url":null,"abstract":"Flash memory is a non-volatile memory that has been widely used as a storage medium for various mobile devices, consumer electronics, and data centers due to its natures of lightweight, high performance, low power consumption, and shock resistance. However, flash memory requires erasing before it can be overwritten. Compared with other operations, the erase operation is the most time-consuming. In addition, flash memory can only endure a limited number of erasures. Out-place-update is adopted to hide the overhead incurred by erase operations. The space occupied by obsolete data are reclaimed during garbage collection. Garbage collection reclaims free space by migrating valid data from the victim block to another free flash block, and then erasing the victim block. To improve the performance of garbage collection and extend the lifetime of the storage device, we propose a new data separation scheme, referred to as the Enhance Dynamic Clustering (EDC) scheme. By this scheme, data are dynamically classified and clustered together according to their data lifetimes. Experiment results showed that the EDC scheme significantly improved the performance of garbage collection, compared with various schemes. The number of erase operations and extra write operations performed during garbage collection could be greatly reduced even under various types of host workloads.","PeriodicalId":186790,"journal":{"name":"Proceedings of the 2018 Conference on Research in Adaptive and Convergent Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130658295","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}
Ji Young Lee, Dongyoun Kim, J. Mun, Seok-Jae Kang, Seong‐Ho Son, Sung Y. Shin
{"title":"Texture weighted fuzzy C-means algorithm for 3D brain MRI segmentation","authors":"Ji Young Lee, Dongyoun Kim, J. Mun, Seok-Jae Kang, Seong‐Ho Son, Sung Y. Shin","doi":"10.1145/3264746.3264777","DOIUrl":"https://doi.org/10.1145/3264746.3264777","url":null,"abstract":"The segmentation of human brain Magnetic Resonance Image (MRI) is an essential component in the computer-aided medical image processing research. Fuzzy C-Means (FCM) algorithm is one of the practical algorithms for brain MRI segmentation. However, Intensity Non-Uniformity (INU) problem in brain MRI is still challenging to existing FCM. In this paper, we propose the Texture weighted FCM (TFCM) algorithm performed with Local Binary Patterns on Three Orthogonal Planes (LBP-TOP). By incorporating texture constraints, TFCM could take into account more global image information. The proposed algorithm is divided into following stages: Volume of Interest (VOI) is extracted by 3D skull stripping in the pre-processing stage. The initial FCM clustering and LBP-TOP feature extraction are performed to extract and classify each cluster's features. At the last stage, FCM with texture constraints refines the result of initial FCM. The proposed algorithm has been implemented to evaluate the performance of segmentation result with Dice's coefficient and Tanimoto coefficient compared with the ground truth. The results show that the proposed algorithm has the better segmentation accuracy than existing FCM models for brain MRI.","PeriodicalId":186790,"journal":{"name":"Proceedings of the 2018 Conference on Research in Adaptive and Convergent Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130791587","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}