Study on Intelligent NC Programming for Complex Components of Marine Diesel Based on KBE and UG NX

The NC programming for complex components has lots drawbacks such as excessive repetitious labors,heavy work- load and lack of optimixation,which are especially serious in NC programming for complex components of marine diesel.Based on the key technologies of applying KBE(Knowledge Based Engineering)to NC programming——knowledge representation,general- ized knowledge base,knowledge acquisition and knowledge reasoning,the system of intelligent NC programming for complex com- ponents of marine diesel has been built by means of the knowledge template and the UG/Open.The experiment results indicate that the NC program generated with high efficiency of NC programming by the system is accurate enough to meet the need of NC ma- chining.Consequently,the automatization and intelligentization of NC programming has been presented,and the study is proved to be a successful attempt in the area of applying KBE to NC programming.     

Integer Programming Model for Maximum Clique in Graph

The maximum clique or maximum independent set of graph is a classical problem in graph theory. Combined with Boolean algebra and integer programming, two integer programming models for maximum clique problem,which improve the old results were designed in this paper. Then, the programming model for maximum independent set is a corollary of the main results. These two models can be easily applied to computer algorithm and software, and suitable for graphs of any scale. Finally the models are presented as Lingo algorithms, verified and compared by several examples.     

Improved Group Fuzzy Preference Programming Method Based on Fuzzy Random Theory

A new prioritization method in the analytic hierarchy process （AHP）, which improves the group fuzzy preference programming （GFPP） method, is proposed. The fuzzy random theory is applied in the new prioritization method. By modifying the principle of decision making implied in the GFPP method, the improved group fuzzy preference programming （IGFPP） method is formulated as a fuzzy linear programming problem to maximize the average degree of the group satisfaction with all possible group priority vectors. The IGFPP method inherits the advantages of the GFPP method, and solves the weighting trouble existed in the GFPP method. Numerical tests indicate that the IGFPP method performs more effectively than the GFPP method in the case of very contradictive comparison judgments from decision makers.     

Bin-objective shape optimization based on linear programming model of arch dam

Bin-objective shape optimization of arch dam based on linear programming model is discussed to minimize both dam volume and maximal tensile stress.The importance of weight coefficient of the above two objectives is chosen according to the value of importance ratio.The influence of weight coefficient to the optimization result is discussed in detail and the numerical example shows that both the model and method proposed is doable.     

Intelligent manufacturing system of impeller for computer numerical control（CNC） programming based on KBE

To solve the problem of advanced digital manufacturing technology in the practical application, a knowledge engineering technology was introduced into the computer numerical control（CNC） programming. The knowledge acquisition, knowledge representation and reasoning used in CNC programming were researched. The CNC programming system functional architecture of impeller parts based on knowledge based engineering（KBE） was constructed. The structural model of the general knowledge-based system（KBS） was also constructed. The KBS of CNC programming system was established through synthesizing database technology and knowledge base theory. And in the context of corporate needs, based on the knowledge-driven manufacturing platform（i.e. UG CAD/CAM）, VC＋＋6.0 and UG/Open, the KBS and UG CAD/CAM were integrated seamlessly and the intelligent CNC programming KBE system for the impeller parts was developed by integrating KBE and UG CAD/CAM system. A method to establish standard process templates was proposed, so as to develop the intelligent CNC programming system in which CNC machining process and process parameters were standardized by using this KBE system. For the impeller parts processing, the method applied in the development of the prototype system is proven to be viable, feasible and practical.     

Optimal dynamic dispatch of surplus gas among buffer boilers in steel plant

As valuable energy in iron-and steel-making process,by-product gas is widely used in heating and technical processes in steel plant.After being used according to the technical requirements,the surplus by-product gas is usually used for buffer boilers to produce steam.With the rapid development of energy conservation technology and energy consumption level,surplus gas in steel plant continues to get larger.Therefore,it is significant to organize surplus gas among buffer boilers.A dynamic programming model of that issue was established in this work,considering the ramp rate constraint of boilers and the influences of setting gasholders.Then a case study was done.It is shown that dynamic programming dispatch gets more steam generation and less specific gas consumption compared with current proportionate dispatch depending on nominal capacities of boilers.The ignored boiler ramp rate constraint was considered and its contribution to the result validity was pointed out.Finally,the significance of setting gasholders was studied.     

用非线性规划求解的最大(火啇)图象恢复(英文)

<正> A blurred and noisy image usually can be processed digitally to reduce its blur and noise level. Maximum entropy restoration has proved very useful in digital image processing. Frieden's solution by Newton-Rapson methods is limited by the small number of points in the one-dimensional case. In this paper, the formulation of maximum entropy approach in terms of an optimization problem is presented. The optimization problem is solved with linearly constrained nonlinear programming.     

