Excess power circulation in distribution networks containing distributed energy resources

The presence of large number of single-phase distributed energy resources (DERs) can cause severe power quality problems in distribution networks. The DERs can be installed in random locations. This may cause the generation in a particular phase exceeds the load demand in that phase. Therefore the excess power in that phase will be fed back to the transmission network. To avoid this problem, the paper proposes the use of distribution static compensator (DSTATCOM) that needs to be connected at the first bus following a substation. When operated properly, the DSTATCOM can facilitate a set of balanced current flow from the substation, even when excess power is generated by DERs. The proposals are validated through extensive digital computer simulation studies using PSCAD and MATLAB.

Energy-efficient virtual machine placement in data centers by genetic algorithm

Server consolidation using virtualization technology has become an important technology to improve the energy efficiency of data centers. Virtual machine placement is the key in the server consolidation. In the past few years, many approaches to the virtual machine placement have been proposed. However, existing virtual machine placement approaches to the virtual machine placement problem consider the energy consumption by physical machines in a data center only, but do not consider the energy consumption in communication network in the data center. However, the energy consumption in the communication network in a data center is not trivial, and therefore should be considered in the virtual machine placement in order to make the data center more energy-efficient. In this paper, we propose a genetic algorithm for a new virtual machine placement problem that considers the energy consumption in both the servers and the communication network in the data center. Experimental results show that the genetic algorithm performs well when tackling test problems of different kinds, and scales up well when the problem size increases.

Contextualizing a university-school STEM education collaboration : distributed and self-activated leadership for project outcomes

Implementing educational reform requires partnerships, and university-school collaborations in the form of investigative and experimental projects can aim to determine the practicalities of reform. However, there are funded projects that do not achieve intended outcomes. In the context of a new reform initiative in education, namely, science, technology, engineering and mathematics (STEM) education, this article explores the management of a government-funded project. In a university school partnership for STEM education, how can leadership be distributed for achieving project outcomes? Participants included university personnel from different STEM areas, school teachers and school executives. Data collected included observations, interviews, resource materials, and video and photographic images. Findings indicated that leadership roles were distributed and selfactivated by project partners according to their areas of expertise and proximal activeness to the project phases, that is: (1) establishing partnerships; (2) planning and collaboration; (3) project implementation; and (4) project evaluation and further initiatives. Leadership can be intentional and unintentional within project phases, and understanding how leadership can be distributed and selfactivated more purposefully may aid in generating more expedient project outcomes.

A hardware virtualization-based component sandboxing architecture

Modern applications comprise multiple components, such as browser plug-ins, often of unknown provenance and quality. Statistics show that failure of such components accounts for a high percentage of software faults. Enabling isolation of such fine-grained components is therefore necessary to increase the robustness and resilience of security-critical and safety-critical computer systems. In this paper, we evaluate whether such fine-grained components can be sandboxed through the use of the hardware virtualization support available in modern Intel and AMD processors. We compare the performance and functionality of such an approach to two previous software based approaches. The results demonstrate that hardware isolation minimizes the difficulties encountered with software based approaches, while also reducing the size of the trusted computing base, thus increasing confidence in the solution's correctness. We also show that our relatively simple implementation has equivalent run-time performance, with overheads of less than 34%, does not require custom tool chains and provides enhanced functionality over software-only approaches, confirming that hardware virtualization technology is a viable mechanism for fine-grained component isolation.

A distributed memory for networked livecoding performance

The symbolic and improvisational nature of Livecoding requires a shared networking framework to be flexible and extensible, while at the same time providing support for synchronisation, persistence and redundancy. Above all the framework should be robust and available across a range of platforms. This paper proposes tuple space as a suitable framework for network communication in ensemble livecoding contexts. The role of tuple space as a concurrency framework and the associated timing aspects of the tuple space model are explored through Spaces, an implementation of tuple space for the Impromptu environment.

Adaptive sizing of populations and number of islands in distributed genetic algorithms

Deciding the appropriate population size and number of is- lands for distributed island-model genetic algorithms is often critical to the algorithm’s success. This paper outlines a method that automatically searches for good combinations of island population sizes and the number of islands. The method is based on a race between competing parameter sets, and collaborative seeding of new parameter sets. This method is applicable to any problem, and makes distributed genetic algorithms easier to use by reducing the number of user-set parameters. The experimental results show that the proposed method robustly and reliably finds population and islands settings that are comparable to those found with traditional trial-and-error approaches.

