垄断服务系统公共损耗费用分摊理论基础分析

就具有最简单结构的抽象垄断服务系统的基本特性及其公共损耗的费用分摊问题建立了较为完整的公平性与合理性公理体系.同时,利用边际损耗原则导出了一类满足公理组的费用分摊方法,并将所得结论应用于电力系统有功网损费用分摊问题,从理论上统一了现有的几类主要的分摊方法.分析结论表明:损耗结构分析和费用分摊原则的确定在本质上从属于不同层次的问题.特别地,对不分明损耗而言:它们还是不可分割的统一体.对这一类问题进行描述必须考虑综合运用数学、社会学、经济学和方法论原则.     

地震激励下参数不确定结构重叠分散保性能控制

对参数不确定结构振动控制方法进行了研究。基于包含原理,采用重叠分散控制策略与保性能控制算法相结合的方法,将高层建筑结构划分成一组子结构,对每一个子结构采用保性能控制方法设计控制器,提出了参数不确定结构重叠分散保性能控制方法,较好地解决了地震激励下参数不确定建筑结构的振动控制问题。以20层Benchmark结构模型为研究对象,采用重叠分散保性能控制策略和集中保性能控制策略进行数值模拟。结果表明,对于结构系统建模存在误差或系统本身存在不确定性的情况,本文提出的重叠分散保性能控制方法均能有效降低结构的地震响应,且能够保证控制系统的可靠性和稳定性。     

Prophet inequalities for cost of observation stopping problems

Comparisons are made between the expected gain of a prophet (an observer with complete foresight) and the maximal expected gain of a gambler (using only non-anticipating stopping times) observing a sequence of independent, uniformly bounded random variables where a non-negative fixed cost is charged for each observation. Sharp universal bounds are obtained under various restrictions on the cost and the length of the sequence. For example, it is shown for X₁, X₂, … independent, [0, 1]-valued random variables that for all c ≥ 0 and all n ≥ 1 that E(max_{1 ≤ j ≤ n}(X_j − jc)) − sup_{t Tn} E(X_t − tc) ≤ 1/e, where T_n is the collection of all stopping times t which are less than or equal to n almost surely.     

Delay-Dependent Criterion for Guaranteed Cost Control of Neutral Delay Systems

In this article, the guaranteed cost control problem for a class of neutral delay systems is investigated. A linear--quadratic cost function is considered as a performance measure for the closed-loop system. Based on the Lyapunov method, delay-dependent criteria, which are expressed in terms of matrix inequalities, are proposed to guarantee the asymptotic stability of the system. The matrix inequalities can be solved easily by various efficient optimization algorithms.     

基于智能化信息处理的建筑工程造价短期预测

提出了一种新的基于智能化信息处理的建筑工程造价短期预测模型.该模型首次利用数据的高阶统计信息,提出了改进独立分量分析技术.通过构建适用于建筑工程造价的属性重构空间,挖掘出表征能力更强的造价独立属性,用于神经网络的学习和训练,从而建立了全新的建筑工程造价短期预测智能模型.该模型通过发挥独立分量分析强大的信号分离能力,增强了神经网络的学习效率,提高了预测精度.实例数据验证了文中所建模型的有效性.     

遗传算法求解带容量限制的最小费用流问题

研究了带容量限制的带固定费用和可变费用的最小费用流问题,发现该问题是混合0-1整数规划问题,不存在多项式算法.在研究了最优解的结构后,结合最优解的结构特点为之设计了遗传算法,然后构造了一个100个节点的特殊网络,用计算机做了100例计算,验证了该算法具有很好的近似比和很快的收敛速度.     

On computing average cost optimal policies with application to routing to parallel queues

The Approximating Sequence Method for computation of average cost optimal stationary policies in denumerahle state Markov decision chains, introduced in Sennott (1994), is reviewed. New methods for verifying the assumptions are given. These are useful for models with multidimensional state spaces that satisfy certain mild structural properties. The results are applied to four problems in the optimal routing of packets to parallel queues. Numerical results are given for one of the models.     

Zero-sum stochastic games with unbounded costs: Discounted and average cost cases

Zero-sum stochastic games with countable state space and with finitely many moves available to each player in a given state are treated. As a function of the current state and the moves chosen, player I incurs a nonnegative cost and player II receives this as a reward. For both the discounted and average cost cases, assumptions are given for the game to have a finite value and for the existence of an optimal randomized stationary strategy pair. In the average cost case, the assumptions generalize those given in Sennott (1993) for the case of a Markov decision chain. Theorems of Hoffman and Karp (1966) and Nowak (1992) are obtained as corollaries. Sufficient conditions are given for the assumptions to hold. A flow control example illustrates the results.     

Minmax scheduling with job-classes and earliness–tardiness costs

We address scheduling problems with job-dependent due-dates and general (possibly nonlinear and asymmetric) earliness and tardiness costs. The number of distinct due-dates is substantially smaller than the number of jobs, thus jobs are partitioned to classes, where all jobs of a given class share a common due-date. We consider the settings of a single machine and parallel identical machines. Our objective is of a minmax type, i.e., we seek a schedule that minimizes the maximum earliness/tardiness cost among all jobs.     

THE THEORETICAL COST OF SEQUENTIAL AND PARALLEL ALGORITHMS FOR SOLVING LINEAR SYSTEMS OF EQUATIONS

ＴＨＥ　ＴＨＥＯＲＥＴＩＣＡＬ　ＣＯＳＴ　ＯＦ　ＳＥＱＵＥＮＴＩＡＬ　ＡＮＤ　ＰＡＲＡＬＬＥＬ　ＡＬＧＯＲＩＴＨＭＳ　ＦＯＲ　ＳＯＬＶＩＮＧ　ＬＩＮＥＡＲ　ＳＹＳＴＥＭＳ　ＯＦ　ＥＱＵＡＴＩＯＮＳＳａｌｍａｎＨ．Ａｂｂａｓ（ＲｅｃｅｉｖｅｄＭａｙ２４...