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

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

Molecular dynamics and information on possible sites of interaction of intramyocellular metabolites in vivo from resolved dipolar couplings in localized H NMR spectra

Proton NMR resonances of the endogenous metabolites creatine and phosphocreatine ((P)Cr), taurine (Tau), and carnosine (Cs, β-alanyl-l-histidine) were studied with regard to residual dipolar couplings and molecular mobility. We present an analysis of the direct ¹H–¹H interaction that provides information on motional reorientation of subgroups in these molecules in vivo. For this purpose, localized ¹H NMR experiments were performed on m. gastrocnemius of healthy volunteers using a 1.5-T clinical whole-body MR scanner. We evaluated the observable dipolar coupling strength SD₀ (S = order parameter) of the (P)Cr-methyl triplet and the Tau-methylene doublet by means of the apparent line splitting. These were compared to the dipolar coupling strength of the (P)Cr-methylene doublet. In contrast to the aliphatic protons of (P)Cr and Tau, the aromatic H2 (δ = 8 ppm) and H4 (δ = 7 ppm) protons of the imidazole ring of Cs exhibit second-order spectra at 1.5 T. This effect is the consequence of incomplete transition from Zeeman to Paschen-Back regime and allows a determination of SD₀ from H2 and H4 of Cs as an alternative to evaluating the multiplet splitting which can be measured directly in high-resolution ¹H NMR spectra. Experimental data showed striking differences in the mobility of the metabolites when the dipolar coupling constant D₀ (calculated with the internuclear distance known from molecular geometry in the case of complete absence of molecular dynamics and motion) is used for comparison. The aliphatic signals involve very small order parameters S ≈ (1.4 − 3) × 10⁻⁴ indicating rapid reorientation of the corresponding subgroups in these metabolites. In contrast, analysis of the Cs resonances yielded S ≈ (113 − 137) × 10⁻⁴. Thus, the immobilization of the Cs imidazole ring owing to an anisotropic cellular substructure in human m. gastrocnemius is much more effective than for (P)Cr and Tau subgroups. Furthermore, ¹H NMR experiments on aqueous model solutions of histidine and N-acetyl-l-aspartate (NAA) enabled the assignment of an additional signal component at δ = 8 ppm of Cs in vivo to the amide group at the peptide bond. The visibility of this proton could result from hydrogen bonding which would agree with the anticipated stronger motional restriction of Cs. Referring to the observation that all dipolar-coupled multiplets resolved in localized in vivo ¹H NMR spectra of human m. gastrocnemius collapse simultaneously when the fibre structure is tilted towards the magic angle (θ ≈ 55°), a common model for molecular confinement in muscle tissue is proposed on the basis of an interaction of the studied metabolites with myocellular membrane phospholipids.     

Gray code for derangements

We give a Gray code and constant average time generating algorithm for derangements, i.e., permutations with no fixed points. In our Gray code, each derangement is transformed into its successor either via one or two transpositions or a rotation of three elements. We generalize these results to permutations with number of fixed points bounded between two constants.     

The Potts model representation and a Robinson–Schensted correspondence for the partition algebra

We construct a correspondence between the set of partitions of a finite set M and the set of pairs of walks to the same vertex on a graph giving the Bratteli diagram of the partition algebra on M. This is the precise analogue of the correspondence between the set of permutations of a finite set and the set of pairs of Young tableaux of the same shape, called the Robinson–Schensted correspondence.     

On the stability of some integer programming algorithms

In the present paper we develop our approach for studying the stability of integer programming problems. We prove that the L-class enumeration method is stable on integer linear programming problems in the case of bounded relaxation sets [9]. The stability of some cutting plane algorithms is discussed.     

关于限制李超代数的分解

代数$A$ 称为不可分解的,如果 $A$ 不能分解成理想的直和.文中将证明满足$C(L_{\bar{0}})=C(L)=\{0\}$的限制李超代数能够分解成不可分解限制理想的直和,这种分解在不计理想次序的前提下是唯一的.而且还证明了限制李超代数的一些结果.     

About the Notion of Semiring of Sets

We introduce a generalized notion of semiring and prove that all known properties that semirings have according to the old definition are preserved.     

Identifying phylogenetic trees

A central problem that arises in evolutionary biology is that of displaying partitions of subsets of a finite set X on a tree whose vertices are partially labelled with the elements of X. Such a tree is called an X-tree and, for a collection of partitions of subsets of X, characterisations for the existence and uniqueness of an X-tree that displays have been previously given in terms of chordal graphs. In this paper, we obtain two closely related characterisations also in terms of chordal graphs. The first describes when identifies an X-tree, and the second describes when a compatible subset of is of maximum size.     

Symmetry specified enumeration of substituted derivatives: an easy solution to the complex problem

Several sophisticated methods to solution of symmetry specified enumeration problems are available in the modern literature. In this paper we propose a simple technique that allows one to manually compute the exact numbers of fixed-symmetry derivatives for a given structure either with inclusion or ignoring the substitution patterns. The basic idea of the method suggested consists in the derivation of Pólya-like cycle indices for the automorphism groups of specially constructed orbit partition graphs; the expansion of these indices and subsequent simple calculations result in the desired numbers of substituted derivatives with achiral substituents. Limitations of the new technique (and a method suggested earlier) depend on the relevance of the orbit partitions for particular subgroups of the point symmetry group. For illustration purposes, the results obtained for the prismane (D _3h ) and adamantane (T _d ) structures are discussed. In the former case the numbers of substituted derivatives can be found for all subgroups of the D _3h group, whereas in the latter case these numbers can be determined for eight out of eleven subgroups of the T _d point symmetry group. This work is based on the text of the lecture presented by the authors at the 5th All-Russia Conference on Molecular Modeling (Moscow, April 2007). The paper deals with the methodology and detailed treatment of applied aspects related to solution of enumeration problems for substituted derivatives with prescribed symmetry groups. Unlike the known methods of symmetry specified enumeration, the technique suggested is simple enough and may be regarded as generalization of the Pólya methodology, which is widely used by chemists. Published in Russian in Izvestiya Akademii Nauk. Seriya Khimicheskaya, No. 2, pp. 227–245, February, 2008.     

Maximal σ‐polynomials of connected 3‐chromatic graphs

In the set of graphs of order n and chromatic number k the following partial order relation is defined. One says that a graph G is less than a graph H if c_i(G) ≤ c_i(H) holds for every i, k ≤ i ≤ n and at least one inequality is strict, where c_i(G) denotes the number of i‐color partitions of G. In this paper the first ? n/2 ? levels of the diagram of the partially ordered set of connected 3‐chromatic graphs of order n are described. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 210–222, 2003