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

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

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.     

Intersective polynomials and the primes

Intersective polynomials are polynomials in Z[x] having roots every modulus. For example, P₁(n)=n² and P₂(n)=n²−1 are intersective polynomials, but P₃(n)=n²+1 is not. The purpose of this note is to deduce, using results of Green and Tao (2006) [8] and Lucier (2006) [16], that for any intersective polynomial h, inside any subset of positive relative density of the primes, we can find distinct primes p₁,p₂ such that p₁−p₂=h(n) for some integer n. Such a conclusion also holds in the Chen primes (where by a Chen prime we mean a prime number p such that p+2 is the product of at most 2 primes).     

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

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

On the asymptotic number of inequivalent binary self-dual codes

Let Ψn be the number of inequivalent self-dual codes in . We prove that , where . Let Δn be the number of inequivalent doubly even self-dual codes in . We also prove that .     

On Skew Triangular Matrix Rings

For a ring R, endomorphism α of R and positive integer n we define a skew triangular matrix ring T _n (R, α). By using an ideal theory of a skew triangular matrix ring T _n (R, α) we can determine prime, primitive, maximal ideals and radicals of the ring R[x; α]/ ? x ⁿ  ?, for each positive integer n, where R[x; α] is the skew polynomial ring, and ? x ⁿ  ? is the ideal generated by x ⁿ .     

Repunit R49081 is a probable prime

The Repunit R is a probable prime. In order to prove primality R49080 must be approximately 33.3% factored. The status of this factorization is included.