核磁共振法测定高聚物的结构—核磁共振二维谱

介绍了核磁共振(NMR)波谱,尤其是核磁共振二维谱(2D NMR)在最近几年内的进展。内容包括怎样用NMR测定高聚物的序列分布、共聚物结构、聚合物的混溶性、聚合物液晶的取向度、分子量、短链度和长链支化度、凝聚态高聚物的多相结构等。     

Powerful arithmetic progressions

We give a complete characterization of so-called powerful arithmetic progressions, i.e. of progressions whose kth term is a kth power for all k. We also prove that the length of any primitive arithmetic progression of powers can be bounded both by any term of the progression different from 0 and ±1, and by its common difference. In particular, such a progression can have only finite length.     

Marcus contextual languages consisting of primitive words

In this paper we prove that the language of all primitive (strongly primitive) words over a nontrivial alphabet can be generated by certain types of Marcus contextual grammars.     

Combinatorics on words in symbolic dynamics: the antisymmetric cubic map

This paper is contributed to the combinatorial properties of the periodic kneading words of antisymmetric cubic maps defined on a interval. The least words of given lengths, the adjacency relations on the words of given lengths and the parity-alternative property in some sets of such words are established.     

A suite of algorithms for key distribution and authentication in centralized secure multicast environments

The Extended Euclidean algorithm provides a fast solution to the problem of finding the greatest common divisor of two numbers. In this paper, we present three applications of the algorithm to the security and privacy field. The first one allows one to privately distribute a secret to a set of recipients with only one multicast communication. It can be used for rekeying purposes in a Secure Multicast scenario. The second one is an authentication mechanism to be used in environments in which a public-key infrastructure is not available. Finally, the third application of the Extended Euclidean algorithm is a zero-knowledge proof that reduces the number of messages between the two parts involved, with the aid of a central server.     

Polymerizable C70 derivatives with acrylate functionality for efficient and stable solar cells

Fullerene-based organic solar cells are generally suffering from severe microstructure evolution occurring in their bulk heterojunction active layers and thus are extremely stable. To address it, four polymerizable C₇₀ fullerene derivatives, [6,6]-phenyl-C₇₁-ethyl acrylate (PC₇₁EA), [6,6]-phenyl-C₇₁-propyl acrylate (PC₇₁PrA), [6,6]-phenyl-C₇₁-butyl acrylate (PC₇₁BA), and [6,6]-phenyl-C₇₁-pentyl acrylate (PC₇₁PeA), have been designed, synthesized, and investigated. These fullerene compounds have a molecular structure, shape and size very like the conventional C₇₀ fullerene acceptor, [6,6]-phenyl-C₇₁-butyric acid methyl ester (PC₇₁BM), and have been found no different in their light absorption, redox potentials, and frontier orbital energy levels. Using these fullerene acrylates individually as acceptor and poly(3-hexylthiophene) as donor, organic solar cells have been fabricated and gave optimal efficiencies ranging from 3.32% to 4.16%, comparable to PC₇₁BM-based reference cells (4.06%). Owing to their acrylate functionality, these fullerene derivatives can turn into insoluble upon heating, and thus endow their solar cell devices much better thermostability than PC₇₁BM-based reference cells. The best one, coming from PC₇₁PeA devices, reported an optimal efficiency of 4.16%, and maintained 91.7% efficiency after heat treatment at 150 °C for 35 h. As a sharp contrast, the PC₇₁BM reference cell dropped its optimal efficiency from 4.06% to 0.48% only after 5 h heat treatment. X-ray diffraction, optical and atomic force microscopy, and space-charge-limited current method have been carried out to understand active layer structure, morphology, and charge mobility change during heat treatment.     

Generating 2-Gray codes for ballot sequences in constant amortized time

We present a simple algorithm that generates a cyclic 2-Gray code for ballot sequences. The algorithm generates each ballot sequence in constant amortized time using a linear amount of space. This is the first known cyclic 2-Gray code for ballot sequences that achieves this time bound. In addition, the algorithm can be easily modified to output ballot sequences in binary reflected Gray code order in constant amortized time per string using a linear amount of space.     

岩质边坡设计坡角和锚固方案的确定

本文运用赤平极射投影、块体理论和岩体力学的基本原理, 试探求一种可供边坡工程设计采用的确定人工岩质边坡最大安全设计坡角和锚固方案的简易方法。     

Squares of regular languages

The square of a language L is the set of all words pp where p ∈ L. The square of a regular language may be regular too or context‐free or none of both. We give characterizations for each of these cases and show that it is decidable whether a regular language has one of these properties. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)