Improved formic acid oxidation using electrodeposited Pd–Cd electrocatalysts in sulfuric acid solution

In the present research, nanostructured Pd–Cd alloy electrocatalysts with different compositions were produced using the electrodeposition process. The morphology of the samples was studied by scanning electron microscopy analysis. Also, the elemental composition of the samples was determined by energy-dispersive X-ray spectroscopy and elemental mapping tests. Tafel polarization and electrochemical impedance spectroscopy methods were employed to determine the electrochemical corrosion properties of the synthesized samples in a solution containing 0.5 M sulfuric acid and 0.1 M formic acid. The linear sweep voltammetry, cyclic voltammetry, and chronoamperometry techniques were also employed to evaluate the electrocatalytic activity of prepared samples toward the oxidation of formic acid. In this respect, the influence of some factors such as formic acid and sulfuric acid concentrations and also potential scan rate was investigated. Compared to the pure Pd sample, the Pd–Cd samples were more reactive for the oxidation of formic acid. Besides, the sample with a lower amount of Pd (Pd_1·3Cd) demonstrated much higher electrocatalytic activity than the Pd_7·1Cd and Pd_2·1Cd samples. The observed high mass activity of 15.06 A mg^?1_Pd for the Pd_1·3Cd sample which is 21.1 times higher than Pd/C is an interesting result of this study.     

Model Selection for Unsupervised Learning of Visual Context

This study addresses the problem of choosing the most suitable probabilistic model selection criterion for unsupervised learning of visual context of a dynamic scene using mixture models. A rectified Bayesian Information Criterion (BICr) and a Completed Likelihood Akaike’s Information Criterion (CL-AIC) are formulated to estimate the optimal model order (complexity) for a given visual scene. Both criteria are designed to overcome poor model selection by existing popular criteria when the data sample size varies from small to large and the true mixture distribution kernel functions differ from the assumed ones. Extensive experiments on learning visual context for dynamic scene modelling are carried out to demonstrate the effectiveness of BICr and CL-AIC, compared to that of existing popular model selection criteria including BIC, AIC and Integrated Completed Likelihood (ICL). Our study suggests that for learning visual context using a mixture model, BICr is the most appropriate criterion given sparse data, while CL-AIC should be chosen given moderate or large data sample sizes.     

A Lattice Approach to Image Segmentation

After a formal definition of segmentation as the largest partition of the space according to a criterion σ and a function f, the notion of a morphological connection is reminded. It is used as an input to a central theorem of the paper (Theorem 8), that identifies segmentation with the connections that are based on connective criteria. Just as connections, the segmentations can then be regrouped by suprema and infima. The generality of the theorem makes it valid for functions from any space to any other one. Two propositions make precise the AND and OR combinations of connective criteria. The soundness of the approach is demonstrated by listing a series of segmentation techniques. One considers first the cases when the segmentation under study does not involve initial seeds. Various modes of regularity are discussed, which all derive from Lipschitz functions. A second category of examples involves the presence of seeds around which the partition of the space is organized. An overall proposition shows that these examples are a matter for the central theorem. Watershed and jump connection based segmentations illustrate this type of situation. The third and last category of examples deals with cases when the segmentation occurs in an indirect space, such as an histogram, and is then projected back on the actual space under study. The relationships between filtering and segmentation are then investigated. A theoretical chapter introduces and studies the two notions of a pulse opening and of a connected operator. The conditions under which a family of pulse openings can yield a connected filter are clarified. The ability of segmentations to generate pyramids, or hierarchies, is analyzed. A distinction is made between weak hierarchies where the partitions increase when going up in the pyramid, and the strong hierarchies where the various levels are structured as semi-groups, and particularly as granulometric semi-groups. The last section is based on one example, and goes back over the controversy about “lattice” versus “functional” optimization. The problem is now tackled via a case of colour segmentation, where the saturation serves as a cursor between luminance and hue. The emphasis is put on the difficulty of grouping the various necessary optimizations into a single one.     

Range Assignment for Biconnectivity and k-Edge Connectivity in Wireless Ad Hoc Networks

