基于组合权重的系统评价模型

提出了基于组合权重的系统评价新模型 ( CWSE) ,即 :直接根据评价指标样本数据集 ,用基于加速遗传算法的投影寻踪方法确定各评价指标的分类权重 ,用基于加速遗传算法的层次分析法确定各评价指标的排序权重 ,用加速遗传算法对各评价指标的分类权重和排序权重进行综合得到组合权重 ,然后以这些组合权重与各评价对象相应评价指标的标准化值进行加权平均 ,得到系统评价的综合指标值 ,据此可对各评价对象进行分类排序 .用 CW SE模型评价中国 30个区域 1995年开发度的结果表明 ,根据开发度的强弱可把这些区域分成 3个强开发区域、6个较强开发区域、10个中等开发区域和 11个弱开发区域 ;CWSE模型简便、通用 ,计算结果较为客观和稳定 ,为系统工程理论和实践提供了新的研究方法 .     

基于关键链的敏捷软件开发多项目网络模型

敏捷软件开发因其效率和文档量远低于传统方法在一提出就得到广泛应用,但仍无法有效解决软件开发多项目管理中的资源受限调度问题.将关键链思想应用到包含多个项目的敏捷软件开发问题中,在分析敏捷软件开发多项目网络模型的基础上,建立了数学优化模型;提出了一种适宜敏捷软解开发的多项目网络迭代调度假设与规则,并设计了相应的算法,具体包括关键链选择算法和调度算法;最后进行了实例分析,所得结果与遗传算法的相比从52个单位时间的迭代周期减少到42,使得工期节省了近20%.     

Accelerated gradient descent methods with line search

We introduced an algorithm for unconstrained optimization based on the transformation of the Newton method with the line search into a gradient descent method. Main idea used in the algorithm construction is approximation of the Hessian by an appropriate diagonal matrix. The steplength calculation algorithm is based on the Taylor’s development in two successive iterative points and the backtracking line search procedure. The linear convergence of the algorithm is proved for uniformly convex functions and strictly convex quadratic functions satisfying specified conditions.     

Routing and scheduling in a flexible job shop by tabu search

A hierarchical algorithm for the flexible job shop scheduling problem is described, based on the tabu search metaheuristic. Hierarchical strategies have been proposed in the literature for complex scheduling problems, and the tabu search metaheuristic, being able to cope with different memory levels, provides a natural background for the development of a hierarchical algorithm. For the case considered, a two level approach has been devised, based on the decomposition in a routing and a job shop scheduling subproblem, which is obtained by assigning each operation of each job to one among the equivalent machines. Both problems are tackled by tabu search. Coordination issues between the two hierarchical levels are considered. Unlike other hierarchical schemes, which are based on a one-way information flow, the one proposed here is based on a two-way information flow. This characteristic, together with the flexibility of local search strategies like tabu search, allows to adapt the same basic algorithm to different objective functions. Preliminary computational experience is reported.     

基于VIKOR算法的区域经济发展状况评价

区域经济发展状况评价是多属性方案决策,为防止个别较差指标的消极影响被其他指标中和,提高决策的合理性,采用简化的VIKOR算法完成决策矩阵的规范化处理,在此基础上对区域经济发展状况进行排序.并通过算例说明VIKOR算法的有效性和可行性.     

A scalable TFETI algorithm for two-dimensional multibody contact problems with friction

A Total FETI (TFETI) based domain decomposition algorithm with preconditioning by a natural coarse grid of rigid body motions is adapted to the solution of two-dimensional multibody contact problems of elasticity with the Coulomb friction and proved to be scalable for the Tresca friction. The algorithm finds an approximate solution at the cost asymptotically proportional to the number of variables provided the ratio of the decomposition parameter and the discretization parameter is bounded. The analysis is based on the classical results by Farhat, Mandel, and Roux on scalability of FETI with a natural coarse grid for linear problems and on our development of optimal quadratic programming algorithms for bound and equality constrained problems. The algorithm preserves parallel scalability of the classical FETI method. Both theoretical results and numerical experiments indicate a high efficiency of our algorithm. In addition, its performance is illustrated on analysis of the yielding clamp connection with the Coulomb friction.     

