Status of MICE

Muon ionization cooling is the only practical method for preparing high-brilliance beams needed for a neutrino factory or muon collider. The muon ionization cooling experiment (MICE) under development at the Rutherford Appleton Laboratory comprises a dedicated beamline to generate a range of input emittance and momentum, with time-of-flight and Cherenkov detectors to ensure a pure muon beam. A first measurement of emittance is performed in the upstream magnetic spectrometer with a scintillating-fiber tracker. A cooling cell will then follow, alternating energy loss in liquid hydrogen with RF acceleration. A second spectrometer identical to the first and a particle identification system will measure the outgoing emittance. Plans for measurements of emittance and cooling are described.Comment: Poster presented at ICHEP08 Conference, Philadelphia, USA, July 2008. 3 pages, 3 figure

The performance of innovation networks in transition economies: An empirical study of Slovenia

Although the post-socialist countries in Eastern Europe experienced radical economic reforms, in many cases, the transformation of the industry sector has not been completed. As a result, the majority of enterprises is not internationally competitive and technological innovation is low. A model to foster innovation and competitiveness of Eastern European industries could be provided by western European regions with above-average growth rates during the last decades. The success of these regions, as is argued by an extensive literature on industrial districts, innovation networks and innovative milieux, relies on a special form of co-operation between companies from inside (and outside) the region. The aim of this paper is to assess the performance of networks and their impact on innovation activities in the transition context and to identify starting points for innovation policies. The empirical analysis is based on an extensive survey of industry and science in Slovenia. The theoretically guided empirical study of Slovenia further develops network analysis in the transformation context. Although Slovenia is one of the most developed transition economies, the socialist legacy, such as the fragmentation of research, applies to her as well. The first step assesses existing newly emerged and established networks in terms of type and quality of relations. As the opportunities of learning, technology transfer and innovating depend to some extend on the type of network, supplier-user relationships and horizontal networks between industry and science are distinguished. The quality of networks refers to their transactional and informational structure, trust relationships and regional dimensions. Special attention is on old versus new networks and their conduciveness to innovation: Whereas many actors in transition economies mourn about lost partnerships, these might hamper innovation. Therefore, the second step of this analysis documents the innovation performance of the sample. It relates the propensity of firms to engage in networks to the impact on process and product innovation. The third part is oriented towards policy recommendations. The Slovenian innovation policy is evaluated from the enterprises? point of view. This relies on the basis of the empirical analysis of the emergence of innovation networks and support by public programmes. The Ministry for Science and Technology has introduced various measures to realise the country?s innovation potential. The aim of the analysis is to suggest further improvements to effectively stimulate the development and consolidation of innovation networks. This benefits from extensive qualitative research carried out during the past years.

Implementing path coloring algorithms on planar graphs

Master's Project (M.S.) University of Alaska Fairbanks, 2017A path coloring of a graph partitions its vertex set into color classes such that each class induces a disjoint union of paths. In this project we implement several algorithms to compute path colorings of graphs embedded in the plane. We present two algorithms to path color plane graphs with 3 colors based on a proof by Poh in 1990. First we describe a naive algorithm that directly follows Poh's procedure, then we give a modified algorithm that runs in linear time. Independent results of Hartman and Skrekovski describe a procedure that takes a plane graph G and a list of 3 colors for each vertex, and computes a path coloring of G such that each vertex receives a color from its list. We present a linear time implementation based on Hartman and Skrekovski's proofs. A C++ implementation is provided for all three algorithms, utilizing the Boost Graph Library. Instructions are given on how to use the implementation to construct colorings for plane graphs represented by Boost data structures