检索结果-内蒙古大学图书馆

IEEE International Conference on Big Data

作者： Andreas Grafberger Mohak Chadha Anshul Jindal Jianfeng Gu Michael Gerndt Chair of Computer Architecture and Parallel Systems Technische Universität München Garching (Near Munich) Germany

ISBN: (纸本)9781665445993

The traditional cloud-centric approach for Deep Learning (DL) requires training data to be collected and processed at a central server which is often challenging in privacy-sensitive domains like healthcare. Towards this, a new learning paradigm called Federated Learning (FL) has been proposed that brings the potential of DL to these domains while addressing privacy and data ownership issues. FL enables clients to learn a shared ML model while keeping the data local. However, conventional FL systems face challenges such as scalability, complex infrastructure management, and wasted compute and incurred costs due to idle clients. These challenges of FL systems closely align with the core problems that serverless computing and Function-as-a-Service (FaaS) platforms aim to solve. These include rapid scalability, no infrastructure management, automatic scaling to zero for idle clients, and a pay-per-use billing model. To this end, we present a novel system and framework for serverless FL, called FedLess. Our system supports multiple commercial and self-hosted FaaS providers and can be deployed in the cloud, on-premise in institutional data centers, and on edge devices. To the best of our knowledge, we are the first to enable FL across a large fabric of heterogeneous FaaS providers while providing important features like security and Differential Privacy. We demonstrate with comprehensive experiments that the successful training of DNNs for different tasks across up to 200 client functions and more is easily possible using our system. Furthermore, we demonstrate the practical viability of our methodology by comparing it against a traditional FL system and show that it can be cheaper and more resource-efficient.

关键词： Training Scalability Computational modeling Serverless computing Training data FAA Big Data

来源：评论

学校读者我要写书评

暂无评论

Semantic Map Learning of Traffic Light to Lane Assignment based on Motion Data

arXiv

引用

arXiv 2023年

作者： Monninger, Thomas Weber, Andreas Staab, Steffen Mercedes-Benz Research & Development North America SunnyvaleCA United States Mercedes-Benz AG Research & Development Stuttgart Germany University of Stuttgart Institute of Parallel and Distributed Systems Stuttgart Germany University of Southampton Electronics and Computer Science Southampton United Kingdom

Understanding which traffic light controls which lane is crucial to navigate intersections safely. Autonomous vehicles commonly rely on High Definition (HD) maps that contain information about the assignment of traffic lights to lanes. The manual provisioning of this information is tedious, expensive, and not scalable. To remedy these issues, our novel approach derives the assignments from traffic light states and the corresponding motion patterns of vehicle traffic. This works in an automated way and independently of the geometric arrangement. We show the effectiveness of basic statistical approaches for this task by implementing and evaluating a pattern-based contribution method. In addition, our novel rejection method includes accompanying safety considerations by leveraging statistical hypothesis testing. Finally, we propose a dataset transformation to re-purpose available motion prediction datasets for semantic map learning. Our publicly available API for the Lyft Level 5 dataset enables researchers to develop and evaluate their own approaches5 Copyright © 2023, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

FEniCS-preCICE: Coupling FEniCS to other simulation software

arXiv

引用

arXiv 2021年

作者： Rodenberg, Benjamin Desai, Ishaan Hertrich, Richard Jaust, Alexander Uekermann, Benjamin Scientific Computing in Computer Science Department of Informatics Technical University of Munich Germany Usability and Sustainability of Simulation Software Institute for Parallel and Distributed Systems University of Stuttgart Germany Simulation of Large Systems Institute for Parallel and Distributed Systems University of Stuttgart Germany

The new software FEniCS-preCICE is a middle software layer, sitting in between the existing finite-element library FEniCS and the coupling library preCICE. The middle layer simplifies coupling (existing) FEniCS application codes to other simulation software via preCICE. To this end, FEniCS-preCICE converts between FEniCS and preCICE mesh and data structures, provides easy-to-use coupling conditions, and manages data checkpointing for implicit coupling. The new software is a library itself and follows a FEniCS-native style. Only a few lines of additional code are necessary to prepare a FEniCS application code for coupling. We illustrate the functionality of FEniCS-preCICE by two examples: a FEniCS heat conduction code coupled to OpenFOAM and a FEniCS linear elasticity code coupled to SU2. The results of both scenarios are compared with other simulation software showing good agreement. © 2021, CC BY-NC-ND.