基于多层次模糊关联算法的通用航空产业知识挖掘研究

为挖掘通用航空产业领域知识的类型与发展规律,明确产业规划、推动产业健康发展,利用采集的3869份通用航空产业主题相关的网页资料,根据主题信息的关键词对通用航空产业领域知识进行分类,并基于多层次模糊关联算法进行知识挖掘分析.结果表明,通用航空产业领域知识中的通用航空产业主体与通用航空产业产品存在着紧密的联系和规则,而且采...     

SSM的改进及其泉州区域经济不平衡发展分析

引进SSM(偏离-份额分析法)研究区域经济不平衡发展,发现当前普遍采用的基于研究初末期的SSM算法有缺陷,因此,提出改进算法.根据全国第一、二次经济普查,以泉州区域经济发展为参照,应用改进的SSM,从县域经济及其产业的规模、结构与竞争效果等,分析2004-2008年泉州区域经济不平衡发展及原因.     

求解一类非光滑优化问题的改进变尺度方法

1 引言 近来，人们对用过剩其函数来表示信号的处理方法表现出极大的兴趣，原因是基函数类越大所表示出的函数类就越大，人们通常采用小波基和Gabor基，本文的目的是构造一个寻找优化（或最优）基函数的算法，该算法的出发点是从过剩的其函数中选择紧支撑的基向量。     

ML Estimation of the MultivariatetDistribution and the EM Algorithm

Maximum likelihood estimation of the multivariatetdistribution, especially with unknown degrees of freedom, has been an interesting topic in the development of the EM algorithm. After a brief review of the EM algorithm and its application to finding the maximum likelihood estimates of the parameters of thetdistribution, this paper provides new versions of the ECME algorithm for maximum likelihood estimation of the multivariatetdistribution from data with possibly missing values. The results show that the new versions of the ECME algorithm converge faster than the previous procedures. Most important, the idea of this new implementation is quite general and useful for the development of the EM algorithm. Comparisons of different methods based on two datasets are presented.     

随机环境下资金预算问题的机会约束整数规划模型

本文基于最新的机会约束规划理论,提出了两类随机环境下资金预算问题的整数规划模型,并且设计了一种基于随机模拟的遗传算法来计算给出的模型．为了例证算法的有效性,本文给出了两类模型的数值例子,并且对其中一个例子给出了不同的参数,测试遗传算法的有效性,数值例子及测试结果均显示,本文所设计的基于随机模拟的遗传算法对于解决本文提出的两类模型是有效的．     

Modeling customer satisfaction with new product design using a flexible fuzzy regression-data envelopment analysis algorithm

The success of new products depends greatly on customer satisfaction and meeting the customer needs is vital for new product development. By incorporating customer needs in the design and development process, organizations can improve productivity for their new products and reduce the risks associated with new product markets. Hence, design teams require methods to model customer satisfaction when setting the associated product design attributes. Thus, different approaches have been developed for modeling the relationship between customer satisfaction and product design parameters. In this study, 16 well-known fuzzy regression (FR) models are considered to understand the relationship between customer satisfaction and new product design. The design of FR models is based on the 4Ps marketing mix (product, price, place, and promotion) concept in fuzzy environments. A flexible algorithm is then presented based on the index of confidence, error measures, and data envelopment analysis for selecting the best FR model. The applicability and usefulness of the proposed algorithm is demonstrated experimentally based on an actual case study, where the flexible algorithm is employed to predict customer satisfaction with a new product design in the freezer/refrigerator industry.     

Learning marginal AMP chain graphs under faithfulness revisited

Marginal AMP chain graphs are a recently introduced family of models that is based on graphs that may have undirected, directed and bidirected edges. They unify and generalize the AMP and the multivariate regression interpretations of chain graphs. In this paper, we present a constraint based algorithm for learning a marginal AMP chain graph from a probability distribution which is faithful to it. We show that the marginal AMP chain graph returned by our algorithm is a distinguished member of its Markov equivalence class. We also show that our algorithm performs well in practice. Finally, we show that the extension of Meek's conjecture to marginal AMP chain graphs does not hold, which compromises the development of efficient and correct score+search learning algorithms under assumptions weaker than faithfulness.     

