Compact Routing on Internet-Like Graphs

The Thorup-Zwick (TZ) routing scheme is the first generic stretch-3 routing scheme delivering a nearly optimal local memory upper bound. Using both direct analysis and simulation, we calculate the stretch distribution of this routing scheme on random graphs with power-law node degree distributions, $P_k \sim k^{-\gamma}$. We find that the average stretch is very low and virtually independent of $\gamma$. In particular, for the Internet interdomain graph, $\gamma \sim 2.1$, the average stretch is around 1.1, with up to 70% of paths being shortest. As the network grows, the average stretch slowly decreases. The routing table is very small, too. It is well below its upper bounds, and its size is around 50 records for $10^4$-node networks. Furthermore, we find that both the average shortest path length (i.e. distance) $\bar{d}$ and width of the distance distribution $\sigma$ observed in the real Internet inter-AS graph have values that are very close to the minimums of the average stretch in the $\bar{d}$- and $\sigma$-directions. This leads us to the discovery of a unique critical quasi-stationary point of the average TZ stretch as a function of $\bar{d}$ and $\sigma$. The Internet distance distribution is located in a close neighborhood of this point. This observation suggests the analytical structure of the average stretch function may be an indirect indicator of some hidden optimization criteria influencing the Internet's interdomain topology evolution.Comment: 29 pages, 16 figure

Customisable arithmetic hardware designs

Imperial Users onl

Implementacija digitalnog generatora obojenog šuma bez množila

Colored noise can be generated by filtering of the white noise. It is a simple task. However, it becomes challenging if high operating speed of the generator is required. The realization of digital filter generally requires one multiplication per coefficient. Therefore, a high operating speed is achieved only with the cost of several generalpurpose multipliers. In this paper, a multiplierless realization of the colored noise generator is proposed. It is based on the filtering of 1-bit random signal by a finite impulse response filter. The design of the generator is described and its implementation is considered. Furthermore, an application is described in which the proposed generator is used in mitigation of undesired effects caused by nonlinearities in an analog to digital converter.Obojeni šum može se generirati filtriranjem bijelog šuma. To je jednostavan postupak. Međutim, on postaje izazovan ako se od generatora traži velika brzina rada. Realizacija digitalnog filtra u pravilu zahtijeva jedno množenje po koeficijentu. Zato se velika brzina rada može postići samo uz cijenu većeg broja množila opće namjene. U ovom radu predložena je realizacija generatora obojenog šuma koja ne sadrži množila. Ona se temelji se na filtraciji 1-bitnog slučajnog signala pomoću filtra s konačnim impulsnim odzivom. Opisano je projektiranje generatora te je razmotrena njegova implementacija. Nadalje, opisana je primjena u kojoj je predloženi generator iskorišten za smanjivanje utjecaja nelinearnosti u analogno digitalnom pretvorniku

Telecommunications Division

Spacecraft telecommunication systems - coding methods for phase locked loops, absolute time determination by pulsar, communications elements researc

A Style-Based Generator Architecture for Generative Adversarial Networks

We propose an alternative generator architecture for generative adversarial networks, borrowing from style transfer literature. The new architecture leads to an automatically learned, unsupervised separation of high-level attributes (e.g., pose and identity when trained on human faces) and stochastic variation in the generated images (e.g., freckles, hair), and it enables intuitive, scale-specific control of the synthesis. The new generator improves the state-of-the-art in terms of traditional distribution quality metrics, leads to demonstrably better interpolation properties, and also better disentangles the latent factors of variation. To quantify interpolation quality and disentanglement, we propose two new, automated methods that are applicable to any generator architecture. Finally, we introduce a new, highly varied and high-quality dataset of human faces.Comment: CVPR 2019 final versio

L\'evy Processes on Quantum Permutation Groups

We describe basic motivations behind quantum or noncommutative probability, introduce quantum L\'evy processes on compact quantum groups, and discuss several aspects of the study of the latter in the example of quantum permutation groups. The first half of this paper is a survey on quantum probability, compact quantum groups, and L\'evy processes on compact quantum groups. In the second half the theory is applied to quantum permutations groups. Explicit examples are constructed and certain classes of such L\'evy processes are classified.Comment: 60 page