关键词： Finite element method

来源：评论

学校读者我要写书评

暂无评论

Towards Autoscaling with Guarantees on Kubernetes Clusters

Towards Autoscaling with Guarantees on Kubernetes Clusters

引用

Autonomic Computing and Self-Organizing systems Companion (ACSOS-C), IEEE International Conference on

作者： Stephen Burroughs Helge Dickel Martin van Zijl Vladimir Podolskiy Michael Gerndt Robi Malik Panos Patros ORKA Cloud and Adaptive Systems Lab University of Waikato New Zealand Chair of Computer Architecture and Parallel Systems Technical University of Munich Germany

Autoscaling is used by cloud providers, microser-vices, and edge computing applications to respond to dynamic load fluctuations. A critical direction of research has focused on providing guarantees under uncertainty that the auto scaling system will work as intended-both at design-time and more importantly, at runtime. In this work, we evaluate the efficacy of three complementary methods: A) deterministic finite automata, B) probabilistic process algebra and C) Proportional-Integral-Derivative (PID) control. We experimentally evaluate their efficacy in modelling and verify autoscaling on clusters managed by Kubernetes. Our results suggest that deterministic modelling can provide theoretically optimal guarantees for small deployments; probabilistic algebras are able to capture stochastic behaviours, but benefit from deterministic templates; and control theory benefits by providing a black-box approach for modelling, verification and control.

关键词：

来源：评论

学校读者我要写书评

暂无评论

parallel Quantum Chemistry on Noisy Intermediate-Scale Quantum computers

arXiv

引用

arXiv 2022年

作者： Schade, Robert Bauer, Carsten Tamoev, Konstantin Mazur, Lukas Plessl, Christian Kühne, Thomas D. Paderborn Center for Parallel Computing Paderborn University Germany Dynamics of Condensed Matter and Institute for Sustainable Systems Design Theoretical Chemistry Paderborn University Germany Department for Computer Science Paderborn University Germany

A novel parallel hybrid quantum-classical algorithm for the solution of the quantum-chemical ground-state energy problem on gate-based quantum computers is presented. This approach is based on the reduced density-matrix functional theory (RDMFT) formulation of the electronic structure problem. For that purpose, the density-matrix functional of the full system is decomposed into an indirectly coupled sum of density-matrix functionals for all its subsystems using the adaptive cluster approximation to RDMFT. The approximations involved in the decomposition and the adaptive cluster approximation itself can be systematically converged to the exact result. The solutions for the density-matrix functionals of the effective subsystems involves a constrained minimization over many-particle states that are approximated by parametrized trial states on the quantum computer similarly to the variational quantum eigensolver. The independence of the density-matrix functionals of the effective subsystems introduces a new level of parallelization and allows for the computational treatment of much larger molecules on a quantum computer with a given qubit count. In addition, for the proposed algorithm techniques are presented to reduce the qubit count, the number of quantum programs, as well as its depth. The evaluation of a density-matrix functional as the essential part of our new approach is demonstrated for Hubbard-like systems on IBM quantum computers based on superconducting transmon qubits. Copyright © 2022, The Authors. All rights reserved.

关键词： Quantum theory

来源：评论

学校读者我要写书评

暂无评论

Leveraging Hybrid Classical-Quantum Methods for Efficient Load Rebalancing in HPC 24

Leveraging Hybrid Classical-Quantum Methods for Efficient Lo...

引用

Proceedings of the SC '24 Workshops of the International Conference on High Performance Computing, Network, Storage, and Analysis

