 | | Home : Math : Higher Mathematics : Discrete Mathematics : Rosen, Discrete Mathematics and Its Applications, 6th Edition : Chapter 08 | | LINKS: |  | - Page 519 - Section 8.1
Notes on Relations -- You can find an introduction to relations and their properties at the Mathematics Department of the California State University at San Bernardino website.
http://www.math.csusb.edu/notes/rel/rel.html
(Added: Fri Jul 28 2006)
- Page 531 - Section 8.2
Relational database -- You can learn more about relational databases at this Wikipedia page.
http://en.wikipedia.org/wiki/Relational_database
(Added: Fri Jul 28 2006)
- Page 535 - Section 8.2
SQL -- To learn about SQL, you can read this Wikipedia page.
http://en.wikipedia.org/wiki/SQL
(Added: Fri Jul 28 2006)
- Page 550 - Section 8.4
1.4.5 Transitive Closure and Reduction -- Information about the transitive closure of a graph and where to obtain software for this algorithm, can be found here.
http://www.cs.sunysb.edu/~algorith/files/transitive-closure.shtml
(Added: Fri Jul 28 2006)
- Page 550 - Section 8.4
Transitive Closure -- An applet implementing Warshall’s algorithm can be found here.
http://www.cs.nmsu.edu/~ipivkina/TransClosure/index.html
(Added: Fri Jul 28 2006)
- Page 555 - Section 8.5
Equivalence Relations -- Equivalence relations are also discussed at the Cut-the-Knot site here.
http://www.cut-the-knot.com/blue/equi.html
(Added: Fri Jul 28 2006)
- Page 566 - Section 8.6
Partially Ordered Set -- To find out more abou partial orderings, consult the Wikipedia article here.
http://en.wikipedia.org/wiki/Partially_ordered_set
(Added: Fri Jul 28 2006)
- Page 571 - Section 8.6
Helmut Hasse -- A biography and photograph of Helmut Hasse can also be found at the MacTutor History of Mathematics Archive at the University of St. Andrews, Scotland.
http://www-groups.dcs.st-and.ac.uk/~history/Mathematicians/Hasse.html
(Added: Fri Jul 28 2006)
- Page 575 - Section 8.6
Lattice Model of Secure Information Flow -- You can an important article by Dorothy Denning about mechanisms ensuring secure information flow in a computer system.
http://www.cs.georgetown.edu/~denning/infosec/lattice76.pdf#search=%22lattice%20model%20information%20flow%22
(Added: Fri Jul 28 2006)
- Page 575 - Section 8.6
Access Control Models -- To learn about different access control models, including lattice models, read this article.
http://www.blacksheepnetworks.com/security/info/misc/handbook/087-089.html
(Added: Fri Jul 28 2006)
- Page 576 - Section 8.6
A Decentralized Model for Information Flow Control -- You can learn more about information flow security by reading a paper written by Andrew C. Myers and Barbara Liskov at the MIT Laboratory for Computer Science, accessible here.
http://www.pmg.lcs.mit.edu/papers/iflow-sosp97/paper.html
(Added: Fri Jul 28 2006)
- Page 576 - Section 8.6
1.4.2 Topological Sorting -- Source code for algorithms for topological sorting can be found at the Stony Brook Algorithm Archive, run by Steven Skiena.
http://www.cs.sunysb.edu/~algorith/files/topological-sorting.shtml
(Added: Fri Jul 28 2006)
- Page 584 - Supplementary Exercise #14c
The Erdös Number Project -- Information about the Erdös number of various people is maintained by the Erdös Number Project (which has also been selected as a Geek Site of the Day) run by Jerry Grossman of Oakland University.
http://www.oakland.edu/enp/
(Added: Fri Jul 28 2006)
- Page 584 - Supplementary Exercises
Paul Erdös -- A biography and photograph of Erdös can be found at the MacTutor History of Mathematics Archive at the University of St. Andrews, Scotland.
http://www-groups.dcs.st-and.ac.uk/~history/Mathematicians/Erdos.html
(Added: Fri Jul 28 2006)
- Page 584 - Supplementary Exercises
Erdös, Pal (1913-1996) -- Photographs and links related to Paul Erdös can be found here.
http://www.math.elte.hu/erdos/
(Added: Fri Jul 28 2006)
| |
