编码字符集标准及分类研究

编码字符集标准是计算机处理文字信息的基础,本文提出了编码字符集三元组抽象,对现有编码字符集标准进行了简单回顾和总结,深入剖析了影响巨大的ISO 2022标准及其派生标准,对ISO 2022编码机制应用于多语言环境的局限性进行了探讨,阐明了使用通用编码字符集UCS的必要性,并对其进行了分析.探讨了现有编码分类方法存在的问题,引入了一种对编码字符集以及实现方法进行分类的新方法,使用该方法对现有标准进行了归类;最后对汉字字符集相关的国家标准进行了分析评介.

藏文编码字符集的扩充集在Linux上的实现

国内藏文软件开发普遍使用的是基于垂直预组合字符的实现方案,但是缺乏统一的编码标准.藏文编码字符集扩充集的推出,对于国内藏文软件的标准化、国际化具有重要意义.本文通过分析ISO/IEC 10646藏文编码字符集基本集、藏文编码字符集扩充集国家标准,区分它们描述字丁的差异,分析由编码方案所导致的实现上的关键问题.最后,针对藏文扩充集B的特殊性,提出并实现了基于Linux国际化架构下支持藏文扩充集标准的解决方案.

藏文基本字符集的支持在OpenOffice.org中的实现方法

以开源项目OpenOffice.org为基础,针对藏文基本字符集在OpenOffice.org办公套件本地化的过程中出现的技术难点,根据藏文自身的特点结合OpenOffice.org中文本显示模块Icu的结构,解决了藏文小字符集在OpenOffice.org办公套件中显示、排序和转写等和文化与文字紧密相关的问题。该本地化软件可以跨Windows和Linux平台运行。

藏文支持在OpenOffice.org办公套件中的实现

办公套件是人们日常应用最为广泛的信息处理软件之一,但真正意义的藏文办公套件至今都尚未问世,成为藏文信息技术发展的“瓶颈”.开源项目OpenOffice.org的不断发展和日益成熟,为藏文办公套件的研制开发提供了有利的契机.以OpenOffice.org为源代码基础,采用藏文编码字符集（扩充集A）国家标准,研制的藏文办公套件可支持藏文排版习惯和藏文本地环境,着重解决了藏文文本自动断行的问题,能够满足藏语文用户日常办公需要.

LEVEL SET输运方程的求解方法及其对气-液两相流运动界面数值模拟的影响

用数值模拟方法来研究气-液两相流动与传热现象是当今多相流领域的一个热门课题.由于两相流固有的复杂性,气-液两相流界面迁移现象的数值模拟一直是两相流研究中的一大难点.本文介绍了捕捉气-液两相流相界面运动的水平集方法(Level Set)及其研究进展,介绍了求解Level Set输运方程的3种方法,即一般差分格式、Superbee-TVD格式和Runge-Kutta法-5阶WENO组合格式.结合主流场的求解,分别用这3种方法对4种典型相界面在5种流场中的迁移特性进行了模拟计算,并对计算结果进行了比较和分析.结果表明,Runge-Kutta法-5阶WENO组合格式求解Level Set输运方程的效果最好,在以后的计算中将主要采用这种组合格式来进行气-液相界面输运方程的求解.

Statistical analysis of synthetic earthquake catalogs generated by models with various levels of fault zone disorder

The stress release model, a stochastic version of the elastic rebound theory, is applied to the large events from four synthetic earthquake catalogs generated by models with various levels of disorder in distribution of fault zone strength (Ben-Zion, 1996) They include models with uniform properties (U), a Parkfield-type asperity (A), fractal brittle properties (F), and multi-size-scale heterogeneities (M). The results show that the degree of regularity or predictability in the assumed fault properties, based on both the Akaike information criterion and simulations, follows the order U, F, A, and M, which is in good agreement with that obtained by pattern recognition techniques applied to the full set of synthetic data. Data simulated from the best fitting stress release models reproduce, both visually and in distributional terms, the main features of the original catalogs. The differences in character and the quality of prediction between the four cases are shown to be dependent on two main aspects: the parameter controlling the sensitivity to departures from the mean stress level and the frequency-magnitude distribution, which differs substantially between the four cases. In particular, it is shown that the predictability of the data is strongly affected by the form of frequency-magnitude distribution, being greatly reduced if a pure Gutenburg-Richter form is assumed to hold out to high magnitudes.

Character of simplified Navier-Stokes (SNS) equations near separation point for two-dimensional laminar flow over a flat plate

It is proved that the simplified Navier-Stokes (SNS) equations presented by Gao Zhi[1], Davis and Golowachof-Kuzbmin-Popof (GKP)[3] are respectively regular and singular near a separation point for a two-dimensional laminar flow over a flat plate. The order of the algebraic singularity of Davis and GKP equation[2,3] near the separation point is indicated. A comparison among the classical boundary layer (CBL) equations, Davis and GKP equations, Gao Zhi equations and the complete Navier-Stokes (NS) equations near the separation point is given.

Orientation preference and fractal character of short fatigue cracks in a weld metal

Short fatigue crack behaviour in a weld metal has been further investigated. The Schmid factor and the fractal dimension of short cracks on iso-stress specimens subjected to reversed bending have been determined and then applied to account for the distribution and orientation characteristics of short fatigue cracks. The result indicates that the orientation preference of short cracks is attributed to the large values of Schmid factor at relevant grains. The Schmid factors of most slip systems, which produced short cracks, are less than or equal to 0.4. Crack length measurements reveal that short crack path, compared to that of long crack, possesses a more stable and relatively larger value of fractal dimension. This is regarded as one of the typical features of short cracks.

