The design of the TEI encoding scheme

This paper discusses the basic design of the encoding scheme described by the Text Encoding Initiative'sGuidelines for Electronic Text Encoding and Interchange (TEI document number TEI P3, hereafter simplyP3 orthe Guidelines). It first reviews the basic design goals of the TEI project and their development during the course of the project. Next, it outlines some basic notions relevant for the design of any markup language and uses those notions to describe the basic structure of the TEI encoding scheme. It also describes briefly the core tag set defined in chapter 6 of P3, and the default text structure defined in chapter 7 of that work. The final section of the paper attempts an evaluation of P3 in the light of its original design goals, and outlines areas in which further work is still needed.C. M. Sperberg-McQueen is a Senior Research Programmer at the academic computer center of the University of Illinois at Chicago; his interests include medieval Germanic languages and literatures and the theory of electronic text markup. Since 1988 he has been editor in chief of the ACH/ACL/ALLC Text Encoding Initiative. Lou Burnard is Director of the Oxford Text Archive at Oxford University Computing Services, with interests in electronic text and database technology. He is European Editor of the Text Encoding Initiative's Guidelines.     

On the Efficiency of Runs Rules Schemes for Process Monitoring

There are two main types of variations, namely, common and special causes leading to in‐control and out‐of‐control states, respectively. Control charts are popular tools used to differentiate between these two states of a process. Implementation of runs rules schemes with control charts is an attractive approach for process monitoring. This study is designed to describe the methodology of runs rules schemes and discuss their implementation for different types of control charts. We have considered memory‐less charts, namely, , S, and R charts for our study purposes. It is examined that the efficiency gain depends on the number of decision points utilized to implement a given rule. Moreover, superiority of runs rules schemes may vary for different types of location and dispersion charts. An application example using a dataset is also included in the study for practical considerations. Copyright © 2015 John Wiley & Sons, Ltd.     

GOST 34.10—A brief overview of Russia's DSA

GOST 34.10 is Russia's DSA. Like its US counterpart, GOST is an ElGamal-like signature scheme used in Schnorr mode. It is similar to NIST DSA in many aspects. In this paper we will overview GOST 34.10 and discuss the three main differences between the two algorithms, (i) GOST's principal design criterion does not seem to be computational efficiency: the algorithm is 1.6 times slower than the DSA and produces 512-bit signatures. This is mainly due to the usage of the modulus q which is at least 254 bits long. During verification, modular inverses are computed by exponentiation (while the Extended Euclidian algorithm is roughly 100 times faster for this parameter size) and the generation of the public parameters is much more complicated than in the DSA. This choice of the parameters makes GOST 34.10 very secure. (ii) GOST signers do not have to generate modular inverses as the basic signature equation is s = xr + mk (mod q) instead of (mod q). (iii) GOST's hash function (the Russian equivalent of the SHA) is the standard GOST 34.11 which uses the block cipher GOST 28147 (partially classified) as a building block. The hash function will be briefly described. Copyright     

A kinetic flux-vector splitting method for the shallow water magnetohydrodynamics

A kinetic flux-vector splitting (KFVS) scheme for the shallow water magnetohydrodynamic (SWMHD) equations in one- and two-space dimensions is formulated and applied. These equations model the dynamics of a thin layer of nearly incompressible and electrically conducting fluids for which the evolution is nearly two-dimensional with magnetic equilibrium in the third direction. The proposed numerical scheme is based on the direct splitting of macroscopic flux functions of the SWMHD equations. In two-space dimensions the scheme is derived in a usual dimensionally split manner; that is, the formulae for the fluxes can be used along each coordinate direction. The high-order resolution of the scheme is achieved by using a MUSCL-type initial reconstruction and Runge-Kutta time stepping method. Both one- and two-dimensional test computations are presented. For validation, the results of KFVS scheme are compared with those obtained from the space-time conservation element and solution element (CE/SE) method. The accuracy, efficiency and simplicity of the KFVS scheme demonstrate its potential in modeling SWMHD equations.     

