Story telling in sustainable development projects

This paper constitutes an attempt to find a means to represent multiple stories in the strong narrative of conventional sustainable development (SD) projects. The authors' experience of such projects in various parts of the world indicates that they have a tendency to arise from and reflect a dominant mindset, placing the SD project in what can be a working environment that is inimical to the very ideals that SD is supposed to represent. Short-termism and value for money drive project formats and objectives, whilst counter-narratives and alternative stories arising from stakeholders in such projects are often ignored. Yet these alternative threads often contain strong SD messages of their own and could, if effectively utilized, enhance the SD project process. This paper sets out the case for a new field - 'project ethnography' - allied with the growing use of meta-analysis to compare project 'stories'. The analytical model applied to compare projects is based on the Kolb learning cycle and involves a (3 X 4)-fold questioning of project conceptual ization and roll-out. Copyright @ 2oo6 John Wiley & Sons, Ltd and ERP Environment.

A family of promoter probe vectors incorporating autofluorescent and chromogenic reporter proteins for studying gene expression in Gram-negative bacteria

A series of promoter probe vectors for use in Gram-negative bacteria has been made in two broad-host-range vectors, pOT (pBBR replicon) and pJP2 (incP replicon). Reporter fusions can be made to gfpUV, gfprnut3.1, unstable gfpmut3.1 variants (LAA, LVA, AAV and ASV), gfp+, dsRed2, dsRedT3, dsRedT4, mRFP1, gusA or lacZ. The two vector families, pOT and pJP2, are compatible with one another and share the same polylinker for facile interchange of promoter regions. Vectors based on pJP2 have the advantage of being ultra-stable in the environment due to the presence of the parABCDE genes. As a confirmation of their usefulness, the dicarboxylic acid transport system promoter (dctA(p)) was cloned into a pOT (pRU1097)- and a pJP2 (pRU1156)-based vector and shown to be expressed by Rhizobium leguminosarum in infection threads of vetch. This indicates the presence of dicarboxylates at the earliest stages of nodule formation.

Parallel and distributed computing with Java

The Java language first came to public attention in 1995. Within a year, it was being speculated that Java may be a good language for parallel and distributed computing. Its core features, including being objected oriented and platform independence, as well as having built-in network support and threads, has encouraged this view. Today, Java is being used in almost every type of computer-based system, ranging from sensor networks to high performance computing platforms, and from enterprise applications through to complex research-based.simulations. In this paper the key features that make Java a good language for parallel and distributed computing are first discussed. Two Java-based middleware systems, namely MPJ Express, an MPI-like Java messaging system, and Tycho, a wide-area asynchronous messaging framework with an integrated virtual registry are then discussed. The paper concludes by highlighting the advantages of using Java as middleware to support distributed applications.

Nested parallelism for multi-core HPC systems using Java

Since its introduction in 1993, the Message Passing Interface (MPI) has become a de facto standard for writing High Performance Computing (HPC) applications on clusters and Massively Parallel Processors (MPPs). The recent emergence of multi-core processor systems presents a new challenge for established parallel programming paradigms, including those based on MPI. This paper presents a new Java messaging system called MPJ Express. Using this system, we exploit multiple levels of parallelism - messaging and threading - to improve application performance on multi-core processors. We refer to our approach as nested parallelism. This MPI-like Java library can support nested parallelism by using Java or Java OpenMP (JOMP) threads within an MPJ Express process. Practicality of this approach is assessed by porting to Java a massively parallel structure formation code from Cosmology called Gadget-2. We introduce nested parallelism in the Java version of the simulation code and report good speed-ups. To the best of our knowledge it is the first time this kind of hybrid parallelism is demonstrated in a high performance Java application. (C) 2009 Elsevier Inc. All rights reserved.

Multicore-enabling the MPJ express messaging library

With the transition to multicore processors almost complete, the parallel processing community is seeking efficient ways to port legacy message passing applications on shared memory and multicore processors. MPJ Express is our reference implementation of Message Passing Interface (MPI)-like bindings for the Java language. Starting with the current release, the MPJ Express software can be configured in two modes: the multicore and the cluster mode. In the multicore mode, parallel Java applications execute on shared memory or multicore processors. In the cluster mode, Java applications parallelized using MPJ Express can be executed on distributed memory platforms like compute clusters and clouds. The multicore device has been implemented using Java threads in order to satisfy two main design goals of portability and performance. We also discuss the challenges of integrating the multicore device in the MPJ Express software. This turned out to be a challenging task because the parallel application executes in a single JVM in the multicore mode. On the contrary in the cluster mode, the parallel user application executes in multiple JVMs. Due to these inherent architectural differences between the two modes, the MPJ Express runtime is modified to ensure correct semantics of the parallel program. Towards the end, we compare performance of MPJ Express (multicore mode) with other C and Java message passing libraries---including mpiJava, MPJ/Ibis, MPICH2, MPJ Express (cluster mode)---on shared memory and multicore processors. We found out that MPJ Express performs signicantly better in the multicore mode than in the cluster mode. Not only this but the MPJ Express software also performs better in comparison to other Java messaging libraries including mpiJava and MPJ/Ibis when used in the multicore mode on shared memory or multicore processors. We also demonstrate effectiveness of the MPJ Express multicore device in Gadget-2, which is a massively parallel astrophysics N-body siimulation code.

Structural characterisation of bisintercalation in higher-order DNA at a junction-like quadruplex

