Muutke küpsiste eelistusi

E-raamat: Complex Networks: Advances in Research and Applications

  • Formaat: 151 pages
  • Ilmumisaeg: 01-Nov-2017
  • Kirjastus: Nova Science Publishers Inc
  • ISBN-13: 9781536128345
  • Formaat - PDF+DRM
  • Hind: 135,85 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.
  • Formaat: 151 pages
  • Ilmumisaeg: 01-Nov-2017
  • Kirjastus: Nova Science Publishers Inc
  • ISBN-13: 9781536128345

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

"Chapter One focuses on investigational data on the fluorescence of DNA complexes inside neutrophils in flow cytometry with nanometer spatial resolution. Fluorescence visualizes oxidative activity of all coding and non-coding DNA parts in the full set ofchromosomes. Chapter Two studies real-world networks based on a centrality metric called the Leverage Centrality metric which has been recommended as a means of identifying neighborhood hubs. The LevC of a node is a comparative measure of the connectivity of a node vis-a-vis its neighbors. In Chapter Three, the author goes on to examine neighborhood overlap, bipartivity index, and algebraic connectivity as edge centrality metrics to measure the consistency of links for mobile sensor networks. For severalinstances of node density and mobility, the author observes the stability of the network-wide data gathering trees determined using the proposed three edge centrality metrics to be significantly larger than the stability of the LET-based data gathering trees. Finally, Chapter Four proposes a fusion condition with the goal of preventing wrong fusions and alleviating the effect of the resolution limit. The suggested condition can also be used in other algorithms that make community fusions"--
Preface vii
Chapter 1 Super Dense Fractal Networks for Multi Scale Activity of DNA Inside Cells
1(54)
N. E. Galich
Chapter 2 Leverage Centrality-Based Assortativity Analysis of Real-World Network Graphs
55(36)
Natarajan Meghanathan
Chapter 3 Location and Mobility Independent Theoretic Graph Metrics to Quantify the Stability of Links for Mobile Sensor Networks
91(14)
Natarajan Meghanathan
Chapter 4 A Fusion Condition for Community Detection with Modularity
105(32)
Olivier Gach
Jin-Kao Hao
Index 137