R-curves determination of ordinary refractory ceramics assisted by digital image correlation method

As a figure-of-merit, the rising ratio of crack propagation resistance to fracture initiation resistance indicates a reduction of the brittleness and enhances the thermal shock resistance of ordinary refractory ceramics. The significant nonlinear fracture behaviour is related to the development of a fracture process zone (FPZ). The universal dimensionless load–displacement diagram method is applied as a promising graphical method for the determination of R-curves for magnesia refractories showing different brittleness. By applying digital image correlation (DIC) together with the graphical method, the problems arisen with accurate determination of the fracture initiation resistance and the crack length are overcome. Meanwhile, the R-curve is subdivided with respect to the fracture processes, viz the fracture initiation, the development of FPZ and the onset of traction free macro-crack. With the simultaneous crack lengths evaluated from DIC, the contribution of each fracture process to the crack propagation resistance at certain loading stage is quantitatively presented.     

Survivability of systems under multiple factor impact

The paper considers vulnerable multi-state series-parallel systems operating under influence of external impacts. Both the external impacts and internal failures affect system survivability, which is determined as the probability of meeting a given demand. The external impacts are characterized by several destructive factors affecting the system or its parts simultaneously.In order to increase the system's survivability a multilevel protection against the destructive factors can be applied to its subsystems. In such systems, the protected subsystems can be destroyed only if all of the levels of their protection are destroyed.The paper presents an algorithm for evaluating the survivability of series-parallel systems with arbitrary configuration of multilevel protection against multiple destructive factor impacts. The algorithm is based on a composition of Boolean and the Universal Generating Function techniques.Illustrative examples are presented.     

竞争环境下电信行业的普遍服务

以引入竞争为标志的电信领域改革以来，在竞争环境下如何实现作为原有垄断经营者政治使用命的普遍服务，成了世界各国政府，企业，学术界及国际电信机构共同关注的重大问题，我国是个发展中国家，电信的普通服务远没有完成。因此在借鉴国外经验的基础上，研究和探讨竞争环境下实现普遍服务的政策和策略具有十分现实的意义。     

Locality-preserving hash functions for general purpose parallel computation

Consider the problem of efficiently simulating the shared-memory parallel random access machine (PRAM) model on massively parallel architectures with physically distributed memory. To prevent network congestion and memory bank contention, it may be advantageous to hash the shared memory address space. The decision on whether or not to use hashing depends on (1) the communication latency in the network and (2) the locality of memory accesses in the algorithm.We relate this decision directly to algorithmic issues by studying the complexity of hashing in the Block PRAM model of Aggarwal, Chandra, and Snir, a shared-memory model of parallel computation which accounts for communication locality. For this model, we exhibit a universal family of hash functions having optimal locality. The complexity of applying these hash functions to the shared address space of the Block PRAM (i.e., by permuting data elements) is asymptotically equivalent to the complexity of performing a square matrix transpose, and this result is best possible for all pairwise independent universal hash families. These complexity bounds provide theoretical evidence that hashing and randomized routing need not destroy communication locality, addressing an open question of Valiant.This work was started when the author was a student at Oxford University, supported by a National Science Foundation Graduate Fellowship and a Rhodes Scholarship. Any opinions, findings, conclusions, or recommendations expressed in this publication are those of the author and do not necessarily reflect the views of the National Science Foundation or the Rhodes Trust.     

基于柔性逻辑的智能控制器设计与仿真

研究倒立摆复杂系统优化控制问题,传统优化控制要建立精确数学模型,但与实际不符。对复杂系统采用具有认知和仿人功能、适应不确定环境等特性的智能控制方法较传统控制方法更具优势。为此,提出一种柔性泛逻辑学的智能控制模型,具有三个典型参数(e、h、k),分别反映了控制过程中的决策门限、被控量之间的关系和测量误差,能更好地掌握控制的思路。对三级倒立摆的控制采用上述方法进行仿真,实验证明了模型的正确性和有效性,并且具有良好的抗干扰能力,为复杂系统控制寻求了一种新的有效途径。     

物联网中移动节点抗克隆攻击的UC安全认证协议

物联网中的感知网一般由计算、通信和存储能力极差的感知节点通过移动节点和静态节点相结合的方式构成,以采集信息;而传输网通常利用现有互联网的基础设施,提供强大的计算、通信和存储服务。为了满足物联网中移动节点漫游时实施接入认证的访问控制要求,同时兼顾实际应用中可行性与移动节点轻量级、抗物理克隆攻击等的安全性需求,基于物理不可克隆函数(Physical Unclonable Function,PUF),提出了移动节点抗克隆攻击的UC(Universally Composable)安全认证协议,其可实现移动节点漫游到其他区域时与接入基站之间的双向认证与密钥交换过程。分析表明,所提出的协议在UC安全模型下是可证明安全的。     

基于USB总线的安全隔离单向传输系统设计实现

介绍了采用私有协议标准和传输信息深度检测技术,基于USB总线的数据安全隔离单向传输系统。选用高速USB2.0控制芯片CY7C68001和ARM微处理器STM32F103组成一个通用的数据传输模块,实现主机间的USB直接通信;通过数据二极管单向传输技术,实现了信息流的单向传输;利用专用的物理信道和特殊的私有传输协议,保证文件数据的安全传输。最终实现处于不同密级网络计算机间的单向、可靠、高速、实时数据通讯。     

基于TMS320VC5402的RS_485通信设计

完成了基于TMS320VC5402 DSP的R5_485通信的硬件设计和软件编程.基于美国TI公司TMS320VC5402 DSP芯片的多通道缓冲口(McBSP)进行适当的硬件扩展,以SPI方式直接和MAXIM公司的MAX3100通用异步串行收发器接口,然后经Linear Technology公司的LTC 1480超低...     

CPLD在万能试验机控制器中的应用

文章对现场可编程门列(CPLD)在万能试验机控制器中的应用方面作了一些探索，以此来满足要求的精度等方面的特殊性。CPLD集成了A／D、D／A、计数器、串口通信等功能。     

Building a Language‐Independent Discourse Parser using Universal Networking Language

Discourse parsing has become an inevitable task to process information in the natural language processing arena. Parsing complex discourse structures beyond the sentence level is a significant challenge. This article proposes a discourse parser that constructs rhetorical structure (RS) trees to identify such complex discourse structures. Unlike previous parsers that construct RS trees using lexical features, syntactic features and cue phrases, the proposed discourse parser constructs RS trees using high‐level semantic features inherited from the Universal Networking Language (UNL). The UNL also adds a language‐independent quality to the parser, because the UNL represents texts in a language‐independent manner. The parser uses a naive Bayes probabilistic classifier to label discourse relations. It has been tested using 500 Tamil‐language documents and the Rhetorical Structure Theory Discourse Treebank, which comprises 21 English‐language documents. The performance of the naive Bayes classifier has been compared with that of the support vector machine (SVM) classifier, which has been used in the earlier approaches to build a discourse parser. It is seen that the naive Bayes probabilistic classifier is better suited for discourse relation labeling when compared with the SVM classifier, in terms of training time, testing time, and accuracy.