This paper examines the problem of designing the optimal hybrid form FIR filter subjected to a minimum cycletime constraint. We formulate the problem as one of determining the optimal partitioning of the hybrid form FIR filter into subsections. Each subsection can be optimized independently using other methods. We then show how the problem can be solved efficiently using a dynamic programming a...

Article history: Received 28 May 2015 Received in revised form 14 September 2016 Accepted 27 October 2016 Available online 9 November 2016 The development of theories and techniques for big data analytics offers tremendous possibility for investigating large-scale events and patterns that emerge over space and time. In this research, we utilize a unique open dataset “The Global Data on Events, ...

Computing polytopic controlled invariant sets which are maximal inside a prescribed region often yields sets which have a really complex representation. Since the associated control has a complexity which drastically increases with that of the region, this turns out to be a major problem in the implementation of the theory of controlled invariant regions. In this paper, we consider the problem ...

In this paper 1 we present a novel no-reference (NR) metric to measure block impairment (blockiness) in JPEGcoded images. The proposed metric integrates several key human visual sensitivity factors such as edge amplitude, edge length, background activity and background luminance to evaluate the effect of block edge impairment on perceived image quality. The subjective test results of our metric...

Time series classification in the dissimilarity space combines the advantages of the dynamic time warping and the rich mathematical structure of Euclidean spaces. We applied dimension reduction using PCA followed by support vector learning on dissimilarity representations to 43 UCR datasets. Results indicate that time series classification in dissimilarity space has potential to complement the ...

Unlike delta-hedging or similar methods based on Greeks, global hedging is an approach that optimizes some terminal criterion that depends on the difference between the value of a derivative security and that of its hedging portfolio at maturity or exercise. Global hedging methods in discrete time can be implemented using dynamic programming. They provide optimal strategies at all rebalancing d...

A new efficient dynamic programming (DP) algorithm for 2D elastic matching is proposed. The present DP algorithm requires by far less complexity than previous DPbased elastic matching algorithms. This complexity reduction results from piecewise linearization of a 2D-2D mapping which specifies an elastic matching between two given images. Since this linearization can be guided by a priori knowle...