软夹硬力学不均匀焊接接头疲劳裂纹闭合行为的实验研究

力学性能不均匀是焊接接头的三大待征之一，本文采用柔度法研究了不同硬夹层宽度的软夹硬力学不均匀焊接接头疲劳裂纹的闭俣行为。研究结果表明，裂纹尖端附近软区的局部屈服在疲劳载荷卸载过程中促使裂纹闭合。随着硬夹层宽度的减小，这一影响越来越明显。     

Multiple Internal Resonance in Suspended Cables under Random In-Plane Loading

The random excitation of a suspended cable with simultaneous internal resonances is considered. The internal resonances can take place among the first in-plane and the first two out-of-plane modes. The external loading is represented by a wide-band random process. The response statistics are estimated using the Fokker-Planck-Kolmogorov (FPK) equation, together with Gaussian and non-Gaussian closures. Monte Carlo simulation is also used for numerical verification. The unimodal in-plane motion exists in regions away from the internal resonance condition. The mixed mode interaction is manifested within a limited range of internal detuning parameters, depending on the excitation power spectrum density and damping ratios. The Gaussian closure scheme failed to predict bounded solutions of mixed mode interaction. The non-Gaussian closure results are in good agreement with the Monte Carlo simulation. The on-off intermittency of the autoparametrically excited modes is observed in the Monte Carlo simulation over a small range of excitation levels. The influence of the cable parameters, such as damping ratios, sag-to-span ratio, internal detuning parameters, and excitation level on the autoparametric interaction, is studied. It is found that the internal detuning and excitation level are the two main parameters which affect the autoparametric interaction among the three modes. Due to the system's nonlinearity, the response of the three modes is strongly non-Gaussian and the coupled modes experience irregular modulation.     

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     

Quading triangular meshes with certain topological constraints

In computer graphics and geometric modeling, shapes are often represented by triangular meshes (also called 3D meshes or manifold triangulations). The quadrangulation of a triangular mesh has wide applications. In this paper, we present a novel method of quading a closed orientable triangular mesh into a quasi-regular quadrangulation, i.e., a quadrangulation that only contains vertices of degree four or five. The quasi-regular quadrangulation produced by our method also has the property that the number of quads of the quadrangulation is the smallest among all the quasi-regular quadrangulations. In addition, by constructing the so-called orthogonal system of cycles our method is more effective to control the quality of the quadrangulation.     

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.