作者： Justyna Zawalska Minh Chung Katarzyna Rycerz Laura Schulz Martin Schulz Dieter Kranzlmüller AGH University of Krakow Institute of Computer Science Krakow Poland and Academic Computer Center CYFRONET AGH Krakow Poland Leibniz Supercomputing Centre (LRZ) Garching bei München Germany and MNM-Team Ludwig-Maximilians-Universität München (LMU) Germany Leibniz Supercomputing Centre (LRZ) Garching bei München Germany Leibniz Supercomputing Centre (LRZ) Garching bei München Germany and Chair for Computer Architecture and Parallel Systems Technical University of Munich (TUM) Germany

ISBN: (纸本)9798350355543

Load imbalance is a challenge for parallel applications in High Performance Computing (HPC). It is caused by processes having different execution times or load values, leading to idle or wait times at synchronization points, where faster processes must wait for the slowest process to catch up. To mitigate this issue, applications can employ load balancing (LB) strategies, which migrate load between processes to even out load. This is often referred to as the Load Rebalancing Problem (LRP). While many approaches solving the LRP exist, they can only be heuristics and hence further optimization potential exists. In our work, we turn to a novel approach by using hybrid classical-quantum approaches and present two versions of the constrained quadratic model for solving the LRP; the two differ in how they balance the number of qubits required with the types of applied constraints. We compare the quantum-based methods with classical methods using heuristic algorithms Greedy, Karmarkar--Karp, and ProactLB. We evaluate our approaches using imbalance ratio and speedup as metrics, as well as the number of migrated tasks to indicate overhead caused by migrations. Our results show that the quantum-based methods outperform the classic methods. For example, we need only 1/4 of the number of migrated tasks in a realistic use case compared with classical methods, particularly Greedy and KK, to balance the load.

关键词： CQM

来源：评论

学校读者我要写书评

暂无评论

Deep Isolation Forest for Anomaly Detection

arXiv

引用

arXiv 2022年

作者： Xu, Hongzuo Pang, Guansong Wang, Yijie Wang, Yongjun The College of Computer National University of Defense Technology Changsha410073 China The Science and Technology on Parallel and Distributed Processing Laboratory China The School of Computing and Information Systems Singapore Management University 178902 Singapore

Isolation forest (iForest) has been emerging as arguably the most popular anomaly detector in recent years due to its general effectiveness across different benchmarks and strong scalability. Nevertheless, its linear axis-parallel isolation method often leads to (i) failure in detecting hard anomalies that are difficult to isolate in high-dimensional/non-linear-separable data space, and (ii) notorious algorithmic bias that assigns unexpectedly lower anomaly scores to artefact regions. These issues contribute to high false negative errors. Several iForest extensions are introduced, but they essentially still employ shallow, linear data partition, restricting their power in isolating true anomalies. Therefore, this paper proposes deep isolation forest. We introduce a new representation scheme that utilises casually initialised neural networks to map original data into random representation ensembles, where random axis-parallel cuts are subsequently applied to perform the data partition. This representation scheme facilitates high freedom of the partition in the original data space (equivalent to non-linear partition on subspaces of varying sizes), encouraging a unique synergy between random representations and random partition-based isolation. Extensive experiments show that our model achieves significant improvement over state-of-the-art isolation-based methods and deep detectors on tabular, graph and time series datasets;our model also inherits desired scalability from iForest. © 2022, CC BY.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

Cooperative Air-Ground Instant Delivery by UAVs and Crowdsourced Taxis

Cooperative Air-Ground Instant Delivery by UAVs and Crowdsou...

引用

International Conference on Data Engineering

作者： Junhui Gao Qianru Wang Xin Zhang Juan Shi Xiang Zhao Qingye Han Yan Pan School of Computer Science Northwestern Polytechnical University School of Computer Science and Technology Xidian University National Key Laboratory of Information Systems Engineering National University of Defense Technology Air Force Engineering University Laboratory for Big Data and Decision National University of Defense Technology School of Management Science and Real Estate Chongqing University National Key Laboratory of Parallel and Distributed Computing National University of Defense Technology

ISBN: (数字)9798350317152

ISBN: (纸本)9798350317169

