地震作用下结构的基于阻尼柔性连接MTMD控制

研究了基于阻尼柔性连接多重高谐质量阻尼器(MTMD)在减小结构地震反应方面的动力特性。利用导出的设置MTMD结构的传递函数，建立了设置MTMD结构的动力放大系数(DMF)设计公式，于是MTMD的优化准则可定义为结构最大动力放大系数的最小值的最小化(Min．Min．Max．DMF)。根据优化准则，得不同刚度比MTMD的最优参数和相应的Min.Min.Max．DMF值。为比较，同时给出了基于阻尼刚性连接(R＝0)MTMD的结果，广泛的数值分析表明，传统的阻尼刚性连接MTMD的性能可以扩展至一定刚度比范围的阻尼柔性连接MTMD。     

结构主动开闭环多重调谐质量阻尼器（AMTMD）新控制策略

提出了一种新控制策略——主动开闭环多重调谐质量阻尼器(AMTMD)。AMTMD控制系统频率呈线性分布。AMTMD中的MTMD保持相同的刚度和阻尼系数但质量变化。基于TMD的工作原理定义了AMTMD的主动控制力构成即保持相同的位移和速度反馈增益系数但变化结构和地震加速度反馈增益系数。基于结构的广义振型模型，导出了设置AMTMD时结构的动力放大系数(DMF)，于是优化准则可定义为：Min．Min．Max．DMF．通过最优搜寻，研究了反映AMTMD有效性和鲁棒性的参数。这些参数包括：频率间隔、平均阻尼比、调谐频率比、总数、质量比和标准化加速度反馈增益系数。为了比较，多重调谐质量阻尼器(MTMD)和主动开闭环调谐质量阻尼器(ATMD)也被考虑。     

A parametric total order on fuzzy numbers and a fuzzy shortest route problem

A parametric total order relation is introduced in the form of a certain modification of the "fuzzy max" order on the class of fuzzy numbers generated by a shape function. By the parametric relation. fuzzy numbers unordered with respect of the fuzzy max order can be ordered according either to their value of center or the size of ambiguity. A fuzzy shortest route problem in which are distances are given by fuzzy numbers is discussed under the criterion of the parametric total order, and solved by the dynamic programming approach. A method is proposed to find all of fuzzy routes mimmal in the sense of the fuzzy max order.     

Column Ranks and Their Preservers of Matrices Over Max Algebra

The column rank of an m by n matrix A over max algebra is the weak dimension of the column space of A. We compare the column rank with rank of matrices over max algebra. We also characterize the linear operators which preserve the column rank of matrices over max algebra.     

Column Ranks and Their Preservers of Matrices Over Max Algebra

The column rank of an m by n matrix A over max algebra is the weak dimension of the column space of A. We compare the column rank with rank of matrices over max algebra. We also characterize the linear operators which preserve the column rank of matrices over max algebra.     

Tails for (max, plus) recursions under subexponentiality

We study the stationary solution of a (max, plus)-linear recursion. Under subexponentiality assumptions on the input to the recursion, we obtain the tail asymptotics of certain (max, plus)-linear functionals of this solution. (Max, plus)-linear recursions arise from FIFO queueing networks; more specifically, from stochastic event graphs. In the event graph setting, two special cases of our results are of particular interest and have already been investigated in the literature. First, the functional may correspond to the end-to-end sojourn time of a customer. Second, for two queues in tandem, the functional may correspond to the sojourn time in the second queue. Our results allow for more general networks, which we illustrate by studying the tail asymptotics of the resequencing delay due to multi-path routing.     

一个Mini Max定理和一类二阶Hamiltont系统的解的唯一性5

推广了Stepan A．Tersian的关于g（u）=2^-1（Au，u）-Ф（u）型泛函的一个Mini Max定理．利用这一推广了的MiniMax定理，研究了一类受迫振动下二阶Hamilton系统的边界值问题的解，获得了这类二阶Hamilton系统边界值问题的解的一个唯一性定理．