计算机存储系统的9位字节单向错误检测码

本文介绍了一种计算机存储系统中的单向错误检测码，系统构成采用９位字节，其中８位数据位，１位校验位，并使用一个单独的附加奇偶校验字节。单向错误检测码有两类，一类每个字包含固定的奇偶校验位；另一类每个字节包含的检验位的构成方式是任意的。     

基于社会网络的语义Web服务发现模型

web服务发现模型是为了满足用户各种用途的web服务方式,以代码重入和松散耦合的方式以最优的组合实现可以提供用户需要的web服务模型。web服务发现模型是一种面向服务系统架构的一类基础性问题,但是又是解决用户不同需求十分有效的模型。通过对本体特性和发现模型的结构特点的研究,在本文中引入了本体解析的web服务标注算法和环境语义web发现模型。从而更好地实现web服务发现模型的选择用户所要求的服务的准确性,也为web服务的智能匹配做出了探索。     

Downlink multiple access schemes for transmitted reference pulse cluster UWB systems

Transmitted reference pulse cluster (TRPC) signaling was recently proposed for low data rate ultra‐wideband communications. Compared with the conventional transmitted reference (TR), TRPC has a more compact and uniform spacing for the reference and data pulses and therefore solves the implementation problem posed by the long delay line requirement in the conventional TR. In this paper, downlink multiple access issue is further investigated for TRPC systems. According to the TRPC signaling structure, both code division multiple access (CDMA) and time division multiple access (TDMA) methods are discussed. Theoretical analysis and simulation results show that TDMA outperforms CDMA in both bit error rate performance and throughput. Copyright © 2010 John Wiley & Sons, Ltd.     

Flexizyme‐Mediated Genetic Reprogramming As a Tool for Noncanonical Peptide Synthesis and Drug Discovery

Noncanonical peptides occur frequently in Nature, and often display high bioactivity. However, the lack of tractable systems for the synthesis of diverse libraries of such peptides has thus far hampered their development as drugs. Genetic reprogramming techniques, in which noncanonical amino acids may be incorporated into peptides, have largely removed this limitation. This Concept article outlines the development of these techniques with an emphasis on drug discovery.     

竖向不规则结构抗震性能研究现状及其在设计规范中的应用

结构竖向不规则布置是导致结构地震损伤破坏的主要原因之一.介绍了建筑结构沿竖向的强度、刚度和质量不规则布置的定义、不规则的主要内容及其在地震作用下损伤破坏的特点;总结回归了钢筋混凝土竖向不规则结构地震反应需求的研究现状以及国际上典型的结构设计规范中结构竖向不规则条款的限定.针对竖向不规则结构目前的研究现状,提出了今后值得进一步加强研究的方向.      

BREW实现机制深入分析

BREW（binary runtime environment for wireless）是目前流行的CDMA手机开发环境。从分析CDMA手机的系统结构入手,详细分析了BREW的层次结构,并尝试从公开资料中剖析BREW实现机制．最后给出了PEK（porting evaluation kit）测试原理。     

A Confidential QR Code Approach with Higher Information Privacy

In present times, barcode decoders on mobile phones can extract the data content of QR codes. However, this convenience raises concerns about security issues when using QR codes to transmit confidential information, such as e-tickets, coupons, and other private data. Moreover, current secret hiding techniques are unsuitable for QR code applications since QR codes are module-oriented, which is different from the pixel-oriented hiding manner. In this article, we propose an algorithm to conceal confidential information by changing the modules of the QR Code. This new scheme designs the triple module groups based on the concept of the error correction capability. Additionally, this manner can conceal two secret bits by changing only one module, and the amount of hidden confidential information can be twice the original amount. As a result, the ordinary data content (such as URL) can be extracted correctly from the generated QR code by any barcode decoders, which does not affect the readability of scanning. Furthermore, only authorized users with the secret key can further extract the concealed confidential information. This designed scheme can provide secure and reliable applications for the QR system.     

Covering and radius-covering arrays: Constructions and classification

The minimum number of rows in covering arrays (equivalently, surjective codes) and radius-covering arrays (equivalently, surjective codes with a radius) has been determined precisely only in special cases. In this paper, explicit constructions for numerous best known covering arrays (upper bounds) are found by a combination of combinatorial and computational methods. For radius-covering arrays, explicit constructions from covering codes are developed. Lower bounds are improved upon using connections to orthogonal arrays, partition matrices, and covering codes, and in specific cases by computation. Consequently for some parameter sets the minimum size of a covering array is determined precisely. For some of these, a complete classification of all inequivalent covering arrays is determined, again using computational techniques. Existence tables for up to 10 columns, up to 8 symbols, and all possible strengths are presented to report the best current lower and upper bounds, and classifications of inequivalent arrays.     

便携式条形码阅读器的设计

本设计为一种便携式条形码阅读译码器（简称阅读器），它采用ＩＮＴＥＬ８０３１ＣＰＵ微处理器为主芯片，辅以其它大规模集成电路芯片，构成一智能化系统，阅读及识别采用Ｃｏｄｅ３９码编制的条形码，并能完成条形码信息的存储、数目统计及与微机进行串行通信功能。