Dependency Risk Graphs have been proposed as a tool to analyze the cascading failures of Critical Infrastructure (CI) dependency chains. However, dependency chain analysis is not by itself sufficient for developing an efficient risk mitigation strategy, i.e. a strategy that defines which CI nodes should have high priority for the application of mitigation controls, in order to achieve the optim...

Text in camera based image carries important information for visual content understanding and retrieval. Locating text from complex background is a challenge task and complex structure of Chinese words make it harder. In this paper, we develop an application which is targeted toward smart phone with camera. Our goal is to enable the smart phone to detect Chinese words in nature scenes. First of...

Given an undirected network with link capacities and a set of commodities with known demands, this paper addresses the problem of determining D (with D = 2, 3) hop-constrained node disjoint paths for each commodity while minimizing the average or the maximum number of hops of all relevant paths. These paths are defined according to two survivability mechanisms: Path Diversity and Path Protectio...

A reflexive graph is a simple undirected graph where a loop has been added at each vertex. If G and H are reflexive graphs and U ⊆ V (H), then a vertex map f : U → V (G) is called nonexpansive if for every two vertices x, y ∈ U , the distance between f(x) and f(y) in G is at most that between x and y in H . A reflexive graph G is said to have the extension property (EP) if for every reflexive g...

In this paper, we prepare segmenting the brain portion Magnetic Resonance Image (MRI). In our method, we first find the threshold using Riddler’s method and convert gray image to binary image. The head boundaries are detected by using contour of the head. By subtracting, we detect the scalp and remove it. We perform morphological operation to disconnect the non-brain region. Finally, by applyin...

For a graph H and an integer n, the Turán number ex(n,H) is the maximum possible number of edges in a simple graph on n vertices that contains no copy of H . H is rdegenerate if every one of its subgraphs contains a vertex of degree at most r. We prove that, for any fixed bipartite graph H in which all degrees in one colour class are at most r, ex(n,H) O(n2−1/r). This is tight for all values of...

∗The authors thank the financial support received from Grant UNAM-PAPIIT IN114415 and SEP-CONACyT. Also, the first author would like to thank the support of the Post-Doctoral Fellowships program of DGAPA-UNAM. †email: [email protected] (Corresponding Author) ‡[email protected] §[email protected] 1 ar X iv :1 70 5. 00 21 6v 1 [ m at h. C O ] 2 9 A pr 2 01 7 A vertex cover of a grap...

Kim, C. and D.H. Lee, Separating k-separated eNCE graph languages, Theoretical Computer Science 120 (1993) 247-259. An eNCE graph grammar is k-separated (k > 1) if the distance between any two nonterminal nodes in any of its sentential forms is at least k. Let SEP, denote the class of graph languages generated by SEPl (SEP2) is the class of eNCE (boundar E) graph languages, Recently, Engelfriet...