This paper focuses on Byzantine attack detection for Gaussian two-way relay network. In this network, two source nodes communicate with each other with the help of an amplify-and-forward relay which may perform Byzantine attacks by forwarding altered symbols to the sources. For simple investigating the detectability of attacks conducted in Gaussian channels, we focus on the MA channel of the ne...

We discuss one known and five new interrelated methods for bounding the hull of the solution set of a system of interval linear equations. Each method involves a polynomial amount of computing; but requires considerably more effort than Gaussian elimination. However, each method can yield sharper results for appropriate problems. For certain problems, our methods can obtain sharp bounds for one...

The first and second order of accuracy stable difference schemes for the numerical solution of the mixed problem for the fractional parabolic equation are presented. Stability and almost coercive stability estimates for the solution of these difference schemes are obtained. A procedure of modified Gauss elimination method is used for solving these difference schemes in the case of one-dimension...

In the classical herding literature, agents receive a private signal regarding a binary state of nature, and sequentially choose an action, after observing the actions of their predecessors. When the informativeness of private signals is unbounded, it is known that agents converge to the correct action and correct belief. We study how quickly convergence occurs, and show that it happens more sl...

We consider a MIMO fading broadcast channel and compare the achievable ergodic rates when the channel state information at the transmitter is provided by “analog” noisy feedback or by quantized (digital) feedback. The superiority of digital feedback is shown, with perfect or imperfect CSIR, whenever the number of feedback channel uses per channel coefficient is larger than 1. Also, we show that...

For each of the lattices A,(n 2 I), D,,(n 2 2), EC, E,, E,, and their duals a very fast algorithm is given for finding the closest lattice point to an arbitrary point. If these lattices are used for vector quantizing of uniformly distributed data, the algorithm finds the min imum distortion lattice point. If the lattices are used as codes for a Gaussian channel, the algorithm performs max imum ...

0. Notations Throughout the paper we use the following notations: We write e(z) = e; C, R, Q, Z, N and N0, denote the set of complex numbers, real numbers, rational numbers, integers, positive integers, and positive integers including zero, respectively. Q(i) denotes the field of Gaussian numbers, and Z[i] the ring of Gaussian integers. We write tr(z) and N(z) for the trace and the norm of z ov...

This paper presents a new similarity measure for object recognition from large libraries of line-patterns. The measure draws its inspiration from both the Hausdor distance and a recently reported Bayesian consistency measure that has been sucessfully used for graphbased correspondence matching. The measure uses robust error-kernels to gauge the similarity of pairwise attribute relations de ned ...

Let s ≥ 1 be an integer. A Gaussian network is a function on R of the form g(x) = ∑N k=1 ak exp(−‖x − xk‖ ). The minimal separation among the centers, defined by min1≤j 6=k≤N ‖xj − xk‖, is an important characteristic of the network that determines the stability of interpolation by Gaussian networks, the degree of approximation by such networks, etc. We prove that if g(x) = ∑N k=1 ak exp(−‖x − x...