Instability of diatomic deuterium in fcc palladium

To clarify some of the solid-state aspects of cold fusion in deuterated transition metal electrodes, we have carried out first-principles self-consistent total energy calculations for various configurations of atomic and diatomic deuterium inside fcc palladium. We find that the stability of the Pd+D system is controlled by the relative position of the deuterium-inducedantibonding level with respect to the Fermi energy. The equilibrium D-D distance in dense PdD up to =3 is found to be much larger than the free space value. The calculated Born-Oppenheimer energy surface of diatomic D₂ in crystalline palladiuim is shown to have but metastable local minima whose internuclear separation is at least 0.2 Ålarger than that of the isolated D₂ molecule. We conclude that D₂ incrystalline Pd will have a substantially lower tunneling probability than hitherto thought and that explanation for fusion mechanisms should be sought elsewhere.     

Monomer and amino resin modified tall oil fatty acid alkyds

Summary Monomer modified tall oil fatty acid trimethylolethane medium type of phthalic alkyds made by the High Polymer Alkyd Technique show improved properties in dry time, mar resistance, and flexibility as compared with monomer modified conventional prepared systems. Greater hardness, less color degradation, greater resistance to extended periods at high temperature, and alkali and detergent resistances result from the urea and melamine resin modifications of tall oil fatty acid High Polymer alkyds than is obtained with similarly modified conventional alkyds.     

Substrate-mediated interactions and intermolecular forces between molecules adsorbed on surfaces

Adsorbate interactions and reactions on metal surfaces have been investigated using scanning tunneling microscopy. The manners in which adsorbates perturb the surface electronic structure in their vicinity are discussed. The effects these perturbations have on other molecules are shown to be important in overlayer growth. Interactions of molecules with surface steps are addressed, and each molecule's electron affinity is shown to dictate its adsorption sites at step edges. Standing waves emanating from steps are demonstrated to effect transient molecular adsorption up to 40 A away from the step edge. Halobenzene derivatives are used to demonstrate how the surface is important in aligning reactive intermediates.     

Hierarchical classification of protein function with ensembles of rules and particle swarm optimisation

This paper focuses on hierarchical classification problems where the classes to be predicted are organized in the form of a tree. The standard top-down divide and conquer approach for hierarchical classification consists of building a hierarchy of classifiers where a classifier is built for each internal (non-leaf) node in the class tree. Each classifier discriminates only between its child classes. After the tree of classifiers is built, the system uses them to classify test examples one class level at a time, so that when the example is assigned a class at a given level, only the child classes need to be considered at the next level. This approach has the drawback that, if a test example is misclassified at a certain class level, it will be misclassified at deeper levels too. In this paper we propose hierarchical classification methods to mitigate this drawback. More precisely, we propose a method called hierarchical ensemble of hierarchical rule sets (HEHRS), where different ensembles are built at different levels in the class tree and each ensemble consists of different rule sets built from training examples at different levels of the class tree. We also use a particle swarm optimisation (PSO) algorithm to optimise the rule weights used by HEHRS to combine the predictions of different rules into a class to be assigned to a given test example. In addition, we propose a variant of a method to mitigate the aforementioned drawback of top-down classification. These three types of methods are compared against the standard top-down hierarchical classification method in six challenging bioinformatics datasets, involving the prediction of protein function. Overall HEHRS with the rule weights optimised by the PSO algorithm obtains the best predictive accuracy out of the four types of hierarchical classification method.     

USE of Railway Analysis Tools from an Australian Perspective

The functions of Australia’s railways are divided between the delivery of suburban passenger railway services, long distance general and intermodal freight services and regional bulk commodity haulage. There is a national interest in the efficient carriage of export freight flows because Australia is a major trading nation. Australia’s railways are expected play their part in hauling export commodities. Unsurprisingly, there are conflicting demands on these railways. Hence, universities, and the industry itself, are directing research and investigation effort into policy, planning, engineering, operational and human factors matters. A question which then arises is what means could be used to analyse the problems identified during this research and investigation. This paper is thus concerned with the inter-relationships between the planning, engineering and operations of railways in Australia. It identifies four areas of analysis associated with the planning and development of railway infrastructure and operations. It then discusses a range of analytical tools which could be applied to different components of these analytical areas and critiques their appropriateness from an Australian perspective. Having made this assessment, the paper uses a recent Australian case study to show how analytical tools could be used and what lessons might be learnt from the process. Figure Use of Railway Analysis Tools from an Australian Perspective

A queue based mutual exclusion algorithm

A new elegant and simple algorithm for mutual exclusion of N processes is proposed. It only requires shared variables in a memory model where shared variables need not be accessed atomically. We prove mutual exclusion by reformulating the algorithm as a transition system (automaton), and applying simulation of automata. The proof has been verified with the higher-order interactive theorem prover PVS. Under an additional atomicity assumption, the algorithm is starvation free, and we conjecture that no competing process is passed by any other process more than once. This conjecture was verified by model checking for systems with at most five processes.     

DOLAR: virtualizing heterogeneous information spaces to support their expansion

Users expect applications to successfully cope with the expansion of information as necessitated by the continuous inclusion of novel types of content. Given that such content may originate from ‘not‐seen thus far’ data collections and/or data sources, the challenging issue is to achieve the return of investment on existing services, adapting to new information without changing existing business‐logic implementation. To address this need, we introduce DOLAR (Data Object Language And Runtime), a service‐neutral framework which virtualizes the information space to avoid invasive, time‐consuming, and expensive source‐code extensions that frequently break applications. Specifically, DOLAR automates the introduction of new business‐logic objects in terms of the proposed virtual ‘content objects’. Such user‐specified virtual objects align to storage artifacts and help realize uniform ‘store‐to‐user’ data flows atop heterogeneous sources, while offering the reverse ‘user‐to‐store’ flows with identical effectiveness and ease of use. In addition, the suggested virtual object composition schemes help decouple business logic from any content origin, storage and/or structural details, allowing applications to support novel types of items without modifying their service provisions. We expect that content‐rich applications will benefit from our approach and demonstrate how DOLAR has assisted in the cost‐effective development and gradual expansion of a production‐quality digital library. Experimentation shows that our approach imposes minimal overheads and DOLAR‐based applications scale as well as any underlying datastore(s). Copyright © 2011 John Wiley & Sons, Ltd.     

Optimal neuronal tuning for finite stimulus spaces

The efficiency of neuronal encoding in sensory and motor systems has been proposed as a first principle governing response properties within the central nervous system. We present a continuation of a theoretical study presented by Zhang and Sejnowski, where the influence of neuronal tuning properties on encoding accuracy is analyzed using information theory. When a finite stimulus space is considered, we show that the encoding accuracy improves with narrow tuning for one- and two-dimensional stimuli. For three dimensions and higher, there is an optimal tuning width.