This paper analyzes the use of the, previously proposed, Parallel Single Front Genetic Algorithm (PSFGA) in applications in which the objective functions, the restrictions, and hence also solutions can change over the time. These dynamic optimization problems appear in quite different real applications with relevant socio-economic impacts. PSFGA uses a master process that distributes the popula...

Three-dimensional (3D) integration is promising to provide dramatic performance and energy efficiency improvement to 3D logic-DRAM integrated computing system, but also poses significant challenge to the yield. To address this challenge, this paper explores a way to leverage logic-DRAM co-design to reactivate unused spares and thereby enable the cost-efficient technique to repair 3D integration...

Dynamically allocating computing nodes to parallel applications is a promising technique for improving the utilization of cluster resources. Detailed simulations can help identify allocation strategies and problem decomposition parameters that increase the efficiency of parallel applications. We describe a simulation framework supporting dynamic node allocation which, given a simple cluster mod...

Recent approaches in meter tracking have successfully applied Bayesian models. While the proposed models can be adapted to different musical styles, the applicability of these flexible methods so far is limited because the application of exact inference is computationally demanding. More efficient approximate inference algorithms using particle filters (PF) can be developed to overcome this lim...

This correspondence describes an approach to reducing the computational cost of document image decoding by viewing it as a heuristic search problem. The kernel of the approach is a modi ed dynamic programming (DP) algorithm, called the iterated complete path (ICP) algorithm, that is intended for use with separable source models. A set of heuristic functions are presented for decoding formatted ...

We consider a hybrid wireless sensor network consisting of static and mobile sensors, where each static sensor can detect an event of only one type while each mobile sensor can analyze events of multiple types. Static sensors monitor the environment and report where events appear in the sensing field. Then, mobile sensors are dispatched to reach these event locations to perform more in-depth an...

Design of active orthosis is a challenging problem from both the dynamic simulation and control points of view. The redundancy problem of the simultaneous human-orthosis actuation is an interesting exercise to solve concerning the analytical and computational cost effectiveness. The physiological static optimization approach tries to solve the actuation sharing problem. Its objective is to quan...

Many common approaches to detecting changepoints, for example based on statistical criteria such as penalised likelihood or minimum description length, can be formulated in terms ofminimising a cost over segmentations. We focus on a class of dynamic programming algorithms that can solve the resulting minimisation problem exactly, and thus find the optimal segmentation under the given statistica...

In this paper, we develop a novel algorithm which finds a subset of Pareto front of a Multi-Objective Distributed Constraint Optimization Problem. This algorithm utilizes the Lp-norm method, pseudo-tree, and Dynamic Programming technique. Furthermore, we show that this Lp-norm based algorithm can only guarantee to find a Pareto optimal solution, when we employ L1-norm (Manhattan norm).

The reliable forward engineering of genetic systems remains limited by the ad hoc reuse of many types of basic genetic elements. Although a few intrinsic prokaryotic transcription terminators are used routinely, termination efficiencies have not been studied systematically. Here, we developed and validated a genetic architecture that enables reliable measurement of termination efficiencies. We ...