From: couchot Date: Thu, 12 Dec 2013 14:38:32 +0000 (+0100) Subject: totot X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/desynchronisation-controle.git/commitdiff_plain/74148119c4eab3cb701943974e740e25f9ab0c7a?ds=inline;hp=e02082ad2d87032e8cff4fa8cc48682c85efc624 totot --- diff --git a/IWCMC14/convex.png b/IWCMC14/convex.png index 2279c17..87e488c 100644 Binary files a/IWCMC14/convex.png and b/IWCMC14/convex.png differ diff --git a/IWCMC14/convexity.tex b/IWCMC14/convexity.tex index de0ddbc..d88481c 100644 --- a/IWCMC14/convexity.tex +++ b/IWCMC14/convexity.tex @@ -12,6 +12,10 @@ The function inside the $\arg \min$ is strictly convex if and only if $\lambda_h$ is not null. This asymptotic configuration may arise due to the definition of $\lambda_h$. Worth, in this case, the function is strictly decreasing and the minimal value is obtained when $p$ is the infinity. +Thus, the method follows its iterative calculus +with an arbitrarely large value for $P_{sh}^{(k)}$. This leads to +a convergence which is dramatically slow down. + To prevent this configuration, we replace the objective function given in equation~(\ref{eq:obj2}) by @@ -59,9 +63,8 @@ one which is convex guarantee. The Figure~\ref{Fig:convex} summarizes the average number of convergence iterations for each treshold value. As we can see, even if this new enhanced method introduces new calculus, -it only slows few down the algorithm and guarantee the convexity, +it speeds up the algorithm and guarantees the convexity, and thus the convergence. -Notice that the encoding power has been arbitrarily limited to 10 W. \begin{figure*} \begin{center} \includegraphics[scale=0.5]{convex.png} diff --git a/IWCMC14/main.tex b/IWCMC14/main.tex index bd4e952..4be8723 100644 --- a/IWCMC14/main.tex +++ b/IWCMC14/main.tex @@ -25,7 +25,7 @@ \author{ - Jean-Fran\c{c}cois Couchot, \and + Jean-Fran\c{c}cois COuchot, \and Ahmed Mostefaoui\\ FEMTO-ST Institute, UMR 6174 CNRS\\ DISC Department, University of Franche-Comt\'{e}\\ @@ -107,7 +107,7 @@ %\bibliographystyle{compj} \bibliographystyle{IEEEtran} -\bibliography{abbrev,biblioand} +\bibliography{biblioand,abbrev}