Instant delivery has become a fundamental service in people's daily lives. Different from the traditional express service, the instant delivery has a strict shipping time constraint after being ordered. However, the labor shortage makes it challenging to realize efficient instant delivery. To tackle the problem, researchers have studied to introduce vehicles (i.e., taxis) or Unmanned Aerial Vehicles (UAVs or drones) into instant delivery tasks. Unfortunately, the delivery detour of taxis and the limited battery of UAVs make it hard to meet the rapidly increasing instant delivery demands. Under this circumstance, this paper proposes an air-ground cooperative instant delivery paradigm to maximize the delivery performance and meanwhile minimize the negative effects on the taxi passengers. Specifically, a data-driven delivery potential-demands-aware cooperative strategy is designed to improve the overall delivery performance of both UAVs and taxis as well as the taxi passengers' experience. The experimental results show that the proposed method improves the delivery number by 30.1% and 114.5% compared to the taxi-based and UAV-based instant delivery respectively, and shortens the delivery time by 35.7% compared to the taxi-based instant delivery.

关键词： Autonomous aerial vehicles Data engineering Air to ground communication Trajectory Batteries Time factors Task analysis

来源：评论

学校读者我要写书评

暂无评论

Feature and Performance Comparison of FaaS Platforms

Feature and Performance Comparison of FaaS Platforms

引用

IEEE International Conference on Software Engineering and Service Sciences (ICSESS)

作者： Penghui Ma Peichang Shi Guodong Yi National Key Laboratory of Parallel and Distributed Processing College of Computer Science National University of Defense Technology Changsha China Key Laboratory of Software Engineering for Complex Systems College of Computer Science National University of Defense Technology Changsha China Xiangjiang Lab Changsha China School of Advanced Interdisciplinary Studies Hunan University Of Technology and Business Changsha China

With serverless computing offering more efficient and cost-effective application deployment, the diversity of serverless platforms presents challenges to users, including platform lock-in and costly migration. Moreover, due to the black box nature of function computing, traditional performance benchmarking methods are not applicable, necessitating new studies. This article presents a detailed comparison of six major public cloud function computing platforms and introduces a benchmarking framework for function computing performance. This framework aims to help users make comprehensive comparisons and select the most suitable platform for their specific needs.

关键词：

来源：评论

学校读者我要写书评

暂无评论

parallel quantum chemistry on noisy intermediate-scale quantum computers

引用

Physical Review Research 2022年第3期4卷 033160-033160页

作者： Robert Schade Carsten Bauer Konstantin Tamoev Lukas Mazur Christian Plessl Thomas D. Kühne Paderborn Center for Parallel Computing Paderborn University 33098 Paderborn Germany Dynamics of Condensed Matter and Institute for Sustainable Systems Design Chair of Theoretical Chemistry Paderborn University 33098 Paderborn Germany Department for Computer Science Paderborn University 33098 Paderborn Germany

A parallel hybrid quantum-classical algorithm for the solution of the quantum-chemical ground-state energy problem on gate-based quantum computers is presented. This approach is based on the reduced density-matrix functional theory (RDMFT) formulation of the electronic structure problem. For that purpose, the density-matrix functional of the full system is decomposed into an indirectly coupled sum of density-matrix functionals for all its subsystems using the adaptive cluster approximation to RDMFT. The approximations involved in the decomposition and the adaptive cluster approximation itself can be systematically converged to the exact result. The solutions for the density-matrix functionals of the effective subsystems involves a constrained minimization over many-particle states that are approximated by parametrized trial states on the quantum computer similarly to the variational quantum eigensolver. The independence of the density-matrix functionals of the effective subsystems introduces a new level of parallelization and allows for the computational treatment of much larger molecules on a quantum computer with a given qubit count. In addition, for the proposed algorithm techniques are presented to reduce the qubit count, the number of quantum programs, as well as its depth. The evaluation of a density-matrix functional as the essential part of our approach is demonstrated for Hubbard-like systems on IBM quantum computers based on superconducting transmon qubits.

关键词： Quantum algorithms Quantum software Molecules Superconducting qubits Ab initio molecular dynamics Density matrix methods Electron-correlation calculations Hubbard model Quantum chemistry methods Trial wave functions Variational approach Variational wave functional methods

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：