原发性高血压病靶器官损害的预测仿真研究

研究原发性高血压病靶器官损害准确预测问题,由于原发性高血压病靶器官损害的影响因子之间存在着高度冗余和非线性,导致传统方法预测准确率低,为提高预测精度,构建了一种改进的基因表达式编程算法的原发性高血压病靶器官损害预测模型,首先设计了适合靶器官损害预测的适应度函数,然后为克服早熟现象提出了以平均适应度形式自适应的改变重组算子概率和变异算子概率,通过数据训练得到靶器官损害的2年预测模型。采用对山东中医药大学第二附属医院原发性高血压病历史数据进行验证性仿真,结果表明,方法的预测精度更高,在原发性高血压病靶器官损害的预测中有着广泛的应用前景。     

基于MYGCC的编程规则检查算法研究

MYGCC是一个编程规则检查工具,其目前的检查算法存在局限性,不能完整地展示违反编程规则的程序路径。本文提出并实现了一种改进的编程规则检查算法,可以弥补上述的局限性。实验表明改进算法是有效的,此改进有助于用户更准确地定位错误位置,方便对编程错误的修正。     

Interactive fuzzy stochastic multi-level 0–1 programming using tabu search and probability maximization

In this paper, we consider interactive fuzzy programming for multi-level 0–1 programming problems involving random variable coefficients both in objective functions and constraints. Following the probability maximization model together with the concept of chance constraints, the formulated stochastic multi-level 0–1 programming problems are transformed into deterministic ones. Taking into account vagueness of judgments of the decision makers, we present interactive fuzzy programming. In the proposed interactive method, after determining the fuzzy goals of the decision makers at all levels, a satisfactory solution is derived efficiently by updating satisfactory levels of the decision makers with considerations of overall satisfactory balance among all levels. For solving the transformed deterministic problems efficiently, we also introduce novel tabu search for general 0–1 programming problems. A numerical example for a three-level 0–1 programming problem is provided to illustrate the proposed method.     

A genetic tango attack against the David–Prasad RFID ultra‐lightweight authentication protocol

Radio frequency identification (RFID) is a powerful technology that enables wireless information storage and control in an economical way. These properties have generated a wide range of applications in different areas. Due to economic and technological constrains, RFID devices are seriously limited, having small or even tiny computational capabilities. This issue is particularly challenging from the security point of view. Security protocols in RFID environments have to deal with strong computational limitations, and classical protocols cannot be used in this context. There have been several attempts to overcome these limitations in the form of new lightweight security protocols designed to be used in very constrained (sometimes called ultra‐lightweight) RFID environments. One of these proposals is the David–Prasad ultra‐lightweight authentication protocol. This protocol was successfully attacked using a cryptanalysis technique named Tango attack. The capacity of the attack depends on a set of boolean approximations. In this paper, we present an enhanced version of the Tango attack, named Genetic Tango attack, that uses Genetic Programming to design those approximations, easing the generation of automatic cryptanalysis and improving its power compared to a manually designed attack. Experimental results are given to illustrate the effectiveness of this new attack.     

Solving a multi-floor layout design model of a dynamic cellular manufacturing system by an efficient genetic algorithm

This paper presents a mixed-integer programming model for a multi-floor layout design of cellular manufacturing systems (CMSs) in a dynamic environment. A novel aspect of this model is to concurrently determine the cell formation (CF) and group layout (GL) as the interrelated decisions involved in the design of a CMS in order to achieve an optimal (or near-optimal) design solution for a multi-floor factory in a multi-period planning horizon. Other design aspects are to design a multi-floor layout to form cells in different floors, a multi-rows layout of equal area facilities in each cell, flexible reconfigurations of cells during successive periods, distance-based material handling cost, and machine depot keeping idle machines. This model incorporates with an extensive coverage of important manufacturing features used in the design of CMSs. The objective is to minimize the total costs of intra-cell, inter-cell, and inter-floor material handling, purchasing machines, machine processing, machine overhead, and machine relocation. Two numerical examples are solved by the CPLEX software to verify the performance of the presented model and illustrate the model features. Since this model belongs to NP-hard class, an efficient genetic algorithm (GA) with a matrix-based chromosome structure is proposed to derive near-optimal solutions. To verify its computational efficiency in comparison to the CPLEX software, several test problems with different sizes and settings are implemented. The efficiency of the proposed GA in terms of the objective function value and computational time is proved by the obtained results.     

