Open Access. Powered by Scholars. Published by Universities.®

Computer Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 7 of 7

Full-Text Articles in Computer Engineering

Distance-Based Cluster Head Election For Mobile Sensing, Ruairí De Fréin, Liam O'Farrell Dec 2018

Distance-Based Cluster Head Election For Mobile Sensing, Ruairí De Fréin, Liam O'Farrell

Conference papers

Energy-efficient, fair, stochastic leader-selection algorithms are designed for mobile sensing scenarios which adapt the sensing strategy depending on the mobile sensing topology. Methods for electing a cluster head are crucially important when optimizing the trade-off between the number of peer-to- peer interactions between mobiles and client-server interactions with a cloud-hosted application server. The battery-life of mobile devices is a crucial constraint facing application developers who are looking to use the convergence of mobile computing and cloud computing to perform environmental sensing. We exploit the mobile network topology, specifically the location of mobiles with respect to the gateway device, to stochastically …


State Acquisition In Computer Networks, Ruairí De Fréin May 2018

State Acquisition In Computer Networks, Ruairí De Fréin

Conference papers

We establish that State Acquisition should be per- formed in networks at a rate which is consistent with the rate-of-change of the element or service being observed. We demonstrate that many existing monitoring and service-level prediction tools do not acquire network state in an appropriate manner. To address this challenge: (1) we define the rate-of- change of different applications; (2) we use methods for analysis of unevenly spaced time series, specifically, time series arising from video and voice applications, to estimate the rate-of-change of these services; and finally, (3) we demonstrate how to acquire network state accurately for a number …


Ambiqual – A Full Reference Objective Quality Metric For Ambisonic Spatial Audio, Miroslaw Narbutt, Andrew Allen, Jan Skoglund, Michael Chinen, Andrew Hines Jan 2018

Ambiqual – A Full Reference Objective Quality Metric For Ambisonic Spatial Audio, Miroslaw Narbutt, Andrew Allen, Jan Skoglund, Michael Chinen, Andrew Hines

Conference papers

Streaming spatial audio over networks requires efficient encoding techniques that compress the raw audio content without compromising quality of experience. Streaming service providers such as YouTube need a perceptually relevant objective audio quality metric to monitor users’ perceived quality and spatial localization accuracy. In this paper we introduce a full reference objective spatial audio quality metric, AMBIQUAL, which assesses both Listening Quality and Localization Accuracy. In our solution both metrics are derived directly from the B-format Ambisonic audio. The metric extends and adapts the algorithm used in ViSQOLAudio, a full reference objective metric designed for assessing speech and audio quality. …


Tiled Time Delay Estimation In Mobile Cloud Computing Environments, Ruairí De Fréin Dec 2017

Tiled Time Delay Estimation In Mobile Cloud Computing Environments, Ruairí De Fréin

Conference papers

We present a tiled delay estimation technique in the context of Mobile Cloud Computing (MCC) environments. We examine its accuracy in the presence of multiple sources for (1) sub-sample delays and also (2) in the presence of phase-wrap around. Phase wrap-around is prevalent in MCC because the separation of acoustic sources may be large. We show that tiling a histogram of instantaneous phase estimates can improve delay estimates when phase-wrap around is sig- nificantly present and also when multiple sources are present. We report that error in the delay estimator is generally less than 5% of a sample, when the …


Bitrate Classification Of Twice-Encoded Audio Using Objective Quality Features, Colm Sloan, Damien Kelly, Naomi Harte, Anil C. Kokaram, Andrew Hines Jun 2016

Bitrate Classification Of Twice-Encoded Audio Using Objective Quality Features, Colm Sloan, Damien Kelly, Naomi Harte, Anil C. Kokaram, Andrew Hines

Conference papers

When a user uploads audio files to a music stream- ing service, these files are subsequently re-encoded to lower bitrates to target different devices, e.g. low bitrate for mobile. To save time and bandwidth uploading files, some users encode their original files using a lossy codec. The metadata for these files cannot always be trusted as users might have encoded their files more than once. Determining the lowest bitrate of the files allows the streaming service to skip the process of encoding the files to bitrates higher than that of the uploaded files, saving on processing and storage space. This …


Measuring And Monitoring Speech Quality For Voice Over Ip With Polqa, Visqol And P.563, Andrew Hines, Eoin Gillen, Naomi Harte Jan 2015

Measuring And Monitoring Speech Quality For Voice Over Ip With Polqa, Visqol And P.563, Andrew Hines, Eoin Gillen, Naomi Harte

Conference papers

There are many types of degradation which can occur in Voice over IP (VoIP) calls. Of interest in this work are degradations which occur independently of the codec, hardware or network in use. Specifically, their effect on the subjective and objec- tive quality of the speech is examined. Since no dataset suit- able for this purpose exists, a new dataset (TCD-VoIP) has been created and has been made publicly available. The dataset con- tains speech clips suffering from a range of common call qual- ity degradations, as well as a set of subjective opinion scores on the clips from 24 …


Distributed Formal Concept Analysis Algorithms Based On An Iterative Mapreduce Framework, Ruairí De Fréin, Biao Xu, Eric Robson, Mícheál Ó Fóghlú Jan 2012

Distributed Formal Concept Analysis Algorithms Based On An Iterative Mapreduce Framework, Ruairí De Fréin, Biao Xu, Eric Robson, Mícheál Ó Fóghlú

Conference papers

While many existing formal concept analysis algorithms are efficient, they are typically unsuitable for distributed implementation. Taking the MapReduce (MR) framework as our inspiration we introduce a distributed approach for performing formal concept mining. Our method has its novelty in that we use a light-weight MapReduce runtime called Twister which is better suited to iterative algorithms than recent distributed approaches. First, we describe the theoretical foundations underpinning our distributed formal concept analysis approach. Second, we provide a representative exemplar of how a classic centralized algorithm can be implemented in a distributed fashion using our methodology: we modify Ganter’s classic algorithm …