voltage stability issues are growing challenges in many modern power systems. this paper proposes optimizing the size and location of static var compensator (svc) devices using a fuzzy weighted seeker optimization algorithm (fwsoa), as an effective solution to overcome such issues. although the primary purpose of svc is bus voltage regulation, it can also be useful for voltage stability enhance...

Numerical experiments in literature on compressed sensing have indicated that the reweighted l1 minimization performs exceptionally well in recovering sparse signal. In this paper, we develop exact recovery conditions and algorithm for sparse signal via weighted l1 minimization from the insight of the classical NSP (null space property) and RIC (restricted isometry constant) bound. We first int...

BACKGROUND Minimization is a case allocation method for randomized controlled trials (RCT). Evidence suggests that the minimization method achieves balanced groups with respect to numbers and participant characteristics, and can incorporate more prognostic factors compared to other randomization methods. Although several automatic allocation systems exist (e.g., randoWeb, and MagMin), the minim...

In this paper, we first detail the geodesic matching of images which consists in minimizing an energy resulting from a Riemannian metric on a manifold of images, which itself comes from the projection of a Riemannian metric on a deformation group onto the image manifold. We will then present an energy minimization technique based on a wavelet analysis of the deformation and finally some applica...

For a non-negative integer k, a language is k-piecewise testable (k-PT) if it is a finite boolean combination of languages of the form Σa1Σ · · ·ΣanΣ for ai ∈ Σ and 0 ≤ n ≤ k. We study the following problem: Given a DFA recognizing a piecewise testable language, decide whether the language is k-PT. We provide a complexity bound and a detailed analysis for small k’s. The result can be used to fi...

Data warehouses (DWs) can become inconsistent when some dimensional constraints are not satisfied by the dimension instances. In this paper, we present preliminary results about the effects of the violation of partitioning constraints in homogeneous dimension instances over aggregation queries, and in particular over the summarizability property (SUMM) of the DWs. We are interested in finding w...

Let L(M) be the (factorial) language avoiding a given anti-factorial language M. We design an automaton accepting L(M) and built from the language M. The construction is eeective if M is nite. If M is the set of minimal forbidden words of a single word v, the automaton turns out to be the factor automaton of v (the minimal automaton accepting the set of factors of v). We also give an algorithm ...

We consider the classical statistical learning/regression problem, when the value of a real random variable Y is to be predicted based on the observation of another random variableX . Given a class of functions F and a sample of independent copies of (X,Y ), one needs to choose a function f̂ from F such that f̂(X) approximates Y as well as possible, in the mean-squared sense. We introduce a new p...

This paper presents a new approach to synthesize face images under different pose changes given a single input image. The approach is based on two observations: 1. a series of face images of a single person under different poses could be mapped to a smooth manifold in the unified feature space. 2. the manifolds from different faces are separated from each other by their dissimilarities. The new...

In this talk, we study a fast total variation minimization method for image restoration. In the proposed method, we use the exact total variation minimization scheme to denoise the deblurred image. An alternating minimization algorithm is employed to solve the proposed total variation minimization problem. Our experimental results show that the quality of restored images by the proposed method ...