Muutke küpsiste eelistusi

E-raamat: Trustworthy Communications and Complete Genealogies: Unifying Ancestries for a Genealogical History of the Modern World

Teised raamatud teemal:
  • Formaat - PDF+DRM
  • Hind: 55,56 €*
  • * 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.
Teised raamatud teemal:

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. 

Genealogies document relationships between persons involved in historical events. Information about the events is parsed from communications from the past. This book explores a way to organize information from multiple communications into a trustworthy representation of a genealogical history of the modern world. The approach defines metrics for evaluating the consistency, correctness, closure, connectivity, completeness, and coherence of a genealogy. The metrics are evaluated using a 312,000-person research genealogy that explores the common ancestors of the royal families of Europe. A major result is that completeness is defined by a genealogy symmetry property driven by two exponential processes, the doubling of the number of potential ancestors each generation, and the rapid growth of lineage coalescence when the number of potential ancestors exceeds the available population. A genealogy expands from an initial root person to a large number of lineages, which then coalesce into a small number of progenitors. Using the research genealogy, candidate progenitors for persons of Western European descent are identified. A unifying ancestry is defined to which historically notable persons can be linked.
Introduction.- Research Genealogy.- Research Genealogy Knowledge Base.- Genealogical History of the Modern World.- Trustworthy Communications.- Summary.- Appendix A: Cousin Relationship Terminology.- Appendix B: Simple Lineages to the Unified Ancestry Progenitors.- Appendix C: Sample Lineages for Linking Historically Notable Persons to the Unifying Ancestry.- Appendix D: Sources Referenced in the Lineages.- Appendix E: Algorithms Used to Analyze Genealogies.- References/ Author Biography.
Reagan Moore is an emeritus professor in the School of Information and Library Science at the University of North Carolina at Chapel Hill. Previously, he was Chief Scientist for Data Intensive Cyber Environments at the Renaissance Computing Institute, and Director of the Data Intensive Cyber Environments Center at UNC. He coordinated research efforts in the development of data grids, digital libraries, and preservation environments, including the integrated Rule Oriented Data System (iRODS). An ongoing research interest is use of data grid technology to automate execution of management policies and validate trustworthiness of repositories. Moores previous roles include: Director of the DICE group at the San Diego Supercomputer Center, and Manager of production services at SDSC. He also worked as a computational plasma physicist at General Atomics on equilibrium and stability of toroidal fusion devices. He has a Ph.D. in plasma physics from the University of California, San Diego (1978) and a B.S. in physics from the California Institute of Technology (1967).