Negative apparent kinetic order in steady-state kinetics of the water-gas shift reaction over a Pt-CeO2 catalyst

The kinetics of the water-gas shift reaction Were Studied on a 0.2% Pt/CeO2 catalyst between 177 and 300 degrees C over a range of CO and steam pressures. A rate decrease with increasing partial pressure of CO was experimentally observed over this sample, confirming that a negative order in CO can occur under certain conditions at low temperatures. The apparent reaction order of CO measured at 197 degrees C was about -0.27. This value is significantly larger than that (i.e, -0.03) reported by Ribeiro and co-workers [A.A. Phatak, N. Koryabkina, S. Rai, J.L. Ratts, W. Ruettinger, R.J. Farrauto, G.E. Blau, W.N. Delgass, F.H. Ribeiro, Catal. Today 123 (2007) 224] at a similar temperature. A kinetic peculiarity was also evidenced, i.e. a maximum of the reaction rate as a function of the CO concentration or possibly a kinetic break, which is sometimes observed in the oxidation of simple molecules. These observations support the idea that competitive adsorption of CO and H2O play an essential role in the reaction mechanism. (C) 2008 Elsevier B.V. All rights reserved.

Convergence of partial-wave expansions for energies, scattering amplitudes and positron annihilation rates

We use many-body theory to find the asymptotic behaviour of second-order correlation corrections to the energies and positron annihilation rates in many- electron systems with respect to the angular momenta l of the single-particle orbitals included. The energy corrections decrease as 1/(l+1/2)4, in agreement with the result of Schwartz, whereas the positron annihilation rate has a slower 1/(l+1/2)2 convergence rate. We illustrate these results by numerical calculations of the energies of Ne and Kr and by examining results from extensive con?guration-interaction calculations of PsH binding and annihilation.

Reasoning about orchestrations of web services using partial correctness

A service is a remote computational facility which is made available for general use by means of a wide-area network. Several types of service arise in practice: stateless services, shared state services and services with states which are customised for individual users. A service-based orchestration is a multi-threaded computation which invokes remote services in order to deliver results back to a user (publication). In this paper a means of specifying services and reasoning about the correctness of orchestrations over stateless services is presented. As web services are potentially unreliable the termination of even finite orchestrations cannot be guaranteed. For this reason a partial-correctness powerdomain approach is proposed to capture the semantics of recursive orchestrations.

Partial and total multiphoton detachment rates for H- in a perturbative B-spline-based approach

An ab initio approach has been applied to study multiphoton detachment rates for the negative hydrogen ion in the lowest nonvanishing order of perturbation theory. The approach is based on the use of B splines allowing an accurate treatment of the electronic repulsion. Total detachment rates have been determined for two- to six-photon processes as well as partial rates for detachment into the different final symmetries. It is shown that B-spline expansions can yield accurate continuum and bound-state wave functions in a very simple manner. The calculated total rates for two- and three-photon detachment are in good agreement with other perturbative calculations. For more than three-photon detachment little information has been available before now. While the total cross sections show little structure, a fair amount of structure is predicted in the partial cross sections. In the two-photon process, it is shown that the detached electrons mainly have s character. For four- and six-photon processes, the contribution from the d channel is the most important. For three- and five-photon processes p electrons dominate the electron emission spectrum. Detachment rates for s and p electrons show minima as a function of photon energy. © 1994 The American Physical Society.

Magnetic short-range order in the new ternary phase Mn8Pd15Si7

A new compound, Mn8Pd15Si7, is reported to crystallize in a face centered cubic unit cell of dimension a = 12.0141(2) angstrom, space groupFm (3) over barm, and can thus be classified as a G-phase. The crystal structure was studied by single crystal X-ray diffraction, X-ray and neutron powder diffraction and electron diffraction. A filled Mg6Cu16Si7 type structure was found, corresponding to the Sc11Ir4 type structure. The magnetic properties were investigated by magnetization measurements and Reverse Monte Carlo modeling of low temperature magnetic short-range order (SRO). Dominating near neighbor antiferromagnetic correlations were found between the Mn atoms and geometric frustration in combination with random magnetic interactions via metal sites with partial Mn occupancy were suggested to hinder formation of long-range magnetic order. 

Thermography-based virtual MPPT scheme for improving PV energy efficiency under partial shading conditions

This paper proposes a new thermography-based maximum power point tracking (MPPT) scheme to address photovoltaic (PV) partial shading faults. Solar power generation utilizes a large number of PV cells connected in series and in parallel in an array, and that are physically distributed across a large field. When a PV module is faulted or partial shading occurs, the PV system sees a nonuniform distribution of generated electrical power and thermal profile, and the generation of multiple maximum power points (MPPs). If left untreated, this reduces the overall power generation and severe faults may propagate, resulting in damage to the system. In this paper, a thermal camera is employed for fault detection and a new MPPT scheme is developed to alter the operating point to match an optimized MPP. Extensive data mining is conducted on the images from the thermal camera in order to locate global MPPs. Based on this, a virtual MPPT is set out to find the global MPP. This can reduce MPPT time and be used to calculate the MPP reference voltage. Finally, the proposed methodology is experimentally implemented and validated by tests on a 600-W PV array. 

