On a question of Gross

Using the notion of weighted sharing of sets we prove two uniqueness theorems which improve the results proved by Fang and Qiu [H. Qiu, M. Fang, A unicity theorem for meromorphic functions, Bull. Malaysian Math. Sci. Soc. 25 (2002) 31-38], Lahiri and Banerjee [I. Lahiri, A. Banerjee, Uniqueness of meromorphic functions with deficient poles, Kyungpook Math. J. 44 (2004) 575-584] and Yi and Lin [H.X. Yi, W.C. Lin, Uniqueness theorems concerning a question of Gross, Proc. Japan Acad. Ser. A 80 (2004) 136-140] and thus provide an answer to the question of Gross [F. Gross, Factorization of meromorphic functions and some open problems, in: Proc. Conf. Univ. Kentucky, Lexington, KY, 1976, in: Lecture Notes in Math., vol. 599, Springer, Berlin, 1977, pp. 51-69], under a weaker hypothesis.     

基于小波压缩的二值图像图视密码学的改进

图视密码学方案最初由Naor和Shamir在 1994年欧洲密码学会议上提出 ,但像素扩展太大 ,生成分存图像太大。采用小波变换对分存图像进行压缩 ,有效地降低了分存图像规模。     

Asymptotic analysis of a large closed queueing network with discriminatory processor sharing

In this paper the steady-state behavior of a closed queueing network with multiple classes and large populations is investigated. One of the two nodes of the network simply introduces random delays and the discipline in the other node is discriminatory processor sharing. The network is not product-form, so not even the steady-state behavior is known. We assume that the usage is moderately heavy, and obtain two-term asymptotic approximations to the mean number of jobs, and the mean sojourn time, of each class of jobs in the processor node. We also obtain the leading term in the asymptotic approximation to the joint distribution of the number of jobs in the processor node, which is a zero-mean multivariate Gaussian distribution around a line through the origin.     

On meromorphic functions that share three values of finite weights

A uniqueness theorem for two distinct non-constant meromorphic functions that share three values of finite weights is proved, which generalizes two previous results by H.X. Yi, and X.M. Li and H.X. Yi. As applications of it, many known results by H.X. Yi and P. Li, etc. could be improved. Furthermore, with the concept of finite-weight sharing, extensions on Osgood-Yang's conjecture and Mues' conjecture, and a generalization of some prevenient results by M. Ozawa and H. Ueda, ect. could be obtained.     

Optimal production and rationing decisions in supply chains with information sharing

This paper considers a two-echelon capacitated supply chain with two non-identical retailers and information sharing. We characterize the optimal inventory policies. We also study the benefits of the optimal stock rationing policy over the first come first served (FCFS) and the modified echelon-stock rationing (MESR) policies.     

加快图书馆现代化进程的思考

回顾了太原市图书馆评估定级的准备工作，分析了其在现代化进程中的优势与不足。从组织管理现代化、人员培养现代化、信息服务手段现代化、投资机制现代化等方面论述了加快图书馆现代化进程的对策。     

A Representation of a Family of Secret Sharing Matroids

Deciding whether a matroid is secret sharing or not is a well-known open problem. In Ng and Walker [6] it was shown that a matroid decomposes into uniform matroids under strong connectivity. The question then becomes as follows: when is a matroid m with N uniform components secret sharing? When N = 1, m corresponds to a uniform matroid and hence is secret sharing. In this paper we show, by constructing a representation using projective geometry, that all connected matroids with two uniform components are secret sharing     

论商业秘密保护与竞业禁止

针对目前商业秘密被侵犯的现状,对我国建立竞业禁止制度的必要性进行了探讨,对如何完善这一制度提出了立法建议。     

网络图书馆研究

介绍了网络图书馆的概念及其特征,阐述了网络图书馆的服务内容,分析了网络图书馆的运行模式和管理体制。     

教学资源信息化管理与应用平台建设方案

论述了建设教学资源信息化管理与应用平台的重要性,给出了教学资源信息化管理与应用平台的建设方案。