基于多元统计分析的城市竞争力研究

应用多元统计分析方法对34个省会城市和计划单列市的竞争力进行了综合评估.首先设立城市竞争力评价指标,由于指标之间存在相关性,采用因子分析法选取公共因子作为评价的综合指标,然后构造评价函数,根据城市竞争力在各公因子上的得分及其综合排名,分析各城市的发展特色和竞争优劣点.基于因子分析法得到的公因子替代原始变量,分别采用系统聚类分析法和K均值聚类分析法给各城市划分类型,比较两种不同聚类法得出的结果,分析聚类结果可靠性.最后基于综合评估结果给出了提高城市竞争力的合理建议.     

企业技术改造项目后评价的研究

应用模糊评判、ＡＨＰ法、静态和动态权数分配相结合的方法，建立技改项目后评价模型，对工业企业技术改造项目综合效益进行了后评价的研究，其结果与实际情况基本相符     

军事通信网可靠性综合评估方法

军事通信网系统的可靠性测度指标可通过现场实验，实验室实验，计算机模拟和理论分析等方法得到。考虑多个可靠性测度指标的情况下，军事通信网可靠性评估是多指标的综合评价，本文在介绍两种综合评估方法的同时，提出了一种新的可靠性综合评估方法－综合评分法，该方法可应用于军事通信网的规划和决策。     

基于Markov的模块化电传操纵系统软件可靠性模型

电传操纵系统是影响飞行安全的关键系统,建立有效的电传操纵系统软件可靠性模型是软件可靠性测试和验证的基础.针对某型飞机系统安全性设计中横向通道电传操纵系统软件可靠性建模问题,建立了模块化的基于Markov的电传操纵系统软件可靠性模型.提出了综合考虑重要度和复杂度的软件可靠性指标分配方法,将可靠性目标分配到子模块.最后,通过实例验证了所建立的模型和指标分配方法的有效性.     

路段容量约束弹性需求交通均衡分配近似算法

本文研究了带路段容量约束弹性需求用户均衡交通分配问题及其近似解法.采用超需求模型将弹性需求转化为固定需求,提出了一种带路段容量约束弹性需求用户均衡交通分配近似算法.该算法在迭代过程中,通过不断自适应调节排队延误因子、误差因子来近似真实路段行驶时间,使路段流量逐步满足约束条件,最终达到广义用户均衡.这种方法克服了容量约束弹性需求用户均衡分配计算量大及随机分配法要求枚举所有路径的困难.随后证明了算法的收敛性,并对一个小型路网进行了数值试验.     

非对称弹性需求网络容量限制交通分配有效算法

在非对称交通网络中,针对路段容量限制下弹性需求用户均衡分配模型计算困难,提出了一种路段容量限制弹性需求用户均衡交通分配问题的有效算法.该算法在迭代时,排队延误因子、误差因子与交通需求通过自适应调节来逼近真实路段车辆行驶时间和出行者交通需求,促使各路段交通流量逐步满足限制条件,最终达到弹性需求广义用户均衡.方法克服了容量限制弹性需求用户均衡分配计算量大及随机分配法要求枚举所有路径的困难.随后证明了算法的收敛性,并对一个小型路网进行了数值试验.     

基于遗传算法的多目标可靠性优化

在元件的体积、重量和造价的共同约束下的多级串并联系统的可靠性优化问题是一个具有多局部极值的、非线性的、同时具有整数和实数变量的混合优化问题.将遗传算法和多目标可靠性分配问题相结合,对可靠性分配问题进行求解,得到较好效果,从而得出结论,遗传算法在求解多目标可靠性优化问题中是一种行之有效的方法.     

系统可靠性分配的优化方法

本文根据系统元件重要度分析理论,提出一种优化的元件可靠性分配的新方法.它以所给定的系统可靠度为目标,以元件最大可靠度为限止,根据元件重要度排序,逐步分配元件可靠性,使其保证每一步的分配是最优的,从而得到一个整体优化的分配方案,以提供作为可靠性设计的依据。本文最后还给出一个简单算例。该方法思路简单明了,计算方便。     

火工品可靠性试验数据的综合分析方法

升降法试验数据和固定刺激量下的成败型试验数据,是两种最常见的火工品可靠性试验数据．我们应用Markov链,研究了升降法试验数据下,感度分布参数的极大似然估计的特性．在此基础上,应用Bootstrap方法和Bayes方法,给出了综合分析两种试验数据的方法．最后,将该方法应用于520底火的可靠性鉴定,得出了有益的结论．     

基于云模型和证据推理的生态环境安全评价

文章提出了一种生态环境安全综合评价模型。首先构建生态环境安全评价指标体系并划分等级区间, 通过云模型将各指标实际值转化为生态环境安全等级的关联度; 其次结合证据推理与熵权法动静态组合确定指标权重; 然后利用证据推理计算出各指标基本可信度分配函数, 再采用证据融合算法合成出生态环境安全综合评估概率分布; 最后根据“最大关联度准则”得出评价结果。以湖南省为例开展实例研究, 研究结果与模糊综合评价法评估等级结果一致, 验证了所提出方法具有合理性、可行性和有效性。     

冷贮备冗余系统可靠度预计的递归算法

基于贮备科系统的特点,运用折方法得出一种用计算机求冷贮备冗余系统可靠度的方法,并将该计算方法用于两个计算实例。     

