发布求助
文献互助 智能选刊 最新文献

2021 IEEE Symposium on Computers and Communications (ISCC)最新文献

筛选
英文 中文
Cybersecurity Certification Requirements for Supply Chain Services 供应链服务的网络安全认证要求
2021 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2021-09-05 DOI: 10.1109/ISCC53001.2021.9631467
Pinelopi Kyranoud, Eleni-Maria Kalogeraki, Alexandra Michota, Nineta Polemi
{"title":"Cybersecurity Certification Requirements for Supply Chain Services","authors":"Pinelopi Kyranoud, Eleni-Maria Kalogeraki, Alexandra Michota, Nineta Polemi","doi":"10.1109/ISCC53001.2021.9631467","DOIUrl":"https://doi.org/10.1109/ISCC53001.2021.9631467","url":null,"abstract":"Supply Chain Services (SCS) are the backbone of any economy and their security is most important for the competitiveness, prosperity and resilience of the European Digital Single Market. Security certification of the SCS is the necessary mitigation measure towards the trustworthiness of the digital economies. This paper presents the building blocks and requirements for the certification of the SCS.","PeriodicalId":270786,"journal":{"name":"2021 IEEE Symposium on Computers and Communications (ISCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128171918","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
Apriori-Roaring-Parallel: Frequent pattern mining based on compressed bitmaps with OpenMP apriori -吼叫- parallel:基于OpenMP压缩位图的频繁模式挖掘
2021 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2021-09-05 DOI: 10.1109/ISCC53001.2021.9631495
Alexandre Colombo, R. S. Ulson, R. S. Lobato, A. Manacero, M. A. Cavenaghi
{"title":"Apriori-Roaring-Parallel: Frequent pattern mining based on compressed bitmaps with OpenMP","authors":"Alexandre Colombo, R. S. Ulson, R. S. Lobato, A. Manacero, M. A. Cavenaghi","doi":"10.1109/ISCC53001.2021.9631495","DOIUrl":"https://doi.org/10.1109/ISCC53001.2021.9631495","url":null,"abstract":"Mining association rules is a process which consists in extracting knowledge from datasets. This is a widely used technique to analyze customer purchasing patterns, and its process is segmented in two main phases: mining frequent sets and formulating association rules. Several approaches were developed for the first phase of the mining process whose main objective was to reduce execution time. However, as all available datasets are very large (Big Data), there is a limitation regarding its application in these new sets due to excessive memory usage. We propose the Apriori-Roaring-Parallel which explores parallelism in shared memory and demands less memory usage during the mining process. In order to achieve this memory usage reduction, the Apriori-Roaring-Parallel method employs compressed bitmap structures to represent the datasets. The results obtained show that the Apriori-Roaring-Parallel method uses memory efficiently when compared to other methods.","PeriodicalId":270786,"journal":{"name":"2021 IEEE Symposium on Computers and Communications (ISCC)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128462630","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
VM Migration Scheduling as Moving Target Defense against Memory DoS Attacks: An Empirical Study 虚拟机迁移调度作为移动目标防御内存DoS攻击的实证研究
2021 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2021-09-05 DOI: 10.1109/ISCC53001.2021.9631397
Matheus Torquato, M. Vieira
{"title":"VM Migration Scheduling as Moving Target Defense against Memory DoS Attacks: An Empirical Study","authors":"Matheus Torquato, M. Vieira","doi":"10.1109/ISCC53001.2021.9631397","DOIUrl":"https://doi.org/10.1109/ISCC53001.2021.9631397","url":null,"abstract":"Memory Denial of Service (DoS) attacks are easy-to-launch, hard to detect, and significantly impact their targets. In memory DoS, the attacker targets the memory of his Virtual Machine (VM) and, due to hardware isolation issues, the attack affects the co-resident VMs. Theoretically, we can deploy VM migration as Moving Target Defense (MTD) against memory DoS. However, the current literature lacks empirical evidence supporting this hypothesis. Moreover, there is a need to evaluate how the VM migration timing impacts the potential MTD protection. This practical experience report presents an experiment on VM migration-based MTD against memory DoS. We evaluate the impact of memory DoS attacks in the context of two applications running in co-hosted VMs: machine learning and OLTP. The results highlight that the memory DoS attacks lead to more than 70% reduction in the applications' performance. Nevertheless, timely VM migrations can significantly mitigate the attack effects in both considered applications.","PeriodicalId":270786,"journal":{"name":"2021 IEEE Symposium on Computers and Communications (ISCC)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134291816","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
ARAIG And Minecraft: A COVID-19 Workaround ARAIG和Minecraft: COVID-19的解决方案
2021 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2021-09-05 DOI: 10.1109/ISCC53001.2021.9631428
Cassandra Frances Laffan, R. Kozin, James Elliott Coleshill, A. Ferworn, Michael Stanfield, Brodie Stanfield
{"title":"ARAIG And Minecraft: A COVID-19 Workaround","authors":"Cassandra Frances Laffan, R. Kozin, James Elliott Coleshill, A. Ferworn, Michael Stanfield, Brodie Stanfield","doi":"10.1109/ISCC53001.2021.9631428","DOIUrl":"https://doi.org/10.1109/ISCC53001.2021.9631428","url":null,"abstract":"The COVID-19 pandemic has necessitated the use of simulations in projects that may not have relied on them in the past. This project, which is a continuation of the research presented previously in [1], creates an optimized pathway back to the beginning of a user's recorded route using a modified (modded) Minecraft environment. We construct an octree in order to create a graph of connected nodes, then integrate our mod with a simulated “As Real As It Gets” (ARAIG) wearable haptic suit. This provides a visual representation of the physical feedback the user would receive if they were to wear it. Finally, we ask a small group of users to test this program and to give us feedback based upon their experiences, before discussing our next steps in the project. These next steps include broadening the scope of our Minecraft mod and integrating these algorithms into physical mediums.","PeriodicalId":270786,"journal":{"name":"2021 IEEE Symposium on Computers and Communications (ISCC)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122835239","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
End-Stage Renal Disease Self-management: mobile app development 终末期肾病自我管理:移动应用程序开发
2021 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2021-09-05 DOI: 10.1109/ISCC53001.2021.9631482
João Pedro Barros, Pedro Brandão
{"title":"End-Stage Renal Disease Self-management: mobile app development","authors":"João Pedro Barros, Pedro Brandão","doi":"10.1109/ISCC53001.2021.9631482","DOIUrl":"https://doi.org/10.1109/ISCC53001.2021.9631482","url":null,"abstract":"The increase in the prevalence and incidence of chronic diseases leads to the need to adopt measures for promoting self-management. The technology currently available in smartphones has allowed new opportunities to develop digital tools to help chronically ill patients. Mobile health applications for smartphones allows the creation of tools that use the potential of this device in a symbiosis between technology and health care. End-Stage Renal Disease (ESRD) presents a multifaceted, complex, and challenging therapeutic regimen. The mHealth field enables the improvement of self-management of the pathology and promotes better patient monitoring. A user-centered design methodology makes it possible to assess patient's needs and characteristics, allowing the development of tools to focus on the user throughout the process. This study evaluated the ESRD self-management difficulties, revealing high non-adher-ence levels to the therapeutic regimen. In addition, we developed a mobile app prototype and evaluated its usability and technology acceptance.","PeriodicalId":270786,"journal":{"name":"2021 IEEE Symposium on Computers and Communications (ISCC)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128720141","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
NeVe: A Log-based Fast Incremental Network Feature Embedding Approach NeVe:基于日志的快速增量网络特征嵌入方法
2021 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2021-09-05 DOI: 10.1109/ISCC53001.2021.9631421
Ran Tian, Zulong Diao, Haiyang Jiang, Gaogang Xie
{"title":"NeVe: A Log-based Fast Incremental Network Feature Embedding Approach","authors":"Ran Tian, Zulong Diao, Haiyang Jiang, Gaogang Xie","doi":"10.1109/ISCC53001.2021.9631421","DOIUrl":"https://doi.org/10.1109/ISCC53001.2021.9631421","url":null,"abstract":"Similarity (distance) measurement among network features (e.g. IP address, MAC address, port number, and protocol, etc.) based on network logs is a critical step for data mining in intrusion detection, anomaly prediction, and log analysis. A practical approach is necessarily accurate, fast, and incremental due to the dynamic network environment. However, existing solutions fail to satisfy these demands simultaneously. Therefore, we propose a novel unsupervised network feature embedding approach: Network Vector (NeVe). It learns the similarity from context information by introducing a natural language processing algorithm GloVe. Since the network data is more timeliness with an almost infinite corpus size, we adjust the algorithm to adapt the input data format and design a fast scalable online update mechanism. Our evaluation demonstrates that NeVe can achieve the highest accuracy with minimal time consumption (13 ~ 15 times faster) compared with the state-of-the-art approach.","PeriodicalId":270786,"journal":{"name":"2021 IEEE Symposium on Computers and Communications (ISCC)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129130611","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
Output Security for Multi-user Augmented Reality using Federated Reinforcement Learning 基于联邦强化学习的多用户增强现实输出安全
2021 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2021-09-05 DOI: 10.1109/ISCC53001.2021.9631507
F. Wang, Yanwei Liu, Jinxia Liu, A. Argyriou, Liming Wang, Zhen Xu
{"title":"Output Security for Multi-user Augmented Reality using Federated Reinforcement Learning","authors":"F. Wang, Yanwei Liu, Jinxia Liu, A. Argyriou, Liming Wang, Zhen Xu","doi":"10.1109/ISCC53001.2021.9631507","DOIUrl":"https://doi.org/10.1109/ISCC53001.2021.9631507","url":null,"abstract":"With the rapid advancements in Augmented Reality, the number of AR users is gradually increasing and the multiuser AR ecosystem is on the rise. Currently, AR applications usually present results without limitations, which causes great latent danger to users, so it is necessary to apply strategies to ensure the safe output of AR. Due to the environmental diversities among the distributed users, the traditional approaches designed for single-user AR are not efficient for multi-user AR applications. Considering the characteristics of multi-user AR scenarios, we propose a multi-user AR output strategy model based on Federated Reinforcement Learning. With the device-fog-cloud hierarchical architecture, the proposed models are obtained first by Reinforcement Learning on users' devices, and are then hierarchically aggregated on the fog nodes and cloud server. We performed extensive AR simulations in Unity and obtained the results that show our method can avoid several security problems existent in multi-user AR applications.","PeriodicalId":270786,"journal":{"name":"2021 IEEE Symposium on Computers and Communications (ISCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116414283","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
Improving classification accuracy of acoustic real-world urban data using sensors physical redundancy 利用传感器物理冗余提高声学真实城市数据的分类精度
2021 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2021-09-05 DOI: 10.1109/ISCC53001.2021.9631402
Ester Vidaña-Vila, R. Alsina-Pagès, Joan Navarro
{"title":"Improving classification accuracy of acoustic real-world urban data using sensors physical redundancy","authors":"Ester Vidaña-Vila, R. Alsina-Pagès, Joan Navarro","doi":"10.1109/ISCC53001.2021.9631402","DOIUrl":"https://doi.org/10.1109/ISCC53001.2021.9631402","url":null,"abstract":"Latest advances in modern society together with the increase of the population living in urban areas have transformed these environments into noisy spaces. Current regulations limit the amount of noise-per-source that can impact the population. Hence, automatically identifying acoustic events in urban environments is of great interest for public administrations to preserve citizens' health. Therefore, alternatives that are typically composed of expensive sensing devices committed to individually survey a specific area have been researched. The purpose of this paper is to assess the performance of an alternative approach composed of a low-cost acoustic wireless sensor network that takes advantage of physical redundancy. Specifically, the evaluated system incorporates a deep neural network running in each sensor node and a distributed consensus protocol that implements a set of heuristics to benefit from the classification results of neighboring nodes surveying the same area (i.e., physical redundancy). To evaluate this system, real-world acoustic data were collected simultaneously from four different spots of the same crossroad in the centre of Barcelona and further processed by the system. Obtained results suggest that physical redundancy of sensors improves the classifier's confidence and increases the classification accuracy.","PeriodicalId":270786,"journal":{"name":"2021 IEEE Symposium on Computers and Communications (ISCC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116425825","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
An Agent-Based Model to Study the Impact of Non-Pharmaceutical Interventions During Covid-19 Pandemic on Social Isolation 基于agent的模型研究Covid-19大流行期间非药物干预对社会隔离的影响
2021 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2021-09-05 DOI: 10.1109/ISCC53001.2021.9631551
Simranpreet Kaur, Pooya Moradian Zadeh
{"title":"An Agent-Based Model to Study the Impact of Non-Pharmaceutical Interventions During Covid-19 Pandemic on Social Isolation","authors":"Simranpreet Kaur, Pooya Moradian Zadeh","doi":"10.1109/ISCC53001.2021.9631551","DOIUrl":"https://doi.org/10.1109/ISCC53001.2021.9631551","url":null,"abstract":"COVID-19 pandemic has posed detrimental effects worldwide, affecting almost every primary sector. Many government and health organizations implemented non-pharmaceutical interventions such as physical distancing, lockdown, and quarantine, to mitigate the spread of the virus. Studies have shown that a connection exists between social isolation and health risks experienced by individuals. Thus, this research proposes an agent-based model to address the impact of varying interventions in our society. For simulation purposes, the SEIR model is followed, and agents are categorized into two classes based on their pace of movement, low and high mobility agents. These are further classified into four different states: susceptible, infected, recovered, and dead depending upon their changing health status. Various parameters are used in this research to imitate real-time physical situations while formulating the simulation environment before and after the pandemic. For validation, the simulation environment is made similar to the real-world society.","PeriodicalId":270786,"journal":{"name":"2021 IEEE Symposium on Computers and Communications (ISCC)","volume":"30 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114135596","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
Virtual Resource Composition for Allocation Management in VCC Networks 面向VCC网络分配管理的虚拟资源组成
2021 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2021-09-05 DOI: 10.1109/ISCC53001.2021.9631536
Binal Tejani, R. E. Grande
{"title":"Virtual Resource Composition for Allocation Management in VCC Networks","authors":"Binal Tejani, R. E. Grande","doi":"10.1109/ISCC53001.2021.9631536","DOIUrl":"https://doi.org/10.1109/ISCC53001.2021.9631536","url":null,"abstract":"Vehicular Ad-hoc Networks (VANETs) have contributed significantly towards improving road traffic management and safety. VANETs, integrated with Vehicular Clouds, enable underutilized vehicular resources for efficient resource management, fulfilling service requests. This work introduces the concept of clustering resources from nearby vehicles to form Combined Resource Units (CRUs). These units contribute to fulfilling user service requirements while avoiding the difficult task of matching user requests with the available resources of an individual vehicle. CRU composition is helpful, especially for the heterogeneity of vehicles. The vehicle resources are clustered into CRUs based on three different sized pools, making the service matching process more time-efficient. Previous works have adopted stochastic models for resource clustering configurations. However, this paper adopts distinct search algorithms for CRU composition, which are computationally less complex. Results showed that light-weight search algorithms, such as SSA, achieved close to 80% of resource availability without over-assembling CRUs in higher density scenarios.","PeriodicalId":270786,"journal":{"name":"2021 IEEE Symposium on Computers and Communications (ISCC)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114313300","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
首页 上一页 下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信