Abstract

We show that the average of the maximum teleportation fidelities between all pairs of nodes in a large quantum repeater network is a measure of the resourcefulness of the network as a whole. It can be used to rank networks of arbitrary topologies, with and without loops. For demonstration purposes, we use simple Werner state-based models to characterize some fundamental topologies (the star, the chain, some trees, and also the ring and the complete graph) with this measure in three (semi)realistic scenarios. Most of our results are analytic and apply to arbitrary network sizes. We identify the parameter ranges where these networks can achieve quantum advantages and show the large-N behaviors.

Abstract

With the growing adoption of machine learning models in critical domains, techniques for explaining differences between models have become essential for trust, debugging, and informed deployment. Previous approaches address this by identifying input transformations that cause divergent predictions or by learning joint surrogate models to align and contrast behaviors. These methods often require access to training data and do not produce natural language explanations. In this paper, we introduce SLED, a framework that generates faithful natural language explanations of when and how two ML models converge or diverge in their predictions. SLED first uses gradient-based optimization to synthesize input samples that highlight divergence and convergence patterns, and then leverages a large language model (LLM) to generate explanations grounded in these synthetic samples. Across both text-based (3 tasks, 7 models) and structured (10 tasks, 4 models) classification tasks, we show that SLED explanations are 18--24% more faithful than the strongest baselines. User studies also indicate that SLED explanations achieve a real-world simulatability of 63.5%. Importantly, SLED requires minimal access to training data and generalizes well to real-world samples, enabling transparent and data-efficient model comparison.

Abstract

Flexible capacitive pressure sensors have simple sensing structure, zero-temperature drift, linear response, and high sensitivity, leading to applications in human healthcare including soft and surgical robotics, human machine interaction (HMI) and wearable devices. In this paper, we present a highly compressible multilayer flexible capacitive pressure sensor, based on air/vapour bubble-induced PDMS foam thin-film as dielectric and polypyrrole coated cotton textile as electrodes. An in-situ chemical oxidative polymerisation method was used to synthesize a conducting, large area polypyrrole coated cotton textile. We used this as parallel electrodes on the top and bottom of the bubble-induced PDMS foam. The bubble-induced PDMS film was made by casting of PDMS, mix with specific amounts of ethanol. The top and bottom textile electrodes were then attached to it with the help of silicone adhesive. We observed low hysteresis, high repeatability, and good step response in our sensor characterisation. Bubble characterisation was also performed including surface profilometer and scanning electron microscopy (SEM). We showcase two applications of our sensor including mouse click and grasping of a cup. The sensor can be fabricated in different shapes and sizes for various applications of free-form electronics such as soft and surgical robotics, wearable, biomedical, human-machine interaction, and so on.

Abstract

Audio descriptions (ADs) narrate important visual details in movies, enabling Blind and Low Vision (BLV) users to understand narratives and appreciate visual details. Existing works in automatic AD generation mostly focus on few-second trimmed clips, and evaluate them by comparing against a single ground-truth reference AD. However, writing ADs is inherently subjective. Through alignment and analysis of two independent AD tracks for the same movies, we quantify the subjectivity in when and whether to describe, and what and how to highlight. Thus, we show that working with trimmed clips is inadequate. We propose ADQA, a QA benchmark that evaluates ADs at the level of few-minute long, coherent video segments, testing whether they would help BLV users understand the story and appreciate visual details. ADQA features visual appreciation (VA) questions about visual facts and narrative understanding (NU) questions based on the plot. Through ADQA, we show that current AD generation methods lag far behind human-authored ADs. We conclude with several recommendations for future work and introduce a public leaderboard for benchmarking.

Abstract

This article seeks to understand how experiences of coal extraction and use shape local perspectives on energy transitions. It does this by exploring community struggles over land and labour in India's largest coalfield Korba in Chhattisgarh state. While the Indian government has announced that the country will have net zero emissions by 2070, continuing coal mine expansions built on the dispossession of rural poor and indigenous groups dramatically shape lives, economies and aspirations, and with them expectations around a potential transition away from coal. At the moment coal provides stability and continuity in the context of a depressed agricultural sector and limited non-farm employment opportunities. The coal sector is in this manner a source of hope and aspirations for many, while simultaneously creating enormous social and ecological disruptions. In the article we place specific focus on the interlinked roles of land and labour in the production of fossil-free futures situated within agrarian relations. Long-term resistance to land acquisition for coal mining is in recent years accompanied by the emergence of new relationships that coal communities are forging around land as a transactional asset, to be bartered for mining company jobs, or simply used as a speculative asset which may yield future pay-off as mining continues to expand. Based on a close reading of everyday micro-level negotiations, this paper argues that the possibilities for justice in a post-coal future is rendered complicated by existing coal economy dependencies and narrow conceptions of compensation.

Abstract

