| The random-code capacity region of the multiple-access arbitrarily varying channel subject to both state and input constraints is determined. Consideration of a simple erasure channel shows that the capacity region is not convex in general.

The spread of an infection on a real-world social network is determined by the interplay of two processes – the dynamics of the network, whose structure changes over time according to the encounters between individuals, and the dynamics on the network, whose nodes can infect each other after an encounter. Physical encounter is the most common vehicle for the spread of infectious diseases, but d...

Face recognition under varying pose is a challenging problem, especially when illumination variations are also present. In this paper, we propose to address one of the most challenging scenarios in face recognition. That is, to identify a subject from a test image that is acquired under different pose and illumination condition from only one training sample (also known as a gallery image) of th...

Consensus problems in time-varying networks are studied in this paper. We consider two cases. In the first case, the networks are basically connected and the conditions for reaching consensus are described by means of the algebraic properties of connectivity for network graph. In the second case, the networks are possibly disconnected all time. A concept called integral connectivity of networks...

We consider the problem of communicating over an unknown and arbitrarily varying channel, using feedback. This paper focuses on the problem of determining the input behavior, or more specifically, a prior which is used to randomly generate a codebook. We pose the problem of setting the prior as a universal sequential prediction problem using information theoretic abstractions of the communicati...

Tensors are effective representations for complex and time-varying networks. The factorization of a tensor provides a high-quality low-rank compact basis for each dimension of the tensor, which facilitates the interpretation of important structures of the represented data. Many existing tensor factorization (TF) methods assume there is one tensor that needs to be decomposed to low-rank factors....

The Selective Harmonic Elimination (SHE) technique is the fundamental switching frequency scheme which is used to eliminate specific order harmonics. In this paper, the elimination of low order harmonics in cascaded multilevel inverter with equal DC sources is proposed. The modulation strategy used here is SHEPWM in which non linear equations that characterize the low order harmonics are obtain...

Multiharmonic tones containing resolved harmonics (1-7) of a fundamental, unresolved harmonics (8-24) of a fundamental, or both resolved and unresolved harmonics (1-24) were presented to listeners at each of six octaves ranging from 32 to 1024 Hz. There also were modified versions of each stimulus in which alternate harmonics were either attenuated or phase shifted. Listeners were asked to judg...