Line graphs of multigraphs and Hamilton‐connectedness of claw‐free graphs

We introduce a closure concept that turns a claw‐free graph into the line graph of a multigraph while preserving its (non‐)Hamilton‐connectedness. As an application, we show that every 7‐connected claw‐free graph is Hamilton‐connected, and we show that the well‐known conjecture by Matthews and Sumner (every 4‐connected claw‐free graph is hamiltonian) is equivalent with the statement that every 4‐connected claw‐free graph is Hamilton‐connected. Finally, we show a natural way to avoid the non‐uniqueness of a preimage of a line graph of a multigraph, and we prove that the closure operation is, in a sense, best possible. © 2010 Wiley Periodicals, Inc. J Graph Theory 66:152‐173, 2011     

Fuzzy closure systems on L—ordered sets

In this paper, notions of fuzzy closure system and fuzzy closure L —system on L —ordered sets are introduced from the fuzzy point of view. We first explore the fundamental properties of fuzzy closure systems. Then the correspondence between fuzzy closure systems (fuzzy closure L —systems) and fuzzy closure operators is established. Finally, we study the connections between fuzzy closure systems and fuzzy Galois connections. © 2011 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim     

On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0,1 hypercube

Split cuts are prominent general-purpose cutting planes in integer programming. The split closure of a rational polyhedron is what is obtained after intersecting the half-spaces defined by all the split cuts for the polyhedron. In this paper, we prove that deciding whether the split closure of a rational polytope is empty is NP-hard, even when the polytope is contained in the unit hypercube. As a direct corollary, we prove that optimization and separation over the split closure of a rational polytope in the unit hypercube are NP-hard, extending an earlier result of Caprara and Letchford.     

Pushing exercise program to correct glottal incompetence

A voice therapy program using pushing exercises to correct glottal incompetence is described. The program utilizes various types of instrumentation to determine whether or not a given patient is likely to benefit from the treatment. The program also provides feedback of target voices. Three cases with incomplete glottal closure and subsequent vocal dysphonia characterized by an asthenic breathy quality are used to illustrate the program. Details of the program, termination criteria, and problems and precautions learned from treating 29 patients over a 3-year period are presented.     

The first-order perturbed SBS equations

Summary Using standard multiscale techniques, a first-order perturbation theory for SBS is developed. In the presence of small damping, we find that there is a stationary solution for a soliton which is a fixed point. The velocity of this soliton is determined by the damping coefficients. In addition, there is also a constant shift in the pump intensity in the region between the front of the backward moving soliton and the forward light cone of the pump.     

Triheterocyclic Thiadiazepine Derivatives of Pharmacological Interest： Synthesis of 2-Aryl-4-[ρ-（2,3-dihydro-5-methyl-2-oxo-1,3,4-oxadiazol-3-yl）phenyl]-6-（u n）su bstituent-1 ＂,2＂ ,4＂- triazolo[3＂,4＂-b]-1 ＇,3＇,4＇-thiadiazepine

Synthesis of novel thiadiazepine derivatives based on the reactivity of 4-acetylphenylsydnone （1） was reported. The structures of the newly synthesized compounds have been proved by their physical, analytical, IR, 1^H NMR, 13^C NMR and mass spectral data.     

有限格，闭包系统和闭包算子

本文引进了新的闭包系统,新的闭包算子等概念,研究了它们之间的相互关系,给出了由闭包系统来表示有限原子格的表示定理,证明了分别以这些数学结构为对象,以它们之间的同态映射作为态射,所对应的格范畴和对应的闭包系统范畴是范畴等价的.     

广义次指数密度的两个新的等价条件

得到了广义次指数密度的两个新的等价条件,刻划了它们的卷积封闭性和卷积根封闭性.