Diagrams,orientations, and varieties

One of the central problems in the theory of ordered sets is to describe the orientations of the covering graph of an ordered set. We show that the particular operation called inversion, together with the classical constructions of retraction and product, provide a context for the classification of all such orientations. AMS subject classifications (1980). 06A10, 05C75, 05C20.     

On the cover time of random walks on graphs

This article deals with random walks on arbitrary graphs. We consider the cover time of finite graphs. That is, we study the expected time needed for a random walk on a finite graph to visit every vertex at least once. We establish an upper bound ofO(n ²) for the expectation of the cover time for regular (or nearly regular) graphs. We prove a lower bound of (n logn) for the expected cover time for trees. We present examples showing all our bounds to be tight.Mike Saks was supported by NSF-DMS87-03541 and by AFOSR-0271. Jeff Kahn was supported by MCS-83-01867 and by AFOSR-0271.     

STUDIES ON TUNG OIL COATED REGENERATED CELLULOSE FILMS WITH WATERRESISTANCE

Regenerated cellulose films with water-resistance were obtained by an improved method ofpreparing cellulose cuoxam solution from pulps of agricultural wastes (linters, wheat straw, reedand Bamao). Experimental results showed that the mechanical properties of both the dry. and wetfilms were excellent. Data from IR, SEM and tensile strength measurements implied that thesignificant improvement of water-resistance of the films was due to the cohesion between the thinTung oil covers with hydrophobicity and the regenerated cellulose films. The films werecompletely biodegraded after being buried in soil for 100 days. The transmittance of the filmsderived from linter and reed in visible band range were 80-90%.     

Biotechnological storage and utilization of entrapped solar energy

Our laboratory has recently developed a device employing immobilized F₀F₁ adenosine triphosphatase (ATPase) that allows synthesis of adenosine triphosphate (ATP) from adenosine 5′-diphosphate and inorganic phosphate using solar energy. We present estimates of total solar energy received by Earth’s land area and demonstrate that its efficient capture may allow conversion of solar energy and storage into bonds of biochemicals using devices harboring either immobilized ATPase or NADH dehydrogenase. Capture and storage of solar energy into biochemicals may also enable fixation of CO₂ emanating from polluting units. The cofactors ATP and NADH synthesized using solar energy could be used for regeneration of acceptor d-ribulose-1,5-bisphosphate from 3-phosphoglycerate formed during CO₂ fixation.     

Covering with blocks in the non-symmetric case

Considering an infinite string of i.i.d. random letters drawn from a finite alphabet we define the cover timeW _n as the number of random letters needed until each pattern of lenghtn appears at least once as a substring. Sharp weak and a.s. limit results onW _n are known in the symmetric case, i.e., when the random letters are uniformly distributed over the alphabet. In this paper we determine the limit distribution ofW _n in the nonsymmetric case asn. Generalizations in terms of point processes are also proved.Dedicated to Endre Csáki on his 60th birthday.     

终端近场通信天线研究北大核心CSCD

近场通信(NFC)已成为无线终端的标配功能,工作范围小、抗干扰性和安全性较高的特性使其被广泛应用于终端的移动支付和虚拟卡片等领域。由于近场天线产生的感应磁场会在临近的金属上耦合出反向涡流,并且金属屏蔽物覆盖会降低收发天线间的磁场耦合,紧凑终端中的电池、主板、外壳等金属元件将大幅影响NFC天线性能。本文从近场通信的历史、标准、系统结构出发,以终端NFC天线工作环境中的金属覆盖情况作为分类依据,对终端近场通信天线的研究进展进行了简要介绍。     

基于有限非阿贝尔群的密钥交换

从一般线性群GL（n,F）和对称群Sn上的困难问题出发,构造了几个密钥交换算法,新算法具有更高的效率.同时,指出基于一般线性群的密钥交换算法的安全性直接依赖于广义矩阵覆盖问题,基于对称群的密钥交换协议的安全性直接依赖于置换群上的共轭问题.