- 1、本文档共165页,可阅读全部内容。
- 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
离散数学第七版2.1~2.6
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * We will see this basic counting principle again when we talk about combinatorics. * NOT (x in A - x in B) = NOT (x not in A or x in B) (defn. of implies) = x in A AND x not in B (DeMorgan’s law). * * * * Note that set difference and complement do not relate to each other like arithmetic difference and negative. In arithmetic, we know that a-b = -(b-a). But in sets, A-B is not generally the same as the complement of B-A. * * * A membership table is like a truth table. * * * * * * * * * * So, for example, on a 64-bit processor, using just a single machine-language instruction you can calculate the union or intersection of two sets out of a universe of discourse having up to 64 elements. This leads to an extremely fast way of doing complicated calculations on small sets. It is not a good method for large, sparsely populated sets, because searching the bit string to find which bits are “1” can take a long time. * * * * * * * * * * * * Zero-One Matrices Useful for representing other structures. E.g., relations, directed graphs (later in this course) All elements of a zero-one matrix are either 0 or 1 Representing False True respectively. The join of A, B (both m?n zero-one matrices): A?B :? [aij?bij] The meet of A, B: A?B :? [aij?bij] = [aij bij] The 1’s in A join the 1’s in Bto make up the 1’s in C. Where the 1’s in A meet the 1’s in B, we find 1’s in C. Joins and Meets of Zero-One Matrices Example: Find the join and meet of the zero-one matrices Solution: The join of A and B is The meet of A and B is Boolean Products Let A=[aij] be an m?k zero-one matrix, let B=[bij] be a k?n zero-one matrix, The boolean product of A and B is like normal matrix ?, but using ? instead of + in the row-column “vector dot product”: A⊙B Boolean Powers For a square zero-one matrix A, and any k?0, the kth Boolean power of A is simply the Boolean product of k copies of A. A[k] :? A⊙A⊙…⊙A A[0
您可能关注的文档
- 磁共振波谱(MRS)临床应用 聂林.ppt
- 研究生-2014现代分子生物学英语.ppt
- 社会公德分析.ppt
- 社交礼仪:舞会礼仪.ppt
- 社会契约论9、10、11段(于明宝).ppt
- 社交网络数据挖掘.doc
- 社会保障 第二章1.ppt
- 社会心理学英文版Lecture 4- Behavior and Attitudes.pptx
- 社会心理学英文版Lecture 5- Genes, Culture, and Gender.pptx
- 磷酸铁锂 LFP LIB 正极材料 介绍.ppt
- 2025-2030中国反作用轮(RW)行业市场发展趋势与前景展望战略研究报告.docx
- 2025-2030中国原生木浆市场发展态势与未来经营风险可行性报告.docx
- 2025-2030中国双螺杆制冷压缩机行业市场现状供需分析及投资评估规划分析研究报告.docx
- 2025-2030中国反研磨带行业市场发展趋势与前景展望战略研究报告.docx
- 2025-2030中国印刷电路板检查设备行业市场现状供需分析及投资评估规划分析研究报告.docx
- 2025-2030中国卫浴市场发展分析及市场趋势与投资方向研究报告.docx
- 2025-2030中国发动机压力监控器传感器行业市场发展趋势与前景展望战略分析研究报告.docx
- 2025-2030中国卫星导航行业市场发展分析及发展前景与投资研究报告.docx
- 2025-2030中国卫星自动识别系统(SAIS)行业市场现状供需分析及投资评估规划分析研究报告.docx
- 2025-2030中国发动机控制单元用汽车半导体行业市场发展趋势与前景展望战略分析研究报告.docx
文档评论(0)