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

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

筛选
英文 中文
Performance of Intelligent Reflecting Surface Based-FSO Link Under Strong Turbulence and Spatial Jitter 强湍流和空间抖动下基于智能反射面的fso链路性能研究
2023 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2023-07-09 DOI: 10.1109/ISCC58397.2023.10218315
Takumi Ishida, C. B. Naila, Hiraku Okada, M. Katayama
{"title":"Performance of Intelligent Reflecting Surface Based-FSO Link Under Strong Turbulence and Spatial Jitter","authors":"Takumi Ishida, C. B. Naila, Hiraku Okada, M. Katayama","doi":"10.1109/ISCC58397.2023.10218315","DOIUrl":"https://doi.org/10.1109/ISCC58397.2023.10218315","url":null,"abstract":"Intelligent reflecting surfaces (IRSs) are an emerging technology that can be used to alleviate the requirements of a strict line of sight in free-space optical communication (FSO) systems. This paper investigates the performance of an IRS-assisted FSO system under the conditions of strong atmospheric turbulence fluctuations, taking into account the impact of the spatial jitter at the transmitter and the IRS. A closed-form for the bit-error rate (BER) has been derived. The impact of the strong atmospheric turbulence is characterized using the K-distribution. The obtained results demonstrate that the performance depends on the system configuration as well as the transmitter and IRS jitter. Furthermore, we show that optimal placement of the IRS can improve the BER.","PeriodicalId":265337,"journal":{"name":"2023 IEEE Symposium on Computers and Communications (ISCC)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116132448","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
Improved Flaky Test Detection with Black-Box Approach and Test Smells 基于黑盒方法和测试气味的改进片状测试检测
2023 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2023-07-09 DOI: 10.1109/ISCC58397.2023.10217934
David Carmo, Luísa Gonçalves, A. Dias, Nuno Pombo
{"title":"Improved Flaky Test Detection with Black-Box Approach and Test Smells","authors":"David Carmo, Luísa Gonçalves, A. Dias, Nuno Pombo","doi":"10.1109/ISCC58397.2023.10217934","DOIUrl":"https://doi.org/10.1109/ISCC58397.2023.10217934","url":null,"abstract":"Flaky tests can pose a challenge for software development, as they produce inconsistent results even when there are no changes to the code or test. This leads to unreliable results and makes it difficult to diagnose and troubleshoot any issues. In this study, we aim to identify flaky test cases in software development using a black-box approach. Flaky test cases are unreliable indicators of code quality and can cause issues in software development. Our proposed model, Fast-Flaky, achieved the best results in the cross-validation results. In the per-project validation, the results showed an overall increase in accuracy but decreased in other metrics. However, there were some projects where the results improved with the proposed pre-processing techniques. These results provide practitioners in software development with a method for identifying flaky test cases and may inspire further research on the effectiveness of different pre-processing techniques or the use of additional test smells.","PeriodicalId":265337,"journal":{"name":"2023 IEEE Symposium on Computers and Communications (ISCC)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114572476","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
A GNN-Based Rate Limiting Framework for DDoS Attack Mitigation in Multi-Controller SDN 多控制器SDN中基于gnn的DDoS攻击限速框架
2023 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2023-07-09 DOI: 10.1109/ISCC58397.2023.10218204
Ali El Kamel
{"title":"A GNN-Based Rate Limiting Framework for DDoS Attack Mitigation in Multi-Controller SDN","authors":"Ali El Kamel","doi":"10.1109/ISCC58397.2023.10218204","DOIUrl":"https://doi.org/10.1109/ISCC58397.2023.10218204","url":null,"abstract":"This paper proposes a proactive protection against DDoS attacks in SDN that is based on dynamically monitoring rates of hosts and penalizing misbehaving ones through a weight-based rate limiting mechanism. Basically, this approach relies on the power of Graph Neural Networks (GNN) to leverage online deep learning. First, an encoder-decoder function converts a time-series vector of a host features to an embedding representation. Then, GraphSAGE uses hosts' embedding vectors to learn latent features of switches which are used to forecast next time-step values. Predicted values are inputted to a multi-loss DNN model to compute two discounts that are applied to weights associated to source edges using mutli-hop SDG-based backpropagation. Realistic experiments show that the proposed solution succeeds in minimizing the impact of DDoS attacks on both the controllers and the switches regarding the PacketIn arrival rate at the controller and the rate of accepted requests.","PeriodicalId":265337,"journal":{"name":"2023 IEEE Symposium on Computers and Communications (ISCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127001598","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
Revisiting Data Poisoning Attacks on Deep Learning Based Recommender Systems 回顾基于深度学习的推荐系统的数据中毒攻击
2023 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2023-07-09 DOI: 10.1109/ISCC58397.2023.10218302
Zhiye Wang, Baisong Liu, Chennan Lin, Xueyuan Zhang, Ce Hu, Jiangcheng Qin, Linze Luo
{"title":"Revisiting Data Poisoning Attacks on Deep Learning Based Recommender Systems","authors":"Zhiye Wang, Baisong Liu, Chennan Lin, Xueyuan Zhang, Ce Hu, Jiangcheng Qin, Linze Luo","doi":"10.1109/ISCC58397.2023.10218302","DOIUrl":"https://doi.org/10.1109/ISCC58397.2023.10218302","url":null,"abstract":"Deep learning based recommender systems(DLRS) as one of the up-and-coming recommender systems, and their robustness is crucial for building trustworthy recommender systems. However, recent studies have demonstrated that DLRS are vulnerable to data poisoning attacks. Specifically, an unpopular item can be promoted to regular users by injecting well-crafted fake user profiles into the victim recommender systems. In this paper, we revisit the data poisoning attacks on DLRS and find that state-of-the-art attacks suffer from two issues: user-agnostic and fake-user-unitary or target-item-agnostic, reducing the effectiveness of promotion attacks. To gap these two limitations, we proposed our improved method Generate Targeted Attacks(GTA), to implement targeted attacks on vulnerable users defined by user intent and sensitivity. We initialize the fake users by adding seed items to address the cold start problems of fake users so that we can implement targeted attacks. Our extensive experiments on two real-world datasets demonstrate the effectiveness of GTA.","PeriodicalId":265337,"journal":{"name":"2023 IEEE Symposium on Computers and Communications (ISCC)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127258942","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
Optical Intra- and Inter-Rack Switching Architecture for Scalable, Low-Latency Data Center Networks 用于可扩展、低延迟数据中心网络的光机架内和机架间交换体系结构
2023 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2023-07-09 DOI: 10.1109/ISCC58397.2023.10217969
G. Drainakis, P. Baziana, A. Bogris
{"title":"Optical Intra- and Inter-Rack Switching Architecture for Scalable, Low-Latency Data Center Networks","authors":"G. Drainakis, P. Baziana, A. Bogris","doi":"10.1109/ISCC58397.2023.10217969","DOIUrl":"https://doi.org/10.1109/ISCC58397.2023.10217969","url":null,"abstract":"In this paper we propose a DC network (DCN) architecture that interconnects servers in the intra-rack and inter-rack domain, utilizing optical switching at each domain. The proposed interconnection techniques are studied as an intermediate step before migrating the entire DCN to all-optical schemes. Unlike other studies, we study the server-to-server communication across the whole DCN. For the performance evaluation we produce numerical results for throughput and end-to-end delay for three traffic classes co-existing in DCN s. The numerical analysis reveals that bandwidth utilization reaches 90% and 100% in the intra- and inter- domain respectively. Meanwhile, the maximum end-to-end delay for the highest priority packets under congested load is lower than 0.56 and 0.41 µs for the two examined intra-rack capacity scenarios of 400 and 600 Gbps respectively. A comparative study shows that our solution can effectively interconnect up to 10000 servers with lower environmental footprint and end-to-end delay than other DCN s.","PeriodicalId":265337,"journal":{"name":"2023 IEEE Symposium on Computers and Communications (ISCC)","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124289699","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
CANL LoRa: Collision Avoidance by Neighbor Listening for Dense LoRa Networks CANL LoRa:密集LoRa网络的邻居侦听避免碰撞
2023 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2023-07-09 DOI: 10.1109/ISCC58397.2023.10218282
Guillaume Gaillard, C. Pham
{"title":"CANL LoRa: Collision Avoidance by Neighbor Listening for Dense LoRa Networks","authors":"Guillaume Gaillard, C. Pham","doi":"10.1109/ISCC58397.2023.10218282","DOIUrl":"https://doi.org/10.1109/ISCC58397.2023.10218282","url":null,"abstract":"The current medium access in LoRa, involving strategies very similar to early ALOHA systems, does not scale for future denser LoRa networks, subject to many collisions. Semtech's Channel Activity Detection (CAD) feature enables to implement a carrier sense (CS) in LoRa WANs, but its unreliability at short distance dramatically decreases its efficiency for classical CS strategies. We present CANL, a novel LoRa channel access approach based on an asynchronous collision avoidance (CA) mechanism and operating without the CAD procedure. Extensive simulations using an extended LoRaSim confirm the performance of CANL in a wide range of configurations. The results are promising and show that the proposed CA approach can greatly increase the delivery ratio in dense LoRa networks compared to a classical CS strategy while keeping the energy consumption at a reasonable level.","PeriodicalId":265337,"journal":{"name":"2023 IEEE Symposium on Computers and Communications (ISCC)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121981171","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 eXplainable Artificial Intelligence Method for Deep Learning-Based Face Detection in Paintings 基于深度学习的绘画人脸检测的可解释人工智能方法
2023 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2023-07-09 DOI: 10.1109/ISCC58397.2023.10218048
Siwar Ben Gamra, E. Zagrouba, A. Bigand
{"title":"An eXplainable Artificial Intelligence Method for Deep Learning-Based Face Detection in Paintings","authors":"Siwar Ben Gamra, E. Zagrouba, A. Bigand","doi":"10.1109/ISCC58397.2023.10218048","DOIUrl":"https://doi.org/10.1109/ISCC58397.2023.10218048","url":null,"abstract":"Recently, despite the impressive success of deep learning, eXplainable Artificial Intelligence (XAI) is becoming increasingly important research area for ensuring transparency and trust in deep models, especially in the field of artwork analysis. In this paper, we conduct an analysis of major research contribution milestones in perturbation-based XAI methods and propose a novel iterative method based guided perturbations to explain face detection in Tenebrism painting images. Our method is independent of the model's architecture, outperforms the state-of-the-art method and requires very little computational resources (no need for GPUs). Quantitative and qualitative evaluation shows effectiveness of the proposed method.","PeriodicalId":265337,"journal":{"name":"2023 IEEE Symposium on Computers and Communications (ISCC)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122532046","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
Detecting Ethereum Phishing Scams with Temporal Motif Features of Subgraph 基于子图时间基序特征的以太坊网络钓鱼诈骗检测
2023 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2023-07-09 DOI: 10.1109/ISCC58397.2023.10218023
Yunfei Wang, Hao Wang, Xiaozhen Lu, Lu Zhou, L. Liu
{"title":"Detecting Ethereum Phishing Scams with Temporal Motif Features of Subgraph","authors":"Yunfei Wang, Hao Wang, Xiaozhen Lu, Lu Zhou, L. Liu","doi":"10.1109/ISCC58397.2023.10218023","DOIUrl":"https://doi.org/10.1109/ISCC58397.2023.10218023","url":null,"abstract":"In recent years, Ethereum has become a hotspot for criminal activities such as phishing scams that seriously compromise Ethereum transaction security. However, existing methods cannot accurately model Ethereum transaction data and make full use of the temporal structure information and basic account features. In this paper, we propose an Ethereum phishing detection framework based on temporal motif features. By designing a sampling method, we convert labeled Ethereum addresses into multi-directed transaction subgraphs with time and amount to avoid losing structure and attribute information. To learn representations for subgraphs, we define and extract the temporal motif features and general transaction features. Extensive experiments on Support Vector Machine, Random Forest, Logistic Regression, and XGBoost demonstrate that our method significantly outperforms all baselines and provides an effective phishing scams detection for Ethereum.","PeriodicalId":265337,"journal":{"name":"2023 IEEE Symposium on Computers and Communications (ISCC)","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126252123","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
BVSNO: Binary Code Vulnerability Detection Based on Slice Semantic and Node Order 基于分片语义和节点顺序的二进制代码漏洞检测
2023 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2023-07-09 DOI: 10.1109/ISCC58397.2023.10218114
Ningning Cui, Liwei Chen, Gang Shi
{"title":"BVSNO: Binary Code Vulnerability Detection Based on Slice Semantic and Node Order","authors":"Ningning Cui, Liwei Chen, Gang Shi","doi":"10.1109/ISCC58397.2023.10218114","DOIUrl":"https://doi.org/10.1109/ISCC58397.2023.10218114","url":null,"abstract":"The proliferation of code reuse and the prevalence of CPU architecture and compilation environment diversity inevitably lead to many similar cross-platform binary vulnerability codes. This paper designs a deep learning model based on slice semantic and node order to detect similarity vulnerabilities. Firstly, it traverses the program dependence graph (PDG) forward and backward from the library/API function node to generate the binary slice and then uses the bidirectional long short-term memory (BLSTM) network and attention mechanism to form the semantic feature vector of the binary slice. Secondly, it extracts the order information of the slice nodes in the PDG and forms the adjacency matrix, which is then fed into the convolutional neural network (CNN) to form the order feature vector. Finally, the semantic and order feature vector are fused and inputted into the siamese network for similarity vulnerability detection. The detection results show that our method can effectively detect vulnerability.","PeriodicalId":265337,"journal":{"name":"2023 IEEE Symposium on Computers and Communications (ISCC)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126264092","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
6Former: Transformer-Based IPv6 Address Generation former:基于变压器的IPv6地址生成
2023 IEEE Symposium on Computers and Communications (ISCC) Pub Date : 2023-07-09 DOI: 10.1109/ISCC58397.2023.10218311
Li-Yu Daisy Liu, Xing Li
{"title":"6Former: Transformer-Based IPv6 Address Generation","authors":"Li-Yu Daisy Liu, Xing Li","doi":"10.1109/ISCC58397.2023.10218311","DOIUrl":"https://doi.org/10.1109/ISCC58397.2023.10218311","url":null,"abstract":"Active network scanning in IPv6 is hindered by the vast address space of IPv6. Researchers have proposed various target generation methods, which are proved effective for reducing scanning space, to solve this problem. However, the current landscape of address generation methods is characterized by either low hit rates or limited applicability. To overcome these limitations, we propose 6Former, a novel target generation system based on Transformer. 6Former integrates a discriminator and a generator to improve hit rates and overcome usage scenarios limitations. Our experimental findings demonstrate that 6Former improves hit rates by a minimum of 38.6% over state-of-the-art generation approaches, while reducing time consumption by 31.6% in comparison to other language model-based methods.","PeriodicalId":265337,"journal":{"name":"2023 IEEE Symposium on Computers and Communications (ISCC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126444880","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
首页 上一页 下一页 尾页
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学术官方微信