矿井主通风机自动监控系统的设计

为了保障主通风机安全、可靠、经济地运行,提出了一种基于S7-300 PLC的矿井主通风机自动监控系统的设计方案;给出了该系统的结构,详细介绍了该系统中PLC的硬件及软件结构、模拟量的检测实现及采用智能型PID调节器XMA5000对风机负压和流量进行自动调节的方法。实际应用表明,该系统能够实现通风机的就地、集中、远方3种控制方式,提高了主通风机的自动化程度和运行可靠性。     

基于S7-300 PLC和现场总线的3150型盘绞成缆机控制系统设计

根据成缆生产线的工艺要求,提出了一种基于S7-300 PLC和现场总线的3150型盘绞成缆机控制系统的设计方案,给出了3150型盘绞成缆机的整体结构,详细介绍了系统硬件及软件设计,并给出了盘绞头与放线架的同步控制方法。实际应用表明,该系统结构简单、使用灵活方便、控制精度高、人机对话良好,达到了预期目标。     

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).     

基于西门子S7—300PLC和PRODAVE数据库的气力输送实验系统

本文介绍基于西门子S7—300PLC和PRODAVE数据链接库的气力输送实验系统。概述了气力输送实验系统工艺及功能要求,着重描述了该气力输送实验控制系统的硬件配置与软件设计。     

Espaces métriques rationnellement présentés et complexité, le cas de l'espace des fonctions réelles uniformément continues sur un intervalle compact

We define the notion of rational presentation of a complete metric space, in order to study metric spaces from the algorithmic complexity point of view. In this setting, we study some representations of the space C[0,1] of uniformly continuous real functions over [0,1] with the usual norm: ||f||_∞ = Sup{|f(x)|; 0x1}. This allows us to have a comparison of global kind between complexity notions attached to these presentations. In particular, we get a generalization of Hoover's results concerning the Weierstrass approximation theorem in polynomial time. We get also a generalization of previous results on analytic functions which are computable in polynomial time.     

电炉法CS_2废气的治理

简介了电炉法CS2 废气吸附的原理及工艺流程 ,开辟了H2 S利用的新途径 ,具有较好的环境效益和经济效益     

Geoadditive expectile regression

Quantile regression has emerged as one of the standard tools for regression analysis that enables a proper assessment of the complete conditional distribution of responses even in the presence of heteroscedastic errors. Quantile regression estimates are obtained by minimising an asymmetrically weighted sum of absolute deviations from the regression line, a decision theoretic formulation of the estimation problem that avoids a full specification of the error term distribution. Recent advances in mean regression have concentrated on making the regression structure more flexible by including nonlinear effects of continuous covariates, random effects or spatial effects. These extensions often rely on penalised least squares or penalised likelihood estimation with quadratic penalties and may therefore be difficult to combine with the linear programming approaches often considered in quantile regression. As a consequence, geoadditive expectile regression based on minimising an asymmetrically weighted sum of squared residuals is introduced. Different estimation procedures are presented including least asymmetrically weighted squares, boosting and restricted expectile regression. The properties of these procedures are investigated in a simulation study and an analysis on rental fees in Munich is provided where the geoadditive specification allows for an analysis of nonlinear effects of the size of flats or the year of construction and the spatial distribution of rents simultaneously.