Modeling and solving mixed-model assembly line balancing problem with setups. Part I: A mixed integer linear programming model

This paper is the first one of the two papers entitled “modeling and solving mixed-model assembly line balancing problem with setups”, which has the aim of developing the mathematical programming formulation of the problem and solving it with a hybrid meta-heuristic approach. In this current part, a mixed-integer linear mathematical programming (MILP) model for mixed-model assembly line balancing problem with setups is developed. The proposed MILP model considers some particular features of the real world problems such as parallel workstations, zoning constraints, and sequence dependent setup times between tasks, which is an actual framework in assembly line balancing problems. The main endeavor of Part-I is to formulate the sequence dependent setup times between tasks in type-I mixed-model assembly line balancing problem. The proposed model considers the setups between the tasks of the same model and the setups because of the model switches in any workstation. The capability of our MILP is tested through a set of computational experiments. Part-II tackles the problem with a multiple colony hybrid bees algorithm. A set of computational experiments is also carried out for the proposed approach in Part-II.     

Fast economic model predictive control based on NLP-sensitivities

This study adapts the advanced step NMPC framework to Economic NMPC. Here, sufficient conditions for nominal stability are derived for NMPC controllers that incorporate economic stage costs with appropriate regularization. To guarantee these conditions, we derive a constructive strategy to calculate the regularization term directly. Moreover, we extend the sensitivity components in the advanced step NMPC framework to consider a rigorous path-following algorithm. This approach accounts for active set changes and allows much weaker constraint qualifications. Moreover, using an ℓ₁ formulation of the NMPC problem satisfies these constraint qualifications and allows more reliable solution of the moving horizon optimization problem, even in the presence of noise. Finally, all of these concepts are demonstrated on a detailed case study with a continuously stirred tank reactor.     

A Dantzig–Wolfe decomposition algorithm for linear economic model predictive control of dynamically decoupled subsystems

This paper presents a warm-started Dantzig–Wolfe decomposition algorithm tailored to economic model predictive control of dynamically decoupled subsystems. We formulate the constrained optimal control problem solved at each sampling instant as a linear program with state space constraints, input limits, input rate limits, and soft output limits. The objective function of the linear program is related directly to the cost of operating the subsystems, and the cost of violating the soft output constraints. Simulations for large-scale economic power dispatch problems show that the proposed algorithm is significantly faster than both state-of-the-art linear programming solvers, and a structure exploiting implementation of the alternating direction method of multipliers. It is also demonstrated that the control strategy presented in this paper can be tuned using a weighted ℓ₁-regularization term. In the presence of process and measurement noise, such a regularization term is critical for achieving a well-behaved closed-loop performance.     

基于机器人三维模拟仿真的焊接生产线柔性主拼技术研究

为满足生产线柔性设计需求, 对柔性焊接生产线解决方案的难点进行了分析, 提出了基于机器人三维模拟仿真的生产线柔性主拼技术方案, 建立了机器人负载边界模型和基于负载边界模型的机器人选型及快换装置选型方案, 提出了网格式夹具设计方法, 以白车身柔性焊装生产线为例, 建立了面向柔性的网格式夹具设计方案以及网格式装配检测及应力分析, 并对面向柔性主拼中的离线编程技术及三维仿真中的项目权限管理和工作站模拟仿真工作流程进行了分析。该方案在某汽车厂NL-1&NL-2两个车型项目生产线的设计中应用焊接生产线上进行了应用验证, 能满足两车型生产线柔性主拼的需求。