一类大规模目标规划问题的分解

Goal programming is an efficient method whereby to solve multi-objective decision problem. However, with the increasing of problem scale, the computer time has been rapidly increased and even a general computer cannot perform. Therefore, it is important to decompose a large scale problem into smaller ones. In this paper, the authors discuss the dedcomposition of a kind of large scale goal programming problem and have proved the relationship between the large scale goal programming problem and the smaller scale problems. The general form of goal programming is:     

Research on theory and method in parallel designing environment based on coupling

Understanding the relation between multiple agents is very important in developing a multi-agent system. Two concepts, multi-agent system architecture and multi-agent system architecture prototype are brought forward, and the method of descrbing the relation between agents using the concepts is explored. The structure and components are designed. Based on the fact that cooperation between distributed agents is erratic, a controlled natural language communication function is designed and realized. Applying the offered interfaces, the user‘s workload consumed in agent communication and management is reduced, and at the same time, robustness of the multi-agent system is improved.     

逻辑、优化及约束程序的综述

由于优化和约束程序各自具有扩充能力,它们开始有效地结合在一起。它们的结合有着广阔的商业前景,近些年来引起了研究者浓厚的兴趣。概述了各种优化中基于逻辑的方法,总结了约束程序研究领域的各种方法,并对优化和约束程序结合的框架进行了综述。     

一类机会约束规划的回溯逼近求解法

研究了一类机会约束随机规划的近似求解问题,提出了基于蒙特卡罗随机模拟的回溯逼近求解算法,该方法通过在迭代过程中逐步增加抽样次数和精确求解确定性数学规划,最终得到机会约束规划的最优解。文中讨论了最优解的计算方法及算法迭代终止条件。最后,通过算例验证了该方法的有效性。     

基于多元主体参建的西北公益性铁路资本管理模式的会计研究

西北铁路是中国铁路网中公益性最强的板块,立足于多元主体参建的西北公益性铁路资本管理模式,对资本运行实行全过程管理,控制成本,合理清算,提高投资收益。指出及时有效提供真实完整的公司财务报告,准确确认资本收益,规范公司股东会、董事会、监事会和经营管理者的权责,确保分权和制衡的有效性,进一步加大以政府为主的监管力度。     

求解整数规划的一种新方法

借鉴整数规划分支定界法的思路,通过增加约束条件,使整数规划对应线性规划的可行域一分为二,分别找到整数最优解并比较大小得到整数规划的最优解．     

一类特殊的非线性双层规划问题及其遗传算法

利用Karush-Kuhn-Tucker条件,将下层为凸规划的非线性双层规划转化为一个单层规划问题.为了提高遗传算法求解该问题的效率,利用对线性不等式约束添加松弛项和计算非线性约束边界点的方法,给出了一种新的约束处理方法;通过构造一个辅助线性模型降低了搜索空间的维数;结合算法产生的最优个体,设计了一个有助于改善个体适应度的杂交算子.     

非线性规划按K-S函数凝聚为单个约束的解法

为了减少求解非线性规划约束数目太多的巨大计算量,采用K-S函数将非线性规划问题化为只有1个约束条件,按等式约束拉格朗日乘子法得到鞍点条件,利用泰勒公式展开得到近似方程求解非线性规划,迭代求解算例表明该解法具有应用价值.     

机会约束规划理论在有源配电网规划中的应用

综述了不确定性规划的理论方法,详细介绍了3种规划模型的建模机理和数学模型,进而将不确定规划方法与典型分布式电源的出力特性相结合,建立了有源配电网的不确定规划模型,并提出了随机机会约束规划方法.     

解整数规划的另一方法

本文给出了解整数规划问题的另一方法,通过解相应的线性规划问题、灵敏度分析和解不定方程组来解整数规划。     

机会约束规划理论在有源配网规划中的应用

分布式电源的大规模接入会给配电网带来多种不确定性,为了能够有效处理有源配电网规划这一复杂问题,将不确定规划理论引入其中。首先,综述了不确定性规划的理论方法,详细介绍了三种规划模型的建模机理和数学模型;进而,将不确定规划方法与典型分布式电源的出力特性相结合,建立有源配电网的不确定规划模型,提出随机机会约束规划方法。     

农场生产计划的线性规则模型

研究了一个生产计划问题,对问题中的条件进行适当的简化,从而建立了一个线性规划模型,该模型具有一定的通用性,适合于同类问题。