随机激励下柔性智能梁结构振动的模糊自适应控制

对柔性智能梁结构提出了一种具有结构和参数学习能力的模糊神经网络控制方法,该法摒弃了常规的以BP算法来优化整个网络参数的作法,利用遗传算法对网络全局性参数进行离线优化,利用BP学习算法对网络局部性参数进行在线调节。以柔性智能悬臂梁为例,实现了对其在随机激励下的振动控制。仿真结果表明,模糊神经网络控制算法对智能结构的振动控制具有一定的鲁棒性和自适应性。     

Weakly I-continuous functions

Summary Weakly I -continuous functions were introduced and studied by A?ikg?z, Noiri and Yüksel [1]. We further extend their study, generalize some of their results and discuss its properties.     

Theory of valuations on manifolds, II

This article is the second part in the series of articles where we are developing theory of valuations on manifolds. Roughly speaking valuations could be thought as finitely additive measures on a class of nice subsets of a manifold which satisfy some additional assumptions.The goal of this article is to introduce a notion of a smooth valuation on an arbitrary smooth manifold and establish some of the basic properties of it.     

Reverse mathematics of separably closed sets

This paper contains a corrected proof that the statement “every non-empty closed subset of a compact complete separable metric space is separably closed” implies the arithmetical comprehension axiom of reverse mathematics.     

Some Problems of Local Hitting, Scaling, and Conditioning

The aim of this paper is to convey the basic ideas regarding some local hitting and conditioning properties of random measures. Some very general results are obtainable in the special case of simple point processes. Though much of this theory has no counterpart for general random measures, similar results do exist in two cases of special interest—for local time random measures and for Dawson–Watanabe superprocesses. This is an informal account of some of the basic hitting and conditioning properties common to all three cases. Precise statements and proofs will be provided elsewhere.     

Note on maximal split-stable subgraphs

A multigraph G=(V,R∪B) with red and blue edges is an R/B-split graph if V is the union of a red and a blue stable set. Gavril has shown that R/B-split graphs yield a common generalization of split graphs and König-Egerváry graphs. Moreover, R/B-split graphs can be recognized in linear time. In this note, we address the corresponding optimization problem: identify a set of vertices of maximal cardinality that decomposes into a red and a blue stable set. This problem is NP-hard in general. We investigate the complexity of special and related cases (e.g., (anti-)chains in partial orders and stable matroid bases) and exhibit some NP-hard cases as well as polynomial ones.     

3阶非单谷Feigenbaum映射的拟极限集

一个从闭区间到自身的连续映射被称为3阶非单谷Feigenbaum映射,如果它是函数方程f~3(λx)=λf(x)的解．本文讨论了3阶非单谷Feigenbaum映射的拟极限集及其Hausdorff维数．3阶非单谷Feigenbaum映射必然产生混沌,混沌的产生使得拟极限集的存在性问题复杂化．文中采用分形几何中的知识方法证明了此类映射的拟极限集的存在性,并相应的对其Hausdorff维数作出了估计．最后给了一个具体的例子,说明确实存在这样的3阶非单谷Feigenbaum映射．     

企业技术创新能力指标体系的模糊理论综合评价

根据我国具有一定规模的企业创新状况 ,构建了企业技术创新能力的指标体系 .运用模糊数学方法 ,对企业技术创新能力进行综合评价 ,为客观评价、及时调整企业技术创新战略提供了客观依据 ,有利于提高企业的技术创新能力     

Using the Simplex Code to Construct Relative Difference Sets in 2-groups

Relative Difference Sets with the parameters (2a, 2b, 2a, 2a-b) have been constructed many ways (see davis, EB, jung, maschmidt, and pottsurvey for examples). This paper modifies an example found in arasusehgal to construct a family of relative difference sets in 2-groups that gives examples for b = 2 and b = 3 that have a lower rank than previous examples. The Simplex code is used in the construction.     

达标度矩阵对策及其协调解

本文在文献「５」的思想基础上，首先论述达标度及达标度矩阵对策的有关定义。同时，在文「７」，「８」的基础上，进一步给出达标度矩阵对策的协调解概念及解结构。然后，具体讨论解的几种协调方法，即容忍旗的协调，极小熵协调和学习协调等。最后给出结论和注。