Message passing for distributed optimisation of power allocation with renewable resources

The increase in renewable energy generators introduced into the electricity grid is putting pressure on its stability and management as predictions of renewable energy sources cannot be accurate or fully controlled. This, with the additional pressure of fluctuations in demand, presents a problem more complex than the current methods of controlling electricity distribution were designed for. A global approximate and distributed optimisation method for power allocation that accommodates uncertainties and volatility is suggested and analysed. It is based on a probabilistic method known as message passing [1], which has deep links to statistical physics methodology. This principled method of optimisation is based on local calculations and inherently accommodates uncertainties; it is of modest computational complexity and provides good approximate solutions.We consider uncertainty and fluctuations drawn from a Gaussian distribution and incorporate them into the message-passing algorithm. We see the effect that increasing uncertainty has on the transmission cost and how the placement of volatile nodes within a grid, such as renewable generators or consumers, effects it.

Investigating the functional properties of the somatosensory cortex during experimental visceral pain using magnetoencephalography

Background The somatosensory cortex has been inconsistently activated in pain studies and the functional properties of subregions within this cortical area are poorly understood. To address this we used magnetoencephalography (MEG), a brain imaging technique capable of recording changes in cortical neural activity in real-time, to investigate the functional properties of the somatosensory cortex during different phases of the visceral pain experience. Methods In eight participants (4 male), 151-channel whole cortex MEG was used to detect cortical neural activity during 25 trials lasting 20 seconds each. Each trial comprised four separate periods of 5 seconds in duration. During each of the periods, different visual cues were presented, indicating that period 1=rest, period 2=anticipation, period 3=pain and period 4=post pain. During period 3, participants received painful oesophageal balloon distensions (four at 1 Hz). Regions of cortical activity were identified using Synthetic Aperture Magnetometry (SAM) and by the placement of virtual electrodes in regions of interest within the somatosensory cortex, time-frequency wavelet plots were generated. Results SAM analysis revealed significant activation with the primary (S1) and secondary (S2) somatosensory cortices. The time-frequency wavelet spectrograms showed that activation in S1 increased during the anticipation phase and continued during the presentation of the stimulus. In S2, activation was tightly time and phase-locked to the stimulus within the pain period. Activations in both regions predominantly occurred within the 10–15 Hz and 20–30 Hz frequency bandwidths. Discussion These data are consistent with the role of S1 and S2 in the sensory discriminatory aspects of pain processing. Activation of S1 during anticipation and then pain may be linked to its proposed role in attentional as well as sensory processing. The stimulus-related phasic activity seen in S2 demonstrates that this region predominantly encodes information pertaining to the nature and intensity of the stimulus.

Surgical correction of astigmatism during cataract surgery

High levels of corneal astigmatism are prevalent in a significant proportion of the population. During cataract surgery pre-existing astigmatism can be corrected using single or paired incisions on the steep axis of the cornea, using relaxing incisions or with the use of a toric intraocular lens. This review provides an overview of the conventional methods of astigmatic correction during cataract surgery and in particular, discusses the various types of toric lenses presently available and the techniques used in determining the correct axis for the placement of such lenses. Furthermore, the potential causes of rotation in toric lenses are identified, along with techniques for assessing and quantifying the amount of rotation and subsequent management options for addressing post-operative rotation.

The influence of fixation points on contrast detection and discrimination of patches of grating: Masking and facilitation

The use of fixation points (FPs) in visual psychophysics is common practice, though the costs and benefits of different fixation regimens have not been compared. Here we investigate the influence of several different types of FP configurations on the contrast detection of patches of sine-wave gratings. We find that for small targets (1°), the addition of a superimposed central FP can increase thresholds by a factor of 1.3 (2.5 dB) in comparison with no FP, and a factor of 1.5 (3.6 dB) in comparison with FPs that surround the target. These results are consistent with (i) a suppressive influence on the central region of the target from a central FP, and (ii) facilitatory influences from surrounding FPs. Our analysis of the slope of the psychometric function suggests that the facilitatory influence is not due to reduction of uncertainty. Plausible candidate causes for the facilitation are: (i) sensory interactions, (ii) aids to ocular accommodation and convergence, (iii) a reduction in eye-movements and (iv) more accurate placement of the observer’s window of attention. Masking by a central FP is not found for the suprathreshold task of contrast discrimination, suggesting that the masking effects of pedestal and FP do not combine linearly. This means that estimates of the level of masking produced by a contrast pedestal can depend on the details of the fixation point.

