基于满意度和GA的区间系数多目标规划求解*

在缺乏先验知识的前提下,提出了约束条件的一种满意度,按照遗传算法求解多目标问题的步骤,求出非劣解集;然后根据适应度大小选出最优解;最后算例证明了该算法的有效性和可行性。     

四维混沌系统及其在图像加密中的应用

传统基于低维混沌系统的图像加密算法往往具有密钥空间较小、安全性较差的问题。针对这些问题,首先提出了一类新的平衡点不稳定的四维离散混沌系统,通过数值仿真对该类系统进行了动力学行为分析,正的Lyapunov指数的个数可以达到三个。同时并基于该类混沌系统设计了一个新的图像加密方案,并进一步对明密文的分布直方图、相关系数、信息熵以及加密方案对参数的敏感性进行了分析。分析结果表明,该加密方案抵抗外来攻击的能力强,密钥空间可达2996△,具有较高的安全性。     

马钢2号高炉中修后开炉达产操作实践

对马钢2号高炉中修后开炉达产操作实践进行了总结。通过制定科学的开炉方案,快速提高煤比、降低焦比,实现了顺利开炉、快速达产达效的目标。     

INVESTIGATION ON CRYSTALLIZATION KINETICS OF Pd-Cu-Si GLASS

The crystallization kinetics of Pd-Cu-Si glass was studied by means of diferential scanningcalorimetry-Ⅱ.According to Kissinger peak shift meth(?)d and Arrhenius equation,theapparent activation energy was calculated.The crystallization kinetics follows Johnson-Mehl-Avrami equation with n=3.0 within 0.15相似文献   

A suboptimal joint bandwidth and power allocation for cooperative relay networks＂ a cooperative game theoretic approach

In commercial networks, user nodes operating on batteries are assumed to be selfish to consume their resources (i.e., bandwidth and power) solely maximizing their own benefits (e.g., the received signal-to-noise ratios (SNRs) and datarates). In this paper, a cooperative game theoretical framework is proposed to jointly perform the bandwidth and power allocation for selfish cooperative relay networks. To ensure a fair and efficient resource sharing between two selfish user nodes, we assume that either node can act as a source as well as a potential relay for each other and either node is willing to seek cooperative relaying only if the datarate achieved through cooperation is not lower than that achieved through noncooperation (i.e., direct transmission) by consuming the same amount of bandwidth and power resource. Define the cooperative strategy of a node as the number of bandwidth and power that it is willing to contribute for relaying purpose. The two node joint bandwidth and power allocation (JBPA) problem can then be formulated as a cooperative game. Since the Nash bargaining solution (NBS) to the JBPA game (JBPAG) is computationally difficult to obtain, we divide it into two subgames, i.e., the bandwidth allocation game (BAG) and the power allocation game (PAG). We prove that both the subgames have unique NBS. And then the suboptimal NBS to the JBPAG can be achieved by solving the BAG and PAG sequentially. Simulation results show that the proposed cooperative game scheme is efficient in that the performance loss of the NBS result to that of the maximal overall data-rate scheme is small while the maximal-rate scheme is unfair. The simulation results also show that the NBS result is fair in that both nodes could experience better performance than they work independently and the degree of cooperation of a node only depends on how much contribution its partner can make to improve its own performance.     

A new graphical visualization of n-dimensional Pareto front for decision-making in multiobjective optimization

New challenges in engineering design lead to multiobjective (multicriteria) problems. In this context, the Pareto front supplies a set of solutions where the designer (decision-maker) has to look for the best choice according to his preferences. Visualization techniques often play a key role in helping decision-makers, but they have important restrictions for more than two-dimensional Pareto fronts. In this work, a new graphical representation, called Level Diagrams, for n-dimensional Pareto front analysis is proposed. Level Diagrams consists of representing each objective and design parameter on separate diagrams. This new technique is based on two key points: classification of Pareto front points according to their proximity to ideal points measured with a specific norm of normalized objectives (several norms can be used); and synchronization of objective and parameter diagrams. Some of the new possibilities for analyzing Pareto fronts are shown. Additionally, in order to introduce designer preferences, Level Diagrams can be coloured, so establishing a visual representation of preferences that can help the decision-maker. Finally, an example of a robust control design is presented - a benchmark proposed at the American Control Conference. This design is set as a six-dimensional multiobjective problem.     

