The way to a 'no-corrections' Ph.D.

Many recent studies show that data center networks usually mix with a large amount of latency-agnostic background flows and a large number of latency-sensitive flows. The former, although contributing most of the traffic, is deadline-agnostic, while the ...

An asymmetric multidimensional scaling model and an associated nonmetric algorithm to analyze two-mode three-way proximities (object × object × source) are introduced. The model consists of a common object configuration and two kinds of weights, ...

Let d_q(n,k) be the maximum possible minimum Hamming distance of a q-ary [n,k,d]-code for given values of n and k. It is proved that d₄ (33,5)=22, d₄(49,5)=34, d₄ (131,5)=96, d₄(142,5)=104, d₄(147,5)=108, d ₄(152,5)=112, d₄(158,5)=116, d₄(176,5)⩾129, ...