Random walk attachment graphs

We consider the random walk attachment graph introduced by Saramäki and Kaski and proposed as a mechanism to explain how behaviour similar to preferential attachment may appear requiring only local knowledge. We show that if the length of the random walk is fixed then the resulting graphs can have properties significantly different from those of preferential attachment graphs, and in particular that in the case where the random walks are of length 1 and each new vertex attaches to a single existing vertex the proportion of vertices which have degree 1 tends to 1, in contrast to preferential attachment models

Game theoretical modelling of a dynamically evolving network I: general target sequences

Animal (and human) populations contain a finite number of individuals with social and geographical relationships which evolve over time, at least in part dependent upon the actions of members of the population. These actions are often not random, but chosen strategically. In this paper we introduce a game-theoretical model of a population where the individuals have an optimal level of social engagement, and form or break social relationships strategically to obtain the correct level. This builds on previous work where individuals tried to optimise their number of connections by forming or breaking random links; the difference being that here we introduce a truly game-theoretic version where they can choose which specific links to form/break. This is more realistic and makes a significant difference to the model, one consequence of which is that the analysis is much more complicated. We prove some general results and then consider a single example in depth

Graphic deviation

Given a sequence of n nonnegative integers how can we find the graphs which achieve the minimal deviation from that sequence? This extends the classical problem regarding what sequences are "graphic", that is, can be the degrees of a simple graph, to issues regarding arbitrary sequences. In this context, we investigate properties of the "minimal graphs". We shall demonstrate how a variation on the Havel-Hakimi algorithm can supply the value of the minimal possible deviation, and how consideration of the Ruch-Gutman condition and the Ferrer diagram can yield the complete set of graphs achieving this minimum. An application of this analysis is to a population of individuals represented by vertices, interactions between pairs by edges and in which each individual has a preferred range for their number of links to other individuals. Individuals adjust their links according to their preferred range and the graph evolves towards some set of graphs which achieve the minimal possible deviation. This Markov chain is defined but detailed analysis is omitted

Smart Transcription

The Intelligent Voice Smart Transcript is an interactive HTML5 document that contains the audio, a speech transcription and the key topics from an audio recording. It is designed to enable a quick and efficient review of audio communications by encapsulating the recording with the speech transcript and topics within a single HTML5 file. This paper outlines the rationale for the design of the SmartTranscript user experience. The paper discusses the difficulties of audio review, how there is large potential for misinterpretation associated with reviewing transcripts in isolation, and how additional diarization and topic tagging components augment the audio review process

An Experimental Analysis of Deep Learning Architectures for Supervised Speech Enhancement

Recent speech enhancement research has shown that deep learning techniques are very effective in removing background noise. Many deep neural networks are being proposed, showing promising results for improving overall speech perception. The Deep Multilayer Perceptron, Convolutional Neural Networks, and the Denoising Autoencoder are well-established architectures for speech enhancement; however, choosing between different deep learning models has been mainly empirical. Consequently, a comparative analysis is needed between these three architecture types in order to show the factors affecting their performance. In this paper, this analysis is presented by comparing seven deep learning models that belong to these three categories. The comparison includes evaluating the performance in terms of the overall quality of the output speech using five objective evaluation metrics and a subjective evaluation with 23 listeners; the ability to deal with challenging noise conditions; generalization ability; complexity; and, processing time. Further analysis is then provided while using two different approaches. The first approach investigates how the performance is affected by changing network hyperparameters and the structure of the data, including the Lombard effect. While the second approach interprets the results by visualizing the spectrogram of the output layer of all the investigated models, and the spectrograms of the hidden layers of the convolutional neural network architecture. Finally, a general evaluation is performed for supervised deep learning-based speech enhancement while using SWOC analysis, to discuss the technique’s Strengths, Weaknesses, Opportunities, and Challenges. The results of this paper contribute to the understanding of how different deep neural networks perform the speech enhancement task, highlight the strengths and weaknesses of each architecture, and provide recommendations for achieving better performance. This work facilitates the development of better deep neural networks for speech enhancement in the future

The number of genotypic assignments on a genealogy II. Further results for linear systems

In a previous paper we demonstrated how the number of possible genotypic assignments consistent with the rules of Mendelian genetics and with any known phenotypes could be calculated for an arbitrary genealogy. Here, we present further results for several regular genealogies constructed according to some specified recursive formulae and for which the growth of the genotypic statespace, with increasing genealogical size, can be described by a linear system

A Mixed Reality Approach for dealing with the Video Fatigue of Online Meetings

Much of the issue with video meetings is the lack of naturalistic cues, together with the feeling of being observed all the time. Video calls take away most body language cues, but because the person is still visible, your brain still tries to compute that non-verbal language. It means that you’re working harder, trying to achieve the impossible. This impacts data retention and can lead to participants feeling unnecessarily tired. This project aims to transform the way online meetings happen, by turning off the camera and simplifying the information that our brains need to compute, thus preventing ‘Zoom fatigue’. The immersive solution we are developing, iVXR, consists of cutting-edge augmented reality technology, natural language processing, speech to text technologies and sub-real-time hardware acceleration using high performance computing

Game theoretical modelling of a dynamically evolving network Ⅱ: Target sequences of score 1

In previous work we considered a model of a population where individuals have an optimum level of social interaction, governed by a graph representing social connections between the individuals, who formed or broke those links to achieve their target number of contacts. In the original work an improvement in the number of links was carried out by breaking or joining to a randomly selected individual. In the most recent work, however, these actions were often not random, but chosen strategically, and this led to significant complications. One of these was that in any state, multiple individuals might wish to change their number of links. In this paper we consider a systematic analysis of the structure of the simplest class of non-trivial cases, where in general only a single individual has reason to make a change, and prove some general results. We then consider in detail an example game, and introduce a method of analysis for our chosen class based upon cycles on a graph. We see that whilst we can gain significant insight into the general structure of the state space, the analysis for specific games remains difficult