Inicio > Matemáticas y ciencia > Matemáticas > Migliorare la sicurezza nelle reti fuzzy attraverso una dominazione efficiente
Migliorare la sicurezza nelle reti fuzzy attraverso una dominazione efficiente

Migliorare la sicurezza nelle reti fuzzy attraverso una dominazione efficiente

A. Meenakshi / J. Senbagamalar / O. Mythreyi

77,69 €
IVA incluido
Disponible
Editorial:
KS OmniScriptum Publishing
Año de edición:
2024
Materia
Matemáticas
ISBN:
9786207940110
77,69 €
IVA incluido
Disponible

Selecciona una librería:

  • Librería Samer Atenea
  • Librería Aciertas (Toledo)
  • Kálamo Books
  • Librería Perelló (Valencia)
  • Librería Elías (Asturias)
  • Donde los libros
  • Librería Kolima (Madrid)
  • Librería Proteo (Málaga)
Sobre IBD

Sia G(V, E) un grafo finito connesso semplice di ordine m con l’insieme di vertici V e l’insieme di bordi E. Un insieme dominante S ⊆ V(G) è detto un insieme efficientemente dominante se, per ogni vertice u ∈ V(G), |N[u] ∩ S| = 1, dove N[u] indica il vicinato chiuso del vertice. Utilizzando efficienti tecniche di dominio e di etichettatura, abbiamo costruito i diversi tipi di reti fuzzy. È stato messo a punto un algoritmo per criptare e decriptare le informazioni segrete presenti nella rete. La modellazione matematica di un tipo forte di rete fuzzy è stata definita e costruita per eludere l’intruso emergente. Utilizzando lo studio del dominio efficiente sui tipi di grafi fuzzy, questo parametro di dominio gioca un ruolo sfumato nel criptare e decriptare la rete incorniciata. Lo scopo principale dei tipi di rete fuzzy è la crittografia e la decrittografia; il nostro contributo a questa ricerca è quello di costruire una nuova tecnica combinatoria per crittografare e decrittografare la rete fuzzy incorporata con un numero segreto utilizzando la dominazione efficace. Viene fornita un’illustrazione con un messaggio segreto appropriato e gli algoritmi di crittografia e decrittografia.

Artículos relacionados

  • Wearable Electronics and Embedded Computing Systems for Biomedical Applications
    Wearable electronics and embedded computing systems have been receiving a great deal of interest over the last two decades in research and commercial fields, with a special focus on biomedical applications. The key benefits introduced by these systems include their small size, lightweight, low-power consumption, and, of course, wearability. Major human-centered applications are...
    Disponible

    67,84 €

  • John and Betty’s Journey Into Complex Numbers
    Matt Bower
    Set in the genre of a children’s book, John and Betty trace the evolutionof complex numbers and explore their operations. From integers, tofractions, to surds, complex numbers are made to seem like an obviousextension. Incorporating graphing on the complex number plane andculminating in De Moivre’s Theorem, the logic of complex numbers ismade to seem intuitive and simple. John ...
    Disponible

    19,23 €

  • Special Functions
    Historically, the notion of entropy emerged in conceptually very distinct contexts. This book deals with the connection between entropy, probability, and fractional dynamics as they appeared, for example, in solar neutrino astrophysics since the 1970's (Mathai and Rathie 1975, Mathai and Pederzoli 1977, Mathai and Saxena 1978, Mathai, Saxena, and Haubold 2010).The original ...
    Disponible

    75,85 €

  • VALUE DISTRIBUTION IN P-ADIC ANALYSIS
    ALAIN ESCASSUT / ESCASSUT ALAIN
     The book first explains the main properties of analytic functions in order to use them in the study of various problems in p-adic value distribution. Certain properties of p-adic transcendental numbers are examined such as order and type of transcendence, with problems on p-adic exponentials. Lazard's problem for analytic functions inside a disk is explained. P-adic meromo...
  • WORLDWIDE LOTTERY GAMES In Naturally Optimized Systems
    Cornelia Lala / Corneliu Lala
    Worldwide Lottery Games In Naturally Optimized Systems Pick 5 has been developed on the authors’ initiative, based on the belief that nothing in the Universe happens by chance because there are laws governing everything, and by increasing our knowledge, we can triumph over mere chance. This is a book for players and/or groups of players (syndicates) who want to play to more th...
    Disponible

    28,34 €

  • ENTENDIENDO LAS PROBABILIDADES Y CALCULÁNDOLAS
    Catalin Barboianu / Rafael Martilotti
    La vida cotidiana está llena de situaciones que exigen tomar decisiones. Y en estos casos comparamos y hacemos estimaciones de probabilidades, a veces casi sin darnos cuenta, especialmente en el momento de decidir. Pero las probabilidades no son números simples asociados objetiva o subjetivamente a los eventos, como nos podría parecer, y el cálculo y el uso que le damos están e...
    Disponible

    31,57 €

Otros libros del autor

  • Verbesserung der Sicherheit in Fuzzy-Netzen durch effiziente Beherrschung
    A. Meenakshi / J. Senbagamalar / O. Mythreyi
    Sei G(V, E) ein endlicher einfacher zusammenhängender Graph der Ordnung m mit der Knotenmenge V und der Kantenmenge E. Eine dominierende Menge S ⊆ V(G) wird als effizient dominierende Menge bezeichnet, wenn für jeden Knoten u ∈ V(G) |N[u] ∩ S| = 1 ist, wobei N[u] die geschlossene Nachbarschaft des Knotens bezeichnet. Mit Hilfe effizienter Dominierungstechniken und Beschriftunge...
    Disponible

    77,75 €

  • Amélioration de la sécurité dans les réseaux flous grâce à une domination efficace
    A. Meenakshi / J. Senbagamalar / O. Mythreyi
    Soit G(V, E) un graphe connecté simple fini d’ordre m avec un ensemble de sommets V et un ensemble d’arêtes E. Un ensemble dominant S ⊆ V(G) est appelé un ensemble dominant efficace si, pour chaque sommet u ∈ V(G), |N[u] ∩ S| = 1, où N[u] désigne le voisinage fermé du sommet. En utilisant des techniques de domination et d’étiquetage efficaces, nous avons construit les différent...
    Disponible

    77,75 €

  • Melhoria da segurança em redes difusas através de um domínio eficiente
    A. Meenakshi / J. Senbagamalar / O. Mythreyi
    Seja G(V, E) um grafo finito simples conectado de ordem m com conjunto de vértices V e conjunto de arestas E. Um conjunto dominante S ⊆ V(G) é chamado de conjunto eficientemente dominante se, para todo vértice u ∈ V(G), |N[u] ∩ S| = 1, onde N[u] denota a vizinhança fechada do vértice. Usando técnicas eficientes de dominação e rotulagem, construímos os diferentes tipos de redes ...
    Disponible

    77,69 €

  • Enhancing Security in Fuzzy Networks Through Efficient Domination
    A. Meenakshi / J. Senbagamalar / O. Mythreyi
    Let G(V, E) be a finite simple connected graph of order m with vertex set V and edge set E. A dominating set S ⊆ V(G) is called an efficiently dominating set if, for every vertex u ∈ V(G), |N[u] ∩ S| = 1, where N[u] denotes the closed neighborhood of the vertex. Using efficient domination techniques and labeling, we constructed the different types of fuzzy networks. An algorith...
    Disponible

    75,44 €