Abstract This paper examines the robustness of distances and diameter in connected graphs under adversarial edge deletions that preserve connectivity. It introduces the concept of robustness: a distance or diameter is robust if it remains unchanged... This paper examines the robustness of distances and diameter in connected graphs under adversarial edge deletions that preserve connectivity. It introduces the concept of robustness: a distance or diameter is robust if it remains unchanged in all connected spanning subgraphs. The authors establish that testing whether the distance between two vertices is robust can be done in linear time, O(n + m), by showing it is equivalent to recognizing a new class of graphs two terminal series parallel graphs of fixed length. This characterization leverages a for bidden rooted minor (a diamond graph rooted at the two vertices) and adapts known recognition algorithms. In contrast, the problem of determining whether the diameter of a graph is robust is proven to be coNP complete via a reduction from the Hamiltonian Path problem. The paper highlights a striking complexity gap between pairwise distance robustness and diameter robustness, despite their apparent similarity. These results contribute to understanding the structural properties of graphs under dynamic or unreliable network conditions, with implications for resilient network design and distributed algorithms. Read More Read Less

Abstract The paper presents a methodology for multi objective run time requirement enforcement (RRE) on many core systems using finite state machines (FSMs). It addresses non functional requirements like latency and energy under varying workloads by... The paper presents a methodology for multi objective run time requirement enforcement (RRE) on many core systems using finite state machines (FSMs). It addresses non functional requirements like latency and energy under varying workloads by modeling enforcement strategies as deterministic FSMs that adapt system configurations (e.g., voltage/frequency) based on feedback. The approach integrates a discrete time Markov chain (DTMC) to model environmental input variations and uses probabilistic computation tree logic (PCTL) for formal verification via the PRISM model checker. The authors evaluate five enforcement FSMs ranging from single requirement to multi requirement strategies on an image processing case study involving SIFT-based object detection.Verification goals assess the probability of violating latency, energy, or both requirements over consecutive executions. Results show trade offs between objectives: latency oriented strategies excel in timing but fail energetically, while balanced strategies like F3 perform best overall. The work highlights the need for systematic, formally verified design of enforcement mechanisms and proposes future automation for multi objective FSM synthesis. Read More Read Less

Abstract Due to the global integration of culture, the need for English within the arts is now greater than ever. The role of English within the arts has been on the rise due to the ongoing... Due to the global integration of culture, the need for English within the arts is now greater than ever. The role of English within the arts has been on the rise due to the ongoing integration of global markets and cultures. The diverse and effective strategies of teaching art in English have captured the collective attention of educators, as such classes are vital in nurturing students’ artistic appreciation and mastery of the English language. This article explores the utilisation of technologies in art English classes from the perspective of multimodal instruction, discussing the roles of teachers, students, and instructional methodologies within the classes. Studies have shown that the teachers, students, and instructional methods have a significant impact on multimodal English art classes, and their interplay enhances both the teaching and learning experiences. Read More Read Less