With the wide application of unmanned aerial vehicles (UAVs), performing search and rescue missions autonomously in unknown environment has become an increasingly concerning issue. In this article, we propose adaptive conversion speed Q-Learning algorithm (ACSQL). Performing UAV is divided into two stages: mission stage optimal path stage. first stage, a can find task points as soon possible, efficiency exploration increased by adaptively adjusting UAV. second to get secure short path,...

Wireless video broadcast/multicast and mobile communication pose a challenge to the conventional transmission scheme (which consists of separate digital source coding channel coding). The reason is that based on nonscalable design, this unavoidably leads cliff effect as well limits ability support multiple users with diverse conditions. In paper, we propose novel wireless scalable (WSVC) framework. Specifically, present hybrid digital-analog (HDA) joint source-channel (JSCC) integrates...

Wireless video broadcast/multicast and mobile communication pose a challenge to the conventional transmission strategy (which applies separate digital source coding channel in point-to-point system) and, therefore, cooperative has been proposed improve received quality of receivers with bad channels robustness fading (mobility). In this paper we propose novel wireless (WCVC) framework. Specifically, present joint source-channel scheme that is based on hybrid digital-analog integrates...

Functional neuroimaging studies suggest that abnormal brain functional connectivity may be the neural underpinning of addiction to illicit drugs and relapse after successful cessation therapy. Aberrant networks have been demonstrated in addicted patients newly abstinent addicts. However, it is not known whether patterns persist prolonged abstinence. In this cross-sectional study, whole-brain resting-state magnetic resonance images (8 min) were collected from 30 heroin-addicted individuals a...

In image compression and transmission, two basic data redundancies can be identified exploited: statistical redundancy perceptual redundancy. Statistical has been studied for a very long time exploited in most coding schemes. However, not yet completely exploited. Furthermore, is difficult to exploit by using digital techniques because power allocation performed at the bit level coding. as one of one-size-fits-all technique, soft transmission suitable its directly applied pixel instead...

The conventional channel resolvability problem refers to the determination of minimum rate required for an input process so that output distribution approximates a target in either total variation distance or relative entropy. In contrast previous works, this paper, we use (normalized unnormalized) Rényi divergence (with parameter in[0, 2] U {∞}) measure level approximation. We also provide asymptotic expressions normalized when is larger than equal 1 as well (lower and upper) bounds case...

We study a generalized version of Wyner's common information problem (also coined the distributed source simulation problem). The original consists in understanding minimum rate input to independent processors generate an approximation joint distribution when distance measure used quantify discrepancy between synthesized and target distributions is normalized relative entropy. Our generalization involves changing unnormalized Rényi divergences order α = 1 + s ∈ [0, 2]. show that needed...

Recently, two extensions of Wyner's common information-exact and Rényi informations-were introduced respectively by Kumar, Li, El Gamal (KLE), the present authors. The class information problems involves determining minimum rate input to independent processors needed exactly or approximately generate a target joint distribution. For exact problem, generation distribution is required, while for α-Rényi informations, relative entropy divergence with order α were used quantify discrepancy...

In this paper, we propose a novel wireless video transmission scheme named HDA-Cast, which is hybrid digital-analog (HDA) coding that integrates the advantages of digital and analog coding. Relative to most state-of-the-art methods, it avoids "cliff effect" provided channel quality within expected range, gives better fairness among all receivers for multicast, has strong adaption variation. The evaluation results show our HDA-Cast 3.5-9.6 dB than SoftCast an up-to-date scheme. Owing its...

The random variable simulation problem consists in using a k-dimensional i.i.d. vector X <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">k</sup> with distribution P <sub xmlns:xlink="http://www.w3.org/1999/xlink">X</sub> to simulate an n-dimensional Y xmlns:xlink="http://www.w3.org/1999/xlink">n</sup> so that its is approximately Q xmlns:xlink="http://www.w3.org/1999/xlink">Y</sub> . In contrast previous works, this paper, we consider the...

In the complex battlefield electromagnetic environment, multiple jamming signals can enter radar receiver simultaneously due to development of jammers and modulation technology. The received compound aggravate difficulty recognition subsequent counter-countermeasure. face strong overlapping unseen signal combinations, performance existing methods usually seriously degrades. this paper, an end-to-end multi-label classification framework combining a complex-valued convolutional neural network...

A coupling of two distributions P <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">X</sub> and xmlns:xlink="http://www.w3.org/1999/xlink">Y</sub> is a joint distribution xmlns:xlink="http://www.w3.org/1999/xlink">XY</sub> with marginal equal to . Given marginals real-valued function f the , what its minimum over all couplings ? We study asymptotics such problems different f's X Y replaced by <sup xmlns:xlink="http://www.w3.org/1999/xlink">n</sup>...

In literature, different common informations were defined by G\'acs and K\"orner, Wyner, Kumar, Li, Gamal, respectively. this paper, we define two generalized versions of informations, named approximate exact information-correlation functions, exploiting the conditional maximal correlation as a commonness or privacy measure. These encompass notions G\'acs-K\"orner's, Wyner's, Kumar-Li-Gamal's special cases. Furthermore, to give operational characterizations these also study problems private...

In this paper, we study the type graph, namely, a bipartite graph induced by joint type. We investigate maximum edge density of subgraphs having number vertices on each side an exponential scale in length <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</i> This can be seen as isoperimetric problem. provide asymptotically sharp bounds for exponent goes to infinity. also biclique rate region which is defined set (...

In this paper, we derive variational formulas for the asymptotic exponents (i.e., convergence rates) of concentration and isoperimetric functions in product Polish probability space under certain mild assumptions. These are expressed terms relative entropies (which from information theory) optimal transport cost functionals theory). Hence, our results verify an intimate connection among theory, transport, measure or inequalities. regime, corresponding formula is fact a dimension-free bound...

We consider the exact channel synthesis problem. This problem concerns determination of minimum amount information required to create correlation remotely when there is a certain rate randomness shared by two terminals. generalizes an existing approximate version, in which generated joint distribution be close target under total variation (TV) distance measure (instead being exactly equal distribution). provide single-letter inner and outer bounds on admissible region communication for These...

The union-closed sets conjecture states that in any nonempty family $\mathcal{F}$ of subsets a finite set, there exists an element contained at least proportion $1/2$ the $\mathcal{F}$. Using information-theoretic method, Gilmer \cite{gilmer2022constant} recently showed $0.01$ such He conjectured his technique can be pushed to constant $\frac{3-\sqrt{5}}{2}$ which was subsequently confirmed by several researchers...

We revisit the high-dimensional content identification with lossy recovery problem (Tuncel and Gündüz, 2014) establish an exponential strong converse theorem. As a corollary of theorem, we derive upper bound on joint identification-error excess-distortion exponent for problem. Our main results can be specialized to biometrical (Willems, 2003) (Tuncel, 2009) since these two problems are both special cases leverage information spectrum method introduced by Oohama adapt techniques therein...

We leverage proof techniques from discrete Fourier analysis and an existing result in coding theory to derive new bounds for the problem of non-interactive simulation binary random variables. Previous literature were derived by applying data processing inequalities concerning maximal correlation or hypercontractivity. show that our are sharp some regimes. Indeed, a specific instance parameters, main resolves open posed E. Mossel 2017. As by-products analyses, various properties average...

This paper investigates basic trade-offs between energy and delay in wireless communication systems using finite blocklength theory. We first assume that data arrive constant stream of bits, which are put into packets transmitted over a communications link. Our results show depending on exactly how is measured, general depends √d <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">-1</sup> or √Vd log d, where d the delay. means decreases quite...