Draft grid storage namespace guidelines

The Grid can provide MICE not only with computing (number-crunching) power, but also with a secure global framework allowing users access to data. Although the focus is usually on the mass of experiment data, the Grid also opens up new possibilities for the storage and sharing of other material within the collaboration. This document provides an introduction to data storage on the Grid and describes the proposal for the directory structures to be used by MICE when registering data files stored on the Grid within a File Catalogue such as LFC

RFC: Data flow from the MICE experiment

This article can be accessed at the link below.This document sketches out the flow of data from the MICE experiment, as I currently understand it. This includes not only illustrating the structure of the data flow, but also setting out a consistent vocabulary with which to describe it. Many aspects of this data flow are either misunderstood by me, currently undecided, not yet implemented, or simply have never been considered before; so feedback is both welcomed and essential. Background information about job submission and file storage on the Grid can be found in previous MICE Notes and the references therein. In particular the first two sections of Note 247 are meant to provide a gentle introduction to Grid data storage from the MICE perspective, and timid MICE may wish to read those first

The online buffer

Copyright @ 2009 MICEThis is a discussion document regarding the proposed use of the Online Buffer. The Online Buffer is used to store locally the RAW data files created by the Event Builder, before they are uploaded to Castor by the data mover. The files may also be used by the online monitoring and reconstruction activities. At the Trigger-DAQ-Controls Review, the reviewers warned that this three-way activity might saturate the disks, and also that the file uploads to the Grid could conflict with the writing of DAQ data. It was proposed to ameliorate this by splitting the buffer into a set of independent volumes into which the DAQ data would be written on a round-robin basis; outgoing files would meanwhile be read only from one of the other volumes. Further, files being uploaded to the Grid would be staged on the transfer box’ system disk, as the (local) staging process is expected to be more deterministic and easier to control than transfers across the WAN

Blogging the 2006 FIFA World Cup Finals

This study focuses on the use of new technologies by the sports-media complex, looking specifically at the 2006 FIFA World Cup Finals. Combining the world's single largest sports media event with one of the most current, complex forms of Web-based communication, this article explores extent to which football fans embedded in Germany used the Internet to blog their World Cup experiences. Various categories of blog sites were identified, including independent bloggers, bloggers using football-themed Web sites, and blogs hosted on corporate-sponsored platforms. The study shows that the anticipated "democratizing potential" of blogging was not evident during Germany 2006. Instead, blogging acted as a platform for corporations, which, employing professional journalists, told the fans' World Cup stories. © 2009 Human Kinetics, inc

Efficient detection of periodic orbits in high dimensional systems

This paper is concerned with developing a method for detecting unstable periodic orbits (UPOs) by stabilising transformations. Here the strategy is to transform the system of interest in such away that the orbits become stable. However, the number of such transformations becomes overwhelming as we move to higher dimensions [5, 16, 17]. We have recently proposed a set of stabilising transformations which is constructed from a small set of already found UPOs [1]. The real value of the set is that its cardinality depends on the dimension of the unstable manifold at the UPO rather than the dimension of the system. Here we extend this approach to high dimensional systems of ODEs and apply it to the model example of a chaotic spatially extended system - the Kuramoto-Sivashinsky equation

Reformulations of mathematical programming problems as linear complementarity problems

A family of complementarity problems are defined as extensions of the well known Linear Complementarity Problem (LCP). These are (i.) Second Linear Complementarity Problem (SLCP) which is an LCP extended by introducing further equality restrictions and unrestricted variables, (ii.) Minimum Linear Complementarity Problem (MLCP) which is an LCP with additional variables not required to be complementary and with a linear objective function which is to be minimized, (iii.) Second Minimum Linear Complementarity Problem (SMLCP) which is an MLCP but the nonnegative restriction on one of each pair of complementary variables is relaxed so that it is allowed to be unrestricted in value. A number of well known mathematical programming problems, namely quadratic programming (convex, nonconvex, pseudoconvex nonconvex), bilinear programming, game theory, zero-one integer programming, the fixed charge problem, absolute value programming, variable separable programming are reformulated as members of this family of four complementarity problems

An enumerative method for the solution of linear complementarity problems

In this report an enumerative method for the solution of the Linear Complementarity Problem (LCP) is presented. This algorithm completely processes the LCP, and does not require any particular property of the LCP to apply. That is the algorithm terminates after either finding all the solutions of an LCP or establishing that no solution exists. The method is extended to also process the Second Linear Complementarity Problem (SLCP), a problem which has been introduced to represent the general quadratic program involving unrestricted variables