125I粒子条联合胆道支架植入治疗恶性梗阻性黄疸22例疗效分析

【摘要】　 　目的 研究和探讨125I粒子条联合胆道支架植入治疗恶性梗阻性黄疸的临床疗效。方法 2011年6月—2013年9月收治恶性梗阻性黄疸患者40例。行胆道支架植入术治疗患者18例，为对照组；采用125I粒子条联合胆道支架植入患者22例，为观察组。两组均采用经皮肝穿刺胆道引流（PTCD）并胆道支架植入。结果 观察组与对照组的平均胆道开通时间分别为（8.7 ± 0.7）和（6.2 ± 0.4）个月，两组比较差异有统计学意义（P < 0.05）。观察组与对照组术后平均生存时间分别为（11.4 ± 0.8）和（8.7 ± 0.5）个月，生存时间的差异有统计学意义（P < 0.05）。术后近期疗效及并发症两组之间的比较无明显差异（P > 0.05），但是远期疗效有显著差异（P < 0.05）。结论 与对照组相比，观察组的术后生存时间及胆道开通时间明显延长，对于125I粒子条联合支架治疗恶性梗阻性黄疸值得进一步临床研究。
     

用仿真工具优化车辆动力系统(一)

在本文的第一部分，介绍了一种理想的车辆动力系统的计算机辅助开发过程。它显示了现代仿真技术在产品持续发展过程中的作用，该技术采用硬件回路作非在线的仿真，并通过现代化的试验手段对车辆进行匹配。特别重要的是提供了将电控变速器和发动机控制单元综合的可能性。接着是在线仿真在诸如发动机和变速器模式方面的应用和发展，它是上述开发过程的基础。根据上述的方法论，本文论述了仿真技术已取得的成绩和将来的应用可能性。     

我国“十五“电力供需预测分析

分析“十五”期间我国电力需求预测和电力预测中的不确定因素,提出建议采取的措施。     

Control of discrete time nonlinear systems with a time-varying structure

In this paper, we present a control methodology for a class of discrete time nonlinear systems that depend on a possibly exogenous scheduling variable. This class of systems consists of an interpolation of nonlinear dynamic equations in strict feedback form, and it may represent systems with a time-varying nonlinear structure. Moreover, this class of systems is able to represent some cases of gain scheduling control, Takagi-Sugeno fuzzy systems, as well as input-output realizations of nonlinear systems which are approximated via localized linearizations. We present two control theorems, one using what we call a “global” approach (akin to traditional backstepping), and a “local” approach, our main result, where backstepping is again used but the control law is an interpolation of local control terms. An aircraft wing rock regulation problem with varying angle of attack is used to illustrate and compare the two approaches.     

Stability robustness of networked control systems with respect to packet loss

This paper is concerned with stability analysis of discrete-time networked control systems over a communication channel subject to packet loss whose behavior is modeled by an i.i.d Bernoulli process with a packet dropping probability bounded by a constant. A necessary and sufficient condition for stability is obtained. A packet dropping margin is introduced as a measure of stability robustness of a system against packet dropping, and a formula for it is derived. A design method is proposed for achieving a large margin subject to a constraint that the system has a set of prescribed nominal closed-loop poles.     

Decentralized adaptive coordinated control of multiple robot arms without using a force sensor

This paper presents a distributed adaptive coordinated control method for multiple robot arms grasping a common object. The cases of rigid contact and rolling contact are analyzed. In the proposed controller, the dynamic parameters of both object and robot arms are estimated adaptively. The desired motions of the robot arms are generated by an estimated object reference model. The control method requires only the measurements of the positions and velocities of the object and robot arms, but not the measurements of forces and moments at contact points. The asymptotic convergence of trajectory is proven by the Lyapunov-like Lemma. Experiments involving two robot arms handling a common object are shown.     

Controlled linear system with delayed relay output under impulse random disturbances

The paper is devoted to the first order delayed linear system with relay output controlled by the proportional-integral (PI) regulator. The deterministic system exhibits stable oscillations, and, since the system itself is stable, it can be suitable to switch off the controller if there are no disturbances during a long time interval. In the present work, the random disturbances are modelled by a Poisson stream of impulses, and the goal is to determine the instants of switching on (off) of the PI controller. After several assumptions and quantization of the time axis, we construct the new optimal control problem which is successfully solved with the help of the dynamic programming approach.     

Solving the small sample size problem in face recognition using generalized discriminant analysis

The goal of face recognition is to distinguish persons via their facial images. Each person's images form a cluster, and a new image is recognized by assigning it to the correct cluster. Since the images are very high-dimensional, it is necessary to reduce their dimension. Linear discriminant analysis (LDA) has been shown to be effective at dimension reduction while preserving the cluster structure of the data. It is classically defined as an optimization problem involving covariance matrices that represent the scatter within and between clusters. The requirement that one of these matrices be nonsingular restricts its application to datasets in which the dimension of the data does not exceed the sample size. For face recognition, however, the dimension typically exceeds the number of images in the database, resulting in what is referred to as the small sample size problem. Recently, the applicability of LDA has been extended by using the generalized singular value decomposition (GSVD) to circumvent the nonsingularity requirement, thus making LDA directly applicable to face recognition data. Our experiments confirm that LDA/GSVD solves the small sample size problem very effectively as compared with other current methods.