A study of adaptive load balancing algorithms for distributed systems

With the advent of distributed computer systems with a largely transparent user interface, new questions have arisen regarding the management of such an environment by an operating system. One fertile area of research is that of load balancing, which attempts to improve system performance by redistributing the workload submitted to the system by the users. Early work in this field concentrated on static placement of computational objects to improve performance, given prior knowledge of process behaviour. More recently this has evolved into studying dynamic load balancing with process migration, thus allowing the system to adapt to varying loads. In this thesis, we describe a simulated system which facilitates experimentation with various load balancing algorithms. The system runs under UNIX and provides functions for user processes to communicate through software ports; processes reside on simulated homogeneous processors, connected by a user-specified topology, and a mechanism is included to allow migration of a process from one processor to another. We present the results of a study of adaptive load balancing algorithms, conducted using the aforementioned simulated system, under varying conditions; these results show the relative merits of different approaches to the load balancing problem, and we analyse the trade-offs between them. Following from this study, we present further novel modifications to suggested algorithms, and show their effects on system performance.

Knowledge transfer in website design:exploring the processes and benefits of design collaboration for non-creative Micros

This thesis explores the interaction between Micros (<10 employees) from non-creative sectors and website designers ("Creatives") that occurred when creating a website of a higher order than a basic template site. The research used Straussian Grounded Theory Method with a longitudinal design, in order to identify what knowledge transferred to the Micros during the collaboration, how it transferred, what factors affected the transfer and outcomes of the transfer including behavioural additionality. To identify whether the research could be extended beyond this, five other design areas were also examined, as well as five Small to Medium Enterprises (SMEs) engaged in website and branding projects. The findings were that, at the start of the design process, many Micros could not articulate their customer knowledge, and had poor marketing and visual language skills, knowledge core to web design, enabling targeted communication to customers through images. Despite these gaps, most Micros still tried to lead the process. To overcome this disjoint, the majority of the designers used a knowledge transfer strategy termed in this thesis as ‘Bi-Modal Knowledge Transfer’, where the Creative was aware of the transfer but the Micro was unaware, both for drawing out customer knowledge from the Micro and for transferring visual language skills to the Micro. Two models were developed to represent this process. Two models were also created to map changes in the knowledge landscapes of customer knowledge and visual language – the Knowledge Placement Model and the Visual Language Scale. The Knowledge Placement model was used to map the placement of customer knowledge within the consciousness, extending the known Automatic-Unconscious -Conscious model, adding two more locations – Peripheral Consciousness and Occasional Consciousness. Peripheral Consciousness is where potential knowledge is held, but not used. Occasional Consciousness is where potential knowledge is held but used only for specific tasks. The Visual Language Scale was created to measure visual language ability from visually responsive, where the participant only responds personally to visual symbols, to visually multi-lingual, where the participant can use visual symbols to communicate with multiple thought-worlds. With successful Bi-Modal Knowledge Transfer, the outcome included not only an effective website but also changes in the knowledge landscape for the Micros and ongoing behavioural changes, especially in marketing. These effects were not seen in the other design projects, and only in two of the SME projects. The key factors for this difference between SMEs and Micros appeared to be an expectation of knowledge by the Creatives and failure by the SMEs to transfer knowledge within the company.

On the k-anonymization of time-varying and multi-layer social graphs

