Fracture investigation of U‐notch made of tungsten–copper functionally graded materials by means of strain energy density

The averaged strain energy density over a well‐defined control volume was employed to assess the fracture of U‐notched specimens made of tungsten–copper functionally graded materials under prevalent mode II loading. The boundary of control volume was evaluated by using a numerical method. Power law function was employed to describe the mechanical properties (elasticity modulus, Poisson's ratio, fracture toughness and ultimate tensile stress) through the specimen width. The effect of notch tip radius and notch depth on notch stress intensity factors and mode mixity parameter χ were assessed. In addition, a comparison based on fracture load between functionally graded and homogeneous W–Cu was made. Furthermore, in this research, it was shown that the mean value of the strain energy density over the control volume can be accurately determined using coarse meshes for functionally graded materials.     

1996 editorial: 50th Anniversary Issue of the American Psychologist.

Presents an editorial on the 50th Anniversary Issue of The American Psychologist by the CEO and Executive Vice President of the American Psychological Association. An overview of changes to the journal and the developments in electronic communications pare presented, and the implications for international exchange in scholarly publishing are discussed. (0 ref) (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

基于继电保护测试仪的数据存储设计

为解决便携式继电保护测试仪在数据处理及存储方面的相关问题,提出基于USB芯片CH375的解决方案。通过分析CH375的命令集和工作时序,编写了MSP430处理器与U盘的数据通信应用程序。使用结果表明,由此构建的USB接口能够与各种U盘进行数据高速传输和存储。     

Embedding HMMs-based models in a Euclidean space: the topological hidden Markov models

Current extensions of hidden Markov models such as structural, hierarchical, coupled, and others have the power to classify complex and highly organized patterns. However, one of their major limitations is the inability to cope with topology: When applied to a visible observation (VO) sequence, the traditional HMM-based techniques have difficulty predicting the n-dimensional shape formed by the symbols of the VO sequence. To fulfill this need, we propose a novel paradigm named “topological hidden Markov models” (THMMs) that classifies VO sequences by embedding the nodes of an HMM state transition graph in a Euclidean space. This is achieved by modeling the noise embedded in the shape generated by the VO sequence. We cover the first and second level topological HMMs. We describe five basic problems that are assigned to a second level topological hidden Markov model: (1) sequence probability evaluation, (2) statistical decoding, (3) structural decoding, (4) topological decoding, and (5) learning. To show the significance of this research, we have applied the concept of THMMs to: (i) predict the ASCII class assigned to a handwritten numeral, and (ii) map protein primary structures to their 3D folds. The results show that the second level THMMs outperform the SHMMs and the multi-class SVM classifiers significantly.     

基于TMS320C5402的语音信号压缩存储系统设计

根据TMS320C5402的特点,提出了采用G.711语音编解码算法设计的语音压缩系统,给出了系统的硬件结构和软件流程及A/D、D/A模块与TMS320C5402接口电路的设计方法。该系统具有很高的实时性和实用性。     

On the complexity of deciding avoidability of sets of partial words

Blanchet-Sadri et al. have shown that Avoidability, or the problem of deciding the avoidability of a finite set of partial words over an alphabet of size k≥2, is NP-hard [F. Blanchet-Sadri, R. Jungers, J. Palumbo, Testing avoidability on sets of partial words is hard, Theoret. Comput. Sci. 410 (2009) 968-972]. Building on their work, we analyze in this paper the complexity of natural variations on the problem. While some of them are NP-hard, others are shown to be efficiently decidable. Using some combinatorial properties of de Bruijn graphs, we establish a correspondence between lengths of cycles in such graphs and periods of avoiding words, resulting in a tight bound for periods of avoiding words. We also prove that Avoidability can be solved in polynomial space, and reduces in polynomial time to the problem of deciding the avoidability of a finite set of partial words of equal length over the binary alphabet. We give a polynomial bound on the period of an infinite avoiding word, in the case of sets of full words, in terms of two parameters: the length and the number of words in the set. We give a polynomial space algorithm to decide if a finite set of partial words is avoided by a non-ultimately periodic infinite word. The same algorithm also decides if the number of words of length n avoiding a given finite set of partial words grows polynomially or exponentially with n.     

Thermodynamic modeling of the C–Pu–U system

The ternary C–Pu–U system is thermodynamically assessed to pursue the development of a thermodynamic database for future nuclear fuels. The substitution model was used for the liquid phase, and a two-sublattice model for the PuC–UC monocarbide, PuC₂–UC₂ dicarbide and Pu₂C₃–U₂C₃ sesquicarbide phases. Ternary interaction parameters were adjusted on the experimental information for the phase relationships. Isoplethal and isothermal ternary sections, as well as some liquidus temperatures are calculated and compared with the experimental data. The overall agreement is discussed, and shows that experimental uncertainties still remain.     

On some new approximate factorization methods for block tridiagonal matrices suitable for vector and parallel processors

In this paper, to obtain an efficient parallel algorithm to solve sparse block-tridiagonal linear systems, stair matrices are used to construct some parallel polynomial approximate inverse preconditioners. These preconditioners are suitable when the desired goal is to maximize parallelism. Moreover, some theoretical results concerning these preconditioners are presented and how to construct preconditioners effectively for any nonsingular block tridiagonal H-matrices is also described. In addition, the validity of these preconditioners is illustrated with some numerical experiments arising from the second order elliptic partial differential equations and oil reservoir simulations.     

A surface blending approach for displacement features on freeform surfaces

Embedding a number of displacement features into a base surface is common in industrial product design and modeling, where displaced surface regions are blended with the unmodified surface region. The cubic Hermite interpolant is usually adopted for surface blending, in which tangent plane smoothness across the boundary curve is achieved. However, the polynomial degree of the tangent field curve obtained symbolically is considerably higher, and the reduction of the degree of a freeform curve is a non-trivial task. In this work, an approximation surface blending approach is proposed to achieve tangential continuity across the boundary curve. The boundary curve is first offset in the tangent field with the user-specified tolerance, after which it is refined to be compatible with the offset curve for surface blending. Since the boundary curve is offset in a three-dimensional (3D) space, the local self-intersection in the offset curve is addressed in a 2D space by approximately mapping the offset vectors in the respective tangent planes to the parameter space of the base surface. The proposed algorithm is validated using examples, and the normal vector deviation along the boundary curve is investigated.     

网络考试系统中防止U盘作弊方法研究

目前越来越多的高校、教学培训机构和各种社会考试,采用了网络考试、网络在线考试等网络考试形式的无纸化考试.然而许多考试系统自身尚不具备防止考生使用U盘等移动存储设备作弊的功能.本文所涉及的系统能完善这样的功能,考生一旦插入了U盘或其他移动存储设备后,系统立即显示一个特殊的界面锁住屏幕,禁止一切可能的键盘操作.这种状态将一直保持到监考老师在该考生的考试机上解锁为止.