TWO KINDS OF VARIANT IN SHAPE MEMORY MATERIAL

In shape memory materials,that have been trained to have a two way shape memory effect(TWSM),themartensitic variants are classified into two groups,i.e.,preferentially oriented variants and self-accommodatingvariants.Applied stress may promote or constrain the transition of preferentially oriented variants and so changetransformation temperatures but has no essential effect on self-accommodating variants.According to the pointof view mentioned above,some experimental phenomena during thermocycling of a TWSM device may be ex-plained,such as the absence of synchronization between the plot of resistance change.temperature and the plotof memory strain vs.temperature.     

A Constraint-Based Approach for Deriving 3-D Structures of Cyclic Polypeptides

This paper presents an hybrid algorithm for deriving 3-D structures of cyclic polypeptides. The algorithm combines constraint-based techniques with the most widely used methods for non-cyclic polypeptides. The empirical results demonstrate that the proposed hybrid algorithm outperforms traditional methods especially with respect to running times.     

Optimal Control of Two-Stage Discrete Event Systems with Real-Time Constraints

We consider discrete event systems (DES) involving tasks with real-time constraints and seek to control processing times so as to minimize a cost function subject to each task meeting its own constraint. When tasks are processed over a single stage, it has been shown that there are structural properties of the optimal sample path that lead to very efficient solutions of such problems. When tasks are processed over multiple stages and are subject to end-to-end real-time constraints, these properties no longer hold and no obvious extensions are known. We consider a two-stage problem with homogeneous cost functions over all tasks at each stage and derive several new optimality properties. These properties lead to the idea of introducing “virtual” deadlines at the first stage, thus partially decoupling the stages so that the known efficient solutions for single-stage problems can be used. We prove that the solution obtained by an iterative virtual deadline algorithm (VDA) converges to the global optimal solution of the two-stage problem and illustrate the efficiency of the VDA through numerical examples.

A new approach to adaptive control: no nonlinearities

In adaptive control the goal is to design a controller to control an uncertain system whose parameters may be changing with time. Typically the controller consists of an identifier (or tuner) which is used to adjust the parameters of a linear time-invariant (LTI) compensator, and under suitable assumptions on the plant model uncertainty it is proven that good asymptotic behaviour is achieved, such as model matching (for minimum phase systems) or stability. However, a typical adaptive controller does not track time-varying parameters very well, and it is often highly nonlinear, which can result in undesirable behaviour, such as large transients or a large control signal. Furthermore, most adaptive controllers provide only asymptotic tracking, with no ability to design for a pre-specified settling time.Here we propose an alternative approach, which yields a linear periodic controller. Rather than estimating the plant or compensator parameters, instead we estimate what the control signal would be if the plant parameters were known. In this paper we argue the utility of this approach and then examine the first order case in detail, including a simulation. We also explore the benefits and limitations of the approach.     

Dissymmetric warfare versus asymmetric warfare

This paper presents two concepts: asymmetric warfare and dissymmetric warfare. NATO and US Military operations in recent wars in Kosovo and Afghanistan are analysed by means of comparison with old Chinese strategic thinking. No‐Loss‐Strategy and virtual warfare as well as the transformation from asymmetric to dissymmetric and from dissymmetric to asymmetric warfare are reflected upon.     

基于Jack的虚拟环境中一种防止穿越的实现

在虚拟环境下虚拟人手和虚拟物体的交互中,会发生穿越现象。为了解决穿越问题,在人体模型系统Jack的虚拟环境中,根据约束Constraint对象的特点,利用Constraint对象来模拟物体对人手阻挡作用,并利用约束队列实现了对场景中Constraint对象的管理,达到防穿越的效果。     

A note on the time travel approach for handling time windows in vehicle routing problems

In this paper, we identify two cases in which the proposition for calculating time window penalties presented in Nagata, Y., Bräysy, O. and Dullaert, W. A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows, Computers & Operations Research 2010;37(4): 724–37 yields incorrect results. We derive the corrected proposition and use numerical studies to show that a significant proportion of the evaluations performed by a Tabu Search for VRPTW falls under the two incorrect cases. Moreover, we demonstrate that the incorrect time window handling has a significant negative impact on the solution quality of the Tabu Search.     

采用注入法对配电网中性点进行测量

针对配电网中不对称度大的中性点接地方式,提出了采用异频信号注入法对其进行测量,重点分析了其原理并进行详细地理论推导,最后模拟10 kV配电网进行了实验测试.该方法使配电网的谐振频率远离工频50 Hz,有效降低了不对称度大的配电网的位移电压,测量简单,安全可靠.实验结果表明其具有测量精度高、实时性好等特点,具有广阔的应用前景.     

基于约束因子限幅控制的双馈感应发电机有功功率平滑控制

在分析双馈感应发电机（doubly-fed induction generator,DFIG）运行特性和传统最大风能追踪控制（maximum power point tracking,MPPT）策略的基础上,给出一种基于约束因子限幅控制的DFIG有功功率平滑控制策略,提出功率输出限幅值可调的控制思想,结合发电机转速控制和风力机变桨距控制来实现输出功率保持在任意给定值。给出了约束因子的表达式和取值规则。在Matlab／Simulink仿真平台上采用所提平滑控制策略,对一个9MW风电场的有功功率输出特性进行研究,计算了2种控制策略下输出功率的平滑性能指标和方差值。实验结果表明,与传统最大风能追踪控制策略相比,所提出的平滑控制策略能显著减小发电机输出功率的波动,优化了系统的电能质量。     

Performance Analysis of WDM Optical Networks with Wavelength Usage Constraint

Due to power considerations, it is possible that not all wavelengths available in a fiber can be used at a given time. In this paper, an analytical model is proposed to evaluate the blocking performance of wavelength-routed optical networks with and without wavelength conversion where the usable wavelengths in a fiber is limited to a certain maximum number, referred to as wavelength usage constraint. The effect of the wavelength usage constraint is studied on ring and mesh-torus networks. It is shown that the analytical model closely approximates the simulation results. We also evaluate the performance of the first-fit wavelength assignment algorithm and compare its performance with the random wavelength assignment algorithm through simulation. It is observed that increasing the total number of wavelengths in a fiber is an attractive alternative to wavelength conversion when the number of usable wavelengths in a fiber is maintained the same.