加入WTO后庆加快信息资源的建设

文章就我国加入WTO后信息资源建设方面的必要性、紧迫性、实用性、目标等方面做了阐述。     

亚纯函数及其微分多项式的唯一性

设f是非常数亚纯函数,g是f的线性微分多项式．a和b是f的两个不同的小函数．本文证明如果f和g几乎CM分担a和b,则f≡g;此外,若f是非常数整函数,且f和f^(k)(k≥1)IM分担a和b,b-a≠Pe^λz,测f≡g．     

On a result of Ozawa concerning uniqueness of meromorphic functions

In this paper we prove a uniqueness theorem for meromorphic functions sharing three values with some weight which improves some known results.     

廊坊市“文化信息资源共享工程”建设分析与研究

在介绍廊坊市“文化信息资源共享工程”建设现状基础上,阐述了资源共享的意义,分析了资源共享存在的问题,研究了相应的解决方法。     

联机联合编目与资源共享的现状及其对策

论述了图书馆联机联合编目的现状,探讨了联机联合编目与资源共享的意义,提出了新形势下实现联机联合编目与资源共享的若干对策。     

Large deviations and the generalized processor sharing scheduling for a two-queue system

We establish the optimal asymptotic decay rate of per-session queue length tail distributions for a two-queue system where a single constant rate server serves the two queues using the Generalized Processor Sharing (GPS) scheduling discipline. The result is obtained using the sample-path large deviation principle and has implications in call admission control for high-speed communication networks. This revised version was published online in June 2006 with corrections to the Cover Date.     

How to Build Robust Shared Control Systems

Previous researchers have designed shared control schemes with a view to minimising the likelihood that participants will conspire to perform an unauthorised act. But, human nature being what it is, systems inevitably fail; so shared control schemes should also be designed so that the police can identify conspirators after the fact. This requirement leads us to search for schemes with sparse access structures. We show how this can be done using ideas from coding theory. In particular, secret sharing schemes based on geometric codes whose dual [n,k,d] codes have d and n as their only nonzero weights are suitable. We determine their access structures and analyse their properties. We have found almost all of them, and established some relations among codes, designs and secret-sharing schemes.     

Basic Properties of the (t, n)-Threshold Visual Secret Sharing Scheme with Perfect Reconstruction of Black Pixels

In this paper we consider the (t, n)-threshold visual secret sharing scheme (VSSS) in which black pixels in a secret black-white images is reproduced perfectly as black pixels when we stack arbitrary t shares. This paper provides a new characterization of the (t, n)-threshold visual secret sharing scheme with such a property (hereafter, we call such a VSSS the (t, n)-PBVSSS for short). We use an algebraic method to characterize basis matrices of the (t, n)-PBVSSS in a certain class of matrices. We show that the set of all homogeneous polynomials each element of which yields basis matrices of the (t, n)-PBVSSS becomes a set of lattice points in an (n−t+1)-dimensional linear space. In addition, we prove that the optimal basis matrices in the sense of maximizing the relative difference among all the basis matrices in the class coincides with the basis matrices given by Blundo, Bonis and De Santis [3] for all n≥ t ≥ 2.     

Fluid and diffusion limits for transient sojourn times of processor sharing queues with time varying rates

We provide an approximate analysis of the transient sojourn time for a processor sharing queue with time varying arrival and service rates, where the load can vary over time, including periods of overload. Using the same asymptotic technique as uniform acceleration as demonstrated in [12] and [13], we obtain fluid and diffusion limits for the sojourn time of the M_t/M_t/1 processor-sharing queue. Our analysis is enabled by the introduction of a “virtual customer” which differs from the notion of a “tagged customer” in that the former has no effect on the processing time of the other customers in the system. Our analysis generalizes to non-exponential service and interarrival times, when the fluid and diffusion limits for the queueing process are known.     

<化学教学论>课程内容体系的变迁与发展研究

探讨了我国高等师范化学教育专业的《化学教学论》课程内容体系演变发展的特点和改革的经验，并对一些典型教材的编写特点进行了分析，提出了值得研究的问题。