A belief revision framework for revising epistemic states with partial epistemic states

Belief revision performs belief change on an agent’s beliefs when new evidence (either of the form of a propositional formula or of the form of a total pre-order on a set of interpretations) is received. Jeffrey’s rule is commonly used for revising probabilistic epistemic states when new information is probabilistically uncertain. In this paper, we propose a general epistemic revision framework where new evidence is of the form of a partial epistemic state. Our framework extends Jeffrey’s rule with uncertain inputs and covers well-known existing frameworks such as ordinal conditional function (OCF) or possibility theory. We then define a set of postulates that such revision operators shall satisfy and establish representation theorems to characterize those postulates. We show that these postulates reveal common characteristics of various existing revision strategies and are satisfied by OCF conditionalization, Jeffrey’s rule of conditioning and possibility conditionalization. Furthermore, when reducing to the belief revision situation, our postulates can induce Darwiche and Pearl’s postulates C1 and C2.

Revising Partial Pre-Orders with Partial Pre-Orders: A Unit-Based Revision Framework

Belief revision studies strategies about how agents revise their belief states when receiving new evidence. Both in classical belief revision and in epistemic revision, a new input is either in the form of a (weighted) propositional formula or a total
pre-order (where the total pre-order is considered as a whole).
However, in some real-world applications, a new input can be a partial pre-order where each unit that constitutes the partial pre-order is important and should be considered individually. To address this issue, in this paper, we study how a partial preorder representing the prior epistemic state can be revised by another partial pre-order (the new input) from a different perspective, where the revision is conducted recursively on the individual units of partial pre-orders. We propose different revision operators (rules), dubbed the extension, match, inner and outer revision operators, from different revision points of view. We also analyze several properties for these operators.

Revision over Partial Pre-orders: A Postulational Study

Belief revision is the process that incorporates, in a consistent way,
a new piece of information, called input, into a belief base. When both belief
bases and inputs are propositional formulas, a set of natural and rational properties, known as AGM postulates, have been proposed to define genuine revision operations. This paper addresses the following important issue : How to revise a partially pre-ordered information (representing initial beliefs) with a new partially pre-ordered information (representing inputs) while preserving AGM postulates? We first provide a particular representation of partial pre-orders (called units) using the concept of closed sets of units. Then we restate AGM postulates in this framework by defining counterparts of the notions of logical entailment and logical consistency. In the second part of the paper, we provide some examples of revision operations that respect our set of postulates. We also prove that our revision methods extend well-known lexicographic revision and natural revision for both cases where the input is either a single propositional formula or a total pre-order.

Rational Partial Choice Functions and Their Application to Belief Revision.

Necessary and sufficient conditions for choice functions to be rational have been intensively studied in the past. However, in these attempts, a choice function is completely specified. That is, given any subset of options, called an issue, the best option over that issue is always known, whilst in real-world scenarios, it is very often that only a few choices are known instead of all. In this paper, we study partial choice functions and investigate necessary and sufficient rationality conditions for situations where only a few choices are known. We prove that our necessary and sufficient condition for partial choice functions boils down to the necessary and sufficient conditions for complete choice functions proposed in the literature. Choice functions have been instrumental in belief revision theory. That is, in most approaches to belief revision, the problem studied can simply be described as the choice of possible worlds compatible with the input information, given an agent’s prior belief state. The main effort has been to devise strategies in order to infer the agents revised belief state. Our study considers the converse problem: given a collection of input information items and their corresponding revision results (as provided by an agent), does there exist a rational revision operation used by the agent and a consistent belief state that may explain the observed results?

JPEG decoder implementation on FPGA using dynamic partial reconfiguration

Trabalho Final de Mestrado para obtenção do grau de Mestre em Engenharia de Electrónica e telecomunicações

Use of DNA profiles for investigation using a simulated national DNA database: Part I. Partial SGM Plus profiles.

In traditional criminal investigation, uncertainties are often dealt with using a combination of common sense, practical considerations and experience, but rarely with tailored statistical models. For example, in some countries, in order to search for a given profile in the national DNA database, it must have allelic information for six or more of the ten SGM Plus loci for a simple trace. If the profile does not have this amount of information then it cannot be searched in the national DNA database (NDNAD). This requirement (of a result at six or more loci) is not based on a statistical approach, but rather on the feeling that six or more would be sufficient. A statistical approach, however, could be more rigorous and objective and would take into consideration factors such as the probability of adventitious matches relative to the actual database size and/or investigator's requirements in a sensible way. Therefore, this research was undertaken to establish scientific foundations pertaining to the use of partial SGM Plus loci profiles (or similar) for investigation.

Does friendship give us non-derivative partial reasons ?

