Polytopes associated to Dihedral Groups

In this note we investigate the convex hull of those $n \times n$-permutation matrices that correspond to symmetries of a regular $n$-gon. We give the complete facet description. As an application, we show that this yields a Gorenstein polytope, and we determine the Ehrhart $h^*$-vector

Access Control for Binary Integrity Protection using Ethereum

The integrity of executable binaries is essential to the security of any device that runs them. At best, a manipulated binary can leave the system in question open to attack, and at worst, it can compromise the entire system by itself. In recent years, supply-chain attacks have demonstrated that binaries can even be compromised unbeknownst to their creators. This, in turn, leads to the dissemination of supposedly valid binaries that need to be revoked later. In this paper, we present and evaluate a concept for publishing and revoking integrity protecting information for binaries, based on the Ethereum Blockchain and its underlying peer-to-peer network. Smart Contracts are used to enforce access control over the publication and revocation of integrity preserving information, whereas the peer-to-peer network serves as a fast, global communication service to keep user clients informed. The Ethereum Blockchain serves as a tamper-evident, publicly-verifiable log of published and revoked binaries. Our implementation incurs costs comparable to registration fees for centralised software distribution platforms but allows publication and revocation of individual binaries within minutes. The proposed concept can be integrated incrementally into existing software distribution platforms, such as package repositories or various app stores

Permutation Polytopes of Cyclic Groups

We investigate the combinatorics and geometry of permutation polytopes associated to cyclic permutation groups, i.e., the convex hulls of cyclic groups of permutation matrices. We give formulas for their dimension and vertex degree. In the situation that the generator of the group consists of at most two orbits, we can give a complete combinatorial description of the associated permutation polytope. In the case of three orbits the facet structure is already quite complex. For a large class of examples we show that there exist exponentially many facets.Comment: 15 page

Acceptance in Incomplete Argumentation Frameworks

A Abstract argumentation frameworks (AFs), originally proposed by Dung, constitute a central formal model for the study of computational aspects of argumentation in AI. Credulous and skeptical acceptance of arguments in a given AF are well-studied problems both in terms of theoretical analysis-especially computational complexity-and the development of practical decision procedures for the problems. However, AFs make the assumption that all attacks between arguments are certain (i.e., present attacks are known to exist, and missing attacks are known to not exist), which can in various settings be a restrictive assumption. A generalization of AFs to incomplete AFs was recently proposed as a formalism that allows the representation of both uncertain attacks and uncertain arguments in AFs. In this article, we explore the impact of allowing for modeling such uncertainties in AFs on the computational complexity of natural generalizations of acceptance problems to incomplete AFs under various central AF semantics. Complementing the complexity-theoretic analysis, we also develop the first practical decision procedures for all of the NP-hard variants of acceptance in incomplete AFs. In terms of complexity analysis, we establish a full complexity landscape, showing that depending on the variant of acceptance and property/semantics, the complexity of acceptance in incomplete AFs ranges from polynomial-time decidable to completeness for Sigma(p)(3). In terms of algorithms, we show through an extensive empirical evaluation that an implementation of the proposed decision procedures, based on boolean satisfiability (SAT) solving, is effective in deciding variants of acceptance under uncertainties. We also establish conditions for what type of atomic changes are guaranteed to be redundant from the perspective of preserving extensions of completions of incomplete AFs, and show that the results allow for considerably improving the empirical efficiency of the proposed SAT-based counterexample-guided abstraction refinement algorithms for acceptance in incomplete AFs for problem variants with complexity beyond NP. (C) 2021 The Authors. Published by Elsevier B.V.Peer reviewe

Bewegter Alltag in Alterszentren der Stadt Zürich : Leitfaden zur Umsetzung eines partizipativen Prozesses zur Förderung von Bewegung und sozialer Teilhabe

Das in diesem Leitfaden beschriebene 3-Phasen-Modell und die entsprechenden Materialien/Illustrationen sollen es ermöglichen, einen „partizipativen Prozesses zur Förderung von Bewegung und sozialer Teilhabe“ in Altersinstitutionen zu planen und durchzuführen

Navigating AI in Personnel Selection: A Scenario-based Study on Applicants\u27 Perceptions

AI-based systems are increasingly deployed on organizational tasks, such as personnel selection decisions. As existing research indicates that applicants generally react negatively to the use of AI in personnel selection, this study examines how organizations can mitigate adverse reactions to fully exploit the benefits of AI. To obtain robust results, we recruited an online sample of German participants (N = 1,852) and presented them with various selection scenarios. Using a between-subject design, the process stage (pre-selection vs. interview) and the degree of process automation (augmented vs. automated) were manipulated. By employing a multidimensional conceptualization of transparency, we show that disclosure and accuracy positively impact procedural justice perceptions, a strong predictor of process quality assessment. This relationship is robust across selection contexts. Results indicate that applicants prefer AI for pre-selection and as human decision support, thus offering overall insights into design choices for AI in selection, optimizing applicant reactions

Use of long-term microdialysis subcutaneous glucose monitoring in the management of neonatal diabetes - A first case report

In neonatal diabetes mellitus (NDM), a rare genetic disorder, insulin therapy is required but the management is difficult. Frequent blood glucose determinations are necessary in most cases. Microdialysis subcutaneous glucose monitoring (MSGM) is feasible in neonates and has been proposed to reduce painful blood sampling and blood loss. We have applied long-term MSGM to a small-fordate female newborn with transient NDM. We found a good correlation of subcutaneous and blood glucose concentration over a wide range of values. MSGM enabled a reduction in blood glucose determinations during optimization of intravenous insulin treatment and initiation of continuous subcutaneous insulin infusion. We conclude that long-term MSGM is feasible and may reduce painful blood sampling and blood loss in NDM. Furthermore, long-term MSGM may hold a potential for avoiding hypoglycemic episodes and earlier discharge. Copyright (C) 2006 S. Karger AG, Basel