Laplacians and the Cheeger Inequality for Directed Graphs

We consider Laplacians for directed graphs and examine their eigenvalues. We introduce a notion of a circulation in a directed graph and its connection with the Rayleigh quotient. We then define a Cheeger constant and establish the Cheeger inequality for directed graphs. These relations can be used to deal with various problems that often arise in the study of non-reversible Markov chains including bounding the rate of convergence and deriving comparison theorems.Received September 8, 2004     

Electrochemical behavior of Li intercalation processes into a Li[NixLi(1/3−2x/3)Mn(2/3−x/3)]O2 cathode

Li[Ni_xLi_(1/3−2x/3)Mn_(2/3−x/3)]O₂ (X=0.17, 0.25, 0.33, 0.5) compounds are prepared by a simple combustion method. The Rietvelt analysis shows that these compounds could be classified as having the α-NaFeO₂ structure. The initial charge-discharge and irreversible capacity increases with the decrease of x in Li[Ni_xLi_(1/3−2x/3)Mn_(2/3−x/3)]O₂. Indeed, Li[Ni_0.50Mn_0.50]O₂ compound shows relatively low initial discharge capacity of 200 mAh/g and large capacity loss during cycling, with Li[Ni_0.17Li_0.22Mn_0.61]O₂ and Li[Ni_0.25Li_0.17Mn₀.₅₈]O₂ compounds exhibit high initial discharge capacity over 245 mAh/g and stable cycle performance in the voltage range of 4.8 -2.0 V. On the other hand, XANES analysis shows that the oxidation state of Ni ion reversibly changes between Ni²⁺ and about Ni³⁺, while the oxidation state of Mn ion sustains Mn⁴⁺ during charge-discharge process. This result does not agree with the previously reported ‘electrochemistry model’ of Li[Ni_xLi_(1/3−2x/3)Mn_(2/3−x/3)]O₂, in which Ni ion changes between Ni²⁺ and NI⁴⁺. Based on these results, we modified oxidation-state change of Mn and Ni ion during charge-discharge process.     

变换中含有孤立稳定点的第二积分换元定理

在不定积分第二积分换元定理的条件中,要求变换x=φ(t)不含有稳定点,即:φ′(t)≠0.当变换x=φ(t)中含有孤立稳定点时,给出了变换中含有孤立稳定点的第二积分换元定理.拓宽了第二积分换元定理的应用范围.     

Insight into chain dimensions in PEO/water solutions

Small‐Angle Neutron Scattering has been performed from poly(ethylene oxide) in deuterated water at temperature ranging from 10 to 80 °C. A simple fitting model was used to obtain a correlation length and a Porod exponent. The correlation length L characterizes the average distance between entanglements in the semidilute region and is proportional to the individual coil sizes in the dilute region. L was found to increase with temperature in the semidilute region but it decreases with temperature in the dilute region. This decrease is the precursor to the single‐chain collapse which applies to very dilute polymer solutions. © 2007 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 45: 2196–2200, 2007     

Metaplectic Representation of ospq(1/2) Algebra and Basic Hypergeometric Functions

In this paper we use the bosonic realization of osp_q(1/2) algebra to obtain its metaplectic representation. The group element for this algebra is shown to be described in terms of the basic hypergeometric function.     

透镜初级球差的横向剪切干涉条纹研究

利用玻璃平行平板构成简单的横向剪切干涉仪可以观察到单薄透镜形成的准直光束的剪切干涉条纹,由干涉条纹分布求出对应的几何像差和离焦量.用焦距为190 mm的单薄透镜做实验,实验结果与计算机模拟结果符合,说明可以从剪切干涉条纹的分布求出透镜的轴向调整误差和初级球差.     

Preparation of antimicrobial poly(vinyl alcohol) nanofibers containing silver nanoparticles

Polyvinyl alcohol (PVA) nanofibers containing Ag nanoparticles were prepared by electrospinning PVA/silver nitrate (AgNO₃) aqueous solutions, followed by short heat treatment, and their antimicrobial activity was investigated for wound dressing applications. Since PVA is a water soluble and biocompatible polymer, it is one of the best materials for the preparation of wound dressing nanofibers. After heat treatment at 155 °C for 3 min, the PVA/AgNO₃ nanofibers became insoluble, while the Ag⁺ ions therein were reduced so as to produce a large number of Ag nanoparticles situated preferentially on their surface. The residual Ag⁺ ions were reduced by subsequent UV irradiation for 3 h. The average diameter of the Ag nanoparticles after the heat treatment was 5.9 nm and this value increased slightly to 6.3 nm after UV irradiation. It was found that most of the Ag⁺ ions were reduced by the simple heat treatment. The PVA nanofibers containing Ag nanoparticles showed very strong antimicrobial activity. © 2006 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 44: 2468–2474, 2006     

Tchebychev acceleration technique for large scale nonsymmetric matrices

Summary The acceleration by Tchebychev iteration for solving nonsymmetric eigenvalue problems is dicussed. A simple algorithm is derived to obtain the optimal ellipse which passes through two eigenvalues in a complex plane relative to a reference complex eigenvalue. New criteria are established to identify the optimal ellipse of the eigenspectrum. The algorithm is fast, reliable and does not require a search for all possible ellipses which enclose the spectrum. The procedure is applicable to nonsymmetric linear systems as well.     

The Recognition of Double Euler Trails in Series-Parallel Networks

Given a series-parallel network (network, for short)N, its dual networkN′ is given by interchanging the series connection and the parallel connection of networkN. We usually use a series-parallel graph to represent a network. LetG[N] andG[N′] be graph representations ofNandN′, respectively. A sequence of edgese₁, e₂,…,e_kis said to form a common trail on (G[N], G[N′]) if it is a trail on bothG[N] andG[N′]. If a common trail covers all of the edges inG[N] andG[N′], it is called adouble Euler trail.However, there are many different graph representations for a network. We say that a networkNhas a double Euler trail (DET) if there is a common Euler trail for someG[N] and someG[N′]. Finding a DET in a network is essential for optimizing the layout area of a complementary CMOS functional cell. Maziasz and Hayes (IEEE Trans. Computer-Aided Design9(1990), 708–719) gave a linear time algorithm for solving the layout problem in fixedG[N] andG[N′] and an exponential algorithm for finding the optimal cover in a network without fixing graph representations. In this paper, we study properties of subnetworks of a DET network. According to these properties, we propose an algorithm that automatically generates the rules for composition of trail cover classes. On the basis of these rules, a linear time algorithm for recognizing DET networks is presented. Furthermore, we also give a necessary and sufficient condition for the existence of a double Euler circuit in a network.     

De Bruijn cycles for covering codes

A de Bruijn covering code is a q‐ary string S so that every q‐ary string is at most R symbol changes from some n‐word appearing consecutively in S. We introduce these codes and prove that they can have size close to the smallest possible covering code. The proof employs tools from field theory, probability, and linear algebra. Included is a table of the best known bounds on the lengths of small binary de Bruijn covering codes, up to R = 11 and n = 13, followed by several open questions in this area. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2004