Performance assessment and reliability analysis of dependable and distributed computing systems based on BDD and recursive merge

System reliability evaluation, sensitivity analysis, failure frequency analysis, importance measures, and optimal design are important issues that have become research topics for distributed dependable computing. Finding all of the Minimal File Spanning Trees (MFST) and avoiding repeatedly computing the redundant MFSTs have been key techniques for evaluating the reliability of a distributed computing system (DCS) in previous works. However, identifying all of the disjointed MFSTs is difficult and time consuming for large-scale networks. Although existing algorithms have been demonstrated to work well on medium-scale networks, they have two inherent drawbacks. First, they do not support efficient manipulation of Boolean algebra. The sum-of-disjoint-products method used by these algorithms is inefficient when dealing with large Boolean functions. Second, the tree-based partitioning algorithm does not merge isomorphic sub-problems, and therefore, redundant computations cannot be avoided. In this paper, we propose a new efficient algorithm for the reliability evaluation of a DCS based on the recursive merge and the binary decision diagram (BDD). Using the BDD substitution method, we can easily apply our algorithm to a network with imperfect nodes. The experimental results show a significant improvement in the execution time compared to previous works.     

A partial enumeration algorithm for pure nonlinear integer programming

In this paper, a partial enumeration algorithm is developed for a class of pure IP problems. Then, a computational algorithm, named PE_SPEEDUP (partial enumeration speedup), has been developed to use whatever explicit linear constraints are present to speedup the search for a solution. The method is easy to understand and implement, yet very effective in dealing with many pure IP problems, including knapsack problems, reliability optimization, and spare allocation problems. The algorithm is based on monotonicity properties of the problem functions, and uses function values only; it does not require continuity or differentiability of the problem functions. This allows its use on problems whose functions cannot be expressed in closed algebraic form. The reliability and efficiency of the proposed algorithm and the PE_SPEEDUP algorithm has been demonstrated on some integer optimization problems taken from the literature.     

Incorporating transfer reliability into equilibrium analysis of railway passenger flow

Passenger’s transfer route choice behavior is one of the prominent research topics in the field of railway transportation. Existing traffic assignment approaches do not properly account for passenger’s expectation for transfer reliability. In this study, the transfer reliability is explicitly defined and a multi-class user equilibrium model is established, given which passengers choose the minimal-cost path based on their expected reliability thresholds. In particular, a path-based traffic assignment algorithm which combines a k-shortest path algorithm and the method of successive averages is proposed. The validity of the proposed approach is verified by an illustrative example. Using the proposed modeling approach, it is possible to determine the passenger’s collective route choice behavior based on the user equilibrium pattern. Moreover, the railway timetables can be evaluated and optimized based on the cost-based level of service estimation.     

两不同部件串联可修系统的可用度的一个新的计算方法

本用直接解一组不含时间t的一阶线性偏微分积方程而得到两不同部件可修系统的可用度。     

Fast computation of bounds for two-terminal network reliability

In this paper, an algorithm for the fast computation of network reliability bounds is proposed. The evaluation of the network reliability is an intractable problem for very large networks, and hence approximate solutions based on reliability bounds have assumed importance. The proposed bounds computation algorithm is based on an efficient BDD representation of the reliability graph model and a novel search technique to find important minpaths/mincuts to quickly reduce the gap between the reliability upper and lower bounds. Furthermore, our algorithm allows the control of the gap between the two bounds by controlling the overall execution time. Therefore, a trade-off between prediction accuracy and computational resources can be easily made in our approach. The numerical results are presented for large real example reliability graphs to show the efficacy of our approach.     

N车探险问题的一种ε-近似度的近似算法

本文探讨了一类N车探险问题的近似算法,首先通过建模将N车问题转变为一个等价的非线性0-1混合整数规划问题,进而将该非线性0-1混合整数规划问题转化为一个一般的带约束非线性规划问题,并用罚函数的方法将得到的带约束非线性规划问题化为相应的无约束问题.我们证明了可通过求解该无约束非线性规划问题得到原N车问题的ε-近似度的近似解,并设计了-个收敛速度为二阶的迭代箅法,文章最后给出算法实例.     

A new accurate numerical method of approximation of chaotic solutions of dynamical model equations with quadratic nonlinearities

In this article the authors describe the method of construction of approximate chaotic solutions of dynamical model equations with quadratic nonlinearities in a general form using a new accurate numerical method. Numerous systems of chaotic dynamical systems of this type are studied in modern literature. The authors find the region of convergence of the method and offer an algorithm of construction and several criteria to check the accuracy of the approximate chaotic solutions.     

软件可靠性模型的补偿算法

世界上已发表了四十多个软件可靠性模型,但使用情况不尽如人意．提出了模型的补偿算法,实验研究结果表明,该算法能有效地改善模型的精度及适应性．     

Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound

We consider a recent branch-and-bound algorithm of the authors for nonconvex quadratic programming. The algorithm is characterized by its use of semidefinite relaxations within a finite branching scheme. In this paper, we specialize the algorithm to the box-constrained case and study its implementation, which is shown to be a state-of-the-art method for globally solving box-constrained nonconvex quadratic programs. S. Burer was supported in part by NSF Grants CCR-0203426 and CCF-0545514.