Dynamic optimization of migration topology in internet-based distributed genetic algorithms

Distributed Genetic Algorithms (DGAs) designed for the Internet have to take its high communication cost into consideration. For island model GAs, the migration topology has a major impact on DGA performance. This paper describes and evaluates an adaptive migration topology optimizer that keeps the communication load low while maintaining high solution quality. Experiments on benchmark problems show that the optimized topology outperforms static or random topologies of the same degree of connectivity. The applicability of the method on real-world problems is demonstrated on a hard optimization problem in VLSI design.

Towards distributed citizen participation : lessons from WikiLeaks and the Queensland floods

This paper examines the rapid and ad hoc development and interactions of participative citizen communities during acute events, using the examples of the 2011 floods in Queensland, Australia, and the global controversy surrounding Wikileaks and its spokesman, Julian Assange. The self-organising community responses to such events which can be observed in these cases bypass or leapfrog, at least temporarily, most organisational or administrative hurdles which may otherwise frustrate the establishment of online communities; they fast-track the processes of community development and structuration. By understanding them as a form of rapid prototyping, e-democracy initiatives can draw important lessons from observing the community activities around such acute events.

Slotted distributed space-time coding

Distributed space-time coding (DSTC) exploits the concept of cooperative diversity and space-time coding to offer a powerful bandwidth efficient solution with improved diversity. In this paper, we evaluate the performance of DSTC with slotted amplify-and-forward protocol (SAF). Relay nodes between the source and the destination nodes are grouped into two relay clusters based on their respective locations and these relay clusters cooperate to transmit the space-time coded signal to the destination node in different time frames. We further extend the proposed Slotted-DSTC to Slotted DSTC with redundant code (Slotted-DSTC-R) protocol where the relay nodes in both relay clusters forward the same space-time coded signal to the destination node to achieve a higher diversity order.

Planning for the impact of distributed solar energy on the grid

The behaviour of single installations of solar energy systems is well understood; however, what happens at an aggregated location, such as a distribution substation, when output of groups of installations cumulate is not so well understood. This paper considers groups of installations attached to distributions substations on which the load is primarily commercial and industrial. Agent-based modelling has been used to model the physical electrical distribution system and the behaviour of equipment outputs towards the consumer end of the network. The paper reports the approach used to simulate both the electricity consumption of groups of consumers and the output of solar systems subject to weather variability with the inclusion of cloud data from the Bureau of Meteorology (BOM). The data sets currently used are for Townsville, North Queensland. The initial characteristics that indicate whether solar installations are cost effective from an electricity distribution perspective are discussed.

A New DER coordination in LV network based on the concept of distributed control

Given the paradigm of smart grid as the promising backbone for future network, this paper uses this paradigm to propose a new coordination approach for LV network based on distributed control algorithm. This approach divides the LV network into hierarchical communities where each community is controlled by a control agent. Different level of communication has been proposed for this structure to control the network in different operation modes.

Building shared situational awareness in surgery through distributed dialogue

Background Failure to convey time-critical information to team members during surgery diminishes members’ perception of the dynamic information relevant to their task, and compromises shared situational awareness. This research reports the dialog around clinical decisions made by team members in the time-pressured and high-risk context of surgery, and the impact of these communications on shared situational awareness. Methods Fieldwork methods were used to capture the dynamic integration of individual and situational elements in surgery that provided the backdrop for clinical decisions. Nineteen semi structured interviews were performed with 24 participants from anaesthesia, surgery, and nursing in the operating rooms of a large metropolitan hospital in Queensland, Australia. Thematic analysis was used. Results: The domain “coordinating decisions in surgery” was generated from textual data. Within this domain, three themes illustrated the dialog of clinical decisions, i.e., synchronizing and strategizing actions, sharing local knowledge, and planning contingency decisions based on priority. Conclusion Strategies used to convey decisions that enhanced shared situational awareness included the use of “self-talk”, closed-loop communications, and “overhearing” conversations that occurred at the operating table. Behaviours’ that compromised a team’s shared situational awareness included tunnelling and fixating on one aspect of the situation.

On the probability density function of the product of Rayleigh distributed random variables

In this paper we investigate the distribution of the product of Rayleigh distributed random variables. Considering the Mellin-Barnes inversion formula and using the saddle point approach we obtain an upper bound for the product distribution. The accuracy of this tail-approximation increases as the number of random variables in the product increase.