Applied Computing Review最新文献_第7页

MP-DDPG: Optimal Latency-Energy Dynamic Offloading Scheme in Collaborative Cloud Networks 协同云网络中最优延迟-能量动态卸载方案

IF 1

Applied Computing Review Pub Date : 2023-03-27 DOI: 10.1145/3555776.3577767

Jui Mhatre, Ahyoung Lee

引用次数: 0

S-ViT: Sparse Vision Transformer for Accurate Face Recognition S-ViT:用于精确人脸识别的稀疏视觉变换

IF 1

Applied Computing Review Pub Date : 2023-03-27 DOI: 10.1145/3555776.3577640

Geunsu Kim, Gyudo Park, Soohyeok Kang, Simon S. Woo

{"title":"S-ViT: Sparse Vision Transformer for Accurate Face Recognition","authors":"Geunsu Kim, Gyudo Park, Soohyeok Kang, Simon S. Woo","doi":"10.1145/3555776.3577640","DOIUrl":"https://doi.org/10.1145/3555776.3577640","url":null,"abstract":"Most of the existing face recognition applications using deep learning models have leveraged CNN-based architectures as the feature extractor. However, recent studies have shown that in computer vision tasks, vision transformer-based models often outperform CNN-based models. Therefore, in this work, we propose a Sparse Vision Transformer (S-ViT) based on the Vision Transformer (ViT) architecture to improve the face recognition tasks. After the model is trained, S-ViT tends to have a sparse distribution of weights compared to ViT, so we named it according to these characteristics. Unlike the conventional ViT, our proposed S-ViT adopts image Relative Positional Encoding (iRPE) method for positional encoding. Also, S-ViT has been modified so that all token embeddings, not just class token, participate in the decoding process. Through extensive experiment, we showed that S-ViT achieves better performance in closed-set than the other baseline models, and showed better performance than the baseline ViT-based models. For example, when using ArcFace as the loss function in the identification protocol, S-ViT achieved up to 3.27% higher accuracy than ResNet50. We also show that the use of ArcFace loss functions yields greater performance gains in S-ViT than in baseline models. In addition, S-ViT has an advantage in cost-performance trade-off because it tends to be more robust to the pruning technique than the underlying model, ViT. Therefore, S-ViT offers the additional advantage, which can be applied more flexibly in the target devices with limited resources.","PeriodicalId":42971,"journal":{"name":"Applied Computing Review","volume":"18 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2023-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81609493","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

Rotated-DETR: an End-to-End Transformer-based Oriented Object Detector for Aerial Images 旋转- detr:一种基于端到端变换的航空图像定向目标检测器

IF 1

Applied Computing Review Pub Date : 2023-03-27 DOI: 10.1145/3555776.3577745

Gil-beom Lee, Jinbeom Kim, Taejune Kim, Simon S. Woo

{"title":"Rotated-DETR: an End-to-End Transformer-based Oriented Object Detector for Aerial Images","authors":"Gil-beom Lee, Jinbeom Kim, Taejune Kim, Simon S. Woo","doi":"10.1145/3555776.3577745","DOIUrl":"https://doi.org/10.1145/3555776.3577745","url":null,"abstract":"Oriented object detection in aerial images is a challenging task due to the highly complex backgrounds and objects with arbitrary oriented and usually densely arranged. Existing oriented object detection methods adopt CNN-based methods, and they can be divided into three types: two-stage, one-stage, and anchor-free methods. All of them require non-maximum suppression (NMS) to eliminate the duplicated predictions. Recently, object detectors based on the transformer remove hand-designed components by directly solving set prediction problems via performing bipartite matching, and achieve state-of-the-art performances in general object detection. Motivated by this research, we propose a transformer-based oriented object detector named Rotated DETR with oriented bounding boxes (OBBs) labeling. We embed the scoring network to reduce the tokens corresponding to the background. In addition, we apply a proposal generator and iterative proposal refinement module in order to provide proposals with angle information to the transformer decoder. Rotated DETR achieves state-of-the-art performance on the single-stage and anchor-free oriented object detectors on DOTA, UCAS-AOD, and DIOR-R datasets with only 10% feature tokens. In the experiment, we show the effectiveness of the scoring network and iterative proposal refinement module.","PeriodicalId":42971,"journal":{"name":"Applied Computing Review","volume":"10 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2023-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89429724","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

Scalable Coercion-Resistant E-Voting under Weaker Trust Assumptions 弱信任假设下的可伸缩抗强制电子投票

IF 1

Applied Computing Review Pub Date : 2023-03-27 DOI: 10.1145/3555776.3578730

Thomas Haines, Johannes Müller, Iñigo Querejeta-Azurmendi

{"title":"Scalable Coercion-Resistant E-Voting under Weaker Trust Assumptions","authors":"Thomas Haines, Johannes Müller, Iñigo Querejeta-Azurmendi","doi":"10.1145/3555776.3578730","DOIUrl":"https://doi.org/10.1145/3555776.3578730","url":null,"abstract":"Electronic voting (e-voting) is regularly used in many countries and organizations for legally binding elections. In order to conduct such elections securely, numerous e-voting systems have been proposed over the last few decades. Notably, some of these systems were designed to provide coercion-resistance. This property protects against potential adversaries trying to swing an election by coercing voters. Despite the multitude of existing coercion-resistant e-voting systems, to date, only few of them can handle large-scale Internet elections efficiently. One of these systems, VoteAgain (USENIX Security 2020), was originally claimed secure under similar trust assumptions to state-of-the-art e-voting systems without coercion-resistance. In this work, we review VoteAgain's security properties. We discover that, unlike originally claimed, VoteAgain is no more secure than a trivial voting system with a completely trusted election authority. In order to mitigate this issue, we propose a variant of VoteAgain which effectively mitigates trust on the election authorities and, at the same time, preserves VoteAgain's usability and efficiency. Altogether, our findings bring the state of science one step closer to the goal of scalable coercion-resistant e-voting being secure under reasonable trust assumptions.","PeriodicalId":42971,"journal":{"name":"Applied Computing Review","volume":"22 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2023-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89267605","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

A Performant and Secure Single Sign-On System Using Microservices 基于微服务的高性能安全单点登录系统

IF 1

Applied Computing Review Pub Date : 2023-03-27 DOI: 10.1145/3555776.3577869

Mahyar Tourchi Moghaddam, Andreas Edal Pedersen, William Walter Lillebroe Bolding, T. Worm

引用次数: 0

Estimating Phenotypic Characteristics of Tuberculosis Bacteria 估计结核杆菌的表型特征

IF 1

Applied Computing Review Pub Date : 2023-03-27 DOI: 10.1145/3555776.3578609

D. Sloan, E. Dombay, W. Sabiiti, B. Mtafya, Ognjen Arandelovic, Marios Zachariou

{"title":"Estimating Phenotypic Characteristics of Tuberculosis Bacteria","authors":"D. Sloan, E. Dombay, W. Sabiiti, B. Mtafya, Ognjen Arandelovic, Marios Zachariou","doi":"10.1145/3555776.3578609","DOIUrl":"https://doi.org/10.1145/3555776.3578609","url":null,"abstract":"Microscopy analysis of sputum images for bacilli screening is a common method used for both diagnosis and therapy monitoring of tuberculosis (TB). Nonetheless, it is a challenging procedure, since sputum examination is time-consuming and needs highly competent personnel to provide accurate results which are important for clinical decision-making. In addition, manual fluorescence microscopy examination of sputum samples for tuberculosis diagnosis and treatment monitoring is a subjective operation. In this work, we automate the process of examining fields of view (FOVs) of TB bacteria in order to determine the lipid content, and bacterial length and width. We propose a modified version of the UNet model to rapidly localise potential bacteria inside a FOV. We introduce a novel method that uses Fourier descriptors to exclude contours that do not belong to the class of bacteria, hence minimising the amount of false positives. Finally, we propose a new feature as a means of extracting a representation fed into a support vector multi-regressor in order to estimate the length and width of each bacterium. Using a real-world data corpus, the proposed method i) outperformed previous methods, and ii) estimated the cell length and width with a root mean square error of less than 0.01%.","PeriodicalId":42971,"journal":{"name":"Applied Computing Review","volume":"51 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2023-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85130465","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

Realism versus Performance for Adversarial Examples Against DL-based NIDS 针对基于dl的NIDS的对抗性示例的现实性与性能

IF 1

Applied Computing Review Pub Date : 2023-03-27 DOI: 10.1145/3555776.3577671

Huda Ali Alatwi, C. Morisset

{"title":"Realism versus Performance for Adversarial Examples Against DL-based NIDS","authors":"Huda Ali Alatwi, C. Morisset","doi":"10.1145/3555776.3577671","DOIUrl":"https://doi.org/10.1145/3555776.3577671","url":null,"abstract":"The application of deep learning-based (DL) network intrusion detection systems (NIDS) enables effective automated detection of cyberattacks. Such models can extract valuable features from high-dimensional and heterogeneous network traffic with minimal feature engineering and provide high accuracy detection rates. However, it has been shown that DL can be vulnerable to adversarial examples (AEs), which mislead classification decisions at inference time, and several works have shown that AEs are indeed a threat against DL-based NIDS. In this work, we argue that these threats are not necessarily realistic. Indeed, some general techniques used to generate AE manipulate features in a way that would be inconsistent with actual network traffic. In this paper, we first implement the main AE attacks selected from the literature (FGSM, BIM, PGD, NewtonFool, CW, DeepFool, EN, Boundary, HSJ, ZOO) for two different datasets (WSN-DS and BoT-IoT) and we compare their relative performance. We then analyze the perturbation generated by these attacks and use the metrics to establish a notion of \"attack unrealism\". We conclude that, for these datasets, some of these attacks are performant but not realistic.","PeriodicalId":42971,"journal":{"name":"Applied Computing Review","volume":"198 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2023-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86228950","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

Improving the Quality of Public Transportation by Dynamically Adjusting the Bus Departure Time 动态调整公交发车时间提高公共交通质量

IF 1

Applied Computing Review Pub Date : 2023-03-27 DOI: 10.1145/3555776.3577596

Shuheng Cao, S. Thamrin, Arbee L. P. Chen

引用次数: 0

On the Effect of Low-Ranked Documents: A New Sampling Function for Selective Gradient Boosting 关于低排序文档的效果:一种新的用于选择性梯度增强的抽样函数

IF 1

Applied Computing Review Pub Date : 2023-03-27 DOI: 10.1145/3555776.3577597

C. Lucchese, Federico Marcuzzi, S. Orlando

{"title":"On the Effect of Low-Ranked Documents: A New Sampling Function for Selective Gradient Boosting","authors":"C. Lucchese, Federico Marcuzzi, S. Orlando","doi":"10.1145/3555776.3577597","DOIUrl":"https://doi.org/10.1145/3555776.3577597","url":null,"abstract":"Learning to Rank is the task of learning a ranking function from a set of query-documents pairs. Generally, documents within a query are thousands but not all documents are informative for the learning phase. Different strategies were designed to select the most informative documents from the training set. However, most of them focused on reducing the size of the training set to speed up the learning phase, sacrificing effectiveness. A first attempt in this direction was achieved by Selective Gradient Boosting a learning algorithm that makes use of customisable sampling strategy to train effective ranking models. In this work, we propose a new sampling strategy called High_Low_Sampl for selecting negative examples applicable to Selective Gradient Boosting, without compromising model effectiveness. The proposed sampling strategy allows Selective Gradient Boosting to compose a new training set by selecting from the original one three document classes: the positive examples, high-ranked negative examples and low-ranked negative examples. The resulting dataset aims at minimizing the mis-ranking risk, i.e., enhancing the discriminative power of the learned model and maintaining generalisation to unseen instances. We demonstrated through an extensive experimental analysis on publicly available datasets, that the proposed selection algorithm is able to make the most of the negative examples within the training set and leads to models capable of obtaining statistically significant improvements in terms of NDCG, compared to the state of the art.","PeriodicalId":42971,"journal":{"name":"Applied Computing Review","volume":"18 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2023-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81259953","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

Efficient Sanitization Design for LSM-based Key-Value Store over 3D MLC NAND Flash 基于lsm的3D MLC NAND闪存键值存储的高效消毒设计

IF 1

Applied Computing Review Pub Date : 2023-03-27 DOI: 10.1145/3555776.3577780

Liang-Chi Chen, Shu-Qi Yu, Chien-Chung Ho, Wei-Chen Wang, Yung-Chun Li

引用次数: 0