This paper uses a modified Dijkstra shortest path method for considering cumulative delays rather than bandwidth in software-defined networks. To implement the proposed method, an open-source Ryu controller is used, and Mininet tool used to emulate topology. The compared with traditional Dijkstra’s algorithm demonstrate its performance. comparison shows that provides higher performance of diffe...

We propose a continuous-time second-order optimization algorithm for solving unconstrained convex problems with bounded Hessian. show that this alternative has comparable convergence rate to of the Newton–Raphson method, however structurally, it is amenable more efficient distributed implementation. present implementation our proposed and prove its via Lyapunov analysis. A numerical example dem...

We study the problem of computing the diameter of a  set of $n$ points in $d$-dimensional Euclidean space for a fixed dimension $d$, and propose a new $(1+varepsilon)$-approximation algorithm with $O(n+ 1/varepsilon^{d-1})$ time and $O(n)$ space, where $0 < varepsilonleqslant 1$. We also show that the proposed algorithm can be modified to a $(1+O(varepsilon))$-approximation algorithm with $O(n+...

Abstract: A Mura (also called “alluck”) defect that causes local deterioration of colors or brightness on a LCD(liquid crystal display) panel is one of the critical issues in display manufacturing. In this paper, we propose mura detection method using frequency filtering. As a mean of frequency filtering to eliminate the low frequency background term, subtraction of the averaged image from the ...

In light of recent advances in genetic-algorithm-driven automated program modi€cation, our team has been actively exploring the art, engineering, and discovery of novel semantics-preserving transforms. While modern compilers represent some of the best ideas we have for automated program modi€cation, current approaches represent only a small subset of the types of transforms which can be achieve...