Search results for "SOFC"
showing 10 items of 660 documents
Quasispheres and metric doubling measures
2018
Applying the Bonk-Kleiner characterization of Ahlfors 2-regular quasispheres, we show that a metric two-sphere $X$ is a quasisphere if and only if $X$ is linearly locally connected and carries a weak metric doubling measure, i.e., a measure that deforms the metric on $X$ without much shrinking.
Gray coding cubic planar maps
2016
International audience; The idea of (combinatorial) Gray codes is to list objects in question in such a way that two successive objects differ in some pre-specified small way. In this paper, we utilize beta-description trees to cyclicly Gray code three classes of cubic planar maps, namely, bicubic planar maps, 3-connected cubic planar maps, and cubic non-separable planar maps. (C) 2015 Elsevier B.V. All rights reserved.
The correlation between intellectual property management and quality management in the modern knowledge-based economy
2018
The aim of this research paper is to highlight the intellectual property place and role within an industrial knowledge-based organization which performs design activities. The research begins by presenting the importance of integrating intellectual property policy implementation with quality policy. The research is based on the setting of objectives in the intellectual property field. This research also establishes some intellectual property strategies, and improvement measures for intellectual property protection management. The basis for these activities is correlation of the quality policy with an intellectual property policy, as well as the point of strength identified in the studied or…
Ultrametric Vs. Quantum Query Algorithms
2014
Ultrametric algorithms are similar to probabilistic algorithms but they describe the degree of indeterminism by p-adic numbers instead of real numbers. This paper introduces the notion of ultrametric query algorithms and shows an example of advantages of ultrametric query algorithms over deterministic, probabilistic and quantum query algorithms.
Quantum Lower Bound for Graph Collision Implies Lower Bound for Triangle Detection
2015
We show that an improvement to the best known quantum lower bound for GRAPH-COLLISION problem implies an improvement to the best known lower bound for TRIANGLE problem in the quantum query complexity model. In GRAPH-COLLISION we are given free access to a graph $(V,E)$ and access to a function $f:V\rightarrow \{0,1\}$ as a black box. We are asked to determine if there exist $(u,v) \in E$, such that $f(u)=f(v)=1$. In TRIANGLE we have a black box access to an adjacency matrix of a graph and we have to determine if the graph contains a triangle. For both of these problems the known lower bounds are trivial ($\Omega(\sqrt{n})$ and $\Omega(n)$, respectively) and there is no known matching upper …
Classification of the hadronic decays of the Z$^0$ into b and c quark pairs using a neural network
1992
A classifier based on a feed-forward neural network has been used for separating a sample of about 123 500 selected hadronic decays of the Z 0 , collected by DELPHI during 1991, into three classes according to the flavour of the original quark pair: u u +d d +s s (unresolved), c c and b b . The classification has been used to compute the partial widths of the Z 0 into b and c quark pairs. This gave Γ c c /Γ h = 0.151 ± 0.008 ( stat. ) ± 0.041 ( syst. ) , Γ b b /Γ h = 0.232±0.005 ( stat. )±0.017 ( syst. ) .
Spatial Search by Quantum Walk is Optimal for Almost all Graphs.
2015
The problem of finding a marked node in a graph can be solved by the spatial search algorithm based on continuous-time quantum walks (CTQW). However, this algorithm is known to run in optimal time only for a handful of graphs. In this work, we prove that for Erd\"os-Renyi random graphs, i.e.\ graphs of $n$ vertices where each edge exists with probability $p$, search by CTQW is \textit{almost surely} optimal as long as $p\geq \log^{3/2}(n)/n$. Consequently, we show that quantum spatial search is in fact optimal for \emph{almost all} graphs, meaning that the fraction of graphs of $n$ vertices for which this optimality holds tends to one in the asymptotic limit. We obtain this result by provin…
Equilibrium real gas computations using Marquina's scheme
2003
Marquina's approximate Riemann solver for the compressible Euler equations for gas dynamics is generalized to an arbitrary equilibrium equation of state. Applications of this solver to some test problems in one and two space dimensions show the desired accuracy and robustness
On a step method and a propagation of discontinuity
2019
In this paper we analyze how to compute discontinuous solutions for functional differential equations, looking at an approach which allows to study simultaneously continuous and discontinuous solutions. We focus our attention on the integral representation of solutions and we justify the applicability of such an approach. In particular, we improve the step method in such a way to solve a problem of vanishing discontinuity points. Our solutions are considered as regulated functions.
Development of electrodes materials for SOFC fed by natural gas / biogas. Applications to "pre-reforming" and "single-chamber" concepts
2010
Solid Oxide Fuel Cell is a device for “clean” electricity production from chemical energy. The new configuration called “single-chamber” seems to be very attractive with several advantages over bi-chamber conventional configuration: easier manufacturing, lowering of working temperature, possible use of hydrocarbons as fuel… Such configuration involves the development of new electrode materials satisfying new requirements. The evaluation of 7 potential cathode materials through several characterizations has shown that a compromise has to be found since one material does not exhibit all the requested features. A library of 15 supported catalysts (3 metals and 5 supports) was developed. These …