相关论文: Stateless Geocasting
We introduce a new methodology for forecasting which we call Signal Diffusion Mapping. Our approach accommodates features of real world financial data which have been ignored historically in existing forecasting methodologies. Our method…
We propose a protocol for deterministic communication that does not make use of entanglement. It exploits nonorthogonal states in a two-way quantum channel attaining significant improvement of security and efficiency over already known…
We present an efficient arbitrary polarization qubit transmission scheme against channel noise by utilizing frequency degree of freedom, which is more stable in transmission surroundings. The information of quantum state is encoded in…
We present and explore a model of stateless and self-stabilizing distributed computation, inspired by real-world applications such as routing on today's Internet. Processors in our model do not have an internal state, but rather interact by…
We propose practical and efficient protocols for verifying bipartite pure states for any finite dimension, which can also be applied to fidelity estimation. Our protocols are based on adaptive local projective measurements with either…
Cellular Vehicle-to-Everything (C-V2X) networks can operate without cellular infrastructure support. Vehicles can autonomously select their radio resources using the sensing-based Semi-Persistent Scheduling (SPS) algorithm specified by the…
Unambiguous state discrimination of two mixed bipartite states via local operations and classical communications (LOCC) is studied and compared with the result of a scheme realized via global measurement. We show that the success…
An uninformed sender publicly commits to an informative experiment about an uncertain state, privately observes its outcome, and sends a cheap-talk message to a receiver. We provide an algorithm valid for arbitrary state-dependent…
We have investigated the problem of discriminating between nonorthogonal quantum states with least probability of error. We have determined that the best strategy for some sets of states is to make no measurement at all, and simply to…
In this paper, we present a novel encryption-less algorithm to enhance security in transmission of data in networks. The algorithm uses an intuitively simple idea of a 'jigsaw puzzle' to break the transformed data into multiple parts where…
In this paper, we propose an efficient range free localization scheme for large scale three dimensional wireless sensor networks. Our system environment consists of two type of sensors, randomly deployed static sensors and global…
We propose a new covert communication scheme that operates without pre-sharing side information and channel estimation, utilizing a Gaussian-distributed Grassmann constellation for noncoherent detection. By designing constant-amplitude…
State-space systems encompass a broad class of algorithms used for modeling and forecasting time series. For such systems to be effective, two objectives must be met: (i) accurate point forecasts of the time series must be produced, and…
Currently, cryptography is in wide use as it is being exploited in various domains from data confidentiality to data integrity and message authentication. Basically, cryptography shuffles data so that they become unreadable by unauthorized…
Autonomous hazard detection and avoidance is a key technology for future landing missions in unknown surface conditions. Current state-of-the-art stochastic algorithms assume simple Gaussian measurement noise on dense, high-fidelity digital…
Over the last years, several works have explored the application of deep learning algorithms to determine the large-scale signal fading (also referred to as ``path loss'') between transmitter and receiver pairs in urban communication…
A hybrid communication network with a common analog signal and an independent digital data stream as input to each node in a multiple access network is considered. The receiver/base-station has to estimate the analog signal with a given…
The problem of finding a spanning forest of a graph in a distributed-processing environment is studied. If an input graph is weighted, then the goal is to find a minimum-weight spanning forest. The processors communicate by broadcasting.…
A group of cooperative aerial robots can be deployed to efficiently patrol a terrain, in which each robot flies around an assigned area and shares information with the neighbors periodically in order to protect or supervise it. To ensure…
Serverless computing has emerged as a very popular cloud technology, together with its companion Function-as-a-Service (FaaS) programming model enabling invocations of stateless functions from clients. An evolution of serverless is now…