A computational study of vortex-airfoil interaction using high-order finite difference methods

Simulations of the interaction between a vortex and a NACA0012 airfoil are performed with a stable, high-order accurate (in space and time), multi-block finite difference solver for the compressible Navier-Stokes equations.We begin by computing a benchmark test case to validate the code. Next, the flow with steady inflow conditions are computed on several different grids. The resolution of the boundary layer as well as the amount of the artificial dissipation is studied to establish the necessary resolution requirements. We propose an accuracy test based on the weak imposition of the boundary conditions that does not require a grid refinement.Finally, we compute the vortex-airfoil interaction and calculate the lift and drag coefficients. It is shown that the viscous terms add the effect of detailed small scale structures to the lift and drag coefficients.     

探析服装印花图案色彩设计

服装印花色彩设计是时代的一面镜子,从其特有的角度,映照出人类社会物质及精神文明进步、发展的面貌。探析服装印花色彩,掌握好和运用好色彩是服装印花色彩设计的重要之事,为使其对人们产生艺术魅力,给社会创造更多的经济价值,在服装印花设计中,色彩显然要担负起至关重要的使命。     

A discontinuous Galerkin solver for Boltzmann–Poisson systems in nano devices

In this paper, we present results of a discontinuous Galerkin (DG) scheme applied to deterministic computations of the transients for the Boltzmann–Poisson system describing electron transport in semiconductor devices. The collisional term models optical-phonon interactions which become dominant under strong energetic conditions corresponding to nano-scale active regions under applied bias. The proposed numerical technique is a finite element method using discontinuous piecewise polynomials as basis functions on unstructured meshes. It is applied to simulate hot electron transport in bulk silicon, in a silicon n⁺–n–n⁺ diode and in a double gated 12 nm MOSFET. Additionally, the obtained results are compared to those of a high order WENO scheme simulation and DSMC (Discrete Simulation Monte Carlo) solvers.     

无线传感器网络中高效移动汇点规划算法

在带有移动汇点(MS)的无线传感器网络(WSN)数据收集应用中,采用基于代理的数据收集模式可以有效缩短MS慢速引起的数据收集延迟问题.以提高WSN数据收集的能量效率和缩短数据收集延时为目标,给出了一种MS轨道规划算法MS-TPA. MS-TPA主要包括RN竞选和MS移动规划两个阶段.剩余能量优先的RN竞选机制能够平衡网络节点的能量消耗,MS移动规划算法能够缩短数据收集的延迟问题.仿真实验验证了所提出算法的有效性.     

An ideal multi-secret sharing scheme based on MSP

A multi-secret sharing scheme is a protocol to share m arbitrarily related secrets s₁, … , s_m among a set of n participants. In this paper, we propose an ideal linear multi-secret sharing scheme, based on monotone span programs, where each subset of the set of participants may have the associated secret. Our scheme can be used to meet the security requirement in practical applications, such as secure group communication and privacy preserving data mining etc. We also prove that our proposed scheme satisfies the definition of a perfect multi-secret sharing scheme.     

A Newton-like finite element scheme for compressible gas flows

Semi-implicit and Newton-like finite element methods are developed for the stationary compressible Euler equations. The Galerkin discretization of the inviscid fluxes is potentially oscillatory and unstable. To suppress numerical oscillations, the spatial discretization is performed by a high-resolution finite element scheme based on algebraic flux correction. A multidimensional limiter of TVD type is employed. An important goal is the efficient computation of stationary solutions in a wide range of Mach numbers, which is a challenging task due to oscillatory correction factors associated with TVD-type flux limiters. A semi-implicit scheme is derived by a time-lagged linearization of the nonlinear residual, and a Newton-like method is obtained in the limit of infinite CFL numbers. Special emphasis is laid on the numerical treatment of weakly imposed characteristic boundary conditions. Numerical evidence for unconditional stability is presented. It is shown that the proposed approach offers higher accuracy and better convergence behavior than algorithms in which the boundary conditions are implemented in a strong sense.