The aim of this paper is to introduce and study the notions of fuzzy upper $e$-limit set, fuzzy lower $e$-limit set and fuzzy $e$-continuously convergent functions. Properties and basic relationships among fuzzy upper $e$-limit set, fuzzy lower $e$- limit set and fuzzy $e$-continuity are investigated via fuzzy $e$-open sets.

In this paper, we introduce two algorithms to address the two-echelon capacitated location-routing problem (2E-CLRP). We introduce a branch-and-cut algorithm based on the solution of a new two-index vehicle-flow formulation, which is strengthened with several families of valid inequalities. We also propose an adaptive large-neighbourhood search (ALNS) meta-heuristic with the objective of findin...

In this paper, we re-examine the cellular automata (CA) algorithm to show that the result of its state evolution converges to that of the shortest path algorithm. We proposed a complete tumor segmentation method on post contrast T1 MR images, which standardizes the VOI and seed selection, uses CA transition rules adapted to the problem and evolves a level set surface on CA states to impose spat...

For a graph G, the P2-path graph, P2(G), has for vertices the set of all paths of length 2 in G. Two vertices are connected when their union is a path or a cycle of length 3. We present lower bounds on the edge-connectivity, (P2(G)) of a connected graph G and give conditions for maximum connectivity. A maximally edge-connected graph is superif each minimum edge cut is trivial, and it is optimum...

We show that every (sub)cubic n-vertex graph with sufficiently large girth has fractional chromatic number at most 2.2978 which implies that it contains an independent set of size at least 0.4352n. Our bound on the independence number is valid to random cubic graphs as well as it improves existing lower bounds on the maximum cut in cubic graphs with large girth.

Second language (L2) research often involves analyses of acoustic measures of fluency. The studies investigating fluency, however, have been difficult to compare because the measures of fluency that were used differed widely. One of the differences between studies concerns the lower cut-off point for silent pauses, which has been set anywhere between 100 ms and 1000 ms. The goal of this paper i...

Graphs Sparsification aims at compressing large graphs into smaller ones while (approximately) preserving important characteristics of the input graph. In this work we study Vertex Sparsifiers, i.e., sparsifiers whose goal is to reduce the number of vertices. More concretely, given a weighted graph G = (V,E), and a terminal set K with |K| = k, a quality q vertex cut sparsifier of G is a graph H...

A rough set is a formal approximation of a crisp set which gives lower and upper approximation of original set to deal with uncertainties. The concept of neutrosophic set is a mathematical tool for handling imprecise, indeterministic and inconsistent data. In this paper, we introduce the concepts of Rough Fuzzy Neutrosophic Sets and Fuzzy Neutrosophic Rough Sets and investigate some of their pr...