The study examines alternative on-board energy management system (EMS) supervisory control algorithms for plug-in hybrid electric vehicles. optimum fuel consumption was sought between an equivalent minimization strategy (ECMS) algorithm and a back-engineered commercial rule-based (RB) one, under different operating conditions. RB first validated with experimental data. A method to assess identi...

One of the recently suggested solutions for enhancing fuel economy and lifetime in a cell (FC) hybrid electric vehicle (HEV) is use multi-stack (MS) structure FC system. However, to fully realize potential this structure, design an appropriate energy management strategy (EMS) necessary. This paper aims compare operating cost, including hydrogen consumption degradation FC, between single-stack (...

We address the problem of multi-class classification in the case where the number of classes is very large. We propose a double sampling strategy on top of a multi-class to binary reduction strategy, which transforms the original multi-class problem into a binary classification problem over pairs of examples. The aim of the sampling strategy is to overcome the curse of long-tailed class distrib...

In this paper, we propose a new method for synthetic aperture radar (SAR) image despeckling via L0-minimization strategy, which aims to smooth homogeneous areas while preserve significant structures in SAR images. We argue that the gradients of the despeckled images are sparse and can be pursued by L0-norm minimization. We then formularize the despeckling of SAR images as a global L0 optimizati...

in this paper, we study the problem of minimizing the ratio of two quadratic functions subject to a quadratic constraint. first we introduce a parametric equivalent of the problem. then a bisection and a generalized newton-based method algorithms are presented to solve it. in order to solve the quadratically constrained quadratic minimization problem within both algorithms, a semidefinite optim...

We improve a recent result [A. Badr: Hyper-Minimization in O(n). In Proc. CIAA, LNCS 5148, 2008] for hyper-minimized finite automata. Namely, we present an O(n logn) algorithm that computes for a given finite deterministic automaton (dfa) an almost equivalent dfa that is as small as possible—such an automaton is called hyper-minimal. Here two finite automata are almost equivalent if and only if...