民办院校数字化校园建设新思路之省钱“三板斧”

针对民办高校在数字化校园建设方面资金短缺问题,本文提出了通过用好开源软件、搞好校企合作和自行开发三种解决的办法。     

论OA系统的文档类型

本文论述了在开发OA系统过程中,如何选择合适的文档类型。文中给出了具体方案,并对文档类型的标准化及未来的发展趋势进行了分析。     

A COMPLEX-TYPE FOCUSSED MAGNETRON FOR SPUTTERING

ＡＣＯＭＰＬＥＸ－ＴＹＰＥＦＯＣＵＳＳＥＤＭＡＧＮＥＴＲＯＮＦＯＲＳＰＵＴＴＥＲＩＮＧ￥ＺｈｅｎｇＳｉｘｉａｏ（郑思孝）（ＩｎｓｔｉｔｕｔｅｏｆＮｕｃｌｅａｒＳｃｉｅｎｃｅａｎｄＴｅｃｈｎｏｌｏｇｙ,ＳｉｃｈｕａｎＵｎｉｖｅｒｓｉｔｙ,Ｃｈｅｎｇｄｕ...     

“TCP/IP网络设计及实现”双语课程教学模式探讨

"TCP/IP网络设计及实现"双语课程旨在从实现的高度帮助学生深入理解各种网络协议和技术,提高学生系统软件编程水平,并利用双语平台增强学生的外语听说能力,为学生今后的学习和发展奠定基础。作者从分析课程的特点出发,结合引入双语教学的必要性和存在的问题,主要从教学内容的选择和组织、庞大源码的讲解、实践环节的设置等方面,探讨了该课程的教学模式。     

An inexact hybrid projection-proximal point algorithm for solving generalized mixed variational inequalities

In this paper, we investigate an inexact hybrid projection-proximal method for solving a class of generalized mixed variational inequalities in Hilbert spaces. We construct a general inexact hybrid projection-proximal point algorithm, in which an inexact relaxed proximal point step is followed by a suitable orthogonal projection onto a hyperplane. Under some suitable conditions concerned with the pseudomonotone set-valued mapping T, the nonsmooth convex function f and the step size λ_k, we prove the convergence of the inexact hybrid projection-proximal point algorithm for solving generalized mixed variational inequalities in Hilbert spaces.     

Group path covering and distance two labeling of graphs

For a positive integer d, an L(d,1)-labeling f of a graph G is an assignment of integers to the vertices of G such that |f(u)−f(v)|?d if uv∈E(G), and |f(u)−f(v)|?1 if u and u are at distance two. The span of an L(d,1)-labeling f of a graph is the absolute difference between the maximum and minimum integers used by f. The L(d,1)-labeling number of G, denoted by λd,1(G), is the minimum span over all L(d,1)-labelings of G. An L^′(d,1)-labeling of a graph G is an L(d,1)-labeling of G which assigns different labels to different vertices. Denote by the L^′(d,1)-labeling number of G. Georges et al. [Discrete Math. 135 (1994) 103-111] established relationship between the L(2,1)-labeling number of a graph G and the path covering number of Gc, the complement of G. In this paper we first generalize the concept of the path covering of a graph to the t-group path covering. Then we establish the relationship between the L^′(d,1)-labeling number of a graph G and the (d−1)-group path covering number of Gc. Using this result, we prove that and for bipartite graphs G can be computed in polynomial time.     

Necessary optimality conditions for fuzzy variational problems

The main aims of this study are to derive the fuzzy Euler-Lagrange conditions for both fuzzy unconstrained and constrained variational problems based on the concepts of differentiability and integrability of a fuzzy mapping that may be parameterized by the left and right-hand functions of its α-level sets.     

Strong stability of the mono-tubular heat exchanger equation with output feedback

We investigate asymptotic behavior of the C₀-semigroup T(t) associated with the mono-tubular heat exchanger equation with output feedback by a perturbation method. It is shown that T(t) is bounded if a constraint is satisfied by the parameters and the spatial distribution function. Further, applying the Arendt-Batty-Lyubich-Vu theorem, a criterion is established to judge strong stability of T(t).     

自动生成CGI C++/C源程序

主要讨论如何利用软件自动生成ＣＧＩ的Ｃ／Ｃ＋＋源程序。