Box-constrained multi-objective optimization: A gradient-like method without “a priori” scalarization

The aim of this paper is the development of an algorithm to find the critical points of a box-constrained multi-objective optimization problem. The proposed algorithm is an interior point method based on suitable directions that play the role of gradient-like directions for the vector objective function. The method does not rely on an “a priori” scalarization and is based on a dynamic system defined by a vector field of descent directions in the considered box. The key tool to define the mentioned vector field is the notion of vector pseudogradient. We prove that the limit points of the solutions of the system satisfy the Karush–Kuhn–Tucker (KKT) first order necessary condition for the box-constrained multi-objective optimization problem. These results allow us to develop an algorithm to solve box-constrained multi-objective optimization problems. Finally, we consider some test problems where we apply the proposed computational method. The numerical experience shows that the algorithm generates an approximation of the local optimal Pareto front representative of all parts of optimal front.     

Implementation of fractional-order electromagnetic potential through a genetic algorithm

Several phenomena present in electrical systems motivated the development of comprehensive models based on the theory of fractional calculus (FC). Bearing these ideas in mind, in this work are applied the FC concepts to define, and to evaluate, the electrical potential of fractional order, based in a genetic algorithm optimization scheme. The feasibility and the convergence of the proposed method are evaluated.     

Program derivation with verified transformations — a case study

A program development methodology based on verified program transformations is described and illustrated through derivations of a high level bisimulation algorithm and an improved minimum-state DFA algorithm. Certain doubts that were raised about the correctness of an initial paper-and-pencil derivation of the DFA minimization algorithm were laid to rest by machine-checked formal proofs of the most difficult derivational steps. Although the protracted labor involved in designing and checking these proofs was almost overwhelming, the expense was somewhat offset by a successful reuse of major portions of these proofs. In particular, the DFA minimization algorithm is obtained by specializing and then extending the last step in the derivation of the high level bisimulation algorithm. Our experience suggests that a major focus of future research should be aimed towards improving the technology of machine checkable proofs — their construction, presentation, and reuse. This paper demonstrates the importance of such a technology to the verification of programs and program transformations. We believe that the utility of transformational systems to program development will ultimately rest on a practical program correctness technology. © 1996 John Wiley & Sons, Inc.     

Mathematical simulation of gas–liquid mixture flow in a reservoir and a wellbore with allowance for the dynamical interactions in the reservoir–well system

Fluid dynamic processes related to mature oil field development are simulated by applying a numerical algorithm based on the gas–liquid mixture flow equations in a reservoir and a wellbore with allowance for the dynamical interaction in the reservoir–well system. Numerical experiments are performed in which well production characteristics are determined from wellhead parameters.     

基于多层次映射和遗传策略的语义Web搜索方法

随着语义Web概念的提出及相关技术的发展,基于语义的Web信息检索逐渐成为语义Web研究的热点.首先分析了传统的Web搜索面临的诸多挑战,然后设计了一种新的基于遗传语义搜索算法和和多层次映射的Web搜索方法.该方法充分结合遗传算法并行搜索方式,能扩大搜索空间,快速实现全局优化.实验结果表明该算法能有效提高Web搜索的质量和效率.     

An exact algorithm for the pallet loading problem

The two-dimensional packing problem of finding optimal layouts for identical rectangular boxes on a rectangular pallet has interested OR practitioners for many years. The problem is NP-complete and solution methods to date tend to be heuristic. This paper discusses the development of an exact tree search algorithm based on a graph-theoretic model of the problem.     

Matlab implementation of a moving grid method based on the equidistribution principle

The objective of this paper is to report on the development of a method of lines (MOL) toolbox within MATLAB, and especially, on the implementation and test of a moving grid algorithm based on the equidistribution principle. This new implementation includes various spatial approximation schemes based on finite differences and slope limiters, the choice between several monitor functions, automatic grid adaptation to the initial condition, and provides a relatively easy tuning for the non-expert user. Several issues, including the sensitivity of the numerical results to the tuning parameters, are discussed. A few test problems characterized by solutions with steep moving fronts, including the Buckley-Leverett equation and an extended Fisher-Kolmogorov equation, are investigated so as to demonstrate the algorithm and software performance.