Edge detection remains a crucial stage in numerous image processing applications. Thus, an edge detection technique needs to be assessed before use it in a computer vision task. As dissimilarity evaluations depend strongly of a ground truth edge map, an inaccurate datum in terms of localization could advantage inaccurate precise edge detectors or/and favor inappropriate a dissimilarity evaluati...

For two vertices u and v of a graph G, the set I(u, v) consists of all vertices lying on some u − v geodesic in G. If S is a set of vertices of G, then I(S) is the union of all sets I(u, v) for u, v ∈ S. A set S is a geodetic set if I(S) = V (G). A minimum geodetic set is a geodetic set of minimum cardinality and this cardinality is the geodetic number g(G). A subset T of a minimum geodetic set...

We consider a network design problem in which flow bifurcations are allowed. The demand data are assumed to be uncertain, and the uncertainties of demands are expressed by an uncertainty set. The goal is to install facilities on the edges at minimum cost. The solution should be able to deliver any of the demand requirements defined in the uncertainty set. We propose an exact solution algorithm ...

A novel approach of edge detection is proposed that utilizes a bidimensional empirical mode decomposition (BEMD) method as the primary tool. For this purpose, a recently developed fast and adaptive BEMD (FABEMD) is used to decompose the given image into several bidimensional intrinsic mode functions (BIMFs). In FABEMD, order statistics filters (OSFs) are employed to get the upper and lower enve...

A subset S of vertices in a graph G is called a geodetic set if every vertex not in S lies on a shortest path between two vertices from S. A subset D of vertices in G is called dominating set if every vertex not in D has at least one neighbor in D. A geodetic dominating set S is both a geodetic and a dominating set. The geodetic (domination, geodetic domination) number g(G)(γ(G), γg(G)) of G is...

Let $G$ be a finite group. The prime graph of $G$ is a graph $Gamma(G)$ with vertex set $pi(G)$, the set of all prime divisors of $|G|$, and two distinct vertices $p$ and $q$ are adjacent by an edge if $G$ has an element of order $pq$. In this paper we prove that if $Gamma(G)=Gamma(G_2(5))$, then $G$ has a normal subgroup $N$ such that $pi(N)subseteq{2,3,5}$ and $G/Nequiv G_2(5)$.

• Decompose the global thermodynamic entropy of a network into components associated with its edges. Calculate edge from partition functions classical and quantum statistics. Apply on synthetic real-world networks to evaluate qualitative quantitative differences in performance. In previous study, we have explored how decompose using graph-spectral decomposition technique. Here, develop this wor...

In this paper, we discuss vector and parallel tuning of GeoFEM and the Householder QR decomposition process being solid earth simulation codes. Process of GeoFEM code can be roughly divided into two parts, Matrix Assemble part and Solver part. Currently, GeoFEM's parallel iterative solver has attained good parallel and vector performance, and GeoFEM's Matrix Assemble part has attained good para...

The Earth’s surface is under the continuous influence of a variety of natural forces and human induced sources. Strain data are good examples of such disturbed signals. To determine the geodetic strain behavior before and after the 2003 Tokachi-oki earthquake (M8.0), we decomposed the disturbed strain data into trend, air pressure, earth tide, and precipitation responses components. The decompo...