Catalogue Search | MBRL
Are you sure you want to remove the book from the shelf?
{{itemTitle}}
787,563
result(s) for
"code"
Sort by:
Life's greatest secret : the race to crack the genetic code
Life's Greatest Secret is the story of the discovery and cracking of the genetic code. This great scientific breakthrough has had far-reaching consequences for how we understand ourselves and our place in the natural world. The code forms the most striking proof of Darwin's hypothesis that all organisms are related, holds tremendous promise for improving human well-being, and has transformed the way we think about life. Matthew Cobb interweaves science, biography and anecdote in a book that mixes remarkable insights, theoretical dead-ends and ingenious experiments with the pace of a thriller. He describes cooperation and competition among some of the twentieth-century's most outstanding and eccentric minds, moves between biology, physics and chemistry, and shows the part played by computing and cybernetics. The story spans the globe, from Cambridge MA to Cambridge UK, New York to Paris, London to Moscow. It is both thrilling science and a fascinating story about how science is done.
Book
The minimum locality of linear codes
Locally recoverable codes (LRCs) were proposed for the recovery of data in distributed and cloud storage systems about nine years ago. A lot of progress on the study of LRCs has been made by now. However, there is a lack of general theory on the minimum locality of linear codes. In addition, the minimum locality of many known families of linear codes has not been studied in the literature. Motivated by these two facts, this paper develops some general theory about the minimum locality of linear codes, and investigates the minimum locality of a number of families of linear codes, such as
q
-ary Hamming codes,
q
-ary Simplex codes, generalized Reed-Muller codes, ovoid codes, maximum arc codes, the extended hyperoval codes, and near MDS codes. Many classes of both distance-optimal and dimension-optimal LRCs are presented in this paper. To this end, the concepts of linear locality and minimum linear locality are specified. The minimum linear locality of many families of linear codes are settled with the general theory developed in this paper.
Journal Article
The genetic code
This book tracks the key experiments and discoveries that set in motion efforts to crack the code and explores the many ways humans have applied knowledge of the genetic code to alter gene activity.
Book
Jacobson radicals, abelian p-groups and the ⊕c-topology
In studying the Jacobson radical of the endomorphism ring of a separable abelian p-group, Sands (1984) identified the useful Condition (C). Our central result is that the group G satisfies Condition (C) precisely when it is complete in its ⊕c-topology, which uses the set of subgroups X≤G such that G/X is a direct sum of cyclics as a neighborhood base of 0. This equivalence is then used to compute the Jacobson radicals of the endomorphism rings of a variety of such groups, including those in the so-called Keef class. It is shown that Sands’ attempt to “complete” an arbitrary group with respect to Condition (C) is equivalent to D’Este’s (1980) attempt to show that the ⊕c-topology is completable. Since Mader (1983) provided a counterexample to D’Este’s result, it follows that Sands’ result also fails.
Journal Article
Concatenated Constrained Coding: A New Approach to Efficient Constant-Weight Codes
The design of low-complexity and efficient constrained codes has been a major research item for many years. This paper reports on a versatile method named concatenated constrained codes for designing efficient fixed-length constrained codes with small complexity. A concatenated constrained code comprises two (or more) cooperating constrained codes of low complexity enabling long constrained codes that are not practically feasible with prior art methods. We apply the concatenated coding approach to two case studies, namely the design of constant-weight and low-weight codes. In a binary constant-weight code, each codeword has the same number, w, of 1’s, where w is called the weight of a codeword. We specifically focus on the trading between coder complexity and redundancy.
Journal Article
Algorithms in Low-Code-No-Code for Research Applications: A Practical Review
Algorithms have evolved from machine code to low-code-no-code (LCNC) in the past 20 years. Observing the growth of LCNC-based algorithm development, the CEO of GitHub mentioned that the future of coding is no coding at all. This paper systematically reviewed several of the recent studies using mainstream LCNC platforms to understand the area of research, the LCNC platforms used within these studies, and the features of LCNC used for solving individual research questions. We identified 23 research works using LCNC platforms, such as SetXRM, the vf-OS platform, Aure-BPM, CRISP-DM, and Microsoft Power Platform (MPP). About 61% of these existing studies resorted to MPP as their primary choice. The critical research problems solved by these research works were within the area of global news analysis, social media analysis, landslides, tornadoes, COVID-19, digitization of process, manufacturing, logistics, and software/app development. The main reasons identified for solving research problems with LCNC algorithms were as follows: (1) obtaining research data from multiple sources in complete automation; (2) generating artificial intelligence-driven insights without having to manually code them. In the course of describing this review, this paper also demonstrates a practical approach to implement a cyber-attack monitoring algorithm with the most popular LCNC platform.
Journal Article
Naming the world : language and power among the Northern Arapaho
\"An accessible, linguistics-focused account of language teaching, learning, and change in a Native American community\"--Provided by publisher.
Book
