HIGH-TEMPERATURE ISOPIESTIC STUDIES ON Hg-Pb BINARY AMALGAM

用高温等渗法测定了600K时Hg-Pb二元系中Hg的活度,并用Gibbs-Duhem积分计算了该二元汞齐中Pb的活度。     

Microstructure development of steel during severe plastic deformation

The microstructure development during plastic deformation was reviewed for iron and steel which were subjected to cold rolling or mechanical milling (MM) treatment, and the change in strengthening mechanism caused by the severe plastic deformation (SPD) was also discussed in terms of ultra grain refinement behavior. The microstructure of cold-rolled iron is characterized by a typical dislocation cell structure, where the strength can be explained by dislocation strengthening. It was confirmed that the increase in dislocation density by cold working is limited at 10¹⁶m⁻², which means the maximum hardness obtained by dislocation strengthening is HV3.7 GPa. However, the iron is abnormally work-hardened over the maximum dislocation strengthening by SPD of MM because of the ultra grain refinement caused by the SPD. In addition, impurity of carbon plays an important role in such grain refinement: the carbon addition leads to the formation of nano-crystallized structure in iron.     

Low-energy ion beam treatment of α-Al<Subscript>2</Subscript>O<Subscript>3</Subscript>(0001) and improvement of photoluminescence of ZnO thin films

A low energy N₂ ^? ion beam impinged on a α-Al₂O₃(0001) single crystal surface in the range of fluence 5×10¹⁵/cm²?1×10¹⁸/cm² at room temperature. After ion bombardment, chemical bonding on the modified sapphire surface was investigated by x-ray photoelectron spectroscopy. Below a fluence of 1×10¹⁵/cm², only a non-bonded N1s peak at the binding energy 398.7 eV was found, but further irradiation up to 2×10¹⁷/cm² induced Al?O?N bonding at around 403 eV. The occurrence of Al?N bonding was identified at ion fluence higher than 5×10¹⁷/cm² at 396.6 eV. II–VI ZnO thin films were grown on an untreated/ion-beam-induced sapphire surface by pulsed laser deposition (PLD) for the investigation of the modified-substrate effect on photoluminescence. The ZnO films grown on modified sapphire containing Al?O?N bonding only, and both Al?O?N and Al?N bonding showed a significant reduction of the peak related to deep-level defects in photoluminescence. These results are explained in terms of the formation of Al?N?O and Al?O?N layers and relaxation of the interfacial strain between Al₂O₃ and ZnO.     

Cu/MgO界面位错的高分辨电子显微镜研究

用高分辨透射电子显微镜对内氧化产生的Cu/MgO界面进行了研究，观察到了取向关系相同的两种不同界面。并运用近重位点阵模型对其界面结构进行了研究，求出了失配位错的3个Burgers矢量和次级位错的3个Burgers矢量，它们分别为：b1^→=1/4[011]MgO,b2^→=1/2[100]Cu,b3^→=1/4[01^-1]MgO;b1^→′=1/12[101]Cu(或1／99[755]MgO),b2^→′=1/12[101^-]Cu（或1/99[75^-5^-]MgO),b3^→′=1/6[010]Cu(或1／10[01^-1]MgO)失配位错之间的距离与实验测量结果符合得很好。     

Eliciting positive user experiences with self-service kiosks: pursuing possibilities

Although the prominent concept of the last decade – user experience – maintains its significance in diverse disciplines, especially design, its focus has changed to eliciting positive user experiences by pursuing new possibilities for consumer products rather than by solely seeking solutions to existing problems. Designers continue to aim for rich user experiences with a variety of products, but have neglected self-service (interactive) kiosks. Hence, this paper, after giving a brief overview of the positive psychology literature, demonstrates the dimensions of positive user experiences with self-service kiosks through an empirical study conducted on coffee vending machines and automated tellers.     

Using static suffix array in dynamic application: Case of text compression by longest first substitution

Over the last decade, enhanced suffix arrays (ESA) have replaced suffix trees in many applications. Algorithms based on ESAs require less space, while allowing the same time efficiency as those based on suffix trees. However, this is only true when a suffix structure is used as a static index. Suffix trees can be updated faster than suffix arrays, which is a clear advantage in applications that require dynamic indexing. We show that for some dynamic applications a suffix array and the derived LCP-interval tree can be used in such a way that the actual index updates are not necessary. We demonstrate this in the case of grammar text compression with longest first substitution and provide the source code. The proposed algorithm has O(N²)$O(N^2)$ worst case time complexity but runs in O(N)$O(N)$ time in practice.     

Stabilised finite element methods for a bending moment formulation of the Reissner-Mindlin plate model

This work presents new stabilised finite element methods for a bending moments formulation of the Reissner-Mindlin plate model. The introduction of the bending moment as an extra unknown leads to a new weak formulation, where the symmetry of this variable is imposed strongly in the space. This weak problem is proved to be well-posed, and stabilised Galerkin schemes for its discretisation are presented and analysed. The finite element methods are such that the bending moment tensor is sought in a finite element space constituted of piecewise linear continuos and symmetric tensors. Optimal error estimates are proved, and these findings are illustrated by representative numerical experiments.     

Enforcing Efficient Equilibria in Network Design Games via Subsidies

The efficient design of networks has been an important engineering task that involves challenging combinatorial optimization problems. Typically, a network designer has to select among several alternatives which links to establish so that the resulting network satisfies a given set of connectivity requirements and the cost of establishing the network links is as low as possible. The Minimum Spanning Tree problem, which is well-understood, is a nice example.In this paper, we consider the natural scenario in which the connectivity requirements are posed by selfish users who have agreed to share the cost of the network to be established according to a well-defined rule. The design proposed by the network designer should now be consistent not only with the connectivity requirements but also with the selfishness of the users. Essentially, the users are players in a so-called network design game and the network designer has to propose a design that is an equilibrium for this game. As it is usually the case when selfishness comes into play, such equilibria may be suboptimal. In this paper, we consider the following question: can the network designer enforce particular designs as equilibria or guarantee that efficient designs are consistent with users’ selfishness by appropriately subsidizing some of the network links? In an attempt to understand this question, we formulate corresponding optimization problems and present positive and negative results.     

Hybrid Difference Methods for PDEs

We propose the hybrid difference methods for partial differential equations (PDEs). The hybrid difference method is composed of two types of approximations: one is the finite difference approximation of PDEs within cells (cell FD) and the other is the interface finite difference (interface FD) on edges of cells. The interface finite difference is obtained from continuity of some physical quantities. The main advantages of this new approach are that the method can applied to non-uniform grids, retaining the optimal order of convergence and stability of the numerical method for the Stokes equations is obtained without introducing staggered grids.