Related papers: High-Level Message Sequence Charts: Satisfiability…
We study the satisfiability of randomly generated formulas formed by $M$ clauses of exactly $K$ literals over $N$ Boolean variables. For a given value of $N$ the problem is known to be most difficult with $\alpha=M/N$ close to the…
Large language models (LLMs) have shown remarkable performance in various tasks but often fail to handle queries that exceed their knowledge and capabilities, leading to incorrect or fabricated responses. This paper addresses the need for…
Much of the existing work on the broadcast channel focuses only on the sending of private messages. In this work we examine the scenario where the sender also wishes to transmit common messages to subsets of receivers. For an L user…
This paper describes an extension to the constraint satisfaction problem (CSP) called MUSE CSP (MUltiply SEgmented Constraint Satisfaction Problem). This extension is especially useful for those problems which segment into multiple sets of…
We consider the situation in which a transmitter attempts to communicate reliably over a discrete memoryless channel while simultaneously ensuring covertness (low probability of detection) with respect to a warden, who observes the signals…
We consider reachability decision problems for linear dynamical systems: Given a linear map on $\mathbb{R}^d$ , together with source and target sets, determine whether there is a point in the source set whose orbit, obtained by repeatedly…
This paper introduces and analyzes a new class of mean-field control (\textsc{MFC}) problems in which agents interact through a \emph{fixed but controllable} network structure. In contrast with the classical \textsc{MFC} framework -- where…
Reconfigurable intelligent surfaces (RISs) have become a promising candidate for the development of future mobile systems. In the context of massive machine-type communications (mMTC), a RIS can be used to support the transmission from a…
The multiuser communication channel, in which multiple users exchange information with the help of a relay terminal, termed the multi-way relay channel (mRC), is introduced. In this model, multiple interfering clusters of users communicate…
In this study we consider rateless coding over discrete memoryless channels (DMC) with feedback. Unlike traditional fixed-rate codes, in rateless codes each codeword is infinitely long, and the decoding time depends on the confidence level…
Hamilton-Jacobi (HJ) reachability analysis provides a formal method for guaranteeing safety in constrained control problems. It synthesizes a value function to represent a long-term safe set called feasible region. Early synthesis methods…
Designers often create visualizations to achieve specific high-level analytical or communication goals. These goals require people to extract complex and interconnected data patterns. Prior perceptual studies of visualization effectiveness…
Knowledge Graphs are pivotal for semantic data integration. The real-world data they model is often inherently uncertain. Within knowledge graphs, uncertainty manifests in three distinct levels: imprecise attribute values, probabilistic…
The level set method is a widely used tool for solving reachability and invariance problems. However, some shortcomings, such as the difficulties of handling dissipation function and constructing terminal conditions for solving the…
The decision problems on matrices were intensively studied for many decades as matrix products play an essential role in the representation of various computational processes. However, many computational problems for matrix semigroups are…
Synthetic molecular communication (MC) is a new communication engineering paradigm which is expected to enable revolutionary applications such as smart drug delivery and real-time health monitoring. The design and implementation of…
The problem of simultaneous multicasting of multiple messages with the help of a relay terminal is considered. In particular, a model is studied in which a relay station simultaneously assists two transmitters in multicasting their…
This paper concentrates on a robust transmit optimization problem for the multiuser multi-input single-output (MISO) downlink scenario and under inaccurate channel state information (CSI). This robust problem deals with a general-rank…
In this paper, we study the problem of secret communication over a multiple-access channel with a common message. Here, we assume that two transmitters have confidential messages, which must be kept secret from the wiretapper (the second…
Cognitive Radio Networks (CRNs) are considered as a promising solution to the spectrum shortage problem in wireless communication. In this paper, we initiate the first systematic study on the algorithmic complexity of the connectivity…