Despite edge computing reducing communication delays associated with cloud computing, privacy concerns remain a significant challenge when sharing data from edge-based consumer electronics (CE) or Internet-of-Things (IoT) devices. Ciphertext policy attribute-based encryption (CP-ABE) is a cryptographic tool that facilitates intricate and refined access control. It can deliver more flexible, secure, compact, and effective access control policies for the cloud data. In the case of a conventional CP-ABE scheme, the keys can only be issued and disseminated by a trusted central authority (CA). However, if the CA is compromised, the entire system becomes more susceptible to assaults or failures, which leads to a single-point failure. In this article, we propose a Ring-Learning with Errors (Ring-LWE)-based MA-CP-ABE scheme that is effectively resolved by the multi-authority CP-ABE (MA-CP-ABE), and it ensures the security against quantum attacks. The threshold secret sharing by Shamir and the Lagrange interpolation formula are applied in the key-generation and decryption procedures of the proposed scheme, which make it easier to segment and restore the private keys. The proposed scheme is implemented in the CE-enabled IoT-based smart healthcare applications using the blockchain technology as a secure storage. A detailed comparative study, security analysis and experimental results with the existing relevant schemes shows that the proposed scheme exhibits superior security and better efficiency as compared to other schemes, demonstrating its feasibility in practical IoT-based healthcare applications.

Abstract

Multi-signature protocols allow a group of signers to collectively generate a single signature for a shared message. In the context of a decentralized blockchain, multi-signature schemes play a pivotal role in reducing the signature size. Recently, several multi-signature methods have emerged in the literature, some operating in discrete-log settings and others in lattice settings. However, many of the existing lattice-based multi-signature schemes incur high computation costs and online round complexity. Traditional public key-based multi-signature schemes are susceptible to quantum threats, and they are computationally intensive as well. A lattice-based multi-signature can provide robust security, which often falls short in terms of efficiency when it comes to round complexity. In this article, we aim to introduce a single-round lattice-based multi-signature scheme specifically designed for decentralized public blockchains. What sets the proposed scheme apart is its ability to function without the need for trapdoor commitments or sample pre-images, which are common features in existing lattice-based signature methods. Furthermore, we explore some potential applications in a generic Internet of Things (IoT) environment and their integration of the proposed scheme with the blockchain technology. The security of the proposed scheme is based on lattice-hard problems, like Ring-SIS (Shortest Integer Solution) and Ring-LWE (Learning with Errors).

Abstract

The scalability and reliability of any large scale IoT network depends on a multitude of things, the primary one of that, being the communication protocol underlying the system. Wi-Sun is a novel protocol that offers a low power, long range and cost effective solution. It is a mesh protocol such that any node can be configured to be a transceiver. The mesh forms a destination oriented directed acyclic graph (DODAG) with one node configured to be the border router that connects to the internet, enabling cloud access for the entire mesh. However, long connection time and healing time of the DODAG are some of its drawbacks. In this paper, we present experiments on a real-world deployment of a Wi-Sun network where we study patterns in the time required for each additional node to be added in the Wi-Sun network, and investigate the time required to reform a new DODAG when a node with a certain hop count is detached. This deployment can also serve as a testbed for future such evaluations.

Abstract

A system and processor-implemented method for three-dimensional (3D) object retrieval using a self-supervised model is provided. The present system learns an embedding space of the 3D mesh objects in a self-supervised manner without the need for objects annotated with their class or other properties. Effective embeddings of 3D mesh objects are learned using the self-supervised method for ranked retrieval from a large collection of 3D objects. A simple representation of mesh objects and a standard neural network model is used to learn the embedding. The results are retrieved on the basis of the shape of the object which may not belong to the same category but look similar in shape using the embeddings generated by self-supervised model. The system is independent of class labels and uses the entire 3D model for better information extraction.

Abstract

Digital 3D models play a pivotal role in engineering, entertainment, education, and various domains. However, the search and retrieval of these models have not received adequate attention compared to other digital assets like documents and images. Traditional supervised methods face challenges in scalability due to the impracticality of creating large, labeled collections of 3D objects. In response, this paper introduces a self-supervised approach to generate efficient embeddings for 3D mesh objects, facilitating ranked retrieval of similar objects. The proposed method employs a straightforward representation of mesh objects and utilizes an encoder–decoder architecture to learn the embedding. Extensive experiments demonstrate the competitiveness of our approach compared to supervised methods, showcasing its scalability across diverse object collections. Notably, the method exhibits transferability across datasets, implying its potential for broader applicability beyond the training dataset. The robustness and generalization capabilities of the proposed method are substantiated through experiments conducted on varied datasets. These findings underscore the efficacy of the approach in capturing underlying patterns and features, independent of dataset-specific nuances. This self-supervised framework offers a promising solution for enhancing the search and retrieval of 3D models, addressing key challenges in scalability and dataset transferability.