Low-temperature catalytic decomposition of N2O on platinum and bismuth-modified platinum: identification of active sites

Classification of the active surface sites of platinum catalysts responsible for low temperature N2O decomposition, in terms of steps, kinks and terraces, has been achieved by controlled addition of bismuth to as-received platinum/graphite catalysts.

A first principles study of methanol decomposition on Pd(111): Mechanisms for O-H bond scission and C-O bond scission

There is some dispute as to whether methanol decomposition occurs by O-H bond scission or C-O bond scission. By carrying out density functional theory calculations, we investigate both scenario of the reaction pathways of methanol decomposition on a Pd(111) surface. It is shown that the O-H bond scission pathway is much more energetically favorable than the C-O bond scission pathway. The high reaction barrier in the latter case is found to be due to the poor bonding abilities of CH3 and OH with the surface at the reaction sites. (C) 2001 American Institute of Physics.

A Survey of Search Methodologies and Automated System Development for Examination Timetabling

Exam timetabling is one of the most important administrative activities that takes place in academic institutions. In this paper we present a critical discussion of the research on exam timetabling in the last decade or so. This last ten years has seen an increased level of attention on this important topic. There has been a range of significant contributions to the scientific literature both in terms of theoretical andpractical aspects. The main aim of this survey is to highlight the new trends and key research achievements that have been carried out in the last decade.We also aim to outline a range of relevant important research issues and challenges that have been generated by this body of work.

We first define the problem and review previous survey papers. Algorithmic approaches are then classified and discussed. These include early techniques (e.g. graph heuristics) and state-of-the-art approaches including meta-heuristics, constraint based methods, multi-criteria techniques, hybridisations, and recent new trends concerning neighbourhood structures, which are motivated by raising the generality of the approaches. Summarising tables are presented to provide an overall view of these techniques. We discuss some issues on decomposition techniques, system tools and languages, models and complexity. We also present and discuss some important issues which have come to light concerning the public benchmark exam timetabling data. Different versions of problem datasetswith the same name have been circulating in the scientific community in the last ten years which has generated a significant amount of confusion. We clarify the situation and present a re-naming of the widely studied datasets to avoid future confusion. We also highlight which research papershave dealt with which dataset. Finally, we draw upon our discussion of the literature to present a (non-exhaustive) range of potential future research directions and open issues in exam timetabling research.

Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems

In this paper, we present a random iterative graph based hyper-heuristic to produce a collection of heuristic sequences to construct solutions of different quality. These heuristic sequences can be seen as dynamic hybridisations of different graph colouring heuristics that construct solutions step by step. Based on these sequences, we statistically analyse the way in which graph colouring heuristics are automatically hybridised. This, to our knowledge, represents a new direction in hyper-heuristic research. It is observed that spending the search effort on hybridising Largest Weighted Degree with Saturation Degree at the early stage of solution construction tends to generate high quality solutions. Based on these observations, an iterative hybrid approach is developed to adaptively hybridise these two graph colouring heuristics at different stages of solution construction. The overall aim here is to automate the heuristic design process, which draws upon an emerging research theme on developing computer methods to design and adapt heuristics automatically. Experimental results on benchmark exam timetabling and graph colouring problems demonstrate the effectiveness and generality of this adaptive hybrid approach compared with previous methods on automatically generating and adapting heuristics. Indeed, we also show that the approach is competitive with the state of the art human produced methods.

Phase transition and decomposition temperatures, heat capacities and viscosities of pyridinium ionic liquids

Ionic liquids are organic salts with low melting points. Many of these compounds are liquid at room temperature in their pure state. Since they have negligible vapor pressure and would not contribute to air pollution, they are being intensively investigated for a variety of applications, including as solvents for reactions and separations, as non-volatile electrolytes, and as heat transfer fluids. We present melting temperatures, glass transition temperatures, decomposition temperatures, heat capacities, and viscosities for a large series of pyridinium-based ionic liquids. For comparison, we include data for several imidazolium and quaternary ammonium salts. Many of the compounds do not crystallize, but form glasses at temperatures between 188 K and 223 K. The thermal stability is largely determined by the coordinating ability of the anion, with ionic liquids made with the least coordinating anions, like bis(trifluoromethylsulfonyl)imide, having the best thermal stability. In particular, dimethylaminopyridinium bis(trifluoromethylsulfonyl)imide salts have some of the best thermal stabilities of any ionic liquid compounds investigated to date. Heat capacities increase approximately linearly with increasing molar mass, which corresponds with increasing numbers of translational, vibrational, and rotational modes. Viscosities generally increase with increasing number and length of alkyl substituents on the cation, with the pyridinium salts typically being slightly more viscous than the equivalent imidazolium compounds. (c) 2005 Elsevier Ltd. All rights reserved.

Compact Toffoli gate using weighted graph states

We introduce three compact graph states that can be used to perform a measurement-based Toffoli gate. Given a weighted graph of six, seven, or eight qubits, we show that success probabilities of 1/4, 1/2, and 1, respectively, can be achieved. Our study puts a measurement-based version of this important quantum logic gate within the reach of current experiments. As the graphs are setup independent, they could be realized in a variety of systems, including linear optics and ion traps.

Structural information content of networks: Graph entropy based on local vertex functionals

In this paper we define the structural information content of graphs as their corresponding graph entropy. This definition is based on local vertex functionals obtained by calculating-spheres via the algorithm of Dijkstra. We prove that the graph entropy and, hence, the local vertex functionals can be computed with polynomial time complexity enabling the application of our measure for large graphs. In this paper we present numerical results for the graph entropy of chemical graphs and discuss resulting properties. (C) 2007 Elsevier Ltd. All rights reserved.

QR decomposition-based matrix inversion for high performance embedded MIMO receivers

Real-time matrix inversion is a key enabling technology in multiple-input multiple-output (MIMO) communications systems, such as 802.11n. To date, however, no matrix inversion implementation has been devised which supports real-time operation for these standards. In this paper, we overcome this barrier by presenting a novel matrix inversion algorithm which is ideally suited to high performance floating-point implementation. We show how the resulting architecture offers fundamentally higher performance than currently published matrix inversion approaches and we use it to create the first reported architecture capable of supporting real-time 802.11n operation. Specifically, we present a matrix inversion approach based on modified squared Givens rotations (MSGR). This is a new QR decomposition algorithm which overcomes critical limitations in other QR algorithms that prohibits their application to MIMO systems. In addition, we present a novel modification that further reduces the complexity of MSGR by almost 20%. This enables real-time implementation with negligible reduction in the accuracy of the inversion operation, or the BER of a MIMO receiver based on this.

TAP studies of ammonia decomposition over Ru and Ir catalysts

The Temporal Analysis of Products (TAP) technique has been used to investigate the mechanism involved in the catalytic decomposition of NH3 over a series of catalysts consisting of activated carbon supported Ru (promoted and non-promoted with Na) and over an activated carbon supported Ir. An extensive study of the role played by both the support and the promoter in the