弱耦合方程组混合问题广义解的单调迭代法

利用Galerkin方法证明一类非线性抛物—常微弱耦合方程组混合问题广义解的存在性、唯一性和该混合问题的积分模估计;通过广义上、下解方法、Soblev嵌入定理及归纳法证明极大序列和极小序列分别是单调不增和单调不减的;由勒贝格控制收敛定理及Gronwall不等式严格证明了极大序列和极小序列分别从上方和下方单调收敛于问题的唯一广义解.     

碎石桩复合地基稳定性塑性极限分析法

基于塑性力学极限分析上限定理，建立了复合地基平移、转动相结合的破坏机构．根据外部作用荷载和土体自重所做的外功率等于地基变形所消耗的内部能量耗损率，求得了碎石桩复合地基稳定安全系数计算公式．工程算例分析表明，该方法对于碎石桩复合地基的稳定性分析具有一定实际意义．     

关于倒上阶乘函数的一个展开式

导出了一个用第二类Stirling数表示的倒上阶乘函数fn(x)=1/x(x 1)…(x n)关于1/x的幂级数异型了fn(x)=∑v=n^∞(-1)^n vS2(v,n)1/x^v 1，其对Riemann Zeta函数的研究有重要意义。     

SIEMENS SIMATIC S7-300 PLC在锅炉计算机监控系统中的应用

本文主要讨论了西门子S7-300PLC在神马实业锅炉计算机监控系统中的应用,该系统由PLC来完成数据的采集、运算、回路调节,与上位机通信等功能。本文给出了这个系统的主要硬件构成和软件功能的实现方法。     

Intuitionistic fuzzy rough sets: at the crossroads of imperfect knowledge

Abstract: Just like rough set theory, fuzzy set theory addresses the topic of dealing with imperfect knowledge. Recent investigations have shown how both theories can be combined into a more flexible, more expressive framework for modelling and processing incomplete information in information systems. At the same time, intuitionistic fuzzy sets have been proposed as an attractive extension of fuzzy sets, enriching the latter with extra features to represent uncertainty (on top of vagueness). Unfortunately, the various tentative definitions of the concept of an ‘intuitionistic fuzzy rough set’ that were raised in their wake are a far cry from the original objectives of rough set theory. We intend to fill an obvious gap by introducing a new definition of intuitionistic fuzzy rough sets, as the most natural generalization of Pawlak's original concept of rough sets.     

A Rough Set Approach to Estimating the Game Value and the Shapley Value from Data

A value of a game v is a function which to each coalition S assigns the value v(S) of this coalition, meaning the expected pay–off for players in that coalition. A classical approach of von Neumann and Morgenstern [6] had set some formal requirements on v which contemporary theories of value adhere to. A Shapley value of the game with a value v [14] is a functional Φ giving for each player p the value Φ_p(v) estimating the expected pay-off of the player p in the game. Game as well as conflict theory have been given recently much attention on the part of rough and fuzzy set communities [11,8,1,4,7,2]. In particular, problems of plausible strategies [1] in conflicts as well as problems related to Shapley's value [3,2] have been addressed.We confront here the problem of estimating a value as well as Shapley's value of a game from a partial data about the game. We apply to this end the rough set ideas of approximations, defining the lower and the upper value of the game and, respectively, the lower and upper Shapley value. We also define a notion of an exact coalition, on which both values coincide giving the true value of the game; we investigate the structure of the family of exact sets showing its closeness on complements, disjoint sums, and intersections of coalitions covering the set of players. This work sets open a new area of rough set applications in mining constructs from data. The construct mined in this case are values as well as Shapley values of games.     

Boosting Search with Variable Elimination in Constraint Optimization and Constraint Satisfaction Problems

There are two main solving schemas for constraint satisfaction and optimization problems: i) search, whose basic step is branching over the values of a variables, and ii) dynamic programming, whose basic step is variable elimination. Variable elimination is time and space exponential in a graph parameter called induced width, which renders the approach infeasible for many problem classes. However, by restricting variable elimination so that only low arity constraints are processed and recorded, it can be effectively combined with search, because the elimination of variables may reduce drastically the search tree size.In this paper we introduce BE-BB(k), a hybrid general algorithm that combines search and variable elimination. The parameter k controls the tradeoff between the two strategies. The algorithm is space exponential in k. Regarding time, we show that its complexity is bounded by k and a structural parameter from the constraint graph. We provide experimental evidence that the hybrid algorithm can outperform state-of-the-art algorithms in constraint satisfaction, Max-CSP and Weighted CSP. Especially in optimization tasks, the advantage of our approach over plain search can be overwhelming.     

Banach空间一阶周期边值问题的混合单调方法

研究Banach空间中一阶周期边值微分方程解的存在性。对适合混合单调过程的一类函数，利用上下解的混合单调方法证明了解的存在性，推广了已有的结果[4]。     

黄牛皮劳保鞋面革的制作要点

论述了黄牛皮劳保鞋面革的制作要点。     

从美、英两国的电信资费管制看我国现行电信资费管制的不足

文章介绍了美、英两国在电信资费管制制度的发展历程，阐述了美、英两国在现行的资费管制制度一价格上限制度并从美、英两国的资费管制经验中发现我国现行资费管制制度存在的不足之处，加以改进。