The Coherence Problem: Mapping the Theory and Delivery of Infrastructure Resilience Across Concept, Form, Function, and Experienced Value

In this contribution we explore the interface between the functional characteristics of infrastructures as artefacts and social need supplier. Specifically we are concerned with the ways in which infrastructure performance measures are articulated and assessed and whether there are incongruities between the technical and broader, social goals which infrastructure systems are intended to aspire to. Our analysis involves comparing and contrasting system design and performance metrics across the technical — social boundary, generating new insights for those tasked with the design and operation of networked infrastructures. The assessment delivered in the following sections is inherently interdisciplinary and cross-sectoral in nature, bringing thinking from the social and environmental sciences together with contributions from mathematics and engineering to offer a commentary which is relevant to all types of physical infrastructure

Global search algorithm for optimal control

Random-search algorithm employs local and global properties to solve two-point boundary value problem in Pontryagin maximum principle for either fixed or variable end-time problems. Mixed boundary value problem is transformed to an initial value problem. Mapping between initial and terminal values utilizes hybrid computer

Neural nets on the MPP

The Massively Parallel Processor (MPP) is an ideal machine for computer experiments with simulated neural nets as well as more general cellular automata. Experiments using the MPP with a formal model neural network are described. The results on problem mapping and computational efficiency apply equally well to the neural nets of Hopfield, Hinton et al., and Geman and Geman

Systemic intervention

This paper describes the practice of systemic intervention, emphasizing (1) the need to explore stakeholder values and boundaries for analysis; (2) responses to the challenges of marginalization processes; and (3) a wide, pluralistic range of methods from the systems literature and beyond to create a flexible and responsive systemic action research practice. After presenting an outline of systemic intervention, the author discusses several other well-tested systems approaches with a view to identifying their potential for further supporting systemic intervention practice, and action research more generally. Two practical examples of systemic intervention are provided to illustrate the arguments

Principles for problem aggregation and assignment in medium scale multiprocessors

One of the most important issues in parallel processing is the mapping of workload to processors. This paper considers a large class of problems having a high degree of potential fine grained parallelism, and execution requirements that are either not predictable, or are too costly to predict. The main issues in mapping such a problem onto medium scale multiprocessors are those of aggregation and assignment. We study a method of parameterized aggregation that makes few assumptions about the workload. The mapping of aggregate units of work onto processors is uniform, and exploits locality of workload intensity to balance the unknown workload. In general, a finer aggregate granularity leads to a better balance at the price of increased communication/synchronization costs; the aggregation parameters can be adjusted to find a reasonable granularity. The effectiveness of this scheme is demonstrated on three model problems: an adaptive one-dimensional fluid dynamics problem with message passing, a sparse triangular linear system solver on both a shared memory and a message-passing machine, and a two-dimensional time-driven battlefield simulation employing message passing. Using the model problems, the tradeoffs are studied between balanced workload and the communication/synchronization costs. Finally, an analytical model is used to explain why the method balances workload and minimizes the variance in system behavior

Automated problem scheduling and reduction of synchronization delay effects

It is anticipated that in order to make effective use of many future high performance architectures, programs will have to exhibit at least a medium grained parallelism. A framework is presented for partitioning very sparse triangular systems of linear equations that is designed to produce favorable preformance results in a wide variety of parallel architectures. Efficient methods for solving these systems are of interest because: (1) they provide a useful model problem for use in exploring heuristics for the aggregation, mapping and scheduling of relatively fine grained computations whose data dependencies are specified by directed acrylic graphs, and (2) because such efficient methods can find direct application in the development of parallel algorithms for scientific computation. Simple expressions are derived that describe how to schedule computational work with varying degrees of granularity. The Encore Multimax was used as a hardware simulator to investigate the performance effects of using the partitioning techniques presented in shared memory architectures with varying relative synchronization costs

Three Dimensional Polarimetric Neutron Tomography of Magnetic Fields

Through the use of Time-of-Flight Three Dimensional Polarimetric Neutron Tomography (ToF 3DPNT) we have for the first time successfully demonstrated a technique capable of measuring and reconstructing three dimensional magnetic field strengths and directions unobtrusively and non-destructively with the potential to probe the interior of bulk samples which is not amenable otherwise. Using a pioneering polarimetric set-up for ToF neutron instrumentation in combination with a newly developed tailored reconstruction algorithm, the magnetic field generated by a current carrying solenoid has been measured and reconstructed, thereby providing the proof-of-principle of a technique able to reveal hitherto unobtainable information on the magnetic fields in the bulk of materials and devices, due to a high degree of penetration into many materials, including metals, and the sensitivity of neutron polarisation to magnetic fields. The technique puts the potential of the ToF time structure of pulsed neutron sources to full use in order to optimise the recorded information quality and reduce measurement time.Comment: 12 pages, 4 figure

Minimum BER Precoding in 1-Bit Massive MIMO Systems

1-bit digital-to-analog (DACs) and analog-to-digital converters (ADCs) are gaining more interest in massive MIMO systems for economical and computational efficiency. We present a new precoding technique to mitigate the inter-user-interference (IUI) and the channel distortions in a 1-bit downlink MUMISO system with QPSK symbols. The transmit signal vector is optimized taking into account the 1-bit quantization. We develop a sort of mapping based on a look-up table (LUT) between the input signal and the transmit signal. The LUT is updated for each channel realization. Simulation results show a significant gain in terms of the uncoded bit-error-ratio (BER) compared to the existing linear precoding techniques.Comment: Presented in IEEE SAM 2016, 10th-13th July 2016, Rio De Janeiro, Brazi

Programming Model to Develop Supercomputer Combinatorial Solvers

© 2017 IEEE. Novel architectures for massively parallel machines offer better scalability and the prospect of achieving linear speedup for sizable problems in many domains. The development of suitable programming models and accompanying software tools for these architectures remains one of the biggest challenges towards exploiting their full potential. We present a multi-layer software abstraction model to develop combinatorial solvers on massively-parallel machines with regular topologies. The model enables different challenges in the design and optimization of combinatorial solvers to be tackled independently (separation of concerns) while permitting problem-specific tuning and cross-layer optimization. In specific, the model decouples the issues of inter-node communication, n ode-level scheduling, problem mapping, mesh-level load balancing and expressing problem logic. We present an implementation of the model and use it to profile a Boolean satisfiability solver on simulated massively-parallel machines with different scales and topologies