The convergence of three spline methods for scattered data interpolation and fitting

The convergences of three L₁ spline methods for scattered data interpolation and fitting using bivariate spline spaces are studied in this paper. That is, L₁ interpolatory splines, splines of least absolute deviation, and L₁ smoothing splines are shown to converge to the given data function under some conditions and hence, the surfaces from these three methods will resemble the given data values.     

寄生虫学教学改革的设想

指出了目前寄生虫教学中存在的某些弊病。为适应当代医学发展的需要,在本专科的教育中提出了寄生虫学与微生物学合并为“病原生物学”的设想,并就这两门课程重组的可行性及有益处等方面进行了初步探讨。     

Labeling the -path with a condition at distance two

For integer r≥2, the infinite r-path P_∞(r) is the graph on vertices …v₋₃,v₋₂,v₋₁,v₀,v₁,v₂,v₃… such that v_s is adjacent to v_t if and only if |s−t|≤r−1. The r-path on n vertices is the subgraph of P_∞(r) induced by vertices v₀,v₁,v₂,…,v_n−1. For non-negative reals x₁ and x₂, a λ_x1,x2-labeling of a simple graph G is an assignment of non-negative reals to the vertices of G such that adjacent vertices receive reals that differ by at least x₁, vertices at distance two receive reals that differ by at least x₂, and the absolute difference between the largest and smallest assigned reals is minimized. With λ_x1,x2(G) denoting that minimum difference, we derive λ_x1,x2(P_n(r)) for r≥3, 1≤n≤∞, and . For , we obtain upper bounds on λ_x1,x2(P_∞(r)) and use them to give λ_x1,x2(P_∞(r)) for r≥5 and . We also determine λ_x1,x2(P_∞(3)) and λ_x1,x2(P_∞(4)) for all .     

-extension of Lie triple systems

In this paper, we introduce the notion of T^*-extension of a Lie triple system. Then we show that T^*-extension is compatible with nilpotency, solvability, and it preserves in certain sense the decomposition properties. In addition, we investigate the equivalence of T^*-extensions using cohomology. Finally, we show that every finite-dimensional nilpotent metrised Lie triple system over an algebraically closed field is the T^*-extension of an appropriate quotient system.     

Shock and traveling wave phenomena on an externally damped, non-linear string

We examine the propagation of shocks and traveling wave phenomena on a one-dimensional string that is executing finite-amplitude, transverse vibrations in a resisting medium. As part of our study, we develop an approach that allows us to describe, albeit approximately, the evolution and propagation of a shock front using analytical methods. In addition, exact traveling wave solutions, one of which involves the Lambert W-function, of the string's equation of motion are determined and analyzed. Lastly, a possible new form of the solution to the linearized problem is presented and extensions and other applications of the present work are briefly discussed.     

一种超弹性SMA复合阻尼器的设计与试验

根据形状记忆合金(SMA)的超弹性特性,设计、制造了一种SMA复合摩擦阻尼器,该阻尼器利用SMA超弹性阻尼与SMA丝的约束作用使阻尼器内部产生摩擦来共同耗散振动能量.介绍了阻尼器的结构构造及工作原理.通过试验研究了加载频率、位移幅值对阻尼器力学性能的影响.试验结果表明,在试验频率范围内,阻尼器的刚度、输出力、耗能等主要力学参数随加载频率的改变而变化较小;位移幅值是影响这些力学参数的主要因素,当阻尼器在小位移的情况下,其刚度变化较小,而输出力和耗能与位移基本成线性关系.但在大位移的情况下,阻尼器的输出力变化较小,而其割线刚度减小,耗能有大幅度的增加.分析表明,该SMA复合阻尼器是一种位移相关性的变刚度阻尼器.     

李萨如图形在检测系统中的应用

李萨如图形可以检测两个相同频率信号的相位差．主要论述具有惯性质量、弹簧和阻尼器的二阶加速度测量系统,其动态响应特性的分析方法,如何利用李萨如图形来检测力平衡式加速度传感器的动态特性,即幅频特性和相频特性,从而确定传感器的固有频率ω_n和阻尼比ξ,以此来评定传感器的综合特性．     

Transoral Robotic Surgery (TORS): Glottic Microsurgery in a Canine Model

OBJECTIVES/HYPOTHESIS: We hypothesize that bimanual, three-dimensional robotic surgery will prove valuable for glottic microsurgical procedures. STUDY DESIGN: To test this hypothesis, we developed and optimized a canine model for glottic microsurgery using a commercially available surgical robot. Methods Using a da Vinci Surgical Robot (Intuitive Surgical, Inc., Sunnyvale, CA), glottic microsurgery was performed with a hydrodissection technique in a canine model. The experiments were performed on two orotracheal intubated mongrel dogs under general anesthesia in the supine position on a standard operating room table. A videoscope and two, 360-degree rotating, 5- and 8-mm, wrested-end effector instruments were introduced transorally with three robotic arms. The surgeon performed the actual procedures while positioned at a robotic system console that was located across the operating room suite. The procedure was performed in duplicate and was documented with still and video photography. RESULTS: Glottic microsurgery was successfully performed using the da Vinci Surgical Robot, with both 5- and 8-mm instrumentation. The smaller, 5-mm instruments afforded greater visualization of the operative site and increased maneuverability, which resulted in reduced operative time. The robotic system provided excellent visualization as well as controlled and delicate microdissection at the vocal cord level. CONCLUSIONS: Robotic laryngeal microsurgery is technically feasible in the canine model and warrants consideration for evaluation in controlled human trials.     

On the 3-restricted edge connectivity of permutation graphs

An edge cut W of a connected graph G is a k-restricted edge cut if G−W is disconnected, and every component of G−W has at least k vertices. The k-restricted edge connectivity is defined as the minimum cardinality over all k-restricted edge cuts. A permutation graph is obtained by taking two disjoint copies of a graph and adding a perfect matching between the two copies. The k-restricted edge connectivity of a permutation graph is upper bounded by the so-called minimum k-edge degree. In this paper some sufficient conditions guaranteeing optimal k-restricted edge connectivity and super k-restricted edge connectivity for permutation graphs are presented for k=2,3.     

Ordinal machines and admissible recursion theory

We generalize standard Turing machines, which work in time ω on a tape of length ω, to α-machines with time α and tape length α, for α some limit ordinal. We show that this provides a simple machine model adequate for classical admissible recursion theory as developed by G. Sacks and his school. For α an admissible ordinal, the basic notions of α-recursive or α-recursively enumerable are equivalent to being computable or computably enumerable by an α-machine, respectively. We emphasize the algorithmic approach to admissible recursion theory by indicating how the proof of the Sacks–Simpson theorem, i.e., the solution of Post’s problem in α-recursion theory, could be based on α-machines, without involving constructibility theory.