Opin vísindi

 

Nýlega bætt við

Verk
Crossing the Academia-Practice Divide in Interaction Design
(Association for Computing Machinery, 2026-04-13) Nocera, José Abdelnour; Churchill, Elizabeth F.; Clemmensen, Torkil; Lárusdóttir, Marta Kristín; Macchia, Teresa; Rey, Marta; Russell-Rose, Tony; Smits, Aletta; Oliver, Nuria; Shamma, David A.; Candello, Heloisa; Cesar, Pablo; Lopes, Pedro; Artizzu, Valentino; Draxler, Fiona; Lopez, Gustavo; Reinschluessel, Anke V.; Tong, Xin; Toups Dugas, Phoebe O.; Department of Computer Science
The divide between academic research and professional practice in interaction design continues to challenge how methods, ethics, and innovation are understood and applied. This CHI 2026 meet-up creates a forum where academics, practitioners, and industry leaders can reflect together, share experiences, and explore collaborations. Structured activities will help participants map shared concerns (such as ethics in AI, sustainability, usability in context, and evolving educational practices) while also strengthening cross-sector connections and identifying opportunities for action. The aim is to cultivate a practice-aware, inclusive community that ensures HCI research remains connected, relevant, and impactful. The meet-up capitalizes on the conversations and relationships sparked at ARPPID 2025 (Academic Research and Professional Practice in Interaction Design), a working conference that brought these issues to the fore, extending them into the CHI community and charting directions for future collaboration.
Verk
Consent banners, dark patterns, and GDPR infringements in online gambling : Evidence from a systematic audit and online experiment
(2026-08) McGarrigle, Jack; Torrance, Jamie; Quigley, Martyn; Dymond, Simon; Department of Psychology
Online gambling operators collect vast amounts of consumer data to track behaviour and personalise inducements. Under the General Data Protection Regulation (GDPR), access to these data requires user consent, obtained via pop-up consent banners. However, such banners tend to exhibit “dark patterns” or designs which nudge users towards accepting data sharing. To date, little is known about the extent of such dark patterns in online gambling. Here, we investigated the format of consent banners used on UK gambling websites and assessed how they may influence behaviour. Study 1 reports an audit of all UK-licensed gambling sites ( n = 624). We found that 86% of banners exhibited at least one dark pattern, while GDPR infringements were also identified: 24% of sites offered no option to reject tracking and over two-thirds (67%) processed personally identifiable data prior to obtaining consent. Only 1 in 7 or 14% of sites were GDPR compliant. In Study 2, an online randomised experiment was conducted, whereby participants ( n = 615) were assigned to different consent banners within a simulated gambling platform. The most common banner identified in Study 1 significantly increased acceptance of tracking and produced significantly lower alignment between user choices and preferences. No association between banner decisions and self-reported gambling harm severity was detected. Overall, our findings reveal widespread dark patterns and non-compliance of GDPR requirements on UK online gambling sites, influencing users towards unintended data sharing. These findings highlight the need for stronger regulatory enforcement and stricter consent banner design standards to protect consumers.
Verk
Typing Fallback Functions : A Semantic Approach to Type Safe Smart Contracts
(Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2026-06-25) Lybech, Stian; Gorla, Daniele; Aceto, Luca; Krebbers, Robbert; Silva, Alexandra; Department of Computer Science
This paper develops semantic typing in a smart-contract setting to ensure type safety of code that uses statically untypable language constructs, such as the fallback function. The idea is that the creator of a contract on the blockchain equips code containing such constructs with a formal proof of its type safety, given in terms of the semantics of types. Then, a user of the contract only needs to check the validity of the provided “proof certificate” of type safety. This is a form of proof-carrying code, which naturally fits with the immutable nature of the blockchain environment. As a concrete application of our approach, we focus on ensuring information flow control and non-interference for TinySol, a distilled version of the Solidity language, through security types. We provide the semantics of types in terms of a typed operational semantics of TinySol and we express the proofs of safety as coinductively-defined typing interpretations, which can be represented compactly via up-to techniques, similar to those used for bisimilarity. We also show how our machinery can be used to type the typical pointer-to-implementation pattern based on the fallback function and to reject a distilled version of the infamous Parity Multisig Wallet Attack.
Verk
Computational Design and Analysis of a High-Isolation 5G MIMO Antenna Using a Binary GWO-Optimized Pixelated Metasurface
(2026-04) Ülgü, Mehmet; Karaaslan, Muharrem; Atcı, Ahmet; Wang, Lulu; Altıntaş, Olcay; Department of Engineering
Compact 5G millimeter-wave (mm-Wave) multiple-input multiple-output (MIMO) systems face a serious challenge as high isolation is required for high spectral efficiency. This paper presents a novel computational design framework for enhancing the isolation of a two-port ultra-wideband (UWB) MIMO antenna, specifically targeting the 5G n257 band (26.5–29.5 GHz). A pixelated metasurface is presented and optimized with the help of a binary-coded Grey Wolf Optimizer (B-GWO) algorithm through a MATLAB-Computer Simulation Technology (CST) co-simulation interface, which is used in contrast to some conventional decoupling structures. A Geometric Mirror Symmetry method is used to accelerate the optimization process, which halves the number of optimization variables and significantly reduces the computational load. Crucially, this symmetry is also a fundamental requirement to ensure that the reflection coefficients ((Formula presented.), (Formula presented.)) of the antennas remain identical. The proposed design achieves isolation levels better than 20 dB across the entire target band, reaching a peak isolation of (Formula presented.) dB at (Formula presented.) GHz, while maintaining reflection coefficients ((Formula presented.), (Formula presented.)) below (Formula presented.) dB. The MIMO diversity performance is comprehensively validated with an Envelope Correlation Coefficient (ECC) (Formula presented.), a Diversity Gain (DG) of (Formula presented.) dB, and a Total Active Reflection Coefficient (TARC) (Formula presented.) dB. Moreover, the suppression of surface waves enhances the realized gain to (Formula presented.) dBi, providing a (Formula presented.) dB improvement over the reference antenna. In addition, an equivalent passive RLC circuit model is constructed to observe the physical process of the pixelated surface, which shows the optimized structure as a band stop filter at the coupling frequency. The high correlation of the Equivalent Circuit Model and full-wave simulation outcomes confirms that the suggested design procedure is a strong verification alternative to physical fabrication.
Verk
Byzantine Consensus in the Partially Authenticated Setting
(Association for Computing Machinery, 2026-07-01) Lenzen, Christoph; Loss, Julian; Shi, Kecheng; Wagner, Benedikt; Department of Computer Science
Byzantine Agreement and Broadcast are traditionally studied in one of two extremes: the authenticated setting, where a public key infrastructure (PKI) enables universally verifiable signatures and yields higher fault tolerance, and the unauthenticated setting, where no PKI is available and resilience necessarily drops. Motivated by Proof-of-Stake blockchains, where only a stable subset of participants (e.g., validators) have registered long-term keys while others do not, we initiate a systematic study of consensus in the partially authenticated setting, where a subset of parties are registered in a PKI and the remaining parties are unregistered.We provide a nearly complete feasibility characterization of the resilience as a function of the number s of registered parties among n total parties. First, we show that Byzantine Agreement or Byzantine Broadcast with an unregistered sender is possible if and only if t ≤ max{⌈s/2⌉, ⌈n/3⌉} - 1, matching a simple protocol and an impossibility bound. Second, for Byzantine Broadcast with a registered sender, we give a deterministic synchronous broadcast protocol tolerating up to t ≤ s + ⌈(n - s)/3⌉ - 1 Byzantine faults (equivalently, 3t < n + 2s); while we present the binary case in the main body for clarity, our techniques extend to an efficient multivalued protocol. We complement this with a matching lower bound in a strengthened leakage model in which the adversary learns each party's private state at the end of every round, ruling out both deterministic protocols and randomized protocols that rely only on short-lived secrets and the basic signing/verification interface.

Flokkar í Opnum vísindum

Veldu flokk til að skoða.

Niðurstöður 1 - 9 af 9

Öll gögn í Opnum vísindum eru vernduð af ákvæðum höfundalaga og með öllum réttindum áskildum, nema annað sé tekið fram.