Mixed-mode fracture mechanisms near the fatigue threshold of aisi-316 stainless-steel

Near threshold, mixed mode (I and II), fatigue crack growth occurs mainly by two mechanisms, coplanar (or shear) mode and branch (or tensile) mode. For a constant ratio of ΔK_I/ΔK_II the shear mode growth shows a self-arrest character and it would only start again when ΔK_I and ΔK_II are increased. Both shear crack growth and the early stages of tensile crack growth, are of a crystallographic nature; the fatigue crack proceeds along slip planes or grain boundaries. The appearance of the fracture surfaces suggest that the mechanism of crack extension is by developing slip band microcracks which join up to form a macrocrack. This process is thought to be assisted by the nature of the plastic deformation within the reversed plastic zone where high back stresses are set up by dislocation pile-ups against grain boundaries. The interaction of the crack tip stress field with that of the dislocation pile-ups leads to the formation of slip band microcracks and subsequent crack extension. The change from shear mode to tensile mode growth probably occurs when the maximum tensile stress and the microcrack density in the maximum tensile plane direction attain critical values.

The Relationship between Decision Trees and the Scale of Train Data Set

Decision Trees need train samples in the train data set to get classification rules. If the number of train data was too small, the important information might be missed and thus the model could not explain the classification rules of data. While it is not affirmative that large scale of train data set can get well model. This Paper analysis the relationship between decision trees and the train data scale. We use nine decision tree algorithms to experiment the accuracy, complexity and robustness of decision tree algorithms. Some results are demonstrated.

Generating artificial homologous proteins according to the representative family character in molecular mechanics properties - an attempt in validating an underlying rule of protein evolution

The molecular mechanics property is the foundation of many characters of proteins. Based on intramolecular hydrophobic force network, the representative family character underlying a protein’s mechanics property is described by a simple two-letter scheme. The tendency of a sequence to become a member of a protein family is scored according to this mathematical representation. Remote homologs of the WW-domain family could be easily designed using such a mechanistic signature of protein homology. Experimental validation showed that nearly all artificial homologs have the representative folding and bioactivity of their assigned family. Since the molecular mechanics property is the only consideration in this study, the results indicate its possible role in the generation of new members of a protein family during evolution.

Two-step digit-set-restricted modified signed-digit addition-subtraction algorithm and its optoelectronic implementation

A novel, to our knowledge, two-step digit-set-restricted modified signed-digit (MSD) addition-subtraction algorithm is proposed. With the introduction of the reference digits, the operand words are mapped into an intermediate carry word with all digits restricted to the set {(1) over bar, 0} and an intermediate sum word with all digits restricted to the set {0, 1}, which can be summed to form the final result without carry generation. The operation can be performed in parallel by use of binary logic. An optical system that utilizes an electron-trapping device is suggested for accomplishing the required binary logic operations. By programming of the illumination of data arrays, any complex logic operations of multiple variables can be realized without additional temporal latency of the intermediate results. This technique has a high space-bandwidth product and signal-to-noise ratio. The main structure can be stacked to construct a compact optoelectronic MSD adder-subtracter. (C) 1999 Optical Society of America.

One-step digit-set-restricted modified signed-digit adder using an incoherent correlator based on a shared content-addressable memory

An efficient one-step digit-set-restricted modified signed-digit (MSD) adder based on symbolic substitution is presented. In this technique, carry propagation is avoided by introducing reference digits to restrict the intermediate carry and sum digits to {1,0} and {0,1}, respectively. The proposed technique requires significantly fewer minterms and simplifies system complexity compared to the reported one-step MSD addition techniques. An incoherent correlator based on an optoelectronic shared content-addressable memory processor is suggested to perform the addition operation. In this technique, only one set of minterms needs to be stored, independent of the operand length. (C) 2002 society or Photo-Optical Instrumentation Engineers.

Efficient two-step digit-set-restricted modified signed-digit algorithm based on optoelectronic shared content-addressable memory

A two-step digit-set-restricted modified signed-digit (MSD) adder based on symbolic substitution is presented. In the proposed addition algorithm, carry propagation is avoided by using reference digits to restrict the intermediate MSD carry and sum digits into {(1) over bar ,0} and {0, 1}, respectively. The algorithm requires only 12 minterms to generate the final results, and no complementarity operations for nonzero outputs are involved, which simplifies the system complexity significantly. An optoelectronic shared content-addressable memory based on an incoherent correlator is used for experimental demonstration. (c) 2005 Society of Photo-Optical Instrumentation Engineers.

Efficient two-step digit-set-restricted modified signed-digit algorithm based on optoelectronic shared content-addressable memory

A two-step digit-set-restricted modified signed-digit (MSD) adder based on symbolic substitution is presented. In the proposed addition algorithm, carry propagation is avoided by using reference digits to restrict the intermediate MSD carry and sum digits into {(1) over bar ,0} and {0, 1}, respectively. The algorithm requires only 12 minterms to generate the final results, and no complementarity operations for nonzero outputs are involved, which simplifies the system complexity significantly. An optoelectronic shared content-addressable memory based on an incoherent correlator is used for experimental demonstration. (c) 2005 Society of Photo-Optical Instrumentation Engineers.