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.     

A self‐scalable load injection service

Load testing of applications is an important and costly activity for software provider companies. Classical solutions are very difficult to set up statically, and their cost is prohibitive in terms of both human and hardware resources. Virtualized cloud computing platforms provide new opportunities for stressing an application's scalability, by providing a large range of flexible and less expensive (pay‐per‐use model) computation units. On the basis of these advantages, load testing solutions could be provided on demand in the cloud. This paper describes a Benchmark‐as‐a‐Service solution that automatically scales the load injection platform and facilitates its setup according to load profiles. Our approach is based on: (i) virtualization of the benchmarking platform to create self‐scaling injectors; (ii) online calibration to characterize the injector's capacity and impact on the benched application; and (iii) a provisioning solution to appropriately scale the load injection platform ahead of time. We also report experiments on a benchmark illustrating the benefits of this system in terms of cost and resource reductions. Copyright © 2013 John Wiley & Sons, Ltd.     

Mining fleet management systems: a review of models and algorithms

The objective of this paper is to review and document the mine fleet management systems’ models and algorithms. The purpose is to understand the algorithms behind the fleet management systems and the proposed academic solutions in this area to identify any gaps in the current literature and to open up opportunities to establish research questions that need to be addressed in an integrated simulation and optimisation operational planning research framework. In this paper, we review industrial fleet management systems and the main academic algorithms behind such systems. The fleet management systems are divided into three subsequently related problems to review: shortest path, production optimisation and real-time dispatching. Finally, the limitations of current algorithms for fleet management systems are documented in terms of mining practice feasibility and optimality of the solution on large-scale problems. The results of this literature review enable us to evaluate the logical links between major components of an integrated simulation and optimisation operational planning framework with current theory of fleet management systems.     

流域泥沙灾害与泥沙资源性的研究

泥沙灾害与泥沙资源性是流域泥沙的重要属性,二者在一定条件下可以相互转化。本文论述了泥沙淤积、泥沙冲刷、岸滩崩塌、山地崩塌与泥石流、粗沙淤积的土地沙化等泥沙灾害,指出泥沙灾害具有时空分布的不均匀性、渐变性或突发性、群发性、转化性及危害严重性等;流域泥沙资源化的主要途径包括填海造陆及造地、引洪淤灌、堤防淤临淤背、建筑材料、湿地形成(河流、湖泊与河口海岸)等,指出流域泥沙资源化及其优化配置既要解决思想观念、基本理论、目标效益等方面的问题,还要考虑与水资源联合配置问题。     

随机库存分配问题的一种求解方法

讨论了在VMI管理思想下对具有随机需求特性的多客户库存分配问题 ,重点论述了有效近似算法的设计过程 ,最后基于一组模拟数据给出了一个算例。     

MULTICARRIER DS—CDMA WITH ADAPTIVE MODULATION AND POWER ALLOCATION

Adaptive modulation and power allocation is introduced into the multicarrier DSCDMA system to improve the system performance and bandwidth efficiency.First,the system design appropriate for adaptive modulation and power allocation is given,then the algorithm of adaptive modulation and power allocation is applied.Simulation results demonstrate great performance improvement compared with the fixed modulated one.     

一种有效的优化的多载波通信系统的功率分配算法

本文提出一种关于DMT系统传输纯数据流业务的最佳的功率分配算法，该算法使用了一种有效的表格查手工艺工和拉格朗日乘法器对分搜索办法，能够较快的收敛到最佳的功率点。同时，易于用硬件和软件实现。     

VaR and ES for linear portfolios with mixture of elliptic distributions risk factors

In this paper, we generalize the Linear VaR method from portfolios with normally distributed risk factors to portfolios with mixture of elliptically distributed ones. We treat both the Expected Shortfall and the Value-at-Risk of such portfolios. Special attention is given to the particular case of a mixture of multivariate t-distributions. This is a part of J. SADEFO-KAMDEM PhD Thesis[12] of the Université de Reims, France . It has been presented at the workshop on modelling and computation in Financial Engineering at Bad Herrenalb, Germany May 6-8, 2003. The author is an associate professor at the Department of mathematics, université d’Evry Val d’Essonne.     

Serial deployment of attention during visual search.

This study examined whether objects are attended in serial or in parallel during a demanding visual search task. A component of the event-related potential waveform, the N2pc wave, was used as a continuous measure of the allocation of attention to possible targets in the search arrays. Experiment 1 demonstrated that the relative allocation of attention shifts rapidly, favoring one item and then another. In Experiment 2, a paradigm was used that made it possible to track the absolute allocation of attention to individual items. This experiment showed that attention was allocated to one object for 100-150 ms before attention began to be allocated to the next object. These findings support models of attention that posit serial processing in demanding visual search tasks. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Seeking the truth about ad hoc join costs

In this paper, we re-examine the results of prior work on methods for computing ad hoc joins. We develop a detailed cost model for predicting join algorithm performance, and we use the model to develop cost formulas for the major ad hoc join methods found in the relational database literature. We show that various pieces of “common wisdom” about join algorithm performance fail to hold up when analyzed carefully, and we use our detailed cost model to derive op timal buffer allocation schemes for each of the join methods examined here. We show that optimizing their buffer allocations can lead to large performance improvements, e.g., as much as a 400% improvement in some cases. We also validate our cost model's predictions by measuring an actual implementation of each join algorithm considered. The results of this work should be directly useful to implementors of relational query optimizers and query processing systems. Edited by M. Adiba. Received May 1993 / Accepted April 1996