2019 4th International Conference on Computing, Communications and Security (ICCCS)最新文献

筛选
英文 中文
Real-time Disaggregation of Residential Energy Consumption Enhanced with User Feedback 用户反馈增强的住宅能耗实时分解
Anosh Arshad Sundhu, C. Rottondi, G. Verticale
{"title":"Real-time Disaggregation of Residential Energy Consumption Enhanced with User Feedback","authors":"Anosh Arshad Sundhu, C. Rottondi, G. Verticale","doi":"10.1109/CCCS.2019.8888140","DOIUrl":"https://doi.org/10.1109/CCCS.2019.8888140","url":null,"abstract":"Non-Intrusive Appliance Load Monitoring (NIALM) is a process for deducting what appliances are being used in a household by observing the total energy consumption over time. Such process makes it possible to provide energy management services to a large number of users without installation of per-appliance meters. This paper analyzes the performance of NIALM when used to provide real-time services. In addition, the paper studies how the performance of NIALM could be improved by dynamically selecting the disaggregation model on the basis of user feedback about the correctness of the disaggregation.","PeriodicalId":152148,"journal":{"name":"2019 4th International Conference on Computing, Communications and Security (ICCCS)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131901474","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
Facial Mask Detection using Semantic Segmentation 基于语义分割的人脸检测
T. Meenpal, Ashutosh Balakrishnan, Amit Verma
{"title":"Facial Mask Detection using Semantic Segmentation","authors":"T. Meenpal, Ashutosh Balakrishnan, Amit Verma","doi":"10.1109/CCCS.2019.8888092","DOIUrl":"https://doi.org/10.1109/CCCS.2019.8888092","url":null,"abstract":"Face Detection has evolved as a very popular problem in Image processing and Computer Vision. Many new algorithms are being devised using convolutional architectures to make the algorithm as accurate as possible. These convolutional architectures have made it possible to extract even the pixel details. We aim to design a binary face classifier which can detect any face present in the frame irrespective of its alignment. We present a method to generate accurate face segmentation masks from any arbitrary size input image. Beginning from the RGB image of any size, the method uses Predefined Training Weights of VGG – 16 Architecture for feature extraction. Training is performed through Fully Convolutional Networks to semantically segment out the faces present in that image. Gradient Descent is used for training while Binomial Cross Entropy is used as a loss function. Further the output image from the FCN is processed to remove the unwanted noise and avoid the false predictions if any and make bounding box around the faces. Furthermore, proposed model has also shown great results in recognizing non-frontal faces. Along with this it is also able to detect multiple facial masks in a single frame. Experiments were performed on Multi Parsing Human Dataset obtaining mean pixel level accuracy of 93.884 % for the segmented face masks.","PeriodicalId":152148,"journal":{"name":"2019 4th International Conference on Computing, Communications and Security (ICCCS)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123854717","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}
引用次数: 90
Optimizing on-demand GPUs in the Cloud for Deep Learning Applications Training 优化云中的按需gpu,用于深度学习应用程序训练
A. Jahani, M. Lattuada, M. Ciavotta, D. Ardagna, E. Amaldi, Li Zhang
{"title":"Optimizing on-demand GPUs in the Cloud for Deep Learning Applications Training","authors":"A. Jahani, M. Lattuada, M. Ciavotta, D. Ardagna, E. Amaldi, Li Zhang","doi":"10.1109/CCCS.2019.8888151","DOIUrl":"https://doi.org/10.1109/CCCS.2019.8888151","url":null,"abstract":"Deep learning (DL) methods have recently gained popularity and been used in commonplace applications; voice and face recognition, among the others. Despite the growing popularity of DL and the associated hardware acceleration techniques, GPU-based systems still have very high costs. Moreover, while the cloud represents a cost-effective and flexible solution, in large settings operations costs can be further optimized by carefully managing and fostering resource sharing. This work addresses the online joint problem of capacity planning of virtual machines (VMs) and DL training jobs scheduling, and proposes a Mixed Integer Linear Programming (MILP) formulation. In particular, DL jobs are assumed to feature a deadline, while multiple VM types are available from a cloud provider catalog, and each VM has, possibly, multiple GPUs. Our solutions optimize the operations costs by (i) right-sizing the VM capacities; (ii) partitioning the set of GPUs among multiple concurrent jobs running on the same VM, and (iii) determining a deadline-aware job schedule. Our approach is evaluated using an ad-hoc simulator and a prototype environment, and compared against first-principle approaches, resulting in a cost reduction of 45-80%.","PeriodicalId":152148,"journal":{"name":"2019 4th International Conference on Computing, Communications and Security (ICCCS)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123527086","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}
引用次数: 5
Towards a fully automated and optimized network security functions orchestration 迈向完全自动化和优化的网络安全功能编排
Daniele Bringhenti, Guido Marchetto, Riccardo Sisto, Fulvio Valenza, Jalolliddin Yusupov
{"title":"Towards a fully automated and optimized network security functions orchestration","authors":"Daniele Bringhenti, Guido Marchetto, Riccardo Sisto, Fulvio Valenza, Jalolliddin Yusupov","doi":"10.1109/CCCS.2019.8888130","DOIUrl":"https://doi.org/10.1109/CCCS.2019.8888130","url":null,"abstract":"Automated policy-based network security management tools represent a new research frontier to be fully explored, so as to reduce the number of human errors due to a manual and suboptimal configuration of security services. Moreover, the agility that an automated tool would require can be provided by the most recent networking technologies, Network Functions Virtualization and Software-Defined Networking, which move the network management from the hardware level to the software. However, even though a Security Automation approach is nowadays feasible and would bring several benefits in facing cybersecurity attacks, pending problems are that currently only a limited number of automatic management tools have been developed and that they do not have a direct integration with cloud orchestrators, consequently requiring human interaction. Given these considerations, in this paper we propose a novel framework, whose goal is to automatically and optimally allocate and conFigure security functions in a virtualized network service in a formal and verified way, directly integrated in cloud orchestrators. We validated this contribution through an implementation that is able to cooperate with two well-known orchestrators, that are Open Baton and Kubernetes.","PeriodicalId":152148,"journal":{"name":"2019 4th International Conference on Computing, Communications and Security (ICCCS)","volume":"233 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132813513","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}
引用次数: 9
Wi-CR: Human Action Counting and Recognition with Wi-Fi Signals Wi-CR:人类行为计数和识别与Wi-Fi信号
Xiwen Liu, H. Chen, Xianliang Jiang, Jiangbo Qian, Giuseppe Aceto, A. Pescapé
{"title":"Wi-CR: Human Action Counting and Recognition with Wi-Fi Signals","authors":"Xiwen Liu, H. Chen, Xianliang Jiang, Jiangbo Qian, Giuseppe Aceto, A. Pescapé","doi":"10.1109/CCCS.2019.8888113","DOIUrl":"https://doi.org/10.1109/CCCS.2019.8888113","url":null,"abstract":"Human continuous activity recognition, i.e. automatic inference of human behavior, plays an increasingly important role in many fields, such as smart home, somatic games, and health care. The widening application of wireless technology in sensing is making human continuous activity recognition more unobtrusive and user-friendly. In this paper, we propose a Channel State Information (CSI) based human action counting and recognition method, which is named Wi-CR. Wi-CRtakes advantage of an activity indicator and a threshold to detect the start and end times of a set of continuous actions, then counts the number of actions through a peak-finding algorithm, and determines the start and end times of each action. After that, Wi-CRemploys Discrete Wavelet Transformation (DWT) to extract features to analyze correlation of action waveforms and perform best-fit matching based on dynamic time warping (DTW). Finally, it recognizes the action of each action period by k-Nearest Neighbors (KNN). The experimental results show that Wi-CRcan achieve action counting accuracy of 95% and recognition accuracy of 90%, in the scenarios with two types of actions (squat and walk) occurring simultaneously.","PeriodicalId":152148,"journal":{"name":"2019 4th International Conference on Computing, Communications and Security (ICCCS)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129351666","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}
引用次数: 10
Clustering Geo-Indistinguishability for Privacy of Continuous Location Traces 连续位置痕迹隐私的聚类地理不可分辨性
Mariana Cunha, Ricardo Mendes, J. Vilela
{"title":"Clustering Geo-Indistinguishability for Privacy of Continuous Location Traces","authors":"Mariana Cunha, Ricardo Mendes, J. Vilela","doi":"10.1109/CCCS.2019.8888111","DOIUrl":"https://doi.org/10.1109/CCCS.2019.8888111","url":null,"abstract":"We consider privacy of obfuscated location reports that can be correlated through time/space to estimate the real position of a user. We propose a user-centric Location Privacy-Preserving Mechanism (LPPM) that protects users not only against single reports, but also over time, against continuous reports. Our proposed mechanism, designated clustering geo-indistinguishability, creates obfuscation clusters to aggregate nearby locations into a single obfuscated location. To evaluate the utility of the mechanism, we resorted to a real use-case based on geofencing. Our evaluation results have shown a suitable privacy-utility trade-off for the proposed clustering geo-indistinguishability mechanism.","PeriodicalId":152148,"journal":{"name":"2019 4th International Conference on Computing, Communications and Security (ICCCS)","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130953676","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}
引用次数: 9
Dual Segment Dielectric Resonator Antenna for Microwave Applications 微波用双段介质谐振器天线
Anshul Gupta, R. Gangwar
{"title":"Dual Segment Dielectric Resonator Antenna for Microwave Applications","authors":"Anshul Gupta, R. Gangwar","doi":"10.1109/CCCS.2019.8888141","DOIUrl":"https://doi.org/10.1109/CCCS.2019.8888141","url":null,"abstract":"This paper presents, a dual-segmented Rectangular dielectric resonator antenna (RDRA) fed by a modified conformal strip for wideband application is proposed. $TE_{1,delta,1}^{y}$ and $TE_{1,4,1}^{y}$ modes have been excited which show well-balanced radiation pattern and decent radiation efficiency throughout the bandwidth. The proposed antenna geometry is wideband in nature i.e. 4.32-7.27 GHz. Simulated gain of 7.04 dB was observed at 4.88 GHz while 5.46 dB was observed at 6.66 GHz. It can be concluded that the presented antenna is suitable for WLAN application (5. 15-5.835 GHz), Amateur Satellite (5.6 GHz), Microwave radiometry and various applications in 4-7 GHz frequency band.","PeriodicalId":152148,"journal":{"name":"2019 4th International Conference on Computing, Communications and Security (ICCCS)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131088243","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
ICCCS 2019 Cover Page ICCCS 2019封面
{"title":"ICCCS 2019 Cover Page","authors":"","doi":"10.1109/cccs.2019.8888109","DOIUrl":"https://doi.org/10.1109/cccs.2019.8888109","url":null,"abstract":"","PeriodicalId":152148,"journal":{"name":"2019 4th International Conference on Computing, Communications and Security (ICCCS)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122793107","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
Remote Memory Swapping for Virtual Machines in Commercial Infrastructure-as-a-Service 商业基础设施即服务中虚拟机的远程内存交换
Kashifuddin Qazi, Steven Romero
{"title":"Remote Memory Swapping for Virtual Machines in Commercial Infrastructure-as-a-Service","authors":"Kashifuddin Qazi, Steven Romero","doi":"10.1109/CCCS.2019.8888069","DOIUrl":"https://doi.org/10.1109/CCCS.2019.8888069","url":null,"abstract":"Memory swapping is an essential feature offered by operating systems (OS) to prevent applications from crashing due to the system running out of main memory. Traditional swapping works by using a part of the storage disk as backup memory. Unfortunately, storage disk speeds are orders of magnitude slower than main memory. This implies that as useful as swapping is, it causes expected performance degradation of the application. A more recent swapping mechanism in clusters is remote swapping, which uses one host’s main memory as swap space over the network for another host. For faster networks, remote swapping could outperform disk swapping. However, for users leasing Virtual Machines (VMs) in existing commercial Infrastructure-as-a-Service (IaaS) providers, choosing a swapping mechanism for their VMs is non-trivial. They are subjected to additional constraints and considerations such as lack of access to the underlying hypervisor, OS, and hardware. On the other hand, network speeds within clouds have evolved to be faster than storage device speeds, making remote swap appealing. This paper explores implementing remote swapping for leased VMs within IaaS providers. A setup is proposed that implements remote swapping within a cluster of VMs, abiding by the constraints of IaaS. The setup does not need any modification of the hypervisor, or any special hardware, making it suitable for users currently in commercial IaaS clouds. Through extensive experimental evaluations on Amazon Web Services’ ec2 instances and Google Cloud’s Compute Engine, the paper demonstrates the performance benefits of using remote memory versus the standard storage disks as swap space.","PeriodicalId":152148,"journal":{"name":"2019 4th International Conference on Computing, Communications and Security (ICCCS)","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127820959","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
Reducing Traverse Space in Path Planning using Snake Model for Robots 利用蛇形模型减少机器人路径规划中的遍历空间
Kaushlendra Sharma, R. Doriya
{"title":"Reducing Traverse Space in Path Planning using Snake Model for Robots","authors":"Kaushlendra Sharma, R. Doriya","doi":"10.1109/CCCS.2019.8888083","DOIUrl":"https://doi.org/10.1109/CCCS.2019.8888083","url":null,"abstract":"Path planning for robots is one of the important aspects of robots where they need to get an optimal and obstacle-free path from source to destination. Getting an optimal and obstacle-free path, while traversing is the core research issue in robotics. To address this research issue, several techniques were proposed and implemented in the past, and still, a good amount of work is being carried on. Some well-known algorithms for path planning are ${A}^{*}$, Probabilistic Roadmap Planner (PRM), Rapidly Exploring Random Tree (RRT) and RRT Smooth. Fundamentally, to find an optimal and obstacle-free path, any path planning algorithms needs to explore the whole configuration space, which increases traversing time and efforts. However, the exploration of the whole configuration space can be done efficiently, which result in improving the performance of the path planning algorithms. This paper addresses the use of Snake Model as a preliminary step to path planning algorithms to find optimal and obstacle-free paths for robots efficiently by reducing the traversing in configuration space. Several experiments have been carried out to show the effectiveness of the proposed setup. In the experiments, the Snake model has been applied along with some standard algorithms such as ${A}^{*}$, PRM, RRT and RRT Smooth, where the parameters such as path length, No. of Moves and Time taken are used to record the performance.","PeriodicalId":152148,"journal":{"name":"2019 4th International Conference on Computing, Communications and Security (ICCCS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129712464","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}
引用次数: 4
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信