Nonlinear speech analysis algorithms mapped to a standard metric achieve clinically useful quantification of average Parkinson's disease symptom severity

The standard reference clinical score quantifying average Parkinson's disease (PD) symptom severity is the Unified Parkinson's Disease Rating Scale (UPDRS). At present, UPDRS is determined by the subjective clinical evaluation of the patient's ability to adequately cope with a range of tasks. In this study, we extend recent findings that UPDRS can be objectively assessed to clinically useful accuracy using simple, self-administered speech tests, without requiring the patient's physical presence in the clinic. We apply a wide range of known speech signal processing algorithms to a large database (approx. 6000 recordings from 42 PD patients, recruited to a six-month, multi-centre trial) and propose a number of novel, nonlinear signal processing algorithms which reveal pathological characteristics in PD more accurately than existing approaches. Robust feature selection algorithms select the optimal subset of these algorithms, which is fed into non-parametric regression and classification algorithms, mapping the signal processing algorithm outputs to UPDRS. We demonstrate rapid, accurate replication of the UPDRS assessment with clinically useful accuracy (about 2 UPDRS points difference from the clinicians' estimates, p < 0.001). This study supports the viability of frequent, remote, cost-effective, objective, accurate UPDRS telemonitoring based on self-administered speech tests. This technology could facilitate large-scale clinical trials into novel PD treatments.

Average error exponent in Gallager low-density parity-check codes

We present a theoretical method for a direct evaluation of the average error exponent in Gallager error-correcting codes using methods of statistical physics. Results for the binary symmetric channel(BSC)are presented for codes of both finite and infinite connectivity.

Average and reliability error exponents in low-density parity-check codes

We present a theoretical method for a direct evaluation of the average and reliability error exponents in low-density parity-check error-correcting codes using methods of statistical physics. Results for the binary symmetric channel are presented for codes of both finite and infinite connectivity.

Approximate, Average, Dynamic Models of Uncontrolled Rectifiers for Aircraft Applications

To carry out stability and voltage regulation studies on more electric aircraft systems in which there is a preponderance of multi-pulse, rectifier-fed motor-drive equipment, average dynamic models of the rectifier converters are required. Existing methods are difficult to apply to anything other than single converters with a low pulse number. Therefore an efficient, compact method for deriving the approximate, linear, average model of 6- and 12-pulse rectifiers, based on the assumption of a small duration of the overlap angle is presented. The models are validated against detailed simulations and laboratory prototypes.

An interpretation of the energy variations of dispersion managed solitons in terms of effective average dispersion

We show that the variation in dispersion managed soliton energy that occurs as the amplifier position varies within the dispersion map, for a fixed map strength, can be interpreted using the concept of effective average dispersion. Using this concept we physically explain why the location of the amplifier can produce a greater or lesser energy enhancement factor than the lossless model. © 2001 Elsevier Science B.V. All rights reserved.

Late development of metric part-relational processing in object recognition

Four experiments with unfamiliar objects examined the remarkably late consolidation of part-relational relative to part-based object recognition (Jüttner, Wakui, Petters, Kaur, & Davidoff, 2013). Our results indicate a particularly protracted developmental trajectory for the processing of metric part relations. Schoolchildren aged 7 to 14 years and adults were tested in 3-Alternative-Forced-Choice tasks to judge the correct appearance of upright and inverted newly learned multipart objects that had been manipulated in terms of individual parts or part relations. Experiment 1 showed that even the youngest tested children were close to adult levels of performance for recognizing categorical changes of individual parts and relative part position. By contrast, Experiment 2 demonstrated that performance for detecting metric changes of relative part position was distinctly reduced in young children compared with recognizing metric changes of individual parts, and did not approach the latter until 11 to 12 years. A similar developmental dissociation was observed in Experiment 3, which contrasted the detection of metric relative-size changes and metric part changes. Experiment 4 showed that manipulations of metric size that were perceived as part (rather than part-relational) changes eliminated this dissociation. Implications for theories of object recognition and similarities to the development of face perception are discussed. © 2014 American Psychological Association.

Measuring complexity through average symmetry

This work introduces a complexity measure which addresses some conflicting issues between existing ones by using a new principle - measuring the average amount of symmetry broken by an object. It attributes low (although different) complexity to either deterministic or random homogeneous densities and higher complexity to the intermediate cases. This new measure is easily computable, breaks the coarse graining paradigm and can be straightforwardly generalized, including to continuous cases and general networks. By applying this measure to a series of objects, it is shown that it can be consistently used for both small scale structures with exact symmetry breaking and large scale patterns, for which, differently from similar measures, it consistently discriminates between repetitive patterns, random configurations and self-similar structures

Information capacity of optical fiber channels with zero average dispersion

We study the statistics of optical data transmission in a noisy nonlinear fiber channel with a weak dispersion management and zero average dispersion. Applying analytical expressions for the output probability density functions both for a nonlinear channel and for a linear channel with additive and multiplicative noise we calculate in a closed form a lower bound estimate on the Shannon capacity for an arbitrary signal-to-noise ratio.

Regrouping metric-space search index for search engine size adaptation

This work contributes to the development of search engines that self-adapt their size in response to fluctuations in workload. Deploying a search engine in an Infrastructure as a Service (IaaS) cloud facilitates allocating or deallocating computational resources to or from the engine. In this paper, we focus on the problem of regrouping the metric-space search index when the number of virtual machines used to run the search engine is modified to reflect changes in workload. We propose an algorithm for incrementally adjusting the index to fit the varying number of virtual machines. We tested its performance using a custom-build prototype search engine deployed in the Amazon EC2 cloud, while calibrating the results to compensate for the performance fluctuations of the platform. Our experiments show that, when compared with computing the index from scratch, the incremental algorithm speeds up the index computation 2–10 times while maintaining a similar search performance.

Model and performance of a no-reference quality assessment metric for video streaming

Video streaming via Transmission Control Protocol (TCP) networks has become a popular and highly demanded service, but its quality assessment in both objective and subjective terms has not been properly addressed. In this paper, based on statistical analysis a full analytic model of a no-reference objective metric, namely pause intensity (PI), for video quality assessment is presented. The model characterizes the video playout buffer behavior in connection with the network performance (throughput) and the video playout rate. This allows for instant quality measurement and control without requiring a reference video. PI specifically addresses the need for assessing the quality issue in terms of the continuity in the playout of TCP streaming videos, which cannot be properly measured by other objective metrics such as peak signal-to-noise-ratio, structural similarity, and buffer underrun or pause frequency. The performance of the analytical model is rigidly verified by simulation results and subjective tests using a range of video clips. It is demonstrated that PI is closely correlated with viewers' opinion scores regardless of the vastly different composition of individual elements, such as pause duration and pause frequency which jointly constitute this new quality metric. It is also shown that the correlation performance of PI is consistent and content independent. © 2013 IEEE.

300-mW average output power hybrid mode-locked thulium-doped fiber laser

We report on ring thulium-doped fiber laser hybrid mode-locked by single-walled carbon nanotubes and nonlinear polarization evolution generating 600-fs pulses at 1910-1980nm wavelength band with 72.5MHz repetition rate. Average output power reached 300mW in single-pulse operation regime, corresponding to 4.88kW peak power and 2.93nJ pulse energy.

Pause intensity:a no-reference quality assessment metric for video streaming in TCP networks

In this paper a full analytic model for pause intensity (PI), a no-reference metric for video quality assessment, is presented. The model is built upon the video play out buffer behavior at the client side and also encompasses the characteristics of a TCP network. Video streaming via TCP produces impairments in play continuity, which are not typically reflected in current objective metrics such as PSNR and SSIM. Recently the buffer under run frequency/probability has been used to characterize the buffer behavior and as a measurement for performance optimization. But we show, using subjective testing, that under run frequency cannot reflect the viewers' quality of experience for TCP based streaming. We also demonstrate that PI is a comprehensive metric made up of a combination of phenomena observed in the play out buffer. The analytical model in this work is verified with simulations carried out on ns-2, showing that the two results are closely matched. The effectiveness of the PI metric has also been proved by subjective testing on a range of video clips, where PI values exhibit a good correlation with the viewers' opinion scores. © 2012 IEEE.

Reductions of peak-to-average power ratio and optical beat interference in cost-effective OFDMA-PONs

The peak-to-average power ratio (PAPR) and optical beat interference (OBI) effects are examined thoroughly in orthogonal frequency-division multiplexing access (OFDMA)-passive optical networks (PONs) at a signal bit rate up to ∼ 20 Gb/s per channel using cost-effective intensity-modulation and direct-detection (IM/DD). Single-channel OOFDM and upstream multichannel OFDM-PONs are investigated for up to six users. A number of techniques for mitigating the PAPR and OBI effects are presented and evaluated including adaptive-loading algorithms such as bit/power-loading, clipping for PAPR reduction, and thermal detuning (TD) for the OBI suppression. It is shown that the bit-loading algorithm is a very efficient PAPR reduction technique by reducing it at about 1.2 dB over 100 Km of transmission. It is also revealed that the optimum method for suppressing the OBI is the TD + bit-loading. For a targeted BER of 1 × 10-3, the minimum allowed channel spacing is 11 GHz when employing six users. © 2013 Springer Science+Business Media New York.

Self-adapting parallel metric-space search engine for variable query loads

This research focuses on automatically adapting a search engine size in response to fluctuations in query workload. Deploying a search engine in an Infrastructure as a Service (IaaS) cloud facilitates allocating or deallocating computer resources to or from the engine. Our solution is to contribute an adaptive search engine that will repeatedly re-evaluate its load and, when appropriate, switch over to a dierent number of active processors. We focus on three aspects and break them out into three sub-problems as follows: Continually determining the Number of Processors (CNP), New Grouping Problem (NGP) and Regrouping Order Problem (ROP). CNP means that (in the light of the changes in the query workload in the search engine) there is a problem of determining the ideal number of processors p active at any given time to use in the search engine and we call this problem CNP. NGP happens when changes in the number of processors are determined and it must also be determined which groups of search data will be distributed across the processors. ROP is how to redistribute this data onto processors while keeping the engine responsive and while also minimising the switchover time and the incurred network load. We propose solutions for these sub-problems. For NGP we propose an algorithm for incrementally adjusting the index to t the varying number of virtual machines. For ROP we present an ecient method for redistributing data among processors while keeping the search engine responsive. Regarding the solution for CNP, we propose an algorithm determining the new size of the search engine by re-evaluating its load. We tested the solution performance using a custom-build prototype search engine deployed in the Amazon EC2 cloud. Our experiments show that when we compare our NGP solution with computing the index from scratch, the incremental algorithm speeds up the index computation 2{10 times while maintaining a similar search performance. The chosen redistribution method is 25% to 50% faster than other methods and reduces the network load around by 30%. For CNP we present a deterministic algorithm that shows a good ability to determine a new size of search engine. When combined, these algorithms give an adapting algorithm that is able to adjust the search engine size with a variable workload.