The popularity of online social media platforms provides an unprecedented opportunity to study real-world complex networks of interactions. However, releasing this data to researchers and the public comes at the cost of potentially exposing private and sensitive user information. It has been shown that a naive anonymization of a network by removing the identity of the nodes is not sufficient to preserve users’ privacy. In order to deal with malicious attacks, k -anonymity solutions have been proposed to partially obfuscate topological information that can be used to infer nodes’ identity. In this paper, we study the problem of ensuring k anonymity in time-varying graphs, i.e., graphs with a structure that changes over time, and multi-layer graphs, i.e., graphs with multiple types of links. More specifically, we examine the case in which the attacker has access to the degree of the nodes. The goal is to generate a new graph where, given the degree of a node in each (temporal) layer of the graph, such a node remains indistinguishable from other k-1 nodes in the graph. In order to achieve this, we find the optimal partitioning of the graph nodes such that the cost of anonymizing the degree information within each group is minimum. We show that this reduces to a special case of a Generalized Assignment Problem, and we propose a simple yet effective algorithm to solve it. Finally, we introduce an iterated linear programming approach to enforce the realizability of the anonymized degree sequences. The efficacy of the method is assessed through an extensive set of experiments on synthetic and real-world graphs.

Enabling long journeys in electric vehicles:design and demonstration of an infrastructure location model

This research develops a methodology and model formulation which suggests locations for rapid chargers to help assist infrastructure development and enable greater battery electric vehicle (BEV) usage. The model considers the likely travel patterns of BEVs and their subsequent charging demands across a large road network, where no prior candidate site information is required. Using a GIS-based methodology, polygons are constructed which represent the charging demand zones for particular routes across a real-world road network. The use of polygons allows the maximum number of charging combinations to be considered whilst limiting the input intensity needed for the model. Further polygons are added to represent deviation possibilities, meaning that placement of charge points away from the shortest path is possible, given a penalty function. A validation of the model is carried out by assessing the expected demand at current rapid charging locations and comparing to recorded empirical usage data. Results suggest that the developed model provides a good approximation to real world observations, and that for the provision of charging, location matters. The model is also implemented where no prior candidate site information is required. As such, locations are chosen based on the weighted overlay between several different routes where BEV journeys may be expected. In doing so many locations, or types of locations, could be compared against one another and then analysed in relation to siting practicalities, such as cost, land permission and infrastructure availability. Results show that efficient facility location, given numerous siting possibilities across a large road network can be achieved. Slight improvements to the standard greedy adding technique are made by adding combination weightings which aim to reward important long distance routes that require more than one charge to complete.

Performance analysis of an experimental wireless relay sensor network

Communication through relay channels in wireless sensor networks can create diversity and consequently improve the robustness of data transmission for ubiquitous computing and networking applications. In this paper, we investigate the performances of relay channels in terms of diversity gain and throughput via both experimental research and theoretical analysis. Two relaying algorithms, dynamic relaying and fixed relaying, are utilised and tested to find out what the relay channels can contribute to system performances. The tests are based on a wireless relay sensor network comprising a source node, a destination node and a couple of relay nodes, and carried out in an indoor environment with rare movement of objects nearby. The tests confirm, in line with the analytical results, that more relay nodes lead to higher diversity gain in the network. The test results also show that the data throughput between the source node and the destination node is enhanced by the presence of the relay nodes. Energy consumption in association with the relaying strategy is also analysed. Copyright © 2009 John Wiley & Sons, Ltd.

Performance optimisation of the MAC protocol with multiple contention slots in MIMO ad hoc networks

The multiple-input multiple-output (MIMO) technique can be used to improve the performance of ad hoc networks. Various medium access control (MAC) protocols with multiple contention slots have been proposed to exploit spatial multiplexing for increasing the transport throughput of MIMO ad hoc networks. However, the existence of multiple request-to-send/clear-to-send (RTS/CTS) contention slots represents a severe overhead that limits the improvement on transport throughput achieved by spatial multiplexing. In addition, when the number of contention slots is fixed, the efficiency of RTS/CTS contention is affected by the transmitting power of network nodes. In this study, a joint optimisation scheme on both transmitting power and contention slots number for maximising the transport throughput is presented. This includes the establishment of an analytical model of a simplified MAC protocol with multiple contention slots, the derivation of transport throughput as a function of both transmitting power and the number of contention slots, and the optimisation process based on the transport throughput formula derived. The analytical results obtained, verified by simulation, show that much higher transport throughput can be achieved using the joint optimisation scheme proposed, compared with the non-optimised cases and the results previously reported.