弛豫铁电体Pb(Mg1/3Nb2/3)O3-PbTiO3的相变

测量了(1-x％)镁铌酸铅-x％钛酸铅(1≤X≤11)(简称PMNTx)陶瓷样品的介电常数、内耗和Young’s模量．观测到在Tm温度附近，即在介电常数达到最大值时，出现一个内耗峰，并且模量发生软化．这反映了极化纳米微畴的弛豫．对于PMNTx(5≤x≤11)的样品，在Tm温度以下的某个温度出现附加的内耗峰和Young’s模量的异常，表明样品中发生了自发的弛豫铁电到铁电(简称R-F)的相变，对R-F相变的机制进行了讨论．     

液相流动对柱晶一次间距的影响

利用带有对流驱动系统的定向凝固装置,研究了液相稳定流动时透明合金SCN-2wt-％Ace定向凝固的动态过程.结果表明:流动显著改变定向凝固柱状晶的一次间距枝晶的间距增大,主要是流动与枝端浓度场耦合作用的结果;胞晶的间距变小,主要是侧向分枝转向生长的结果     

原位合成ZrC颗粒增强锆基非晶复合材料及力学性能

利用zr与TiC粉末之间的原位反应经铜模铸造方法制备了zrC颗粒增强zr41Til4Cul2.5Ni10Be22．5块状非晶复合材料结果表明：原位合成的ZrC颗粒尺寸细小、形状规整并均匀地分布在非晶基体上．与锆非晶合金相比，复合材料的压缩强度得到提高，塑性得到改善．对ZrC颗粒原位合成及强化机理进行了讨论．     

金属快速凝固的非平衡超急速传热模型

运用非Fourier传热理论建立了金属快速凝固过程中的非平衡传热理论模型，包括非Fourier方程的建立、传热与相变模拟，模拟计算表明：（1）在溅射激冷条件下，界面换热系数越大，界面冷却速度和移动速度也越高。在界面换热系数相同时，计算得到的界面冷却速度随着固－液界面高度的提高呈现先上升而后下降的变化趋势；计算得到的冷却速度值明显小于Fourier定律的计算值。（2）在激光加热条件下，计算的界面移动速度在凝固开始时先急剧增加，然后渐趋平稳，计算还表明，金属的过热及过冷度与其热物性相关。     

Non-intrusive Coupling: Recent Advances and Scalable Nonlinear Domain Decomposition

This paper provides a detailed review of the global/local non-intrusive coupling algorithm. Such method allows to alter a global finite element model, without actually modifying its corresponding numerical operator. We also look into improvements of the initial algorithm (Quasi-Newton and dynamic relaxation), and provide comparisons based on several relevant test cases. Innovative examples and advanced applications of the non-intrusive coupling algorithm are provided, granting a handy framework for both researchers and engineers willing to make use of such process. Finally, a novel nonlinear domain decomposition method is derived from the global/local non-intrusive coupling strategy, without the need to use a parallel code or software. Such method being intended to large scale analysis, we show its scalability. Jointly, an efficient high level Message Passing Interface coupling framework is also proposed, granting an universal and flexible way for easy software coupling. A sample code is also given.     

A memetic algorithm to solve an unrelated parallel machine scheduling problem with auxiliary resources in semiconductor manufacturing

In this paper, we propose a metaheuristic for solving an original scheduling problem with auxiliary resources in a photolithography workshop of a semiconductor plant. The photolithography workshop is often a bottleneck, and improving scheduling decisions in this workshop can help to improve indicators of the whole plant. Two optimization criteria are separately considered: the weighted flow time (to minimize) and the number of products that are processed (to maximize). After stating the problem and giving some properties on the solution space, we show how these properties help us to efficiently solve the problem with the proposed memetic algorithm, which has been implemented and tested on large generated instances. Numerical experiments show that good solutions are obtained within a reasonable computational time.     

Behaviour based on decision matrices for a coordination between agents in a urban traffic simulation

This paper describes a multi-agent coordination mechanism applied to intersection simulation situations. In a goal of urban traffic simulation, we must consider the dynamic interactions between autonomous vehicles. The field of multi-agent systems provides us some studies for such systems, in particular on the coordination mechanisms. Conflicts between vehicles (i.e. agents) are very frequent in such applications, and they may cause deadlocks, particularly at intersections such as crossroads. Our approach is based on the solving of two player games/decision matrices which characterize three basic situations. An aggregation method generalizes to n-player games for complex crossroads. The objective of this approach consists in searching basic two-player matrices for solving n-agent problems. To explain the principle, we describe our approach for a particular case of crossroad with three agents. Finally, the obtained results have been examined via a tool of road traffic simulation, ARCHISIM. We assume also that the global traffic replicates the behavior of agents in different situations.     

Diagnosability Analysis of a Class of Hierarchical State Machines

This paper addresses the problem of fault detection and isolation for a particular class of discrete event dynamical systems called hierarchical finite state machines (HFSMs). A new version of the property of diagnosability for discrete event systems tailored to HFSMs is introduced. This notion, called L₁-diagnosability, captures the possibility of detecting an unobservable fault event using only high level observations of the behavior of an HFSM. Algorithms for testing L₁-diagnosability are presented. In addition, new methodologies are presented for studying the diagnosability properties of HFSMs that are not L₁-diagnosable. These methodologies avoid the complete expansion of an HFSM into its corresponding flat automaton by focusing the expansion on problematic indeterminate cycles only in the associated extended diagnoser.