MPJ express meets gadget: towards a java code for cosmological simulations

Gadget-2 is a massively parallel structure formation code for cosmological simulations. In this paper, we present a Java version of Gadget-2. We evaluated the performance of the Java version by running colliding galaxies simulation and found that it can achieve around 70% of C Gadget-2's performance.

Reduced-order modelling of a high-voltage oscillatory impulse generator

The design of high-voltage equipment encompasses the study of oscillatory surges caused by transients such as those produced by switching. By obtaining a model, the response of which reconstructs that observed in the actual system, simulation studies and critical tests can be carried out on the model rather than on the equipment itself. In this paper, methods for the construction of simplified models are described and it is shown how the use of a complex model does not necessarily result in superior response pattern reconstruction.

A robust non-orthogonal space-time block code for four transmit antennas

Several non-orthogonal space-time block coding (NO-STBC) schemes have recently been proposed to achieve full rate transmission. Some of these schemes, however, suffer from weak robustness: their channel matrices will become ill conditioned in the case of highly correlated channels (HCC). To address this issue, this paper derives a family of robust NO-STBC schemes for four Tx antennas based on the worst case of HCC. These codes turned out to be a superset of Jafarkhani's quasi-orthogonal STBC codes. A computationally affordable linear decoder is also proposed. Although these codes achieve a similar performance to the non-robust schemes under normal channel conditions, they offer a strong robustness against HCC (although possibly yielding a poorer performance). Finally, computer simulations are presented to verify the algorithm design.

Modula-2 applied

Programming is a skill which requires knowledge of both the basic constructs of the computer language used and techniques employing these constructs. How these are used in any given application is determined intuitively, and this intuition is based on experience of programs already written. One aim of this book is to describe the techniques and give practical examples of the techniques in action - to provide some experience. Another aim of the book is to show how a program should be developed, in particular how a relatively large program should be tackled in a structured manner. These aims are accomplished essentially by describing the writing of one large program, a diagram generator package, in which a number of useful programming techniques are employed. Also, the book provides a useful program, with an in-built manual describing not only how the program works, but also how it does it, with full source code listings. This means that the user can, if required, modify the package to meet particular requirements. A floppy disk is available from the publishers containing the program, including listings of the source code. All the programs are written in Modula-2, using JPI's Top Speed Modula-2 system running on IBM-PCs and compatibles. This language was chosen as it is an ideal language for implementing large programs and it is the main language taught in the Cybernetics Department at the University of Reading. There are some aspects of the Top Speed implementation which are not standard, so suitable comments are given when these occur. Although implemented in Modula-2, many of the techniques described here are appropriate to other languages, like Pascal of C, for example. The book and programs are based on a second year undergraduate course taught at Reading to Cybernetics students, entitled Algorithms and Data Structures. Useful techniques are described for the reader to use, applications where they are appropriate are recommended, but detailed analyses of the techniques are not given.

Perspex machine X: software development

The Perspex Machine arose from the unification of computation with geometry. We now report significant redevelopment of both a partial C compiler that generates perspex programs and of a Graphical User Interface (GUI). The compiler is constructed with standard compiler-generator tools and produces both an explicit parse tree for C and an Abstract Syntax Tree (AST) that is better suited to code generation. The GUI uses a hash table and a simpler software architecture to achieve an order of magnitude speed up in processing and, consequently, an order of magnitude increase in the number of perspexes that can be manipulated in real time (now 6,000). Two perspex-machine simulators are provided, one using trans-floating-point arithmetic and the other using transrational arithmetic. All of the software described here is available on the world wide web. The compiler generates code in the neural model of the perspex. At each branch point it uses a jumper to return control to the main fibre. This has the effect of pruning out an exponentially increasing number of branching fibres, thereby greatly increasing the efficiency of perspex programs as measured by the number of neurons required to implement an algorithm. The jumpers are placed at unit distance from the main fibre and form a geometrical structure analogous to a myelin sheath in a biological neuron. Both the perspex jumper-sheath and the biological myelin-sheath share the computational function of preventing cross-over of signals to neurons that lie close to an axon. This is an example of convergence driven by similar geometrical and computational constraints in perspex and biological neurons.

Code-switching and transfer: an exploration of similarities and differences

This handbook article gives an historical overview of the development of research into code-switching and discusses its relationship to other language contact phenomena.

Multiple PID mapping using neural networks in a MIMO steam generator system

A neural network was used to map three PID operating regions for a two-input two-output steam generator system. The network was used in stand alone feedforward operation to control the whole operating range of the process, after being trained from the PID controllers corresponding to each control region. The network inputs are the plant error signals, their integral, their derivative and a 4-error delay train.

New governance approaches to environmental regulation: an example of the Code for Sustainable Homes (CSH)

Environmental policy in the United Kingdom (UK) is witnessing a shift from command-and-control approaches towards more innovation-orientated environmental governance arrangements. These governance approaches are required which create institutions which support actors within a domain for learning not only about policy options, but also about their own interests and preferences. The need for construction actors to understand, engage and influence this process is critical to establishing policies which support innovation that satisfies each constituent’s needs. This capacity is particularly salient in an era where the expanding raft of environmental regulation is ushering in system-wide innovation in the construction sector. In this paper, the Code for Sustainable Homes (the Code) in the UK is used to demonstrate the emergence and operation of these new governance arrangements. The Code sets out a significant innovation challenge for the house-building sector with, for example, a requirement that all new houses must be zero-carbon by 2016. Drawing upon boundary organisation theory, the journey from the Code as a government aspiration, to the Code as a catalyst for the formation of the Zero Carbon Hub, a new institution, is traced and discussed. The case study reveals that the ZCH has demonstrated boundary organisation properties in its ability to be flexible to the needs and constraints of its constituent actors, yet robust enough to maintain and promote a common identity across regulation and industry boundaries.