Lithium Insertion Mechanism in Iron-Based Oxyfluorides with Anionic Vacancies Probed by PDF Analysis

The mechanism of lithium insertion that occurs in an iron oxyfluoride sample with a hexagonal–tungsten–bronze (HTB)-type structure was investigated by the pair distribution function. This study reveals that upon lithiation, the HTB framework collapses to yield disordered rutile and rock salt phases followed by a conversion reaction of the fluoride phase toward lithium fluoride and nanometer-sized metallic iron. The occurrence of anionic vacancies in the pristine framework was shown to strongly impact the electrochemical activity, that is, the reversible capacity scales with the content of anionic vacancies. Similar to FeOF-type electrodes, upon de-lithiation, a disordered rutile phase forms, showing that the anionic chemistry dictates the atomic arrangement of the re-oxidized phase. Finally, it was shown that the nanoscaling and structural rearrangement induced by the conversion reaction allow the in situ formation of new electrode materials with enhanced electrochemical properties.     

模糊线性回归模型的约束最小二乘估计

自Tanaka等1982年提出模糊回归概念以来,该问题已得到广泛的研究。作为主要估计方法之一的模糊最小二乘估计以其与统计最小二乘估计的密切联系更受到人们的重视。本文依据适当定义的两个模糊数之间的距离,提出了模糊线性回归模型的一个约束最小二乘估计方法,该方法不仅能使估计的模糊参数的宽度具有非负性而且估计的模糊参数的中心线与传统的最小二乘估计相一致。最后,通过数值例子说明了所提方法的具体应用。     

Virtual logarithms

The modification of the number field sieve which Joux and Lercier recently used to compute logarithms in a prime field of a record 120 decimal digits makes use of the notion of a virtual logarithm of a prime ideal in a number ring. We provide necessary and sufficient conditions for their method to succeed and give an explicit formula for the virtual logarithm of an ideal.     

On the spectral norm of algebraic numbers

In this paper we continue to study the spectral norms and their completions ([4]) in the case of the algebraic closure $ \overline {\mathbb Q} $ of ? in ?. Let $ \widetilde{\overline{\mathbb{Q}}} $ be the completion of $ \overline {\mathbb Q} $ relative to the spectral norm. We prove that $ \widetilde{\overline{\mathbb{Q}}} $ can be identified with the R‐subalgebra of all symmetric functions of C(G), where C(G) denotes the ?‐Banach algebra of all continuous functions defined on the absolute Galois group G = Gal$ {\overline {\mathbb Q}} / {\mathbb Q} $. We prove that any compact, closed to conjugation subset of ? is the pseudo‐orbit of a suitable element of $ \widetilde{\overline{\mathbb{Q}}} $. We also prove that the topological closure of any algebraic number field in $ \widetilde{\overline{\mathbb{Q}}} $ is of the form $\widetilde{\mathbb{Q}[x]}$ with x in $ \widetilde{\overline{\mathbb{Q}}} $.     

有限循环群的Fuzzy子群的等价类数

有限循环群G的F子群可以有无数个．但是．若当两个F子群的水平集构成的集合相等就称其等价的话，那么其等价类数是有限的。通过研究群的合成群列、商群列以及数的因数列和极大因数列找出了有限循环群的极大F子群和F子群的等价类数的求解公式．并给出二者之间的关系式．     

On the Zeros of Orthogonal Polynomials: The Elliptic Case

Constructive Approximation - Let E = [–1, α] \cup [β, 1], –1 &;lt; α &;lt; β &;lt; 1, and let (pn) be orthogonal on E with respect to the weight function...     

若干图的点强全染色(英文)

对图G及正整数k，映射f：满足：（1）任意e1，e3，如果e1，e2是相邻或相关联的，则有；（2）对u，v，w（G）有，则称f为G的一个k-点强全染色，并且K|G的社点强全染色称为G的点强全色数．本文讨论了一些特殊困的点强全色数，并提出了一个猜想：若G为每一分图的阶数不小于6的图，则（G），其中（G）为本文中定义的一新参数．     

Joint detection of a given number of reference fragments in a quasi-periodic sequence and its partition into segments containing series of identical fragments

The problem of joint a posteriori detection of reference fragments in a quasi-periodic sequence and its partition into segments containing series of recurring fragments from the reference tuple is solved. It is assumed that (i) an ordered reference tuple of sequences to be detected is given, (ii) the number of desired fragments is known, (iii) the index of the sequence term corresponding to the beginning of a fragment is a deterministic (not random) value, and (iv) a sequence distorted by an additive uncorrelated Gaussian noise is available for observation. It is established that the problem consists in testing a set of hypotheses about the mean of a random Gaussian vector. The cardinality of the set grows exponentially as the vector dimension (i.e., the sequence length) increases. An efficient a posteriori algorithm producing a maximum-likelihood optimal solution to the problem is substantiated. Time and space complexity bounds related to the parameters of the problem are derived. The results of numerical simulation are presented.     

Combinatorial Optimization by Dynamic Contraction

A heuristic optimization methodology, Dynamic Contraction (DC), is introduced as an approach for solving a wide variety of hard combinatorial problems. Contraction is an operation that maps an instance of a problem to a smaller instance of the same problem. DC is an iterative improvement strategy that relies on contraction as a mechanism for escaping local minima. As a byproduct of contraction, efficiency is improved due to a reduction of problem size. Effectiveness of DC is shown through simple applications to two classical combinatorial problems: The graph bisection problem and the traveling salesman problem.     

Relations among eigenvalues of Sturm-Liouville problems with different types of leading coefficient functions

For any Sturm-Liouville problem with a separable boundary condition and whose leading coefficient function changes sign (exactly once), we first give a geometric characterization of its eigenvalues λn using the eigenvalues of some corresponding problems with a definite leading coefficient function. Consequences of this characterization include simple proofs of the existence of the λn's, their Prüfer angle characterization, and a way for determining their indices from the zeros of their eigenfunctions. Then, interlacing relations among the λn's and the eigenvalues of the corresponding problems are obtained. Using these relations, a simple proof of asymptotic formulas for the λn's is given.