{"title":"Malware classification using byte sequence information","authors":"Byungho Jung, Taeguen Kim, E. Im","doi":"10.1145/3264746.3264775","DOIUrl":"https://doi.org/10.1145/3264746.3264775","url":null,"abstract":"The number of new malware and new malware variants have been increasing continuously. Security experts analyze malware to capture the malicious properties of malware and to generate signatures or detection rules, but the analysis overheads keep increasing with the increasing number of malware. To analyze a large amount of malware, various kinds of automatic analysis methods are in need. Recently, deep learning techniques such as convolutional neural network (CNN) and recurrent neural network (RNN) have been applied for malware classifications. The features used in the previous approches are mostly based on API (Application Programming Interface) information, and the API invocation information can be obtained through dynamic analysis. However, the invocation information may not reflect malicious behaviors of malware because malware developers use various analysis avoidance techniques. Therefore, deep learning-based malware analysis using other features still need to be developed to improve malware analysis performance. In this paper, we propose a malware classification method using the deep learning algorithm based on byte information. Our proposed method uses images generated from malware byte information that can reflect malware behavioral context, and the convolutional neural network-based sentence analysis is used to process the generated images. We performed several experiments to show the effecitveness of our proposed method, and the experimental results show that our method showed higher accuracy than the naive CNN model, and the detection accuracy was about 99%.","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":"132138664","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}
Shih-Kai Lin, Ding-Yong Hong, Sheng-Yu Fu, Jan-Jan Wu, W. Hsu
{"title":"Dynamic tuning of applications using restricted transactional memory","authors":"Shih-Kai Lin, Ding-Yong Hong, Sheng-Yu Fu, Jan-Jan Wu, W. Hsu","doi":"10.1145/3264746.3264789","DOIUrl":"https://doi.org/10.1145/3264746.3264789","url":null,"abstract":"Transactional Synchronization Extensions (TSX) support for hardware Transactional Memory (TM) on Intel 4th generation Core processors. Two programming interfaces, Hardware Lock Elision (HLE) and Restricted Transactional Memory (RTM), are provided to support software development using TSX. HLE is easy to use and maintains backward compatible with processors without TSX support while RTM is more flexible and scalable. Previous researches have shown that critical sections protected by RTM with a well-designed retry mechanism as its fallback code path can often achieve better performance than HLE. More parallel programs may be programmed in HLE, however, using RTM may obtain greater performance. To embrace both productivity and high performance of parallel program with TSX, we present a framework built on QEMU that can dynamically transform HLE instructions in an application binary to fragments of RTM codes with adaptive tuning on the fly. Compared to HLE execution, our prototype achieves 1.56x speedup with 8 threads on average. Due to the scalability of RTM, the speedup will be more significant as the number of threads increases.","PeriodicalId":186790,"journal":{"name":"Proceedings of the 2018 Conference on Research in Adaptive and Convergent Systems","volume":"9 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":"127949073","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":"Aspect oriented context-aware and event-driven data processing for internet of things","authors":"Michal Trnka, J. Svacina, T. Cerný, Eunjee Song","doi":"10.1145/3264746.3264761","DOIUrl":"https://doi.org/10.1145/3264746.3264761","url":null,"abstract":"The Internet of Things is currently getting significant interest from the scientific community. Academia and industry are both focused on moving ahead in attempts to put Internet of Things in practical use. Sensors and other devices in the Internet of Things networks generate tremendous amounts of data. Most of the times those data carry some contextual information and thus could be used for context-aware application. However, handling the vast amount of data becomes increasingly demanding task. In this article we propose event-driven solution for context-aware applications. In our method events are generated by Internet of Things devices and further propagated to subscribed actions. It support event filtering based on the data the event carries with him, like temperature or location. We demonstrate feasibility of our solution and compare it with traditional approach.","PeriodicalId":186790,"journal":{"name":"Proceedings of the 2018 Conference on Research in Adaptive and Convergent Systems","volume":"31 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":"125154707","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}
Pei-Jen Wang, C. Liu, Chia-Heng Tu, Chen-Pang Lee, Shih-Hao Hung
{"title":"Acceleration of Monte-Carlo simulation on high performance computing platforms","authors":"Pei-Jen Wang, C. Liu, Chia-Heng Tu, Chen-Pang Lee, Shih-Hao Hung","doi":"10.1145/3264746.3264765","DOIUrl":"https://doi.org/10.1145/3264746.3264765","url":null,"abstract":"Monte Carlo methods are often used to solve computational problems with randomness. The random sampling helps avoid the deterministic results, but it requires intensive computations to obtain the results. Several attempts have been made to boost the performance of the Monte Carlo based algorithms by taking advantage of the parallel computers. In this paper, we use the photonic simulation application, MCML, as a case study to 1) parallelize the Monte Carlo method with OpenMP and vectorization, 2) compare the parallelization techniques, and 3) evaluate the parallelized programs on the platforms with the Xeon Phi processor. In particular, the OpenMP version incorporates the vectorization technique that utilizes the AVX-512 vector instructions on the Xeon Phi processor. Our experimental results show that the OpenMP code achieves up to 345x speedup on the Xeon Phi processor, compared with the original code runs on the Xeon E5 processor.","PeriodicalId":186790,"journal":{"name":"Proceedings of the 2018 Conference on Research in Adaptive and Convergent Systems","volume":"34 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":"116278699","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}
Mohammad Baniata, Hyunho Ji, Yongmin Kim, Jeongwoo Choi, Jiman Hong
{"title":"Energy-balancing unequal concentric chain clustering (MIMO-UCC) protocol for IoT system in 5G environment","authors":"Mohammad Baniata, Hyunho Ji, Yongmin Kim, Jeongwoo Choi, Jiman Hong","doi":"10.1145/3264746.3264747","DOIUrl":"https://doi.org/10.1145/3264746.3264747","url":null,"abstract":"To improve people life quality or experience, recently the concept of IoT technology has been introduced with a higher degree of variability in term communication capability and applied applications comparing with WSN. The devices in such kind of technology are implanted with multiple radio access interfaces, usually indicated as Multiple-In and Multiple-Out (MIMO) in 5G networks. With the propagation of MIMO service in IoT machines, clustering technique for IoT systems is required to achieve energy efficiency. In this paper, we propose a novel centralized Energy -Balancing Unequal Concentric Chain Clustering (MIMO-UCC) protocol for the IoT system in the context of the 5G environment. Which has a probability-based suboptimal multi-hop path selection algorithm to reduce the burden on the cluster head and adjusting the cluster-head diameter based on the energy level and the distance to the base station. MIMO-UCC use principal vector projection approach, which considers the location of the base station to build an unequal concentric chain clustering.","PeriodicalId":186790,"journal":{"name":"Proceedings of the 2018 Conference on Research in Adaptive and Convergent Systems","volume":"23 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":"125652541","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}
Ahyoung Lee, Pu Wang, Shih-Chun Lin, I. Akyildiz, Min Luo
{"title":"Dynamic bandwidth allocation in SDN based next generation virtual networks: a deterministic network calculus approach","authors":"Ahyoung Lee, Pu Wang, Shih-Chun Lin, I. Akyildiz, Min Luo","doi":"10.1145/3264746.3264754","DOIUrl":"https://doi.org/10.1145/3264746.3264754","url":null,"abstract":"Software-defined networking (SDN), recognized as next-generation paradigm, decouples the network control plane from the data forwarding plane for a logically centralized controller, allowing rapid networking technology innovations to serve great varieties of users' applications. SDN empowers the evolution of Internet with Open-Flow (OF) and taking advantages of Network Virtualization (NV) to provide efficient service slicing strategies. One of key research issues in both SDN and NV environments is a lack of resource scheduling mechanisms in the physical infrastructure. The resource scheduling mechanisms should be highly capable of ensuring network stability to add further benefits to SDN based next generation virtual networks. We propose a service discipline of dynamic bandwidth scheduling (DBS) within OF switches that dynamically allocates data rates to flows regarding QoS and flow dynamics. Furthermore, we formulate a coherent analysis framework of scheduling disciplines as a mathematical model based on the deterministic network calculus to provide a fast characterization of deterministic service guarantees in SDN. Finally, simulations validate derived theoretical bounds from the analysis framework and confirm that the DBS discipline guarantees QoS of all flows through dynamic bandwidth allocation and ensures an efficient allocation of system bandwidth.","PeriodicalId":186790,"journal":{"name":"Proceedings of the 2018 Conference on Research in Adaptive and Convergent Systems","volume":"42 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":"129920915","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 center traffic scheduling with hot-cold link detection capabilities","authors":"A. Yazidi, Hussein Abdi, Boning Feng","doi":"10.1145/3264746.3264797","DOIUrl":"https://doi.org/10.1145/3264746.3264797","url":null,"abstract":"Software-Defined Networking (SDN) has been one of the most discussed areas in computer networking over the last years. The field has raised an extensive amount of research, and led to a transformation of traditional network architectures. The architecture of SDN enables the separation of the control and data planes and centralizes the network intelligence. Today's data center networks are clusters of thousands of machines. The most used routing protocol in Data centers is Equal-Cost Multi-Path Protocol (ECMP) which relies on a per-flow static hashing that is known to cause bandwidth loss because of long term collisions. In this paper, a traffic engineering approach built on the concept of SDN is presented that aims to enhance the least-loaded link routing mechanism with intelligent monitoring capabilities. In this perspective, we introduce Hot and Cold link detection (HCLD) mechanism. Our HCLD permits to dynamically re-route heavy flows from heavily utilized links (Hot links) while attracting more flows to lowly utilized links (Cold links). Comprehensive experimental results show that the devised flow scheduling solution outperforms the widely used ECMP. Results also demonstrate that dynamic monitoring of traffic statistics could be used to better utilize the total available bandwidth of the network in a reactive manner.","PeriodicalId":186790,"journal":{"name":"Proceedings of the 2018 Conference on Research in Adaptive and Convergent Systems","volume":"30 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":"127127869","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":"Travel planning problem considering site selection and itinerary making","authors":"Du Jiaoman, Li Lei, Li Xiang","doi":"10.1145/3264746.3264781","DOIUrl":"https://doi.org/10.1145/3264746.3264781","url":null,"abstract":"Tourism development has become indispensable activity for people's daily life, especially self-driving travel. We study destination choice and itinerary problem for self-driving travel planning. A fuzzy analytic hierarchy process (FAHP) is utilized to solve the destination choice problem. Then, according to the priority of travel destination schemes, we formulate the model of self-driving itinerary arrangement problem to determine the itinerary by quantitative criteria. This proposed problem can not only determine travel destination scheme, hotel choice, tour and resting break time, but also discuss the effect of differ resting break time on cost and time. Then, tourists can choose the travel planning according to their taste. A dynamic programming integrated with an efficient constraint inspection procedure is presented. To illustrate the practicability and validity through the use of our methodology, we present results from numerical experiments based on networks of the sites of Japan. The results show that the design of travel planning is applicable and effective.","PeriodicalId":186790,"journal":{"name":"Proceedings of the 2018 Conference on Research in Adaptive and Convergent Systems","volume":"51 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":"116771555","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}
Mohammad Masum, S. Kosaraju, Tanju Bayramoglu, Girish Modgil, Mingon Kang
{"title":"Automatic knowledge extraction from OCR documents using hierarchical document analysis","authors":"Mohammad Masum, S. Kosaraju, Tanju Bayramoglu, Girish Modgil, Mingon Kang","doi":"10.1145/3264746.3264793","DOIUrl":"https://doi.org/10.1145/3264746.3264793","url":null,"abstract":"Industries can improve their business efficiency by analyzing and extracting relevant knowledge from large numbers of documents. Knowledge extraction manually from large volume of documents is labor intensive, unscalable and challenging. Consequently there have been a number of attempts to develop intelligent systems to automatically extract relevant knowledge from OCR documents. Moreover, the automatic system can improve the capability of search engine by providing application-specific domain knowledge. However, extracting the efficient information from OCR documents is challenging due to highly unstructured format [1, 11, 18, 26]. In this paper, we propose an efficient framework for a knowledge extraction system that takes keywords based queries and automatically extracts their most relevant knowledge from OCR documents by using text mining techniques. The framework can provide relevance ranking of knowledge to a given query. We tested the proposed framework on corpus of documents at GE Power where document consists of more than hundred pages in PDF.","PeriodicalId":186790,"journal":{"name":"Proceedings of the 2018 Conference on Research in Adaptive and Convergent Systems","volume":"102 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":"132017995","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":"Efficient synthetic light field generation using adaptive multi-level rendering","authors":"Liang-Chi Tseng, W. Hsu","doi":"10.1145/3264746.3264759","DOIUrl":"https://doi.org/10.1145/3264746.3264759","url":null,"abstract":"Real-time global illumination rendering is very desirable for emerging applications such as Virtual Reality (VR) and Augmented Reality (AR). However, client devices have difficulties to support photorealistic rendering, such as Ray-Tracing, due to insufficient computing resources. Many modern frameworks adopted Light Field rendering to support device displaying. A Light Field can be pre-computed and store in cloud. During runtime, the display extracts the colors from the Light Field to generate arbitrary real time viewpoints or re-focusing within a predefined area. To efficiently compute the Light Field, We have combined DIBR (Depth-Image-Based-Rendering) and traditional ray-tracing in an adaptive fashion to synthesize images. By measuring the color errors during runtime, we adaptively determine the right balance between DIBR and Ray Tracing. To further optimize the computation efficiency, we also added a multi-level design to exploit the degree of shareable pixels among images to control the computation for error removal. Experiments show that we achieved up to 3.24X speedup in Light Field generation for relative simple scenes like Cornell Box, and about 2X speed up for complex scenes like Conference Room or Sponza.","PeriodicalId":186790,"journal":{"name":"Proceedings of the 2018 Conference on Research in Adaptive and Convergent Systems","volume":"3 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":"134461315","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}