This paper surveys the applications of Smarandache’s notion to graph theory appeared in International J.Math.Combin. from Vol.1,2008 to Vol.3,2009. In fact, many problems discussed in these papers are generalized in this paper. Topics covered in this paper include: (1)What is a Smarandache System? (2)Vertex-Edge Labeled Graphs with Applications: (i)Smarandachely k-constrained labeling of a grap...

Di erent security policy models have been developed andpublished in the past. Proven security policy models, if correctly im-plemented, guarantee the protection of data objects from unauthorizedaccess or usage or prevent an illegal information ow. To verify that asecurity policy model has been correctly implemented, it is importantto de ne and execute an exhaustive list of t...

In this paper, we propose a graph structure which captures important data streams. This graph can be easily maintained and mined for frequent item sets as well as various other patterns like constrained item sets. This graph captures the contents of transaction in a window and arranges nodes according to some canonical order that is unaffected by changes in item frequency. This graph structure ...

asthma is a disorder of increasing severity and prevalence. recent knowledge about the pathogenesis of asthma emphasizes its inflammatory nature. cpg oligonucleotides are a class of compounds containing motifs based on the cytosine-guanine dinucleotides (cpg-odns). these motifs are suppressed in mammalian dna. they induce inflammation in mammals characterized by the induction of t helper type 1...

In this paper, we propose methods for proving termination of constrained term rewriting systems, where constraints are interpreted by built-in semantics given by users, and rewrite rules are assumed to be sound for the interpretation. To this end, we extend the dependency pair framework for proving termination of unconstrained term rewriting systems to constrained term rewriting systems. Moreov...

Gouveia et al. [3] show how to model the Hop Constrained Minimum Spanning tree problem as Steiner tree problem on a layered graph. Following their ideas, we provide three possibilities to model the Hop Constrained (HC) Connected Facility Location problem (ConFL) as ConFL on layered graphs. We show that on all three layered graphs the respective LP relaxations of two cut based models are of the ...

Many practical tasks in robotic systems, such as cleaning windows, writing or grasping, are inherently constrained. Learning policies subject to constraints is a challenging problem. We propose a locally weighted constrained projection learning method (LWCPL) that first estimates the constraint and then exploits this estimate across multiple observations of the constrained motion to learn an un...

Restless multi-armed bandits are often used to model budget-constrained resource allocation tasks where receipt of the is associated with an increased probability a favorable state transition. Prior work assumes that individual arms only benefit if they receive directly. However, many occur within communities and can be characterized by positive externalities allow derive partial when their nei...