We report the single-crystal X-ray structure for the complex of the bisacridine bis-(9-aminooctyl(2-(dimethylaminoethyl)acridine-4-carboxamide)) with the oligonucleotide d(CGTACG)2 to a resolution of 2.4 Å. Solution studies with closed circular DNA show this compound to be a bisintercalating threading agent, but so far we have no crystallographic or NMR structural data conforming to the model of contiguous intercalation within the same duplex. Here, with the hexameric duplex d(CGTACG), the DNA is observed to undergo a terminal cytosine base exchange to yield an unusual guanine quadruplex intercalation site through which the bisacridine threads its octamethylene linker to fuse two DNA duplexes. The 4-carboxamide side-chains form anchoring hydrogen-bonding interactions with guanine O6 atoms on each side of the quadruplex. This higher-order DNA structure provides insight into an unexpected property of bisintercalating threading agents, and suggests the idea of targeting such compounds specifically at four-way DNA junctions.

A tutorial on pseudospectral methods for computational optimal control

[English] This paper is a tutorial introduction to pseudospectral optimal control. With pseudospectral methods, a function is approximated as a linear combination of smooth basis functions, which are often chosen to be Legendre or Chebyshev polynomials. Collocation of the differential-algebraic equations is performed at orthogonal collocation points, which are selected to yield interpolation of high accuracy. Pseudospectral methods directly discretize the original optimal control problem to recast it into a nonlinear programming format. A numerical optimizer is then employed to find approximate local optimal solutions. The paper also briefly describes the functionality and implementation of PSOPT, an open source software package written in C++ that employs pseudospectral discretization methods to solve multi-phase optimal control problems. The software implements the Legendre and Chebyshev pseudospectral methods, and it has useful features such as automatic differentiation, sparsity detection, and automatic scaling. The use of pseudospectral methods is illustrated in two problems taken from the literature on computational optimal control. [Portuguese] Este artigo e um tutorial introdutorio sobre controle otimo pseudo-espectral. Em metodos pseudo-espectrais, uma funcao e aproximada como uma combinacao linear de funcoes de base suaves, tipicamente escolhidas como polinomios de Legendre ou Chebyshev. A colocacao de equacoes algebrico-diferenciais e realizada em pontos de colocacao ortogonal, que sao selecionados de modo a minimizar o erro de interpolacao. Metodos pseudoespectrais discretizam o problema de controle otimo original de modo a converte-lo em um problema de programa cao nao-linear. Um otimizador numerico e entao empregado para obter solucoes localmente otimas. Este artigo tambem descreve sucintamente a funcionalidade e a implementacao de um pacote computacional de codigo aberto escrito em C++ chamado PSOPT. Tal pacote emprega metodos de discretizacao pseudo-spectrais para resolver problemas de controle otimo com multiplas fase. O PSOPT permite a utilizacao de metodos de Legendre ou Chebyshev, e possui caractersticas uteis tais como diferenciacao automatica, deteccao de esparsidade e escalonamento automatico. O uso de metodos pseudo-espectrais e ilustrado em dois problemas retirados da literatura de controle otimo computacional.

WCSC 2013: the 3rd World Chess Software Championship

The 3rd World Chess Software Championship took place in Yokohama, Japan during August 2013. It pits chess engines against each other on a common hardware platform - in this instance, the Intel i7 2740 Ivy Bridge with 16GB RAM supporting a potential eight processing threads. It was narrowly won by HIARCS from JUNIOR and PANDIX with JONNY, SHREDDER and MERLIN taking the remaining places. Games, occasionally annotated, are available here.

Relationship between the near-Earth interplanetary field and the coronal source flux: dependence on timescale

The Ulysses spacecraft has shown that the radial component of the heliospheric magnetic field is approximately independent of latitude. This has allowed quantification of the total open solar flux from near-Earth observations of the interplanetary magnetic field. The open flux can also be estimated from photospheric magnetograms by mapping the fields up to the ‘‘coronal source surface’’ where the field is assumed to be radial and which is usually assumed to be at a heliocentric distance r = 2.5R_{S} (a mean solar radius, 1R_{S} = 6.96x10^{8} m). These two classes of open flux estimate will differ by the open flux that threads the heliospheric current sheet(s) inside Earth’s orbit at 2.5R_{S} < r < 1R{1} (where the mean Earth-Sun distance, 1R_{1} = 1 AU = 1.5 x 10^{11} m). We here use near-Earth measurements to estimate this flux and show that at sunspot minimum it causes only a very small (approximately 0.5%) systematic difference between the two types of open flux estimate, with an uncertainty that is of order ±24% in hourly values, ±16% in monthly averages, and between -6% and +2% in annual values. These fractions may be somewhat larger for sunspot maximum because of flux emerging at higher heliographic latitudes.

The case for transient magnetopause reconnection

Recent studies indicate that magnetopause reconnection can, at times, occur exclusively as a series of separated, short bursts. Reconnection generates “open” magnetic flux that threads the magnetospheric boundary, the magnetopause, and so connects the magnetosphere with interplanetary space. The rate at which open flux is generated by a line of unit length in the magnetopause is called the reconnection rate. By Faraday's induction law, the reconnection rate is a boundary-tangential electric field, Et, along that line (called an X-line).

Bit-index sort: a fast non-comparison integer sorting algorithm for permutations

This paper describes a fast integer sorting algorithm, herein referred as Bit-index sort, which is a non-comparison sorting algorithm for partial per-mutations, with linear complexity order in execution time. Bit-index sort uses a bit-array to classify input sequences of distinct integers, and exploits built-in bit functions in C compilers supported by machine hardware to retrieve the ordered output sequence. Results show that Bit-index sort outperforms in execution time to quicksort and counting sort algorithms. A parallel approach for Bit-index sort using two simultaneous threads is included, which obtains speedups up to 1.6.