نتایج جستجو برای: catalyst characterization
تعداد نتایج: 415808 فیلتر نتایج به سال:
This paper focuses on a new polyaniline-derived non-precious cathode catalyst with high oxygen-reduction activity, verified in electrochemical and fuel cell testing. The rotating disk (RDE) onset and half-wave potential (E1⁄2) of oxygen reduction were measured at 0.90 V and 0.77 V, respectively. Rotating ring-disk electrode (RRDE) study revealed very good selectivity in the fourelectron reducti...
Cobalt zinc oxide catalysts have been prepared by anti-solvent precipitation in supercritical CO2 and investigated for CO hydrogenation. Here we show how the textural and catalytic properties of the catalyst can be tailored by the addition of water to the initial solution of cobalt and zinc acetates in methanol. Characterization of the catalysts by powder X-ray diffraction, infra-red and Raman ...
An improved gram-scale synthesis of Bn5CpRu(CO)2Cl is reported based on heating of pentabenzylcyclopentadiene with Ru3(CO)12 at 160 °C under argon atmosphere in mesitylene followed by addition of chloroform, continued heating, and evaporation of the solvents. Subsequent washing of unreacted ligand precursor with hexane provided pure title compound in 77 % yield. In combination with Candida anta...
In this paper, we obtain a forbidden-minor characterization of the class of binary gammoids M such that, for every pair of elements x, y of M, both the splitting matroid Mx,y and the element splitting matroid M ′ x,y are binary gammoids.
A connected edge-colored graphG is said to be rainbow-connected if any two distinct vertices of G are connected by a path whose edges have pairwise distinct colors, and the rainbow connection number rc(G) ofG is the minimum number of colors that can make G rainbow-connected. We consider families F of connected graphs for which there is a constant kF such that every connected F-free graph G with...
Categorical skew lattices are a variety of skew lattices on which the natural partial order is especially well behaved. While most skew lattices of interest are categorical, not all are. They are characterized by a countable family of forbidden subalgebras. We also consider the subclass of strictly categorical skew lattices.
We characterize graphs that have intersection representations using unit intervals with open or closed ends such that all ends of the intervals are integral in terms of infinitely many minimal forbidden induced subgraphs. Furthermore, we provide a quadratic-time algorithm that decides if a given interval graph admits such an intersection representation.
An undirected graph G = (V, E) is a probe split graph if its vertex set can be partitioned into two sets, N (nonprobes) and P (probes) where N is independent and there exists E′ ⊆ N ×N such that G′ = (V, E ∪ E′) is a split graph. Recently Chang et al. gave an O(V (V +E)) time recognition algorithm for probe split graphs. In this article we give O(V 2 +V E) time recognition algorithms and charac...
A method for recognition of Persian handwritten digits based on characterization loci and mixture of experts is proposed. This method utilizes the characterization loci, as the main feature. In the classification stage of our proposed method the mixture of experts are applied. This recognition method is applied to Farsi hand-written digits in the HODA database. The experimental results support ...
Recently Postnikov gave a combinatorial description of the cells in a totallynonnegative Grassmannian. These cells correspond to a special class of matroids called positroids. We prove his conjecture that a positroid is exactly an intersection of permuted Schubert matroids. This leads to a combinatorial description of positroids that is easily computable. The main proof is purely combinatorial,...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید