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.     

Apparent power-law distributions in animal movements can arise from intraspecific interactions

Lévy flights have gained prominence for analysis of animal movement. In a Lévy flight, step-lengths are drawn from a heavy-tailed distribution such as a power law (PL), and a large number of empirical demonstrations have been published. Others, however, have suggested that animal movement is ill fit by PL distributions or contend a state-switching process better explains apparent Lévy flight movement patterns. We used a mix of direct behavioural observations and GPS tracking to understand step-length patterns in females of two related butterflies. We initially found movement in one species (Euphydryas editha taylori) was best fit by a bounded PL, evidence of a Lévy flight, while the other (Euphydryas phaeton) was best fit by an exponential distribution. Subsequent analyses introduced additional candidate models and used behavioural observations to sort steps based on intraspecific interactions (interactions were rare in E. phaeton but common in E. e. taylori). These analyses showed a mixed-exponential is favoured over the bounded PL for E. e. taylori and that when step-lengths were sorted into states based on the influence of harassing conspecific males, both states were best fit by simple exponential distributions. The direct behavioural observations allowed us to infer the underlying behavioural mechanism is a state-switching process driven by intraspecific interactions rather than a Lévy flight.     

Graph-based video fingerprinting using double optimal projection

A double optimal projection method that involves projections for intra-cluster and inter-cluster dimensionality reduction are proposed for video fingerprinting. The video is initially set as a graph with frames as its vertices in a high-dimensional space. A similarity measure that can compute the weights of the edges is then proposed. Subsequently, the video frames are partitioned into different clusters based on the graph model. Double optimal projection is used to explore the optimal mapping points in a low-dimensional space to reduce the video dimensions. The statistics and geometrical fingerprints are generated to determine whether a query video is copied from one of the videos in the database. During matching, the video can be roughly matched by utilizing the statistics fingerprint. Further matching is thereafter performed in the corresponding group using geometrical fingerprints. Experimental results show the good performance of the proposed video fingerprinting method in robustness and discrimination.     

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

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

微制造平台微振动的最优控制

采用混合隔振技术建立了微制造平台隔振系统。该系统以空气弹簧和橡胶层作为被动隔振元件、超磁致伸缩致动器作为主动隔振元件，并采用最优控制理论设计其主动控制器。研究了在不同的性能指标加权阵的情况下，该主动振动控制系统对基础干扰和由微制造设备产生的直接干扰所引起的微制造平台振动的控制效果。研究表明性能指标加权阵对振动控制效果影响非常大。通过大量的仿真实验确定了一组性能指标加权阵，使所设计的主动控制系统能在较宽的频率范围对基础干扰和直接干扰所引起的微制造平台振动进行有效的控制。     

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

本文提出一种关于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