Optimization of clamped circular piezoelectric composite actuators

This paper addresses the design of clamped circular piezoceramic composite unimorph and bimorph configurations, specifically the conflicting requirements of maximum volume displacement for a prescribed bandwidth. An optimization problem is formulated that implements analytical solutions for unimorph and bimorph configurations using laminated plate theory, including the use of oppositely polarized piezoceramic patches. A range of actuator geometric parameters are studied, and bounds for volume displacement and natural frequency of optimal designs are determined and presented via design curves. In the selected design space, Pareto optimization results for unimorph and bimorph configurations show that optimal volume displacement is related to the bandwidth by a universal power law such that the product of the square of the natural frequency and the displaced volume, a “gain-bandwidth” product, is a constant. Characteristic trends are also described that are independent of the actuator radius for the Pareto optimal piezoceramic patch thickness and radius versus normalized bandwidth. The results are relevant, for example, in the design of zero-net mass-flux or synthetic jet actuators used in flow control applications.     

多重链路网络分区与QoS度量两级并行QoSR算法

在多重链路上联网络环境下,采用并行路由搜索的思想寻找最优路径,能够获得较好的路径寻优结果,并且算法的时间复杂度较低.给出一种两级并行QoSR算法,将多重链路环境按一定规则划分为若干分区,为每个分区分配一定数量的QoS度量并行处理器和1个分区处理器,在各个分区分别采用QPAS算法,由QoS度量并行处理器并行计算出各分区内的QoS度量Pareto最佳路径,最终由分区处理器调用最短路径并行算法完成分区间代价最小路径的计算.     

低速无线个域网隐蔽站问题研究

低速无线个域网标准IEEE802.15.4协议MAC层的主要目标是有效地减少能量的消耗,而并没有考虑如何有效地减少隐蔽站问题的产生.在无线多跳网络中解决隐蔽站问题主要方法有RTS/CTS和调节载波侦听范围等办法,但是均不适用于低速无线个域网.在对基于IEEE802.15.4的时隙CSMA/CA退避算法和隐蔽站问题产生的原理进行深入分析的基础上,得出了在节点均匀分布的情况下退避指数的最小值macminBE相对于发帧成功率的表达式,提出了通过调节macminBE,来减少由于隐蔽站问题引发的帧冲突的方法.并通过NS2仿真实验验证了方法的可行性.克服了现有方法的不足,较大地提高了网络的性能.     

Reliability-based robust Pareto design of linear state feedback controllers using a multi-objective uniform-diversity genetic algorithm (MUGA)

In this paper, fuzzy threshold values, instead of crisp threshold values, have been used for optimal reliability-based multi-objective Pareto design of robust state feedback controllers for a single inverted pendulum having parameters with probabilistic uncertainties. The objective functions that have been considered are, namely, the normalized summation of rising time and overshoot of cart (S_RO–C) and the normalized summation of rising time and overshoot of pendulum (S_RO–P) in the deterministic approach. Accordingly, the probabilities of failure of those objective functions are also considered in the reliability-based design optimization (RBDO) approach. A new multi-objective uniform-diversity genetic algorithm (MUGA) is presented and used for Pareto optimum design of linear state feedback controllers for single inverted pendulum problem. In this way, Pareto front of optimum controllers is first obtained for the nominal deterministic single inverted pendulum using the conflicting objective functions in time domain. Such Pareto front is then obtained for single inverted pendulum having probabilistic uncertainties in its parameters using the statistical moments of those objective functions through a Monte Carlo simulation (MCS) approach. It is shown that multi-objective reliability-based Pareto optimization of the robust state feedback controllers using MUGA with fuzzy threshold values includes those that may be obtained by various crisp threshold values of probability of failures and, thus, remove the difficulty of selecting suitable crisp values. Besides, the multi-objective Pareto optimization of such robust feedback controllers using MUGA unveils some very important and informative trade-offs among those objective functions. Consequently, some optimum robust state feedback controllers can be compromisingly chosen from the Pareto frontiers.