| 1. |
- Frasheri, Mirgita, et al.
(författare)
-
Ethics of autonomous collective decision-making : The caesar framework
- 2022
-
Ingår i: Science and Engineering Ethics. - : Springer Nature. - 1353-3452 .- 1471-5546. ; 28:6
-
Tidskriftsartikel (refereegranskat)abstract
- In recent years, autonomous systems have become an important research area and application domain, with a significant impact on modern society. Such systems are characterized by different levels of autonomy and complex communication infrastructures that allow for collective decision-making strategies. There exist several publications that tackle ethical aspects in such systems, but mostly from the perspective of a single agent. In this paper we go one step further and discuss these ethical challenges from the perspective of an aggregate of autonomous systems capable of collective decision-making. In particular, in this paper, we propose the Caesar approach through which we model the collective ethical decision-making process of a group of actors—agents and humans, as well as define the building blocks for the agents participating in such a process, namely Caesar agents. Factors such as trust, security, safety, and privacy, which affect the degree to which a collective decision is ethical, are explicitly captured in Caesar. Finally, we argue that modeling the collective decision-making in Caesar provides support for accountability.
|
|
| 2. |
- Gulisano, Vincenzo, 1982, et al.
(författare)
-
STRETCH : Virtual Shared-Nothing Parallelism for Scalable and Elastic Stream Processing
- 2022
-
Ingår i: IEEE Transactions on Parallel and Distributed Systems. - : IEEE COMPUTER SOC. - 1045-9219 .- 1558-2183. ; 33:12, s. 4221-4238
-
Tidskriftsartikel (refereegranskat)abstract
- Stream processing applications extract value from raw data through Directed Acyclic Graphs of data analysis tasks. Shared-nothing (SN) parallelism is the de-facto standard to scale stream processing applications. Given an application, SN parallelism ins9tantiates several copies of each analysis task, making each instance responsible for a dedicated portion of the overall analysis, and relies on dedicated queues to exchange data among connected instances. On the one hand, SN parallelism can scale the execution of applications both up and out since threads can run task instances within and across processes/nodes. On the other hand, its lack of sharing can cause unnecessary overheads and hinder the scaling up when threads operate on data that could be jointly accessed in shared memory. This trade-off motivated us in studying a way for stream processing applications to leverage shared memory and boost the scale up (before the scale out) while adhering to the widely-adopted and SN-based APIs for stream processing applications. We introduce STRETCH, a framework that maximizes the scale up and offers instantaneous elastic reconfigurations (without state transfer) for stream processing applications. We propose the concept of Virtual Shared-Nothing (VSN) parallelism and elasticity and provide formal definitions and correctness proofs for the semantics of the analysis tasks supported by STRETCH, showing they extend the ones found in common Stream Processing Engines. We also provide a fully implemented prototype and show that STRETCH's performance exceeds that of state-of-the-art frameworks such as Apache Flink and offers, to the best of our knowledge, unprecedented ultra-fast reconfigurations, taking less than 40 ms even when provisioning tens of new task instances.
|
|
| 3. |
- Momeni, Mahdi, et al.
(författare)
-
On the Bar Installation Order for the Automated Fabrication of Rebar Cages
- 2022
-
Ingår i: Proceedings of the International Symposium on Automation and Robotics in Construction. - : International Association for Automation and Robotics in Construction (IAARC). - 9789526952420 ; , s. 508-511
-
Konferensbidrag (refereegranskat)abstract
- Robotics automation is a promising solution for the fabrication of structures made out of reinforced concrete. The reinforcement is often installed directly in the form and barby-bar. Using bigger pre-fabricated units (cages) may be beneficial for saving construction time and better labor safety. In this paper, we focus on the problem of automating the generation of a plan for the installation of rebars, given the digital twin of a desired reinforcement cage design, and of its basic components. More specifically, the plan describes the assembling order for the rebars such that (i) it is possible to fabricate the reinforcement cage by the robots, and (ii) the end product is the final reinforcement cage, ready for installation in the form for the concrete structure. In this paper, we propose an algorithm to automatically compute a feasible installation order for a generic rebar cage. The feasibility of the generated order is also case studied and simulated on a simplified rebar cage under the given assumptions.
|
|
