| 書名: | Combinatorial Group Testing and Its Applications | |||
| 作者: | D.Z.DU | |||
| ISBN: | 9810212933 | |||
| 出版社: | World Scientific (WS) | |||
| 出版日期: | 1993/01 | |||
| 重量: | 0.50 Kg | |||
| 頁數: | 264 | |||
|
#數學與統計學
|
||||
Group testing was first proposed for blood tests, but soon found its way to many industrial applications. Combinatorial group testing studies the combinatorial aspect of the problem and is particularly related to many topics in combinatorics, computer science and operations research. Recently, the idea of combinatorial group testing has been applied to experimental designs, coding, multiaccess computer communication, clone library screening and other fields. This book is the first attempt to cover the theory and applications of combinatorial group testing in one place.
還沒有人留下心得,快來搶頭香!
為您推薦
相關熱銷的書籍推薦給您
書名:Elements of Discrete Mathematics 2/e 作者:LIU 出版社:McGraw-Hill 出版日期:1985/00/00 ISBN:9780071005449 內容簡介 This book presents a selection of topics from set theory, combinatorics, graph theory, and algebra which were been considered as basic and useful to students in Applied Mathematics, Computer Seience, and Engineering. It's intended to be a textbook for a course in Discrete Mathematics at the sophomore-junior level, although it can also be used in a freshman-level course since the presentation does not assume any background beyond high-school mathematics. 目錄 1. Sets and Propositions 2. Computability and Formal Languages 3. Permutations, Combinations, and Discrete Probability 4. Relations and Functions 5. Graphs and Planar Graphs 6. Trees and Cut-Sets 7. Finite State Machines 8. Analysis of Algorithms 9. Discrete Numberic Functions and Generating Functions 10. Recurrence Relations and Recursive Algorithms 11. Groups and Rings 12. Boolean Algebras
類似書籍推薦給您
【簡介】 A classic knot is an embedded simple loop in 3-dimensional space. It can be described as a 4-valent planar graph or network in the horizontal plane, with the vertices or crossings corresponding to double points of a projection. At this stage we have the shadow of the knot defined by the projection. We can reconstruct the knot by lifting the crossings into two points in space, one above the other. This information is preserved at the vertices by cutting the arc which appears to go under the over crossing arc. We can then act on this diagram of the knot using the famous Reidemeister moves to mimic the motion of the knot in space. The result is classic combinatorial knot theory. In recent years, many different types of knot theories have been considered where the information stored at the crossings determines how the Reidemeister moves are used, if at all. In this book, we look at all these new theories systematically in a way which any third-year undergraduate mathematics student would understand. This book can form the basis of an undergraduate course or as an entry point for a postgraduate studying topology. 【目錄】
類似書籍推薦給您
類似書籍推薦給您
類似書籍推薦給您
資訊
工程
數學與統計學
機率與統計
自然科學
健康科學
地球與環境
建築、設計與藝術
人文與社會科學
教育
語言學習與考試
法律
會計與財務
大眾傳播
觀光與休閒餐旅
考試用書
研究方法
商業與管理
經濟學
心理學
生活
生活風格商品
參考書/測驗卷/輔材