Depending on whether bidirectional links or unidirectional links are used for communications, the network topology under a given range assignment is either an undirected graph referred to as the bidirectional topology, or a directed graph referred to as the unidirectional topology. The Min-Power Bidirectional (resp., Unidirectional) k-Node Connectivity problem seeks a range assignment of minimum total power subject to the constraint that the produced bidirectional (resp. unidirectional) topology is k-vertex connected. Similarly, the Min-Power Bidirectional (resp., Unidirectional) k-Edge Connectivity problem seeks a range assignment of minimum total power subject to the constraint the produced bidirectional (resp., unidirectional) topology is k-edge connected. The Min-Power Bidirectional Biconnectivity problem and the Min-Power Bidirectional Edge-Biconnectivity problem have been studied by Lloyd et al. [23]. They show that range assignment based the approximation algorithm of Khuller and Raghavachari [18], which we refer to as Algorithm KR, has an approximation ratio of at most 2(2 – 2/n)(2 + 1/n) for Min-Power Bidirectional Biconnectivity, and range assignment based on the approximation algorithm of Khuller and Vishkin [19], which we refer to as Algorithm KV, has an approximation ratio of at most 8(1 – 1/n) for Min-Power Bidirectional Edge-Biconnectivity. In this paper, we first establish the NP-hardness of Min-Power Bidirectional (Edge-) Biconnectivity. Then we show that Algorithm KR has an approximation ratio of at most 4 for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity, and Algorithm KV has an approximation ratio of at most 2k for both Min-Power Bidirectional k-Edge Connectivity and Min-Power Unidirectional k-Edge Connectivity. We also propose a new simple constant-approximation algorithm for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity. This new algorithm applies only to Euclidean instances, but is best suited for distributed implementation. A preliminary version of this work appeared in the proceedings of the 2nd International Conference on AD-HOC Network and Wireless (Adhoc-Now 2003). Research performed in part while visiting the Max-Plank-Institut fur Informatik. Gruia Calinescu is an Assistant Professor of Computer Science at the Illinois Institute of Technology since 2000. He held postdoc or visiting researcher positions at DIMACS, University of Waterloo, and Max-Plank Institut fur Informatik. Gruia has a Diploma from University of Bucharest and a Ph.D. from Georgia Insitute of Technology. His research interests are in the area of algorithms. Peng-Jun Wan has joined the Computer Science Department at Illinois Institute of Technology in 1997 and has been an Associate Professor since 2004. He received his Ph.D. in Computer Science from University of Minnesota in 1997, M.S. in Operations Research and Control Theory from Chinese Academy of Science in 1993, and B.S. in Applied Mathematics from Tsinghua University in 1990. His research interests include optical networks and wireless networks.     

Sequential Spectrum Analysis of the Sideband Components of Digital Amplitude-Modulated Signals

It is shown that, for the spectrum analysis of digital quasi-periodic signals, one must use a procedure based on approximating the sequence of data readouts by a first-order trigonometric polynomial with a varying frequency of its harmonic functions.     

叠前地震数据优化处理技术分析

由于叠前时间偏移成像是在叠前数据上进行的，因此对数据的质量要求较高。针对这一问题进行了数据优化处理技术研究，研究的基础资料是胜利油田渤深6区块的三维地震数据，首先对资料的质量进行了分析一由于是拼接资料，因此存在着能量不均衡、覆盖次数不均匀、坡形不一致以及各类干扰发育等问题；然后针对这些问题研究了时间-空间域内分频随机噪声衰减、频率一空间域相干噪声衰减、波形匹配处理和数据拟合三维随机噪声衰减等4种处理方法，分别取得了很好的处理效果；在对实际资料进行数据优化处理时，根据资料的特点采用了合适的组合方式，处理后资料的品质得到了较大提高，相干噪声、随机噪声得到了有效衰减，波形一致性得到了恢复，中、深层有效频率和有效能量得到了加强。     

一类Schrdinger方程组解的爆破

本文研究一类Schrodinger方程组解的爆破行为,在Y.Tsutsumi等(1998)文的基础上对非线性项作了修改,并用变分的方法得到了解在有限时间内爆破的一个充分条件。     

Taxometrics in Psychopathology Research: An Introduction to Some of the Procedures and Related Methodological Issues.

This article introduces a special section on the use of taxometrics to examine the categorical versus the dimensional structure of various forms of psychopathology. Paving the way into the special section, this introduction briefly describes 3 taxometric methods--mean above minus below a sliding cut (MAMBAC), maximum covariation (MAXCOV), and maximum eigenvalue (MAXEIG)--and discusses possible threats to statistical conclusion validity that often emerge when such techniques are applied in psychopathology research. (PsycINFO Database Record (c) 2010 APA, all rights reserved)