Performance and optimization of a combustion interface for isotope ratio monitoring gas chromatography/mass spectrometry

Conditions and systems for on-line combustion of effluents from capillary gas chromatographic columns and for removal of water vapor from product streams were tested. Organic carbon in gas chromatographic peaks 15 s wide and containing up to 30 nanomoles of carbon was quantitatively converted to CO2 by tubular combustion reactors, 200 x 0.5 mm, packed with CuO or NiO. No auxiliary source of O2 was required because oxygen was supplied by metal oxides. Spontaneous degradation of CuO limited the life of CuO reactors at T > 850 degrees C. Since NiO does not spontaneously degrade, its use might be favored, but Ni-bound carbon phases form and lead to inaccurate isotopic results at T < 1050 degrees C if gas-phase O2 is not added. For all compounds tested except CH4, equivalent isotopic results are provided by CuO at 850 degrees C, NiO + O2 (gas-phase mole fraction, 10(-3)) at 1050 degrees C and NiO at 1150 degrees C. The combustion interface did not contribute additional analytical uncertainty, thus observed standard deviations of 13C/12C ratios were within a factor of 2 of shot-noise limits. For combustion and isotopic analyses of CH4, in which quantitative combustion required T approximately 950 degrees C, NiO-based systems are preferred, and precision is approximately 2 times lower than that observed for other analytes. Water must be removed from the gas stream transmitted to the mass spectrometer or else protonation of CO2 will lead to inaccuracy in isotopic analyses. Although thresholds for this effect vary between mass spectrometers, differential permeation of H2O through Nafion tubing was effective in both cases tested, but the required length of the Nafion membrane was 4 times greater for the more sensitive mass spectrometer.     

Influence of green creativity on organizations: A case study from the perspectives of leaders and subordinates

The sustainability framework has a strong influence on the policies, practices and procedures of companies. Green creativity plays a pivotal role in the development of initiatives and innovations for the environmental pillar of sustainability. Based on a survey applied to a Portuguese company with an accredited environmental management system (N = 146), the findings reveal that green creativity is influenced in different ways when analysed from distinct perspectives. The leader's green creativity is positively influenced by the subordinate's green self-efficacy and personal identification with the leader, whereas the subordinate's green creativity is positively influenced by their green passion and green self-efficacy, and the leaders' green creativity. This study shows that green creativity develops differentially according to distinct job positions and expectations that in practice must be complementary and synergistic for its effective development.     

Threshold Fluence Measurement for Laser Liftoff of InP Thin Films by Selective Absorption

We explore conditions for achieving laser liftoff in epitaxially grown heterojunctions, in which single crystal thin films can be separated from their growth substrates using a selectively absorbing buried intermediate layer. Because this highly non‐linear process is subject to a variety of process instabilities, it is essential to accurately characterize the parameters resulting in liftoff. Here, we present an InP/InGaAs/InP heterojunction as a model system for such characterization. We show separation of InP thin films from single crystal InP growth substrates, wherein a ≈10 ns, Nd:YAG laser pulse selectively heats a coherently strained, buried InGaAs layer. We develop a technique to measure liftoff threshold fluences within an inhomogeneous laser spatial profile, and apply this technique to determine threshold fluences of the order 0.5 J cm^?2 for our specimens. We find that the fluence at the InGaAs layer is limited by non‐linear absorption and InP surface damage at high powers, and measure the energy transmission in an InP substrate from 0 to 8 J cm^?2. Characterization of the ejected thin films shows crack‐free, single crystal InP. Finally, we present evidence that the hot InGaAs initiates a liquid phase front that travels into the InP substrate during liftoff.

     

Generalised rely-guarantee concurrency: an algebraic foundation

The rely-guarantee technique allows one to reason compositionally about concurrent programs. To handle interference the technique makes use of rely and guarantee conditions, both of which are binary relations on states. A rely condition is an assumption that the environment performs only atomic steps satisfying the rely relation and a guarantee is a commitment that every atomic step the program makes satisfies the guarantee relation. In order to investigate rely-guarantee reasoning more generally, in this paper we allow interference to be represented by a process rather than a relation and hence derive more general rely-guarantee laws. The paper makes use of a weak conjunction operator between processes, which generalises a guarantee relation to a guarantee process, and introduces a rely quotient operator, which generalises a rely relation to a process. The paper focuses on the algebraic properties of the general rely-guarantee theory. The Jones-style rely-guarantee theory can be interpreted as a model of the general algebraic theory and hence the general laws presented here hold for that theory.     

A semantics for Behavior Trees using CSP with specification commands

In this paper we give a formal definition of the requirements translation language Behavior Trees. This language has been used with success in industry to systematically translate large, complex, and often erroneous requirements documents into a structured model of the system. It contains a mixture of state-based manipulations, synchronisation, message passing, and parallel, conditional, and iterative control structures. The formal semantics of a Behavior Tree is given via a translation to a version of Hoare’s process algebra CSP, extended with state-based constructs such as guards and updates, and a message passing facility similar to that used in publish/subscribe protocols. We first provide the extension of CSP and its operational semantics, which preserves the meaning of the original CSP operators, and then the Behavior Tree notation and its translation into the extended version of CSP.     

An efficient blocking-matching algorithm based on fuzzy reasoning

Due to the temporal and spatial correlation of image sequence, the motion vector of a reference block is highly related to the motion vectors of its adjacent blocks in the same image frame. By using that idea, we propose a novel efficient fuzzy search (EFS) algorithm for block motion estimation. The experimental results show that the EFS performs better than other fast search algorithms, such as TSS, CS, NTSS, FSS, BBGDS, SES, and PSA in terms of picture quality, accuracy, computational complexity, and coding efficiency.     

Work-arounds and Boundary Crossing in a High Tech Optronics Company: The Role of Co-operative Workflow Technologies

This study examines how some employeescoped with the exceptions that they encountered withtheir on-going use of a co-operative workflowtechnology in an optronics company. By drawing on thecase material, this paper will indicate thatapproaches which view work as being capable of beingplanned and managed through the formal authority ofthe hierarchy are insufficient. Instead, this paperwill suggest that exception handling, work-arounds andimprovisation are more characteristic of humanactivity. Computer supported co-operative work will beconceptualised as being embedded in a dynamicrelationship between the context it is situatedwithin, and the actors that engage in it. Theprinciples underlying ethnography have informed theresearch approach.     

Neuroproteomics and systems biology-based discovery of protein biomarkers for traumatic brain injury and clinical validation

The rapidly growing field of neuroproteomics has expanded to track global proteomic changes underlying various neurological conditions such as traumatic brain injury (TBI), stroke, and Alzheimer's disease. TBI remains a major health problem with approximately 2?million incidents occurring annually in the United States, yet no affective treatment is available despite several clinical trials. The absence of brain injury diagnostic biomarkers was identified as a significant road-block to therapeutic development for brain injury. Recently, the field of neuroproteomics has undertaken major advances in the area of neurotrauma research, where several candidate markers have been identified and are being evaluated for their efficacy as biological biomarkers in the field of TBI. One scope of this review is to evaluate the current status of TBI biomarker discovery using neuroproteomics techniques, and at what stage we are at in their clinical validation. In addition, we will discuss the need for strengthening the role of systems biology and its application to the field of neuroproteomics due to its integral role in establishing a comprehensive understanding of specific brain disorder and brain function in general. Finally, to achieve true clinical input of these neuroproteomic findings, these putative biomarkers should be validated using preclinical and clinical samples and linked to clinical diagnostic assays including ELISA or other high-throughput assays.     

The Forgiving Graph: a distributed data structure for low stretch under adversarial attack

We consider the problem of self-healing in peer-to-peer networks that are under repeated attack by an omniscient adversary. We assume that, over a sequence of rounds, an adversary either inserts a node with arbitrary connections or deletes an arbitrary node from the network. The network responds to each such change by quick “repairs,” which consist of adding or deleting a small number of edges. These repairs essentially preserve closeness of nodes after adversarial deletions, without increasing node degrees by too much, in the following sense. At any point in the algorithm, nodes v and w whose distance would have been ? in the graph formed by considering only the adversarial insertions (not the adversarial deletions), will be at distance at most ? log n in the actual graph, where n is the total number of vertices seen so far. Similarly, at any point, a node v whose degree would have been d in the graph with adversarial insertions only, will have degree at most 3d in the actual graph. Our distributed data structure, which we call the Forgiving Graph, has low latency and bandwidth requirements. The Forgiving Graph improves on the Forgiving Tree distributed data structure from Hayes et?al. (2008) in the following ways: 1) it ensures low stretch over all pairs of nodes, while the Forgiving Tree only ensures low diameter increase; 2) it handles both node insertions and deletions, while the Forgiving Tree only handles deletions; 3) it requires only a very simple and minimal initialization phase, while the Forgiving Tree initially requires construction of a spanning tree of the network.