914 resultados para Perfect codes
Resumo:
This thesis analyzes four philosophical questions surrounding Ibn al-'Arabi's concept of the al-iman al-kamil, the Perfect Individual. The Introduction provides a definition of Sufism, and it situates Ibn al-'Arabi's thought within the broader context of the philosophy of perfection. Chapter One discusses the transformative knowledge of the Perfect Individual. It analyzes the relationship between reason, revelation, and intuition, and the different roles they play within Islam, Islamic philosophy, and Sufism. Chapter Two discusses the ontological and metaphysical importance of the Perfect Individual, exploring the importance of perfection within existence by looking at the relationship the Perfect Individual has with God and the world, the eternal and non-eternal. In Chapter Three the physical manifestations of the Perfect Individual and their relationship to the Prophet Muhammad are analyzed. It explores the Perfect Individual's roles as Prophet, Saint, and Seal. The final chapter compares Ibn al-'Arabi's Perfect Individual to Sir Muhammad Iqbal's in order to analyze the different ways perfect action can be conceptualized. It analyzes the relationship between freedom and action.
Resumo:
The design of a large and reliable DNA codeword library is a key problem in DNA based computing. DNA codes, namely sets of fixed length edit metric codewords over the alphabet {A, C, G, T}, satisfy certain combinatorial constraints with respect to biological and chemical restrictions of DNA strands. The primary constraints that we consider are the reverse--complement constraint and the fixed GC--content constraint, as well as the basic edit distance constraint between codewords. We focus on exploring the theory underlying DNA codes and discuss several approaches to searching for optimal DNA codes. We use Conway's lexicode algorithm and an exhaustive search algorithm to produce provably optimal DNA codes for codes with small parameter values. And a genetic algorithm is proposed to search for some sub--optimal DNA codes with relatively large parameter values, where we can consider their sizes as reasonable lower bounds of DNA codes. Furthermore, we provide tables of bounds on sizes of DNA codes with length from 1 to 9 and minimum distance from 1 to 9.
Resumo:
Self-dual doubly even linear binary error-correcting codes, often referred to as Type II codes, are codes closely related to many combinatorial structures such as 5-designs. Extremal codes are codes that have the largest possible minimum distance for a given length and dimension. The existence of an extremal (72,36,16) Type II code is still open. Previous results show that the automorphism group of a putative code C with the aforementioned properties has order 5 or dividing 24. In this work, we present a method and the results of an exhaustive search showing that such a code C cannot admit an automorphism group Z6. In addition, we present so far unpublished construction of the extended Golay code by P. Becker. We generalize the notion and provide example of another Type II code that can be obtained in this fashion. Consequently, we relate Becker's construction to the construction of binary Type II codes from codes over GF(2^r) via the Gray map.
Resumo:
Presentation at the Ontario Library Association Super Conference, January 28-21, 2015, Toronto, ON.
Resumo:
Province of Ontario Patent issued to Cyrus Dean of St. Catharines for a machine for effecting more perfect combustion of fuel in the furnaces of locomotives. This patent was listed in the Records Office of the Registrar General of Canada in Lib. JE, folio 361. This patent is accompanied by a 36 cm. x 57 cm. detailed sketch and explanation of the machine. [Samuel D. Woodruff was the assignee of Cyrus Dean in a in a patent for a rotary washing machine in November of 1869 according to The Commissioners of Patents' Journal by the Great Britain Patent Office], March 23, 1870.
Resumo:
UANL