61. Internet Archive: Details: Course 02: Discrete Mathematics (Arsdigita University ars digita; computer science;discrete math; logic; proof techniques; recurrence relations;basic set theory. TODO include mediatypespecific thumbnail when http://www.archive.org/details/arsdigita_02_discrete_math

Web Moving Images Texts Audio ... Home Search: All Media Types Wayback Machine Moving Images Ephemeral Films Movies Non-English Videos Open Source Movies Prelinger Archives Sports Videos Video Games Vlogs Youth Media Texts American Libraries Canadian Libraries Universal Library Open Source Books Project Gutenberg Biodiversity Heritage Library Children's Library Additional Collections Audio Grateful Dead Live Music Archive Netlabels Non-English Audio Open Source Audio Podcasts Radio Programs Software CLASP Tucows Software Library Education Forums FAQs Advanced Search Upload Anonymous User login or join us Open Educational Resources ArsDigita Computer Science University > Course 02: Discrete Mathematics (Arsdigita University) Related Subjects ars digita; computer science;discrete math; logic; proof techniques; recurrence relations;basic set theory Readings AX+By Puzzle Bank Vault Card Trick - Complete Solution Card Trick - Generalizations ... Whole Klein Puzzle Video Files Lecture 1: Intro (Real player) Lecture 2: Boolean Algebra (Real player) Lecture 3: More logic (Real player) Lecture 4: Sets (Real player) ... Lecture 20: Cryptography (Real player) Other Files Card Trick Problem Set - Solutions (Scheme) Card Trick Solutions (Tex) Problem Set #1 - Solutions [Scheme] Problem Set #2 (Tex) ... Problem Set #7 - Solutions (Scheme) View all files: FTP HTTP Resources Bookmark Report errors Course 02: Discrete Mathematics (Arsdigita University) Instructor: Shai Simonson

62. DePaul University Publication Details. · Prentice Hall, Upper Saddle River, NJ 07458. · ISBN 013-117686-2. · Ordering Information. Overview and Table of Contents http://www.depaul.edu/~rjohnson/dm6th

63. MATHS: MATHS - Discrete Mathematics In ASCII MATHS discrete mathematics in ASCII Introduction Lexemes Syntax of Documentation Glossaries Grammars Syntax Macros http://www.csci.csusb.edu/dick/maths/math.syntax.html

CNS Comp Sci Dept R J Botting MATHS ... Contact ] [Search Fri May 12 10:27:21 PDT 2006 Contents MATHS - Discrete mathematics in ASCII : Introduction : Lexemes : Syntax of Documentation ... Notes on the Underlying Logic of MATHS MATHS - Discrete mathematics in ASCII Introduction This document is a syntax summary of the MATHS notation. The MATHS notation is designed so that mathemtical formulae and definitions can be expressed in a palatable form by software developers in ASCII. It contains more than the norml Bachus-Normal-Form grammar because a lot of special names need to be given meaning as well as syntax. This document is a collection of formal (mathematical BNF-style) definitions and assertions. There are less formal introductions that may be easier to understand: [ intro_characters.html ] and [ intro_ebnf.html ] elsewhere. Lexemes math.lexicon.html Syntax of Documentation documentation::=#( formal break directive gloss ... comment formal::= formula declaration assertion colon ... colon colon ::=":". definition::= gloss condition term context ... ender gloss::= term context balanced expression ... ender balanced ::= See http://www.csci.csusb.edu/dick/maths/notn_12_Expressions.html#balanced

64. Discrete Mathematics Seminar Schedule (Fall 2006) discrete mathematics Seminar Schedule. This semester the seminar will take place every Friday at 4.00pm in Ewing Back to discrete mathematics Home Page http://www.math.udel.edu/research/DiscreteMath/schedule.html

Discrete Mathematics Seminar Schedule This semester the seminar will take place every Friday at 4.00pm in Ewing 336. For more information, contact our Qing Xiang, University of Delaware ( Friday, Feb 15 at 4.00pm Ulrich Dempwolff, Technical University at Kaiserlautern ( Friday, Feb 29 at 4.00 pm Tanush Shaska, Oakland University ( Friday, March 7, 4:00 pm Stephaan De Winter, Ghent University ( Friday, March 14, 4:00 pm Dan Cranston, Rutgers University ( Friday, March 21, 4:00 pm Guang Gong, University of Waterloo ( Friday, April 18, 4:00 pm Bruce Sagan, Michigan State University ( Friday, May 9, 4:00 pm Qing Xiang, University of Delaware Semi-regular relative difference sets and mutually unbiased bases Friday, February 15th, 4:00pm, 336 Ewing Hall. Ulrich Dempwolff, Technical University at Kaiserlautern Factorized Spread Sets and Translation Planes Friday, February 29th, 4:00pm, 336 Ewing Hall. Tanush Shaska, Oakland University Algebraic curves and their automorphisms Friday, March 7, 4:00 pm, 336 Ewing Stephaan De Winter, Ghent University

65. Cookies Required SIAM Journal on Applied Mathematics SIAM Journal on Computing SIAM Journal on Control and Optimization SIAM Journal on discrete mathematics http://epubs.siam.org/

What is Scitation? News Contact Us Help MyScitation: Sign In Register Home MyScitation ... Usage Reports Welcome! Sign In Sign up for free Send Feedback ... Learn more about our new features! Cookies Required ALERT! This service requires a web browser and/or firewall/network configuration that supports and accepts cookies. You may have been redirected to this page for one or more of the following reasons: You are using a browser that supports cookies, but cookie acceptance is disabled. You are using an older browser that does not support cookies. You are utilizing a personal firewall that is configured to override your browser settings and reject cookies. You are accessing Scitation from a network or proxy that is configured to reject cookies. (1) Browsers that support cookies: You may be using a browser that does support cookies, but you have cookies disabled. Setting up your browser to accept cookies is straightforward in most current versions of Scitation's recommended browsers . Once you have enabled cookies, you may continue to the URL you requested or return to the previous page (2) Browsers that do not support cookies: If you are using a browser that does not support cookies, you must upgrade to a cookie-capable browser. Consult the Scitation

66. DFG-FG 468: Discrete Mathematics, Chemical Processes It involves various areas of discrete mathematics, optimization and numerical mathematics as well as areas in control and chemical engineering. http://www.math.uni-magdeburg.de/DFG-FG-468/

and Methods from Discrete Mathematics for the Synthesis and Control of Chemical Processes Home Contact Projects Publications ... Links Scientific discipline and field of work The research project proposed here is interdisciplinary. It involves various areas of discrete mathematics, optimization and numerical mathematics as well as areas in control and chemical engineering. The mathematical and algorithmic results we plan to achieve will be of relevance for the following scientific areas: integer programming, combinatorial optimization, algorithmic algebra and discrete event control theory. From the application point of view, our research project will be concerned with discrete decisions involved in the synthesis and control of complex chemical processes. Applications that will be considered are: control of multiproduct batch plants, synthesis of new multifunctional reactors and design of a new class of simulated moving bed chromatographic processes. Summary Goals Increasing requirements on productivity, product quality and environmental compatibility in the chemical industries lead to more and more complex chemical processes. This does not only require the synthesis of more efficient processes but, equally important, the development of new concepts for process control. In both cases, discrete decisions play an important role. For process control problems, these are represented by discrete control inputs, which are often based on discrete, or quantized, measurements. In the context of process synthesis, discrete decisions follow from discrete design parameters as, for example, the number of trays in a distillation column.

67. The Combinatorica Project Combinatorica is a package written in 1989 by Steve Skiena for doing computational discrete mathematics in Mathematica. It included over 230 functions and http://www.cs.uiowa.edu/~sriram/Combinatorica/index.html

The Combinatorica Project Sriram V. Pemmaraju Department of Computer Science The University of Iowa Steven Skiena ... State University of New York at Stony Brook Combinatorica is a package written in 1989 by Steve Skiena for doing computational discrete mathematics in Mathematica . It included over 230 functions and has been a Standard AddOn Mathematica package. Steve Skiena described this package in his book Implementing Discrete Mathematics: Combinatorics and Graph Theory in Mathematica , Advanced Book Division, Addison-Wesley, Redwood City CA, June 1990. Along with Steve Skiena I am developing a "new" Combinatorica package that is expected to be released in the first half of 2001. How computational discrete mathematics is done using the new package will be described in a forthcoming book: Computational Discrete Mathematics: Combinatorics and Graph Theory in Mathematica Cambridge University Press, September 2002 Want the latest Combinatorica package? Download Version 2.0.0 from here and the list of known bugs in this version. (last update: March 5, 2003, size: 341KB)

68. Discrete Mathematics Summer Workshop Problem Solving and Critical Thinking With discrete mathematics for K9 Teachers Tufts University offers the discrete math Workshop for K-9 teachers. http://www.cs.tufts.edu/research/dmw/

Discrete Math Workshop Home What is Discrete Math? Workshops ... Contact Tufts University Institute on Problem Solving and Discrete Mathematics for 5 th th Grade Teachers What Is Discrete Mathematics? Tufts University Medford Massachusetts Summer 1: Grades 5-9 2008 dates to be announced soon! Summer 2: Grades 5-9 (for returning teachers) 2008 dates to be announced soon! The workshops will run from 8:30 a.m.-4:30 p.m. daily. FUNDING SOURCES Funding for the Tufts University Institute on Problem Solving and Discrete Mathematics is provided by The Massachusetts Board of Higher Education and the 2007 Improving Teacher Quality State Grant Program. var sc_project=1692958; var sc_invisible=0; var sc_partition=16; var sc_security="af541fe6"; var sc_text=3; View My Stats

69. CU-Denver Discrete Mathematics Seminars The discrete mathematics Seminar is held every Monday from 1130 1230 pm. in Room 656 of the UCD Building at the corner of Lawrence and 14th Streets http://www-math.cudenver.edu/discrete/seminars.shtml

Department Search: Home People Research Contact ... Newsletter Discrete Mathematics Seminars Schedule, Fall 2006 The Discrete Mathematics Seminar is held every Monday from 11:30 - 12:30 pm. in Room 656 of the UCD Building at the corner of Lawrence and 14th Streets right across Speer Blvd. from the Auraria campus. Topics range widely over the area of Discrete Mathematics. All interested faculty and graduate students are cordially invited. The talks are often accessible to undergraduates as well. Monday, December 4, 2006 Combinatorial Applications of Hilbert's Nullstellensatz Hank Turowski UCDHSC Department of Mathematical Sciences Monday, November 27, 2006 Combinatorial Applications of Hilbert's Nullstellensatz Angela Harris UCDHSC Department of Mathematical Sciences Monday, November 13, 2006 The Enormous Theorem - The Classification of Finite Simple Groups Rich Lundgren UCDHSC Department of Mathematical Sciences Monday, November 6, 2006 Strongly Regular Graphs and Partial Difference Sets in Finite Geometry Steve Flink UCDHSC Department of Mathematical Sciences ABSTRACT: A strongly regular graph with parameters (v,k, lambda, mu) is a k-regular graph on v vertices with the property that every pair of adjacent vertices have lambda common neighbors, and every pair of nonadjacent vertices have mu common neighbors. A partial difference set is a subset of a group, the existence of which is equivalent to the existence of a stgrongly regular Cayley graph on that group. We will review some basic results and constructions, concentrating on those which arise in Galois Geometries. Our main result is a proof of the nonexistence of abelian partial difference sets with parameters (p^2(p+2)^2, p(p+1)^2, p, p^2+p), where p and p+2 are both prime. Along the way, we prove a curious lemma on matchings in bipartite graphs.

70. New England Discrete Mathematics Day At URI New England discrete Mathematics Day at URI. Saturday February 1, 2003. Department of Mathematics University of Rhode Island Kingston, RI 028810816 http://www.math.uri.edu/~thoma/DM/

New England Discrete Mathematics Day at URI Saturday February 1, 2003 Department of Mathematics University of Rhode Island Kingston , RI 02881-0816 Speakers Zoltan Furedi , University of Illinois at Urbana-Champaign Ira M. Gessel , Brandeis University Benny Sudakov , Princeton University and IAS Michelle Wachs , University of Miami Peter Winkler , Mathematical Sciences Research Center, Bell Labs SLIDES PHOTOS Schedule and Abstracts All talks will be held in the Weaver Auditorium (Room 100), URI Coastal Institute , first floor. The meeting will begin at 9:30 am (first talk at 10:00 am) and continue through 5.00 pm. Directions to Kingston, RI, from Providence, Boston and New York by car and some information about plane, and train access. Here are campus maps: a navigable and printable map. Parking : We suggest that you enter the University campus at the junction of Route 138 and Upper College Road, at the traffic light. You will find the campus Information Center on your right after the first 4-way stop sign intersection on Upper College Road. The Information Center will provide a visitor's parking pass and directions for parking. If you do not want to stop for a parking pass and do not mind walking through our campus, the parking office agreed that you can park without a parking pass in the parking lot of Chafee Social Science Center. The lot is in square A4 on this

71. Michigan Technological University Department Of Mathematical Sciences BS in mathematics, discrete CONCENTRATION. discrete. TOTAL CREDITS REQUIRED 124 Science/math, Satisfied by major requirements http://www.math.mtu.edu/undergrad/discrete.html

People: Faculty Staff Grad Students Other ... Course Schedule Programs: Undergraduate Program First-year students Majors Minors Graduate Program ... Math Learning Center Undergraduate Program BS in Mathematics, DISCRETE CONCENTRATION TOTAL CREDITS REQUIRED: 124 Major Requirements: 42 Credits MA1150 Calculus I -or- MA1160 Calculus with Technology I MA2150 Calculus II -or- MA2160 Calculus with Technology II MA2330 Honors Elementary Linear Algebra MA2710 Introduction to Statistical Analysis MA3150 Multivariable Calculus -or- MA3160 Multivariable Calculus with Technology MA3210 Introduction to Combinatorics MA3310 Introduction to Abstract Algebra MA3450 Introduction to Real Analysis MA3530 Introduction to Differential Equations -or- MA3560 Mathematical Modeling Laboratory science course (BL, CH, or PH) CS programming course Science, engineering, or CS Concentration Requirements: 18 Credits MA4208 Optimization/Graph Algorithms MA4209 Combinatorics and Graph Theory MA4310 Abstract Algebra MA4330 Linear Algebra Choose two of the following courses: MA3202 Introduction to Coding Theory, MA3203 Introduction to Cryptography, MA4211 Information Theory/Data Compression, MA4308 Theory of Numbers

72. CSCI0220: Introduction To Discrete Structures And Probability CSCI 0220 Introduction to discrete Structures and Probability. V.I.L.E. Case Files; Main; Assignments; Hours; Miscellaneous; Staff http://www.cs.brown.edu/courses/cs022/

CSCI 0220: Introduction to Discrete Structures and Probability V.I.L.E. Case Files: Main Assignments Lectures Hours ... Staff Mission Updates 13:03, March 13th, 2008 Solutions for homeworks 4 and 5 have been posted. Also, one-time only, Professor Raphael has an extra office hour TODAY from 2:30-3:30. Also, for next week, hours on Tuesday have been moved to Monday; Monday's schedule is Yoonha 4-6, Jon 7-9, Jason 9-11. They will be in room 219. 1:33, March 13th, 2008 Lian is going to break up her hours tomorrow (Thursday). She will be holding them in Room 219 from 7-8pm, and then from 10-11pm. 1:14, March 13th, 2008 An edge was mistakenly left off from problem 6.2a, causing the resulting problem to have too many solutions. We have now updated the problem. For those of you who have already done the harder problem, you can turn in your old solution if you choose. 17:31, March 12th, 2008 Catherine will be holding her hours from 8-10pm instead of 6-8pm tonight. 02:24, March 11th, 2008 Josh will be holding a problem solving session for sets this Wednesday at 8:30pm in CIT room 219. 12:32, March 7th, 2008

73. This Is Mega-Mathematics! Resources for teachers and students collected at Los Alamos National Lab. http://www.c3.lanl.gov/mega-math/

Click anywhere on this picture, or click here for a text menu instead of the picture.

74. CS173 - Discrete Structures - Spring 2008 CS173 discrete Structures - Spring 2008. Tue Thu 930-1045 am, 1404 Siebel Center. • Home • Course Policies • Staff • Schedule • Homework • Exams • http://www.cs.uiuc.edu/class/cs173/

CS173 - Discrete Structures - Spring 2008 Tue Thu 9:30-10:45 am, 1404 Siebel Center Home Course Policies Staff Schedule ... Exams Instructors: Erin Wolf Chambers erinwolf@uiuc.edu Kevin Milans milans@uiuc.edu Office Hours: Wed 12:00 - 1:45 in the lounge outside Siebel 3240 Both instructors are also available by appointment. For information about Teaching Assistants and Section Leaders, please go to the Staff Information page. Announcements: March 6: Due to EOH this week, ALL of Friday's sections have had room changes: Section 4A (Dan M.) will meet in 3403 Section 4B (Yuzi) will meet in 4403 Section 5A (Dan M.) will meet in 4407 Section 5B (Dan S.) will meet in 3102 March 5: Solutions to Midterm 1 are now online March 4: Due to EOH this Friday, March 7, Section 5B with Dan S. will be held in 3102. If you are unable to attend section this Friday due to EOH, you can get still get credit for attendance if you go to another section. Email both your section leader and the section leader holding the class you'd like to attend (see the list of sections and emails at the bottom of this page) so that your attendance can be recorded properly. February 22: Please review the course policies page with regards to requesting regrades. You may bring your test to a course staff member within at most

75. This Page Has Been Moved This Page Has Been Moved. New site http//www.jfsowa.com/logic/math.htm. Please bookmark the new site. http://www.bestweb.net/~sowa/misc/mathw.htm

This Page Has Been Moved New site: http://www.jfsowa.com/logic/math.htm Please bookmark the new site.

76. Elsevier.com The page you are looking for has moved. If you are not automatically redirected to the new page within 5 seconds, please click on http://authors.elsevier.com/JournalDetail.html?PubID=505610

77. Index Of /~mpf/cot3100lecs DIR Parent Directory 03Apr-2005 1315 - DIR 2003-Fall/ 04-Jan-2004 0956 - Module-00-Overview.ppt 10-May-2004 0847 435k http://www.cise.ufl.edu/~mpf/cot3100lecs/

Index of /~mpf/cot3100lecs Name Last modified Size Description ... Parent Directory 03-Apr-2005 13:15 - 2003-Fall/ 04-Jan-2004 09:56 - Module-00-Overview.ppt 10-May-2004 08:47 435k Module-01-Logic.ppt 10-May-2004 09:10 1.1M Module-02-Proofs.ppt 13-Jan-2004 16:38 204k Module-03-Sets.ppt 15-Jan-2004 15:39 570k Module-04-Functions.ppt 15-Jan-2004 16:25 288k 22-Jan-2004 16:46 265k 27-Jan-2004 16:27 197k 16-Jun-2004 08:03 250k Module-08-Numbers.ppt 29-Jan-2004 16:33 221k 05-Feb-2004 16:01 246k Module-10-Matrices.ppt 17-Feb-2004 16:50 231k 10-Feb-2004 16:53 174k Module-12-Sequences.ppt 12-Feb-2004 14:54 107k 12-Feb-2004 15:08 335k 12-Feb-2004 15:14 167k Module-15-Induction.ppt 24-Feb-2004 17:00 133k Module-16-Recursion.ppt 04-Jan-2004 12:35 597k 04-Jan-2004 12:35 124k 04-Mar-2004 16:50 181k 17-Mar-2004 14:30 250k 23-Mar-2004 16:08 296k Module-21-Relations.ppt 23-Mar-2004 16:55 177k Module-22-Graphs.ppt 01-Apr-2004 08:04 1.1M 01-Apr-2004 16:45 174k Module-24-Models.ppt

Page 4     61-77 of 77    Back | 1  | 2  | 3  | 4