A knowledge-based archive multi-objective simulated annealing algorithm to optimize series–parallel system with choice of redundancy strategies

Redundancy allocation problem (RAP) is one of the best-developed problems in reliability engineering studies. This problem follows to optimize the reliability of a system containing s sub-systems under different constraints, including cost, weight, and volume restrictions using redundant components for each sub-system. Various solving methodologies have been used to optimize this problem, including exact, heuristic, and meta-heuristic algorithms. In this paper, an efficient multi-objective meta-heuristic algorithm based on simulated annealing (SA) is developed to solve multi-objective RAP (MORAP). This algorithm is knowledge-based archive multi-objective simulated annealing (KBAMOSA). KBAMOSA applies a memory matrix to reinforce the neighborhood structure to achieve better quality solutions. The results analysis and comparisons demonstrate the performance of the proposed algorithm for solving MORAP.     

3COM交换机技术及应用

本文介绍了3COM Superstack ⅡSwitch 3300 的主要特性及其在局域网中的实际应用，评述了冗余网络的构造等问题。     

On the relationships among latent variables and residuals in PLS path modeling: The formative-reflective scheme

A new approach for the estimation and the validation of a structural equation model with a formative-reflective scheme is presented. The basis of the paper is a proposal for overcoming a potential deficiency of PLS path modeling. In the PLS approach the reflective scheme assumed for the endogenous latent variables (LVs) is inverted; moreover, the model errors are not explicitly taken into account for the estimation of the endogenous LVs. The proposed approach utilizes all the relevant information in the formative manifest variables (MVs) providing solutions which respect the causal structure of the model. The estimation procedure is based on the optimization of the redundancy criterion. The new approach, entitled redundancy analysis approach to path modeling (RA-PM) is compared with both traditional PLS Path Modeling and LISREL methodology, on the basis of real and simulated data.     

Location and calculation-free node-scheduling schemes in large wireless sensor networks

In wireless sensor networks that consist of a large number of low-power, short-lived, unreliable sensors, one of the main design challenges is to obtain long system lifetime without sacrificing system original performance (sensing coverage and sensing reliability). To solve this problem, one of the potential approaches is to identify redundant nodes at the sensing interface and then assign them an off-duty operation mode that has lower energy consumption than the normal on-duty mode. In our previous work [J. Wireless Commun. Mobile Comput. 3 (2003) 271; Processing of ACM Wireless Sensor Network and Application Workshop 2002, September 2002], we proposed a node-scheduling scheme, which can provide a 100% sensing coverage preservation capability. This, however, requires each node to be aware of its own and its neighbors’ location information. Also, in that scheme, each node has to do accurate geometrical calculation to determine whether to take an off-duty status. In this paper, we propose and study several alternative node-scheduling schemes, which cannot completely preserve the original system coverage, but are nonetheless light-weighted and flexible compared with the previous one. Our simulation results compare these schemes with the previous one and demonstrate their effectiveness.     

2D artificial life system using network-type assembly-like language: influence of change in environment with costs of instructions

To unlock the full potential of evolution in digital media, a Tierra-like system using network-type assembly-like language has been constructed. In the system, like Avida, digital creatures, self-replicating programs, live in a discrete 2D torus space and an interaction between creatures is restricted locally. Bearing a genetic network in mind, network structure is introduced. In the previous works, it is shown that the possibility that the network-type model has more potential of evolution than a linear-type model like Avida in a simple environment. In this paper, to study the potential of evolution more precisely, we model the effects of environment other than creatures. As one of the simplest models of such environment, the cost of execution, i.e. executing time, is introduced. The difficult environment to live in costs high to execute instructions, the easy environment does low. In computer experiments, we have investigated the influence of change in environment by analyzing the process of evolution and diversity of the system. Experimental results show that the network-type system keeps more stable diversity than the linear-type system does, even when the environment changes drastically. This indicates the possibility that the network-type system has more potential of evolution than the linear-type system has. This work was presented in part at the 13th International Symposium on Artificial Life and Robotics, Oita, Japan, January 31–February 2, 2008     

设计沟通中的噪音——从传播学角度看设计沟通中的困难

文章从传播学的角度探讨设计沟通过程中的困难。设计沟通是贯穿于整个设计管理活动的重要环节,是传达信息的主要途径,但在实践过程中却经常遇到困难,导致设计活动无法顺利进行。文章通过引入噪音的概念,分析设计沟通的困难产生的原因,并利用传播学的理论提出通过冗余调节噪音的想法,以解决设计沟通中的问题。     

Automated synthesis of multiple analog circuits using evolutionary computation for redundancy-based fault-tolerance

Analog circuits are one of the most important parts of modern electronic systems and the failure of electronic hardware presents a critical threat to the completion of modern aircraft, spacecraft, and robot missions. Compared to digital circuits, designing fault-tolerant analog circuits is a difficult and knowledge-intensive task. A simple but powerful method for robustness is a redundancy approach to use multiple circuits instead of single one. For example, if component failures occur, other redundant components can replace the functions of broken parts and the system can still work. However, there are several research issues to make the redundant system automatically. In this paper, we used evolutionary computation to generate multiple analog circuits automatically and then we combined the solutions to generate robust outputs. Evolutionary computation is a natural way to produce multiple redundant solutions because it is a population-based search. Experimental results on the evolution of the low-pass, high-pass and band-stop filters show that the combination of multiple evolved analog circuits produces results that are more robust than those of the best single circuit.     

缩短机械加工中零件等待时间的方法讨论

在机械制造系统中，零件在各工序间加工及流转，一般情况下许多工序难免存在零件等待加工的现象。为了提高系统的加工性能，本文利用现代仿真技术及排队论，通过优化工件在各相关工序的加工时间，从而消除工序中存在的工件等待加工现象。文章提出的方法还可用来预测机械制造系统的运行性能、比较各种可供选择的方案以及实现制造系统决策的优化。     

A hybrid vendor managed inventory and redundancy allocation optimization problem in supply chain management: An NSGA-II with tuned parameters

In this research, a bi-objective vendor managed inventory model in a supply chain with one vendor (producer) and several retailers is developed, in which determination of the optimal numbers of different machines that work in series to produce a single item is considered. While the demand rates of the retailers are deterministic and known, the constraints are the total budget, required storage space, vendor's total replenishment frequencies, and average inventory. In addition to production and holding costs of the vendor along with the ordering and holding costs of the retailers, the transportation cost of delivering the item to the retailers is also considered in the total chain cost. The aim is to find the order size, the replenishment frequency of the retailers, the optimal traveling tour from the vendor to retailers, and the number of machines so as the total chain cost is minimized while the system reliability of producing the item is maximized. Since the developed model of the problem is NP-hard, the multi-objective meta-heuristic optimization algorithm of non-dominated sorting genetic algorithm-II (NSGA-II) is proposed to solve the problem. Besides, since no benchmark is available in the literature to verify and validate the results obtained, a non-dominated ranking genetic algorithm (NRGA) is suggested to solve the problem as well. The parameters of both algorithms are first calibrated using the Taguchi approach. Then, the performances of the two algorithms are compared in terms of some multi-objective performance measures. Moreover, a local searcher, named simulated annealing (SA), is used to improve NSGA-II. For further validation, the Pareto fronts are compared to lower and upper bounds obtained using a genetic algorithm employed to solve two single-objective problems separately.