Proceedings of the 2021 Australasian Computer Science Week Multiconference最新文献_第2页

FEPAC: A Framework for Evaluating Parallel Algorithms on Cluster Architectures FEPAC:一个评估集群架构上并行算法的框架

Proceedings of the 2021 Australasian Computer Science Week Multiconference Pub Date : 2021-02-01 DOI: 10.1145/3437378.3444363

Mehul Warade, Jean-Guy Schneider, Kevin Lee

{"title":"FEPAC: A Framework for Evaluating Parallel Algorithms on Cluster Architectures","authors":"Mehul Warade, Jean-Guy Schneider, Kevin Lee","doi":"10.1145/3437378.3444363","DOIUrl":"https://doi.org/10.1145/3437378.3444363","url":null,"abstract":"For many years, computer scientists have explored the computing power of so-called computing clusters to address performance requirements of computationally intensive tasks. Historically, computing clusters have been optimized with run-time performance in mind, but increasingly energy consumption has emerged as a second dimension that needs to be considered when optimizing cluster configurations. However, there is a lack of generally available tool support to experiment with cluster and algorithm configurations in order to identify “sweet-spots” with regards to both, run-time performance and energy consumption, respectively. In this work, we are introducing FEPAC, a framework for the automated evaluation of parallel algorithms on different cluster architectures and different deployments of software processes to hardware nodes, allowing users to explore the impact of different configurations on run-time properties of their computations. As proof of concept, the utility of the framework is demonstrated on a custom-built Raspberry Pi 3B+ cluster using different types of parallel algorithms as benchmarks. The experiments evaluate matrix multiplication, kmeans, and OpenCV on varying sizes of cluster, and showed that although a larger cluster improves performance, there is often a trade-off between energy and computation time.","PeriodicalId":146881,"journal":{"name":"Proceedings of the 2021 Australasian Computer Science Week Multiconference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129093759","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

A Traffic and Resource Aware Online Storm Scheduler 一个流量和资源意识在线风暴调度程序

Proceedings of the 2021 Australasian Computer Science Week Multiconference Pub Date : 2021-02-01 DOI: 10.1145/3437378.3444365

Tianyu Qi, M. A. Rodriguez

{"title":"A Traffic and Resource Aware Online Storm Scheduler","authors":"Tianyu Qi, M. A. Rodriguez","doi":"10.1145/3437378.3444365","DOIUrl":"https://doi.org/10.1145/3437378.3444365","url":null,"abstract":"Streaming applications have become widespread with the advent of big data and IoT. They are latency-sensitive applications that aim to process vast amounts of data in near real time. They are usually modelled as directed graphs and their deployment and orchestration in a cluster of nodes are managed by distributed stream processing systems. These systems are responsible for placing the graph components within the cluster nodes, which determines the application’s communication overhead and ultimately affects performance metrics such as latency and throughput. This work presents an adaptive, heuristic-based, scheduling algorithm for distributed stream processing systems that aims to minimize the latency and maximize the throughput of streaming applications deployed in heterogeneous clusters, while considering the resource constraints of the available nodes. The proposed approach uses a graph partitioning algorithm and real time traffic data monitored from a deployed application to derive a near-optimal operator placement plan that minimizes inter-node communication and balances the overall communication load distribution. We evaluated our approach using three micro-benchmark and two practical applications, and the results demonstrate that our scheduler outperforms the default scheduler of a popular stream processing system and a state-of-the-art algorithm, improving throughput by up to 106% and reducing complete latency by up to 58% for most applications.","PeriodicalId":146881,"journal":{"name":"Proceedings of the 2021 Australasian Computer Science Week Multiconference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129598219","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

Application of Graphs for Story Generation in Video Games 图形在电子游戏故事生成中的应用

Proceedings of the 2021 Australasian Computer Science Week Multiconference Pub Date : 2021-02-01 DOI: 10.1145/3437378.3442693

Iwona Grabska-Gradzinska, L. Nowak, W. Palacz, E. Grabska

{"title":"Application of Graphs for Story Generation in Video Games","authors":"Iwona Grabska-Gradzinska, L. Nowak, W. Palacz, E. Grabska","doi":"10.1145/3437378.3442693","DOIUrl":"https://doi.org/10.1145/3437378.3442693","url":null,"abstract":"The paper presents the system based on the layered hierarchical graphs for game plot description implemented in Godot Engine using the JSON format. The aim of the presented research is to create a tool that both supports the decision-making process and helps multiple writers to collaborate in creating a game world. Constructing a layered hierarchical graph provides information about game plot description, while the proposed graph generation system based on JSON data format allows designers and story writers to create game worlds. A key feature of the graph generation system is that it describes game worlds using a sequence of generation rules which represent the player's actions. On the one hand, the proposed approach helps the story writers to control the impact of the created story elements on the game world. On the other hand, it allows world designers to use procedural generation of narration chains, analyze and test the designed game plots. An additional goal of this approach strongly focused on using the JSON data format to describe actions that can be taken in world states is the impact of JSON data structures on the application of graph rules, which may be important in the problems of artificial intelligence.","PeriodicalId":146881,"journal":{"name":"Proceedings of the 2021 Australasian Computer Science Week Multiconference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129676484","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}

引用次数: 2

A snapshot analysis of publicly available BYOD policies 对公开可用的BYOD策略的快照分析

Proceedings of the 2021 Australasian Computer Science Week Multiconference Pub Date : 2021-02-01 DOI: 10.1145/3437378.3437394

B. Scott, Raina Mason, Patryk Szewczyk

引用次数: 2

A comparative analysis of sepsis digital phenotyping methods 脓毒症数字表型方法的比较分析

Proceedings of the 2021 Australasian Computer Science Week Multiconference Pub Date : 2021-02-01 DOI: 10.1145/3437378.3437398

Anna Fedyukova, D. Pires, D. Capurro

{"title":"A comparative analysis of sepsis digital phenotyping methods","authors":"Anna Fedyukova, D. Pires, D. Capurro","doi":"10.1145/3437378.3437398","DOIUrl":"https://doi.org/10.1145/3437378.3437398","url":null,"abstract":"Health data captured in Electronic health records (EHRs) have enabled the development of computational approaches to improve patient management and treatment, including early diagnosis of severe conditions such as sepsis. The validity of these efforts, however, largely relies on which sepsis definition is used and the quality of the underlying data. Here we tested different sepsis definitions to better understand how phenotyping approaches may impact the classification accuracy of sepsis prediction algorithms. To assess the extent to which sepsis definitions (dis)agree with each other, we have analised a large cohort of patients admitted to the ICU (over 22,000) from MIMIC-IV. Cases were classified as septic and non-septic using the Sepsis-3 definition as a standard and compared with different ICD-10-based sepsis phenotyping criteria. Most of administrative sepsis definitions agreed with each other when identifying positive sepsis cases. At the same time, we identified considerable disagreement between Sepsis-3 and administrative definitions. This discrepancy affected machine learning algorithms’ predictive performance. Two algorithms out of three built on Sepsis-3 outperformed models based on other phenotypes. Experiments demonstrate that phenotype definitions can significantly influence a predictive model performance. This highlights the importance of consistent and validated digital phenotyping criteria.","PeriodicalId":146881,"journal":{"name":"Proceedings of the 2021 Australasian Computer Science Week Multiconference","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124344415","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

Open Banking and Electronic Health Records 开放银行和电子健康记录

Proceedings of the 2021 Australasian Computer Science Week Multiconference Pub Date : 2021-02-01 DOI: 10.1145/3437378.3437397

A. Stranieri, A. Mcinnes, M. Hashmi, T. Sahama

引用次数: 7

Establishing a Dialog Agent Policy using Deep Reinforcement Learning in the Psychotherapy Domain 在心理治疗领域使用深度强化学习建立对话代理策略

Proceedings of the 2021 Australasian Computer Science Week Multiconference Pub Date : 2021-02-01 DOI: 10.1145/3437378.3437395

Chester Holt-Quick, J. Warren

{"title":"Establishing a Dialog Agent Policy using Deep Reinforcement Learning in the Psychotherapy Domain","authors":"Chester Holt-Quick, J. Warren","doi":"10.1145/3437378.3437395","DOIUrl":"https://doi.org/10.1145/3437378.3437395","url":null,"abstract":"Recent years have seen a rise in the development and use of dialog agents (chatbots) including as personal friends, coaches and even counsellors (Virtual Counsellor, VC). Some of these [1] employ expert psychotherapy techniques, notably Cognitive Behavioural Therapy (CBT). The usually rule-based dialog policy of these chatbots requires significant authoring effort and can result in overly predictable dialog. This research examines the question of whether using deep reinforcement learning (DRL) to develop an agent dialog policy in the psychotherapy domain is feasible. A framework for DRL for this problem is established including the use of a user simulator that is configured through CBT manual transcript excerpts. It is found that a dialog policy conforming to transcript excerpts can be learned such that core CBT skills can be emulated. A hoped-for reduction in authoring effort is not seen, but a modest amount of local generalisation of the learned CBT skill can be observed which increases when the user simulator is configured with additional rule-based policies. Interesting use of a novel listening dialog move is observed by the trained VC.","PeriodicalId":146881,"journal":{"name":"Proceedings of the 2021 Australasian Computer Science Week Multiconference","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121326877","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}

引用次数: 2

Serverless Edge Computing: Vision and Challenges 无服务器边缘计算:愿景与挑战

Proceedings of the 2021 Australasian Computer Science Week Multiconference Pub Date : 2021-02-01 DOI: 10.1145/3437378.3444367

M. Aslanpour, A. Toosi, C. Cicconetti, B. Javadi, Peter Sbarski, D. Taibi, M. Assunção, S. S. Gill, R. Gaire, S. Dustdar

{"title":"Serverless Edge Computing: Vision and Challenges","authors":"M. Aslanpour, A. Toosi, C. Cicconetti, B. Javadi, Peter Sbarski, D. Taibi, M. Assunção, S. S. Gill, R. Gaire, S. Dustdar","doi":"10.1145/3437378.3444367","DOIUrl":"https://doi.org/10.1145/3437378.3444367","url":null,"abstract":"Born from a need for a pure “pay-per-use” model and highly scalable platform, the “Serverless” paradigm emerged and has the potential to become a dominant way of building cloud applications. Although it was originally designed for cloud environments, Serverless is finding its position in the Edge Computing landscape, aiming to bring computational resources closer to the data source. That is, Serverless is crossing cloud borders to assess its merits in Edge computing, whose principal partner will be the Internet of Things (IoT) applications. This move sounds promising as Serverless brings particular benefits such as eliminating always-on services causing high electricity usage, for instance. However, the community is still hesitant to uptake Serverless Edge Computing because of the cloud-driven design of current Serverless platforms, and distinctive characteristics of edge landscape and IoT applications. In this paper, we evaluate both sides to shed light on the Serverless new territory. Our in-depth analysis promotes a broad vision for bringing Serverless to the Edge Computing. It also issues major challenges for Serverless to be met before entering Edge computing.","PeriodicalId":146881,"journal":{"name":"Proceedings of the 2021 Australasian Computer Science Week Multiconference","volume":"168 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133565772","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}

引用次数: 100

Classifying infective keratitis using a deep learning approach

Proceedings of the 2021 Australasian Computer Science Week Multiconference Pub Date : 2021-02-01 DOI: 10.1145/3437378.3437388

Shelda Sajeev, M. Senthil

{"title":"Classifying infective keratitis using a deep learning approach","authors":"Shelda Sajeev, M. Senthil","doi":"10.1145/3437378.3437388","DOIUrl":"https://doi.org/10.1145/3437378.3437388","url":null,"abstract":"Early diagnosis of infective keratitis is critical as it is a vision-threatening condition that can lead to significant vision loss and ocular morbidity. Diagnosis of infective keratitis done through clinical findings and slit- lamp examination is intricate and requires high expertise. Most infective keratitis cases are challenging to the clinicians. This paper proposes a deep learning approach enabling a more accurate diagnoses and treatment of infective keratitis. As a first step towards developing a comprehensive deep learning-based disease detection tool, we have classified bacterial and viral keratitis based on slit-lamp images and convolutional neutral network. A total of 446 keratitis images (bacterial – 271 and viral - 175) were available for the study. The experiment was conducted with different CNN configurations: with different input shape (image sizes: 64x64, 128x128, 256x256, 400x400) with two and three convolution layers. Image size 64x64 with three convolutional layer and no pooling achieved the highest performance (sensitivity =0.715, specificity= 0.880, precision= 0.807, accuracy= 0.812 and AUC=0.856). Experimental results show that even with a small dataset CNN was able to produce a good classification result.","PeriodicalId":146881,"journal":{"name":"Proceedings of the 2021 Australasian Computer Science Week Multiconference","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127833516","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}

引用次数: 6

Modeling and Emulation of an Osmotic Computing Ecosystem using OsmoticToolkit 使用OsmoticToolkit对渗透计算生态系统进行建模和仿真

Proceedings of the 2021 Australasian Computer Science Week Multiconference Pub Date : 2021-02-01 DOI: 10.1145/3437378.3444366

Alina Buzachis, Daiana Boruta, M. Villari, Josef Spillner

引用次数: 3