首页 > 最新文献

Proceedings of the International Conference on Research in Adaptive and Convergent Systems最新文献

英文 中文
OCPP security - Neural network for detecting malicious traffic OCPP安全-检测恶意流量的神经网络
A. Moroșan, Florin Pop
Because the electric mobility has its focus on eco-friendly means of transport, a distributed platform designed for a smart city environment that can manage the electrical charging stations is vital. One of the major problems of distributed systems and cloud is security. The purpose of this article is to determine the malicious traffic using a backpropagation neural network. The main focus of the paper is to present a composite network that is able to detect faulted, random and normal types of traffic.
由于电动交通的重点是环保交通工具,因此为智能城市环境设计的分布式平台可以管理充电站至关重要。分布式系统和云计算的主要问题之一是安全性。本文的目的是使用反向传播神经网络来确定恶意流量。本文的主要重点是提出一种能够检测故障、随机和正常类型流量的复合网络。
{"title":"OCPP security - Neural network for detecting malicious traffic","authors":"A. Moroșan, Florin Pop","doi":"10.1145/3129676.3129693","DOIUrl":"https://doi.org/10.1145/3129676.3129693","url":null,"abstract":"Because the electric mobility has its focus on eco-friendly means of transport, a distributed platform designed for a smart city environment that can manage the electrical charging stations is vital. One of the major problems of distributed systems and cloud is security. The purpose of this article is to determine the malicious traffic using a backpropagation neural network. The main focus of the paper is to present a composite network that is able to detect faulted, random and normal types of traffic.","PeriodicalId":326100,"journal":{"name":"Proceedings of the International Conference on Research in Adaptive and Convergent Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116935734","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}
引用次数: 15
Real-time motion blur based on per pixel fragment list 基于每像素片段列表的实时运动模糊
Jinhyung Choi, Kyoungsu Oh
Motion-blur effect helps users recognize fast-moving objects in 3D scenes and virtual environments. Recently, the post-processing technique is one of the most commonly used techniques for motion-blur rendering. However, this algorithm has artifacts when there are complex moving directions. In this paper, we present a new algorithm to resolve those artifacts. First, we find pixel locations between t0 and t1 for all moving pixels. t0 and t1 are meant the start and end time respectively, during the period of one frame in which some object moves. We find pixel locations passing between two times on the screen with Bresenham's algorithm. And we store fragments to linked-lists on this position. Theses fragments contain information depth, time and color of a pixel. After we run visibility testing for every fragment and we set the average color from t0 and t1 with determined visible fragment's data. The result of our algorithm can render similar to the accumulation buffer algorithm without artifacts in interactively. We try to contribute a better quality image for motion-blurred. And we suggest a forward processing motion blur in real-time by linked-list. This method is a part of graphics techniques for complex reality 3D scenes. Therefore, we expect to make the better quality and speed of 3D games and virtual reality though this paper.
运动模糊效果可以帮助用户识别3D场景和虚拟环境中快速移动的物体。目前,后处理技术是运动模糊渲染中最常用的技术之一。然而,当运动方向复杂时,该算法存在伪影。在本文中,我们提出了一种新的算法来解决这些伪影。首先,我们找到所有移动像素在t0和t1之间的像素位置。T0和t1分别表示某物体在一帧内运动的开始时间和结束时间。我们用布里森汉姆算法找到在屏幕上两次之间传递的像素位置。我们将片段存储在这个位置的链表中。这些碎片包含一个像素的信息深度、时间和颜色。在我们为每个片段运行可见性测试之后,我们用确定的可见片段的数据从t0和t1设置平均颜色。该算法的呈现结果与累积缓冲算法相似,没有交互干扰。我们试图为运动模糊提供更高质量的图像。提出了一种利用链表对运动模糊进行实时前向处理的方法。该方法是复杂现实三维场景图形技术的一部分。因此,我们希望通过本文可以使3D游戏和虚拟现实的质量和速度更好。
{"title":"Real-time motion blur based on per pixel fragment list","authors":"Jinhyung Choi, Kyoungsu Oh","doi":"10.1145/3129676.3129692","DOIUrl":"https://doi.org/10.1145/3129676.3129692","url":null,"abstract":"Motion-blur effect helps users recognize fast-moving objects in 3D scenes and virtual environments. Recently, the post-processing technique is one of the most commonly used techniques for motion-blur rendering. However, this algorithm has artifacts when there are complex moving directions. In this paper, we present a new algorithm to resolve those artifacts. First, we find pixel locations between t0 and t1 for all moving pixels. t0 and t1 are meant the start and end time respectively, during the period of one frame in which some object moves. We find pixel locations passing between two times on the screen with Bresenham's algorithm. And we store fragments to linked-lists on this position. Theses fragments contain information depth, time and color of a pixel. After we run visibility testing for every fragment and we set the average color from t0 and t1 with determined visible fragment's data. The result of our algorithm can render similar to the accumulation buffer algorithm without artifacts in interactively. We try to contribute a better quality image for motion-blurred. And we suggest a forward processing motion blur in real-time by linked-list. This method is a part of graphics techniques for complex reality 3D scenes. Therefore, we expect to make the better quality and speed of 3D games and virtual reality though this paper.","PeriodicalId":326100,"journal":{"name":"Proceedings of the International Conference on Research in Adaptive and Convergent Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127690249","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}
引用次数: 1
An Improved Evolutionary Approach for Document Clustering 一种改进的文档聚类进化方法
Ruksana Akter, Yoojin Chung
Traditional approaches representing chromosomes based on cluster centroids do not allow dividing cluster centroids during crossover operations. Hence, significant diversity may not be achieved while the algorithm iterates from generation to generation. In our approach presented in this paper, we allow a crossover point to be even inside a cluster centroid, modifying some cluster centroids during the crossover operations. Such modifications also guide the algorithm to get rid of the local minima. Thus the proposed approach can find a better solution than the traditional approaches.
传统的基于聚类质心表示染色体的方法不允许在交叉操作中划分聚类质心。因此,在算法逐代迭代时,可能无法实现显著的多样性。在本文提出的方法中,我们允许交叉点在簇质心内偶数,在交叉操作期间修改一些簇质心。这样的修改也引导算法去除了局部极小值。因此,与传统方法相比,本文提出的方法可以找到更好的解决方案。
{"title":"An Improved Evolutionary Approach for Document Clustering","authors":"Ruksana Akter, Yoojin Chung","doi":"10.1145/3129676.3129733","DOIUrl":"https://doi.org/10.1145/3129676.3129733","url":null,"abstract":"Traditional approaches representing chromosomes based on cluster centroids do not allow dividing cluster centroids during crossover operations. Hence, significant diversity may not be achieved while the algorithm iterates from generation to generation. In our approach presented in this paper, we allow a crossover point to be even inside a cluster centroid, modifying some cluster centroids during the crossover operations. Such modifications also guide the algorithm to get rid of the local minima. Thus the proposed approach can find a better solution than the traditional approaches.","PeriodicalId":326100,"journal":{"name":"Proceedings of the International Conference on Research in Adaptive and Convergent Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121399286","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}
引用次数: 2
Temporal data stream analysis for EV charging infrastructure in Jeju 济州电动汽车充电基础设施时序数据流分析
Junghoon Lee, G. Park
This paper first presents the main features of the dataset obtained from the charging station monitoring system currently in operation on Jeju island. Then, the time series analysis is conducted to find the behavioral trends according to districts and place types, based on periodic report archives from 49 fast chargers. Two most populated districts lead the occupancy rate of the whole island, while those chargers installed in administrative offices account for the most charging demand during office working hours. Combined with the dynamic time warping method, the hierarchical clustering process captures 3 main groups having the same day-by-day occupancy rate dynamics. Additionally, artificial neural network models are built to forecast the next day charging demand, and the prediction for working hours is acceptable as it is not affected by missing data. With the prediction model built upon open data and software, it is possible to develop a new smart grid application such as vehicle-to-grid and renewable energy generation.
本文首先介绍了济州岛目前运行的充电站监测系统数据集的主要特征。然后,基于49家快速充电站的定期报告档案,进行时间序列分析,找出不同地区和地点类型的行为趋势。两个人口最多的地区占据全岛的使用率,而安装在行政办公室的充电器在办公时间内的充电需求最大。结合动态时间规整方法,分层聚类过程捕获具有相同的每日入住率动态的3个主要组。建立人工神经网络模型预测第二天的充电需求,对工作时间的预测不受数据缺失的影响,是可以接受的。有了建立在开放数据和软件基础上的预测模型,就有可能开发出一种新的智能电网应用,如汽车到电网和可再生能源发电。
{"title":"Temporal data stream analysis for EV charging infrastructure in Jeju","authors":"Junghoon Lee, G. Park","doi":"10.1145/3129676.3129717","DOIUrl":"https://doi.org/10.1145/3129676.3129717","url":null,"abstract":"This paper first presents the main features of the dataset obtained from the charging station monitoring system currently in operation on Jeju island. Then, the time series analysis is conducted to find the behavioral trends according to districts and place types, based on periodic report archives from 49 fast chargers. Two most populated districts lead the occupancy rate of the whole island, while those chargers installed in administrative offices account for the most charging demand during office working hours. Combined with the dynamic time warping method, the hierarchical clustering process captures 3 main groups having the same day-by-day occupancy rate dynamics. Additionally, artificial neural network models are built to forecast the next day charging demand, and the prediction for working hours is acceptable as it is not affected by missing data. With the prediction model built upon open data and software, it is possible to develop a new smart grid application such as vehicle-to-grid and renewable energy generation.","PeriodicalId":326100,"journal":{"name":"Proceedings of the International Conference on Research in Adaptive and Convergent Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128687183","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}
引用次数: 7
Intelligent Orchestration Agent for Storage Platform Management 用于存储平台管理的智能编排代理
J. An, Younghwan Kim, Changkwon Park
Until recently, we have concentrated on building hardware based infrastructure such as computing resources, storage resources, and network resources to support rapidly growing big data, and we have been managing it with existing hardware infrastructure management methods. However, as the amount of data explosively increases and the number of infrastructure resources increases, the existing hardware infrastructure operation is confronted with limitations. Therefore, the need for more efficient resource management technology is increasing. This paper has designed intelligent orchestration agent which supports storage platform management with software defined storage concept. The basic structure proposed in this paper is that the orchestration agent manages performance, capacity and power saving based on a software defined storage platform.
直到最近,我们一直专注于构建基于硬件的基础设施,如计算资源、存储资源和网络资源,以支持快速增长的大数据,我们一直用现有的硬件基础设施管理方法来管理它。然而,随着数据量的爆炸式增长和基础设施资源的增加,现有的硬件基础设施运营面临着局限性。因此,对更有效的资源管理技术的需求正在增加。本文采用软件定义存储的概念,设计了支持存储平台管理的智能编排代理。本文提出的基本结构是业务流程代理基于软件定义的存储平台对性能、容量和节能进行管理。
{"title":"Intelligent Orchestration Agent for Storage Platform Management","authors":"J. An, Younghwan Kim, Changkwon Park","doi":"10.1145/3129676.3129705","DOIUrl":"https://doi.org/10.1145/3129676.3129705","url":null,"abstract":"Until recently, we have concentrated on building hardware based infrastructure such as computing resources, storage resources, and network resources to support rapidly growing big data, and we have been managing it with existing hardware infrastructure management methods. However, as the amount of data explosively increases and the number of infrastructure resources increases, the existing hardware infrastructure operation is confronted with limitations. Therefore, the need for more efficient resource management technology is increasing. This paper has designed intelligent orchestration agent which supports storage platform management with software defined storage concept. The basic structure proposed in this paper is that the orchestration agent manages performance, capacity and power saving based on a software defined storage platform.","PeriodicalId":326100,"journal":{"name":"Proceedings of the International Conference on Research in Adaptive and Convergent Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115603640","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}
引用次数: 0
Performance Evaluations of Multiple GPUs based on MPI Environments 基于MPI环境的多gpu性能评估
Bongjae Kim, Jinmang Jung, Hong Min, Junyoung Heo, Hyedong Jung
GPU-based computations are widely used in various computing areas because GPU provides very high computing performance when compared to typical CPU. In this paper, we evaluate and analyze the computing performance of multiple GPUs based on MPI environments. We examine the performance of sparse matric-vector multiply (SpMV). SpMV is one of the most heavily used components in many scientific applications. Based on the performance evaluation results, generally, the execution time of SpMV is decreased as the number of GPUs increase. In some case, the performance was reduced according to the computation overhead, the memory copy overhead among GPUs, and the characteristics of sparse matrices.
基于GPU的计算被广泛应用于各种计算领域,因为GPU与典型的CPU相比可以提供非常高的计算性能。在本文中,我们评估和分析了基于MPI环境的多个gpu的计算性能。我们研究了稀疏矩阵向量乘法(SpMV)的性能。SpMV是许多科学应用中使用最多的组件之一。从性能评估结果来看,SpMV的执行时间通常随着gpu数量的增加而减少。在某些情况下,由于计算开销、gpu之间的内存复制开销和稀疏矩阵的特性,性能会降低。
{"title":"Performance Evaluations of Multiple GPUs based on MPI Environments","authors":"Bongjae Kim, Jinmang Jung, Hong Min, Junyoung Heo, Hyedong Jung","doi":"10.1145/3129676.3129716","DOIUrl":"https://doi.org/10.1145/3129676.3129716","url":null,"abstract":"GPU-based computations are widely used in various computing areas because GPU provides very high computing performance when compared to typical CPU. In this paper, we evaluate and analyze the computing performance of multiple GPUs based on MPI environments. We examine the performance of sparse matric-vector multiply (SpMV). SpMV is one of the most heavily used components in many scientific applications. Based on the performance evaluation results, generally, the execution time of SpMV is decreased as the number of GPUs increase. In some case, the performance was reduced according to the computation overhead, the memory copy overhead among GPUs, and the characteristics of sparse matrices.","PeriodicalId":326100,"journal":{"name":"Proceedings of the International Conference on Research in Adaptive and Convergent Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116276669","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}
引用次数: 3
An Anti-Reverse Engineering Technique using Native code and Obfuscator-LLVM for Android Applications Android应用程序中使用本机代码和混淆- llvm的反逆向工程技术
Kyeonghwan Lim, Jaemin Jeong, Seong-je Cho, Jongmoo Choi, Minkyu Park, Sangchul Han, S. Jhang
Android applications are exposed to reverse engineering attacks. In particular, the applications written in Java are more prone to reverse engineering in comparison to the applications written in native-code languages such as C or C++ on the Android platform. This is because Java applications are distributed as byte codes, while applications written in native-code languages are distributed as low-level binary codes. In this paper, we propose a new technique to protect Android applications against reverse engineering. Three key characteristics of the proposed approach are as follows. First, we write the main parts of the application in native-code using Android NDK. This not only makes reverse engineering more difficult, but it is also more effective in terms of code reuse. Second, we introduce obfuscation, which hides the intent of the native codes and obscures theirs structure, at the intermediate representation (IR) level. Finally, we integrate an integrity verification scheme which detects whether the critical module of the application has been modified prior to execution of the application. Based on the results of experimentation on five known Android applications, we show that the proposed techniques can be applied without a significant effect on performance.
Android应用程序容易受到逆向工程攻击。特别是,与Android平台上用C或c++等本地代码语言编写的应用程序相比,用Java编写的应用程序更容易进行逆向工程。这是因为Java应用程序是作为字节码分发的,而用本机代码语言编写的应用程序是作为低级二进制码分发的。在本文中,我们提出了一种新的技术来保护Android应用程序免受逆向工程。提出的方法的三个关键特征如下。首先,我们使用Android NDK用本机代码编写应用程序的主要部分。这不仅使逆向工程更加困难,而且在代码重用方面也更加有效。其次,我们在中间表示(IR)级别引入混淆,它隐藏了本机代码的意图并模糊了它们的结构。最后,我们集成了一个完整性验证方案,该方案检测应用程序的关键模块是否在应用程序执行之前被修改。基于对五个已知Android应用程序的实验结果,我们证明了所提出的技术可以在不显著影响性能的情况下应用。
{"title":"An Anti-Reverse Engineering Technique using Native code and Obfuscator-LLVM for Android Applications","authors":"Kyeonghwan Lim, Jaemin Jeong, Seong-je Cho, Jongmoo Choi, Minkyu Park, Sangchul Han, S. Jhang","doi":"10.1145/3129676.3129708","DOIUrl":"https://doi.org/10.1145/3129676.3129708","url":null,"abstract":"Android applications are exposed to reverse engineering attacks. In particular, the applications written in Java are more prone to reverse engineering in comparison to the applications written in native-code languages such as C or C++ on the Android platform. This is because Java applications are distributed as byte codes, while applications written in native-code languages are distributed as low-level binary codes. In this paper, we propose a new technique to protect Android applications against reverse engineering. Three key characteristics of the proposed approach are as follows. First, we write the main parts of the application in native-code using Android NDK. This not only makes reverse engineering more difficult, but it is also more effective in terms of code reuse. Second, we introduce obfuscation, which hides the intent of the native codes and obscures theirs structure, at the intermediate representation (IR) level. Finally, we integrate an integrity verification scheme which detects whether the critical module of the application has been modified prior to execution of the application. Based on the results of experimentation on five known Android applications, we show that the proposed techniques can be applied without a significant effect on performance.","PeriodicalId":326100,"journal":{"name":"Proceedings of the International Conference on Research in Adaptive and Convergent Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134102453","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}
引用次数: 11
Contents Recommendation Scheme Considering Trust and Collaborative Filtering in Online Social Networks 基于信任和协同过滤的在线社交网络内容推荐方案
Kyoungsoo Bok, Geonsik Ko, Jongtae Lim, K. Lee, Jaesoo Yoo
With the development of smartphones and online social networks, the users are creating and sharing a large amount of content. Concurrently, there have been recommendation schemes for providing users with content that matches their preferences. In this paper, we present a content recommendation scheme that uses trust-based user filtering. To perform user filtering, the trust of a user is determined by analyzing user social activities, content usage, and social relationships. In addition, trust of the content is considered to decide the content recommendation priority order. To calculate the content trust, we analyze the expertise of the user and implicit activities. It is shown through performance evaluation that the proposed scheme outperforms the existing scheme.
随着智能手机和在线社交网络的发展,用户正在创造和分享大量的内容。同时,也有一些推荐方案为用户提供符合他们喜好的内容。在本文中,我们提出了一种基于信任的用户过滤的内容推荐方案。用户过滤是通过分析用户的社交活动、内容使用情况和社交关系来确定用户的信任程度。此外,还考虑了内容的信任度来决定内容推荐的优先顺序。为了计算内容信任,我们分析了用户的专业知识和隐性活动。通过性能评估表明,所提方案优于现有方案。
{"title":"Contents Recommendation Scheme Considering Trust and Collaborative Filtering in Online Social Networks","authors":"Kyoungsoo Bok, Geonsik Ko, Jongtae Lim, K. Lee, Jaesoo Yoo","doi":"10.1145/3129676.3130217","DOIUrl":"https://doi.org/10.1145/3129676.3130217","url":null,"abstract":"With the development of smartphones and online social networks, the users are creating and sharing a large amount of content. Concurrently, there have been recommendation schemes for providing users with content that matches their preferences. In this paper, we present a content recommendation scheme that uses trust-based user filtering. To perform user filtering, the trust of a user is determined by analyzing user social activities, content usage, and social relationships. In addition, trust of the content is considered to decide the content recommendation priority order. To calculate the content trust, we analyze the expertise of the user and implicit activities. It is shown through performance evaluation that the proposed scheme outperforms the existing scheme.","PeriodicalId":326100,"journal":{"name":"Proceedings of the International Conference on Research in Adaptive and Convergent Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121499253","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}
引用次数: 1
MACaaS Platform for Fog Computing macas雾计算平台
Gibeom Byeon, Myungjoon Shon, Hansol Lee, Jiman Hong
With the development of the Internet of Things(IoT), where things are connected to the Internet, the number of IoT services and users is increasing day by day. Cloud computing is widely used to save and process the huge amounts of data generated by increasing IoT devices efficiently. However transmission delay problem occurs in the cloud computing environment because the huge amounts of data generated by the IoT devices is saved in the remote cloud servers. To solve this problem, fog computing emerged. Fog computing is a concept that brings cloud servers close to user area to provide high quality service by reducing the network transmission time. In this paper, we propose a Monitoring, Analyzing, and Controlling as a Service, which called MACaaS, platform for the fog computing. The proposed MACaaS platform provides services for monitoring, analyzing and controlling various IoT devices. In addition, the proposed platform can easily expand new services according to the additional requirements of IoT devices and users and provide the consistent interface for integrating various IoT devices.
随着物联网(Internet of Things, IoT)的发展,物联网服务和用户的数量日益增加。云计算被广泛用于有效地保存和处理因增加物联网设备而产生的大量数据。然而,在云计算环境中,由于物联网设备产生的大量数据保存在远程云服务器中,导致了传输延迟问题。为了解决这个问题,雾计算出现了。雾计算是通过减少网络传输时间,使云服务器靠近用户区域,提供高质量服务的概念。在本文中,我们提出了一个监测、分析和控制即服务(mcacaas)的雾计算平台。提出的macas平台提供各种物联网设备的监控、分析和控制服务。此外,该平台可以根据物联网设备和用户的额外需求轻松扩展新的业务,并为各种物联网设备的集成提供一致的接口。
{"title":"MACaaS Platform for Fog Computing","authors":"Gibeom Byeon, Myungjoon Shon, Hansol Lee, Jiman Hong","doi":"10.1145/3129676.3129718","DOIUrl":"https://doi.org/10.1145/3129676.3129718","url":null,"abstract":"With the development of the Internet of Things(IoT), where things are connected to the Internet, the number of IoT services and users is increasing day by day. Cloud computing is widely used to save and process the huge amounts of data generated by increasing IoT devices efficiently. However transmission delay problem occurs in the cloud computing environment because the huge amounts of data generated by the IoT devices is saved in the remote cloud servers. To solve this problem, fog computing emerged. Fog computing is a concept that brings cloud servers close to user area to provide high quality service by reducing the network transmission time. In this paper, we propose a Monitoring, Analyzing, and Controlling as a Service, which called MACaaS, platform for the fog computing. The proposed MACaaS platform provides services for monitoring, analyzing and controlling various IoT devices. In addition, the proposed platform can easily expand new services according to the additional requirements of IoT devices and users and provide the consistent interface for integrating various IoT devices.","PeriodicalId":326100,"journal":{"name":"Proceedings of the International Conference on Research in Adaptive and Convergent Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113945743","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}
引用次数: 1
Disambiguation and Comparison of SOA, Microservices and Self-Contained Systems SOA、微服务和自包含系统的消歧和比较
T. Cerný, M. Donahoo, J. Pechanec
There is an industrial shift from Service-Oriented Architectures (SOA) into Microservices; however, a quick review of online resources on these topics reveals a range of different understandings of these two architectures. Individuals often mix terms, grant false advantages or expect different quality attributes and properties. The purpose of this paper is to provide readers a solid understanding of the differences between these two architectures and their features. We provide both research and industry perspectives to point out strengths and weaknesses of both architectural directions, and we point out many shortcomings in both approaches that are not addressed by the architecture. Finally, based on this we propose challenges for future research.
行业正在从面向服务的体系结构(SOA)转向微服务;然而,快速浏览一下关于这些主题的在线资源,就会发现对这两种体系结构的不同理解。个人经常混淆术语,给予虚假的好处或期望不同的质量属性和特性。本文的目的是让读者对这两种体系结构及其特性之间的差异有一个坚实的理解。我们提供了研究和行业的观点来指出这两个体系结构方向的优点和缺点,并指出了这两种方法中体系结构没有解决的许多缺点。最后,在此基础上提出了未来研究的挑战。
{"title":"Disambiguation and Comparison of SOA, Microservices and Self-Contained Systems","authors":"T. Cerný, M. Donahoo, J. Pechanec","doi":"10.1145/3129676.3129682","DOIUrl":"https://doi.org/10.1145/3129676.3129682","url":null,"abstract":"There is an industrial shift from Service-Oriented Architectures (SOA) into Microservices; however, a quick review of online resources on these topics reveals a range of different understandings of these two architectures. Individuals often mix terms, grant false advantages or expect different quality attributes and properties. The purpose of this paper is to provide readers a solid understanding of the differences between these two architectures and their features. We provide both research and industry perspectives to point out strengths and weaknesses of both architectural directions, and we point out many shortcomings in both approaches that are not addressed by the architecture. Finally, based on this we propose challenges for future research.","PeriodicalId":326100,"journal":{"name":"Proceedings of the International Conference on Research in Adaptive and Convergent Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130307492","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}
引用次数: 43
期刊
Proceedings of the International Conference on Research in Adaptive and Convergent Systems
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1