Une des façons d’approcher la question de l’existence de raisons partiales non-dérivatives d’une quelconque sorte consiste à expliquer ce que sont les raisons partiales et ensuite à chercher à savoir s’il y a des raisons de cette sorte. Si de telles raisons existent, alors il est au moins possible qu’il y ait des raisons partiales d’amitié. C’est cette approche que j’adopterai ici, et elle produit des résultats intéressants. Le premier a trait à la structure des raisons partiales. C’est au moins une condition nécessaire pour qu’une raison soit partiale qu’elle aie une composante relationnelle explicite. Cette composante, techniquement parlant, est un relatum dans la relation d’être une raison qui elle-même est une relation entre la personne à qui la raison s’applique et la personne concernée par l’action pour laquelle il y a une raison. La deuxième conclusion de ce texte est que cette composante relationnelle est aussi requise dans de nombreuses sortes de raisons admises comme impartiales. Afin d’éviter de banaliser la distinction entre raisons partiales et impartiales nous devons appliquer une condition suffisante additionnelle. Finalement, bien qu’il pourrait s’avérer possible de distinguer les raisons impartiales ayant une composante relationnelle des raisons partiales, cette approche suggère que la question de savoir si l’éthique est partiale ou impartiale devra se régler au niveau de l’éthique normative, ou à tout le moins, qu’elle ne pourra se régler au niveau du discours sur la nature des raisons d’agir.

Essays in partial identification and applications to treatment effects and policy evaluation.

Dans cette thèse, je me suis interessé à l’identification partielle des effets de traitements dans différents modèles de choix discrets avec traitements endogènes. Les modèles d’effets de traitement ont pour but de mesurer l’impact de certaines interventions sur certaines variables d’intérêt. Le type de traitement et la variable d’intérêt peuvent être défini de manière générale afin de pouvoir être appliqué à plusieurs différents contextes. Il y a plusieurs exemples de traitement en économie du travail, de la santé, de l’éducation, ou en organisation industrielle telle que les programmes de formation à l’emploi, les techniques médicales, l’investissement en recherche et développement, ou l’appartenance à un syndicat. La décision d’être traité ou pas n’est généralement pas aléatoire mais est basée sur des choix et des préférences individuelles. Dans un tel contexte, mesurer l’effet du traitement devient problématique car il faut tenir compte du biais de sélection. Plusieurs versions paramétriques de ces modèles ont été largement étudiées dans la littérature, cependant dans les modèles à variation discrète, la paramétrisation est une source importante d’identification. Dans un tel contexte, il est donc difficile de savoir si les résultats empiriques obtenus sont guidés par les données ou par la paramétrisation imposée au modèle. Etant donné, que les formes paramétriques proposées pour ces types de modèles n’ont généralement pas de fondement économique, je propose dans cette thèse de regarder la version nonparamétrique de ces modèles. Ceci permettra donc de proposer des politiques économiques plus robustes. La principale difficulté dans l’identification nonparamétrique de fonctions structurelles, est le fait que la structure suggérée ne permet pas d’identifier un unique processus générateur des données et ceci peut être du soit à la présence d’équilibres multiples ou soit à des contraintes sur les observables. Dans de telles situations, les méthodes d’identifications traditionnelles deviennent inapplicable d’où le récent développement de la littérature sur l’identification dans les modèles incomplets. Cette littérature porte une attention particuliere à l’identification de l’ensemble des fonctions structurelles d’intérêt qui sont compatibles avec la vraie distribution des données, cet ensemble est appelé : l’ensemble identifié. Par conséquent, dans le premier chapitre de la thèse, je caractérise l’ensemble identifié pour les effets de traitements dans le modèle triangulaire binaire. Dans le second chapitre, je considère le modèle de Roy discret. Je caractérise l’ensemble identifié pour les effets de traitements dans un modèle de choix de secteur lorsque la variable d’intérêt est discrète. Les hypothèses de sélection du secteur comprennent le choix de sélection simple, étendu et généralisé de Roy. Dans le dernier chapitre, je considère un modèle à variable dépendante binaire avec plusieurs dimensions d’hétérogéneité, tels que les jeux d’entrées ou de participation. je caractérise l’ensemble identifié pour les fonctions de profits des firmes dans un jeux avec deux firmes et à information complète. Dans tout les chapitres, l’ensemble identifié des fonctions d’intérêt sont écrites sous formes de bornes et assez simple pour être estimées à partir des méthodes d’inférence existantes.

A Compilation Strategy for Numerical Programs Based on Partial Evaluation

This work demonstrates how partial evaluation can be put to practical use in the domain of high-performance numerical computation. I have developed a technique for performing partial evaluation by using placeholders to propagate intermediate results. For an important class of numerical programs, a compiler based on this technique improves performance by an order of magnitude over conventional compilation techniques. I show that by eliminating inherently sequential data-structure references, partial evaluation exposes the low-level parallelism inherent in a computation. I have implemented several parallel scheduling and analysis programs that study the tradeoffs involved in the design of an architecture that can effectively utilize this parallelism. I present these results using the 9- body gravitational attraction problem as an example.