9607 research outputs found
Sort by
Extending perceived stereo baseline with vector-base amplitude panning and polarity inversion
No full textWe propose an extension to Vector-Base Amplitude Panning (VBAP) that simulates audio positioning beyond the physical baseline of a stereo speaker pair by introducing polarity inversion. The extension to VBAP, where audio sources are positioned on the line segment between loudspeaker vectors, refers to enabling panning outside the speaker positions, and thereby flipping the polarity of the signal from the opposite side speaker. The implementation allows for real-time processing. Listening experiments were conducted in a room with low reverberation on a pair of Bloomline Omnidrive Pro Mk II speakers, with eight participants who localized audio samples inside and beyond the stereo field. Results show that participants were able to perceive sound source positions up to 60% wider than the physical speaker span. The findings imply that by the polarity inversion VBAP can be generalised to, simulate audio positioning outside the speaker bounds and gives rise to a tool for creating virtual sound sources beyond the physical boundaries of the room in future immersive 3D applications
Measuring the Sociolinguistic Patterns of Climate Debate Polarization in the Facebook Context
No full textThis research investigates the sociolinguistic patterns characterizing the polarized climate change debate on Facebook, focusing on the communication dynamics occurring within pro-climate action and anti-climate action stakeholders. Our study specifically aims to (1) identify the variations in language codes among these groups, and (2) assess how these linguistic nuances affect the respective audiences. For this goal, we compiled a comprehensive list of relevant English-speaking stakeholders in the climate debate and collected over 2000 of their posts spanning several months. To analyse the textual content they produced, we defined a series of quantitative language code indicators, measuring the readability, concreteness, subjectivity and scientificity of the language used, alongside topic modeling to dissect the discussion themes. Furthermore, we applied regression modeling to assess the impact of language code variations on the audience responses of the two debate groups. The results revealed significant variations in audience reactions across the debate spectrum, with the pro-climate audience responding more to variations in language style, whereas the anti-climate audience exhibited a distinct response to shifts in topic focus
In the Relational Sandbox: Deep Democracy and Technology
Get PDFDesigning for democracy often emphasizes values while overlooking the role of relationships in shaping civic life. This workshop explores how relationality – encompassing social ties, political agency, and economic conditions – shapesgrassroots democratic experiments and the technologies they inspire. Grounded in principles of deep democracy and participatory approaches, we use the Relational Sandbox to conduct small- scale experiments on how democratic technologies can redistribute power and how locally rooted designs can resist extractive technology development. Through the lens of relational civics, we co-imagine strategies prioritizing meaningful, democratic technologies over capital-driven ones. The workshop invites designers, activists, and researchers to co-develop strategies and design guidelines that place relationships at the center ofdemocratic practice
Learned Cost Models for Query Optimization: From Batch to Streaming Systems.
No full textLearned cost models (LCMs) have recently gained traction as a promising alternative to traditional cost estimation techniques in data management, offering improved accuracy by capturing complex interactions between queries, data, and runtime behavior. While initially developed for batch systems, LCMs are now increasingly applied to stream processing as well, where real-time demands pose new challenges. This tutorial presents the first unified overview of LCMs across both batch and stream processing systems, examining their role as essential components in modern query optimizers. We explore key aspects of LCM design—including input representations and model architectures—and highlight how these models deal with query optimization tasks
New Bounds for the Ideal Proof System in Positive Characteristic.
No full textIn this work, we prove upper and lower bounds over fields of positive characteristics for several fragments of the Ideal Proof System (IPS), an algebraic proof system introduced by Grochow and Pitassi (J. ACM 2018). Our results extend the works of Forbes, Shpilka, Tzameret, and Wigderson (Theory of Computing 2021) and also of Govindasamy, Hakoniemi, and Tzameret (FOCS 2022). These works primarily focused on proof systems over fields of characteristic 0, and we are able to extend these results to positive characteristic. The question of proving general IPS lower bounds over positive characteristic is motivated by the important question of proving AC0[p]-Frege lower bounds. This connection was observed by Grochow and Pitassi (J. ACM 2018). Additional motivation comes from recent developments in algebraic complexity theory due to Forbes (CCC 2024) who showed how to extend previous lower bounds over characteristic 0 to positive characteristic. In our work, we adapt the functional lower bound method of Forbes et al. (Theory of Computing 2021) to prove exponential-size lower bounds for various subsystems of IPS. In order to establish these size lower bounds, we first prove a tight degree lower bound for a variant of Subset Sum over positive characteristic. This forms the core of all our lower bounds. Additionally, we derive upper bounds for the instances presented above. We show that they have efficient constant-depth IPS refutations. This demonstrates that constant-depth IPS refutations are stronger than the proof systems considered above even in positive characteristic. We also show that constant-depth IPS can efficiently refute a general class of instances, namely all symmetric instances, thereby further uncovering the strength of these algebraic proofs in positive characteristic
AI as artificial ignorance
No full textFirst, we present a number of simple tests of AI, which document a profound gap between the hype and the reality of AI. Second, we explain the gap in terms of a confusion of artificial general intelligence with generative artificial intelligence in the promotion of AI. Finally, we analyze AI as bullshit (in the strong philosophical sense of Harry Frankfurt). We find that AI and bullshit are similar in the sense that both prioritize rhetoric over truth. They mix true, false, and ambiguous statements in ways that make it difficult to distinguish which is which. AI sounds convincing even when it's wrong. As such, current AI is more about persuasion than about truth. This is a problem because it means AI produces faulty and ignorant results. For now, we need to be highly skeptical of AI for its lack of a concept of truth
Sticking with Affect in HCI and Design: from Interaction to Relation
No full textThis paper argues for the continued significance of affect in HCI research and design practice. Drawing on a seminal paper by Boehner et al. presented at the 2005 decennial Aarhus conference, the paper traces genealogies of Affective Computing and Affective Interaction Design, examining them within the general context of the evolution of affect studies during the past two decades. Building on Boehner et al.'s proposed shift from understanding affect as information to exploring affect as interaction, the paper advocates for a conceptual advancement from interaction to relation, facilitating engagement with more-than-human design concerns in an era defined by far-from-equilibrium tipping points and crises. Through examination of three affective exemplars, the paper identifies four key themes – affect and the more-than human, affective encounters and modulation over time, affect and care across ecologies and affect in crisis – that provide key insights, concepts and directions for sticking with affect as relational in future explorations in HCI and design, maintaining productive tensions and complexities as essential elements of theoretical and practical advancement across affect-centered design approaches
A Sound and Complete Projection for Global Types.
No full textMultiparty session types is a typing discipline used to write specifications, known as global types, for branching and recursive message-passing systems. A necessary operation on global types is projection to abstractions of local behaviour, called local types. Typically, this is a computable partial function that given a global type and a role erases all details irrelevant to this role. Computable projection functions in the literature are either unsound or too restrictive when dealing with recursion and branching. Recent work has taken a more general approach to projection defining it as a coinductive, but not computable, relation. Our work defines a new computable projection function that is sound and complete with respect to its coinductive counterpart and, hence, equally expressive. All results have been mechanised in the Coq proof assistant