共查询到20条相似文献,搜索用时 78 毫秒
1.
双环网络G(N;1,s)的L形瓦仿真算法 总被引:10,自引:3,他引:10
提出双环网络G(N;1,S)的L形瓦仿真算法,利用VB6.0作为编程语言、SQL Server2000作为数据库来实现这一算法,对任意给定N,而2=相似文献
2.
3.
4.
非单位步长双环网络G(N;r,s)的L形瓦仿真算法 总被引:6,自引:0,他引:6
计算非单位步长双环网络的直径是通过研究其等价的L形瓦来进行的,随着N的增大和r,s的增多,手工绘制L形瓦是不可能的,为此提出非单位步长双环网络G(N;r,s)的L形瓦仿真算法,对任意给定N,而2=相似文献
5.
胡旭晓 《系统工程理论与实践》2005,25(2):79-85
为了解决系统鲁棒性和控制精度之间的矛盾,在分析纳米级驱动部件物理特性和双环控制特性的基础上,建立具有大进给力的纳米级驱动部件数学模型,并提出基于主控制环和从控制环控制强度可优化的改进型双环控制策略.最后,通过计算机仿真和试验证实:纳米级驱动部件应用本文提出的改进型双环控制策略,在5000N载荷下控制精度达到10nm. 相似文献
6.
利用仿真来研究双环网络G(N;1,s)的紧优分布特性在国内外文献中尚未见到。提出一种快速仿真算法,计算出任意N存在的紧优个数n,仿真出4≤N≤1000的n-N紧优分布率和n/(N-2)-N紧优分布率,并列出其中无紧优双环网络的N值。仿真结果表明,n—N分布呈现平稳的波动特性,n不随着N递增,而n/(N-2)随着N的增加呈波动性下降的趋势,并且与N的奇偶性无关。 相似文献
7.
8.
李腊元 《系统工程与电子技术》1993,(2)
本文主要对典型的计算机双环网络拓扑进行了研究。提出了双环网络的形式描述模型,给出了典型双环拓扑的模型表示,并对这类典型双环的网络直径、平均跳跃距离和吞吐量——延迟特性进行了研讨。 相似文献
9.
10.
11.
This paper presents simple and fast algorithms for computing very tight upper and lower bounds on the prices of American Asian options in the binomial model.The authors choose two types sets of the actual arithmetic average prices,instead of the simulated values in other existing models,as the representative average prices at each node of the binomial tree.This approach simplifies effectively the computation and reduces the error caused by the linear interpolation.Numerical results show that the approach produces accurate upper and lower bounds compared to the other existing methods based on the binomial tree. 相似文献
12.
Estimating the number of isolated roots of a polynomial system is not only a fundamental study theme in algebraic geometry but also an important subproblem of homotopy methods for solving polynomial systems. For the mixed trigonometric polynomial systems, which are more general than polynomial systems and rather frequently occur in many applications, the classical B′ezout number and the multihomogeneous B′ezout number are the best known upper bounds on the number of isolated roots. However, for the deficient mixed trigonometric polynomial systems, these two upper bounds are far greater than the actual number of isolated roots. The BKK bound is known as the most accurate upper bound on the number of isolated roots of a polynomial system. However, the extension of the definition of the BKK bound allowing it to treat mixed trigonometric polynomial systems is very difficult due to the existence of sine and cosine functions. In this paper, two new upper bounds on the number of isolated roots of a mixed trigonometric polynomial system are defined and the corresponding efficient algorithms for calculating them are presented. Numerical tests are also given to show the accuracy of these two definitions, and numerically prove they can provide tighter upper bounds on the number of isolated roots of a mixed trigonometric polynomial system than the existing upper bounds, and also the authors compare the computational time for calculating these two upper bounds. 相似文献
13.
2006年黄海军教授等深入分析了固定需求的交通网络中用户均衡和系统最优之间的关系;得到用户均衡效率损失上界计算公式.用一种新方法引入一个与均衡流量相关的参数,扩大了已有用户均衡效率损失上界计算公式的适用范围,给出了新的用户均衡效率损失上界.算例结果表明,新的上界比2006年的交通网络中用户均衡行为的效率损失上界的最小值还小. 相似文献
14.
系统可靠性预计的上(下)限法 总被引:3,自引:0,他引:3
施军 《系统工程与电子技术》1994,(9)
用文献[1]提出的上限计算法预计的系统可靠度的上限会单调收敛至一个小于精确值的错误数值,并使系统可靠度的单一预计值过于保守。本文提出一种计算系统可靠度上限的新方法,并给出了完全对偶的、实用的上下限计算公式。实例表明,对于任何非单纯串联的复杂系统,应用本文的公式均能保证使计算结果单调收敛至真值,并使系统可靠度的单一预计值具有较高的精度。 相似文献
15.
A weighted edge-coloured graph is a graph for which each edge is assigned both a positive weight and a discrete colour, and can be used to model transportation and computer networks in which there are multiple transportation modes. In such a graph paths are compared by their total weight in each colour, resulting in a Pareto set of minimal paths from one vertex to another. This paper will give a tight upper bound on the cardinality of a minimal set of paths for any weighted edge-coloured graph. Additionally, a bound is presented on the expected number of minimal paths in weighted edge–bicoloured graphs. These bounds indicate that despite weighted edge-coloured graphs are theoretically intractable, amenability to computation is typically found in practice. 相似文献
16.
假设广告主分别是风险厌恶和风险追求的,定义了相应的纳什均衡、有效纳什均衡和对称纳什均衡,并获得它们的性质.主要结论包括:1)无论广告主是风险追求、风险中性、还是风险厌恶的,有效纳什均衡的上界总是等于对称纳什均衡的上界.进而搜索引擎从两种均衡获得的收益的上界总是相等的.2)当广告主的风险态度按照风险厌恶、风险中性和风险追求顺序变化时,相应的对称纳什均衡的上界和下界以及搜索引擎从中获得的收益的上界和下界都是不减的.3)随着广告主风险厌恶(追求)程度的增加,对称纳什均衡的上界和下界都增加(减少),进而搜索引擎从对称纳什均衡中获得的收益的上界和下界也都增加(减少). 相似文献
17.
18.
针对分段线性微分包含系统,根据Hamilton-Jacobi-Bellman(H-J-B)不等式将最优控制设计问题转化成最优控制性能上界的优化问题及性能下界的求取问题.其中性能上界的优化是一组以反馈增益为寻优参数的双线性矩阵不等式(bilinear matrix inequalities,BMI)问题,而性能下界是一组基于线性矩阵不等式(linear matrixinequalities,LMI)的半正定规划问题.结合遗传算法和内点法设计了一种混合算法对BMI问题进行求解.算例表明方法的有效性. 相似文献
19.
Hongbing Zeng Shenping Xiao Bin Liu .School of Electrical Information Engineering Hunan University of Technology Zhuzhou P.R.China .School of Information Science Engineering Central South University Changsha 《系统工程与电子技术(英文版)》2011,(6):998-1002
This paper deals with the problem of stability for systems with delay varying in an interval.A new Lyapunov functional,which makes use of the information of both the lower and upper bounds of the interval time-varying delay,is proposed to derive some new stability criteria.Furthermore,the relationship of the time-varying delay and its lower bound and upper bound is taken into account.As a result,some less conservative delay-dependent stability criteria are obtained without ignoring any useful information in the derivative of Lyapunov functional,which are established in the forms of linear matrix inequalities.Numerical examples are provided to show that the obtained results are better than existing ones. 相似文献
20.
提出了通过逻辑蕴涵的演绎规则来构建频繁项集的简洁表示,而不是挖掘所有的频繁项,来降低频繁项集中的冗余性,并利用演绎规则来构建所有频繁项集的简洁表示,从而减少存取数据库和对项集进行计数的次数,最终提供一个更加紧凑的频繁项集输出.最后,通过试验说明了该方法的有效性. 相似文献