Applied Computing Review最新文献_第6页

NFT Trust Survey 信托调查

IF 1

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

Jean-Marc Seigneur, Suzana Moreno

引用次数: 0

Stateful Adaptive Streams with Approximate Computing and Elastic Scaling 具有近似计算和弹性缩放的有状态自适应流

IF 1

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

João Francisco, Miguel E. Coimbra, P. Neto, Felix Freitag, L. Veiga

{"title":"Stateful Adaptive Streams with Approximate Computing and Elastic Scaling","authors":"João Francisco, Miguel E. Coimbra, P. Neto, Felix Freitag, L. Veiga","doi":"10.1145/3555776.3577858","DOIUrl":"https://doi.org/10.1145/3555776.3577858","url":null,"abstract":"The model of approximate computing can be used to increase performance or optimize resource usage in stream and graph processing. It can be used to satisfy performance requirements (e.g., throughput, lag) in stream processing by reducing the effort that applications need to process datasets. There are currently multiple stream processing platforms, and most of them do not natively support approximate results. A recent one, Stateful Functions, is an API that uses Flink to enable developers to easily build stream and graph processing applications. It also retains Flink's features like stateful computations, fault-tolerance, scalability, control events and its graph processing library Gelly. Herein we present Approxate, an extension over this platform to support approximate results. It can also support more efficient stream and graph processing by allocating available resources adaptively, driven by user-defined requirements on throughput, lag, and latency. This extension enables flexibility in computational trade-offs such as trading accuracy for performance. The user can choose which metrics should be guaranteed at the cost of others, and/or the accuracy. Approxate incorporates approximate computing (using load shedding) with adaptive accuracy and resource manegement in state-of-the-art stream processing platforms, which are not targeted in other relevant related work. It does not require significant modifications to application code, and minimizes imbalance in data source representation when dropping events.","PeriodicalId":42971,"journal":{"name":"Applied Computing Review","volume":"6 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2023-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78035215","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

Towards Deployment of Mobile Robot driven Preference Learning for User-State-Specific Thermal Control in A Real-World Smart Space 在现实世界的智能空间中，移动机器人驱动的偏好学习用于用户状态特定的热控制

IF 1

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

Geon Kim, Hyunju Kim, Dongman Lee

引用次数: 1

Acala: Aggregate Monitoring for Geo-Distributed Cluster Federations Acala:地理分布式集群联合的聚合监控

IF 1

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

Chih-Kai Huang, G. Pierre

引用次数: 2

FedFAME: A Data Augmentation Free Framework based on Model Contrastive Learning for Federated Semi-Supervised Learning 联邦半监督学习中基于模型对比学习的数据增强自由框架

IF 1

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

Shubham Malaviya, Manish Shukla, Pratik Korat, S. Lodha

引用次数: 0

Federated Hyperparameter Optimisation with Flower and Optuna 基于Flower和Optuna的联邦超参数优化

IF 1

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

J. Parra-Ullauri, Xunzheng Zhang, A. Bravalheri, R. Nejabati, D. Simeonidou

{"title":"Federated Hyperparameter Optimisation with Flower and Optuna","authors":"J. Parra-Ullauri, Xunzheng Zhang, A. Bravalheri, R. Nejabati, D. Simeonidou","doi":"10.1145/3555776.3577847","DOIUrl":"https://doi.org/10.1145/3555776.3577847","url":null,"abstract":"Federated learning (FL) is an emerging distributed machine learning technique in which multiple clients collaborate to learn a model under the management of a central server. An FL system depends on a set of initial conditions (i.e., hyperparameters) that affect the system's performance. However, defining a good choice of hyperparameters for the central server and clients is a challenging problem. Hyperparameter tuning in FL often requires manual or automated searches to find optimal values. Nonetheless, a noticeable limitation is the high cost of algorithm evaluation for server and client models, making the tuning process computationally expensive and time-consuming. We propose an implementation based on integrating the FL framework Flower, and the prime optimisation software Optuna for automated and efficient hyperparameter optimisation (HPO) in FL. Through this combination, it is possible to tune hyperparameters in both clients and server online, aiming to find the optimal values at runtime. We introduce the HPO factor to describe the number of rounds that the HPO will take place, and the HPO rate that defines the frequency for updating the hyperparameters and can be used for pruning. The HPO is managed by the FL server which updates clients' hyperparameters, with an HPO rate, using state-of-the-art optimisation algorithms enabled by Optuna. We tested our approach by updating multiple client models simultaneously in popular image recognition datasets which produced promising results compared to baselines.","PeriodicalId":42971,"journal":{"name":"Applied Computing Review","volume":"62 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2023-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72646118","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 formal analysis of Dutch Generic Integral Tunnel Design models 荷兰通用整体隧道设计模型的形式化分析

IF 1

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

Kevin H. J. Jilissen, P. Dieleman, J. F. Groote

引用次数: 0

Are alternatives to backpropagation useful for training Binary Neural Networks? An experimental study in image classification 反向传播的替代方法对训练二元神经网络有用吗?图像分类的实验研究

IF 1

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

Ben Crulis, Barthélémy Serres, Cyril de Runz, G. Venturini

{"title":"Are alternatives to backpropagation useful for training Binary Neural Networks? An experimental study in image classification","authors":"Ben Crulis, Barthélémy Serres, Cyril de Runz, G. Venturini","doi":"10.1145/3555776.3577674","DOIUrl":"https://doi.org/10.1145/3555776.3577674","url":null,"abstract":"Current artificial neural networks are trained with parameters encoded as floating point numbers that occupy lots of memory space at inference time. Due to the increase in size of deep learning models, it is becoming very difficult to consider training and using artificial neural networks on edge devices such as smartphones. Binary neural networks promise to reduce the size of deep neural network models as well as increasing inference speed while decreasing energy consumption and so allow the deployment of more powerful models on edge devices. However, binary neural networks are still proven to be difficult to train using the backpropagation based gradient descent scheme. We propose to adapt to binary neural networks two training algorithms considered as promising alternatives to backpropagation but for continuous neural networks. We provide experimental comparative results for image classification including the backpropagation baseline on the MNIST, Fashion MNIST and CIFAR-10 datasets in both continuous and binary settings. The results demonstrate that binary neural networks can not only be trained using alternative algorithms to backpropagation but can also be shown to lead better performance and a higher tolerance to the presence or absence of batch normalization layers.","PeriodicalId":42971,"journal":{"name":"Applied Computing Review","volume":"35 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2023-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77059636","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

Alleviating High Gas Costs by Secure and Trustless Off-chain Execution of Smart Contracts 通过安全、无信任的智能合约链下执行来降低高昂的天然气成本

IF 1

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

Soroush Farokhnia, Amir Kafshdar Goharshady

{"title":"Alleviating High Gas Costs by Secure and Trustless Off-chain Execution of Smart Contracts","authors":"Soroush Farokhnia, Amir Kafshdar Goharshady","doi":"10.1145/3555776.3577833","DOIUrl":"https://doi.org/10.1145/3555776.3577833","url":null,"abstract":"Smart contracts are programs that are executed on the blockchain and can hold, manage and transfer assets in the form of cryptocurrencies. The contract's execution is then performed on-chain and is subject to consensus, i.e. every node on the blockchain network has to run the function calls and keep track of their side-effects including updates to the balances and contract's storage. The notion of gas is introduced in most programmable blockchains, which prevents DoS attacks from malicious parties who might try to slow down the network by performing time-consuming and resource-heavy computations. While the gas idea has largely succeeded in its goal of avoiding DoS attacks, the resulting fees are extremely high. For example, in June-September 2022, on Ethereum alone, there has been an average total gas usage of 2,706.8 ETH ≈ 3,938,749 USD per day. We propose a protocol for alleviating these costs by moving most of the computation off-chain while preserving enough data on-chain to guarantee an implicit consensus about the contract state and ownership of funds in case of dishonest parties. We perform extensive experiments over 3,330 real-world Solidity contracts that were involved in 327,132 transactions in June-September 2022 on Ethereum and show that our approach reduces their gas usage by 40.09 percent, which amounts to a whopping 442,651 USD.","PeriodicalId":42971,"journal":{"name":"Applied Computing Review","volume":"137 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2023-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77813297","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

Sec2vec: Anomaly Detection in HTTP Traffic and Malicious URLs Sec2vec: HTTP流量和恶意url的异常检测

IF 1

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

Mateusz Gniewkowski, H. Maciejewski, T. Surmacz, Wiktor Walentynowicz

{"title":"Sec2vec: Anomaly Detection in HTTP Traffic and Malicious URLs","authors":"Mateusz Gniewkowski, H. Maciejewski, T. Surmacz, Wiktor Walentynowicz","doi":"10.1145/3555776.3577663","DOIUrl":"https://doi.org/10.1145/3555776.3577663","url":null,"abstract":"In this paper, we show how methods known from Natural Language Processing (NLP) can be used to detect anomalies in HTTP requests and malicious URLs. Most of the current solutions focusing on a similar problem are either rule-based or trained using manually selected features. Modern NLP methods, however, have great potential in capturing a deep understanding of samples and therefore improving the classification results. Other methods, which rely on a similar idea, often ignore the interpretability of the results, which is so important in machine learning. We are trying to fill this gap. In addition, we show to what extent the proposed solutions are resistant to concept drift. In our work, we compare three different vectorization methods: simple BoW, fastText, and the current state-of-the-art language model RoBERTa. The obtained vectors are later used in the classification task. In order to explain our results, we utilize the SHAP method. We evaluate the feasibility of our methods on four different datasets: CSIC2010, UNSW-NB15, MALICIOUSURL, and ISCX-URL2016. The first two are related to HTTP traffic, the other two contain malicious URLs. The results we show are comparable to others or better, and most importantly - interpretable.","PeriodicalId":42971,"journal":{"name":"Applied Computing Review","volume":"46 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"2023-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79851654","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