Geometry.Net - Pure_And_Applied


Home - Pure_And_Applied_Math - Discrete Math

e99.com Bookstore

Images

Newsgroups

101-116 of 116 Back | 1 | 2 | 3 | 4 | 5 | 6

Discrete Math: more books (104)

Discrete & Combinatorial Math & Educue Pkg
Math 281: Discrete Dynamical Systems BYU-Idaho Fall 2009 by Eastman, 2009
Advd Math & Mechanics Applns Using MATLAB (Advanced Mathematics & Mechanics Applications Using MATLAB) by Howard B. Wilson, Louis H. Turcotte, 1994-10-24
Introduction Discrete Math by Roman, 1989-07
A Logical Approach to Discrete Math byGries by Gries &Schneider, 1993
Exploring Discrete Math on the Ti-81 by Franklin Demana, 1993-05
Im T/A Discrete Math Through a: Sampler Video Fo by Lois Crisler, 2000-12
Ir CD-Rom T/A Discrete Math App 2e by Crisler, 2000-02-03
Ism Discrete Math
Report of Committee on Discrete Math in the First Two Years
Discrete Math 38-2: 21 Questions by Marvin Marcus, 1983-01
Im-Discrete Math F/Comp Sci by SCHLIPF, WHITESIDE, et all 2005-04-26
Finite/Discrete Math by Gordon, 1997-08
Cme,Dis Math W/BCA Tut/Info 3e by EPP,

lists with details

Discrete Math Home Page
eschool homepage. Welcome! This is where you will find many resources for your discrete math online class. Here is what we currently have to offer
http://www.k12.hi.us/~discrete/
Discrete Math University Of South Carolina
Gallery, Research interests include extremal set theory, extremal graph theory, graph coloring, operations research, and applications of discrete math to biology
http://www.math.sc.edu/~sumner/discretemath/

Extractions: Gallery Research interests include extremal set theory, extremal graph theory, graph coloring, operations research, and applications of discrete math to biology, number theory, analysis of algorithms, and communications Main research interests include claw-free graphs, matchings, Ramsey theory, Hamiltonian graph theory, and the domination number. Combinatorics and graph theory, and their applications to computer science and biology. In particular: extremal problems (graphs and set systems), combinatorial geometry, discrete probability, design and analysis of algorithms, phylogeny reconstruction, graph drawing, and combinatorial optimization. Other faculty with significant discrete connections include Michael Filaseta Ralph Howard Menu document.write('SIDEMENU')
MATH510 Discrete Math - 16501 (Chris Pinner)
discrete math Info. MATH 510. 16501 Chris Pinner. General Information. Course Outline. Homeworks. HW1. 1.8 14,17,18,26,27. (Due Friday Aug 29). HW Questions HW2.
http://www.math.ksu.edu/~pinner/math510/
Powell's Books - Finite And Discrete Math: A Complete Solution Guide To Any Text
Finite and discrete math A Complete Solution Guide to Any Textbook by Rea. Available at Beaverton, Quimby Warehouse, Technical. Free Shipping!
http://www.powells.com/cgi-bin/product?isbn=0878915591
Discrete Math Faculty
The discrete mathematics Faculty Interests. Please send comments to wcherowi@math.cudenver.edu. Last updated January 23, 2003
http://www-math.cudenver.edu/~wcherowi/dmgfac.html
Discrete And Statistical Sciences
discrete and Statistical Sciences. Auburn University Library. mathSciNet. Online Manuals. Thesis Sample Files. math and Stat Links. Auburn University Graduate School. Alabama SuperComputer Network .
http://www.dms.auburn.edu/
Graph Theory And Discrete Geometry Manila 2001
A Conference in Honor of Frank Harary on his 80th Year. Ateneo de Manila University, Quezon City, the Philippines; 1517 October 2001.
http://www.math.admu.edu.ph/CGTDG2001/

Extractions: The proceedings of the conference will be published as a volume of Graphs and Combinatorics. Papers will be refereed in keeping with the standards of the journal. The paper should be 8 pages or less and should follow the format which you can find in the website of the journal Graphs and Combinatorics . Deadline for submission of the full paper: October 17, 2001. Please submit 3 copies of the paper. ORGANIZING COMMITTEE Jin Akiyama
Alex Suciu
Northeastern University, Boston. Topology and combinatorics hyperplane arrangements, the topology and geometry of manifolds, the homology of discrete groups, the homotopy theory of highdimensional knots.
http://www.math.neu.edu/~suciu/

Extractions: I hail from Bucharest, Romania. I did my undergraduate studies in Mathematics at the University of Bucharest ; here is a picture from those days. For my graduate studies, I went to Columbia University, in New York City; here is a picture from that time (taken in Cambridge, UK). After a J.W. Gibbs Instructorship at Yale University , in New Haven, I came to Northeastern University, in Boston, where I've been ever since. Math publications Other publications Citations Meetings organized ... Talks My research interests are in Topology , and how it relates to Algebra, Geometry, and Combinatorics. I mainly study the topology and combinatorics of hyperplane arrangements. I also study various problems concerning the topology and geometry of knots, links, and manifolds, and the homology and lower central series of discrete groups. Some recent papers and preprints: Torsion in Milnor fiber homology (with Dan Cohen and Graham Denham Algebraic and Geometric Topology Chen Lie algebras (with Stefan Papadima International Math. Research Notices
Alternative PK/PD Modelling - Deal
Open source package for the technical computing language R, developed by Aalborg University and Novo Nordisk A/S analysis and structure learning of Bayesian networks with discrete and/or continuous variables
http://www.math.auc.dk/novo/deal

Extractions: Front Research / Deal ] Deal is a software package freely available (under the terms of the GNU General Public License ) for use with R . It includes several methods for the analysis of Bayesian networks with variables of both discrete and/or continuous types. We restrict ourselves to conditionally Gaussian networks. Construction of priors for network parameters is supported and these parameters can be learned from data. The network score is used as a metric to compare different networks and forms the basis of a heuristic search strategy to learn the structure of the network. In addition, methods for simulation of datasets with a given dependency structure is implemented. Deal has the possibility to read and save .net files (readnet, savenet), which can be used by eg. Hugin Deal has been developed by Susanne G. Bøttcher and Claus Dethlefsen , supported by Novo Nordisk A/S. Deal is part of the gR project. You should study the paper: Susanne G. Bøttcher and Claus Dethlefsen. deal: A Package for Learning Bayesian Networks.
Peter Benner - Software
SLICOT Subroutine Library in Control Theory, Parallel Library in Control (PLiC) for largescale time-invariant linear control systems in state-space form on parallel distributed computers, eigenvalues of Hamiltonian Matrices, subroutines for compressing a symmetric or triangular matrix to packed storage mode or to unpack a packed array to full storage mode, benchmark examples of discrete-time algebraic Riccati equations, benchmark examples of continuous-time algebraic Riccati equations.
http://www.math.uni-bremen.de/~benner/software.html

Extractions: The software retrievable from this page is usually archived in tar files that are compressed with gzip . If you have any problems downloading or uncompressing the files, please click here SLICOT The Subroutine Library in Control Theory (SLICOT) is developed and maintained by the Working Group on Software (WGS) and is currently further extended within the EU funded thematic network NICONET (Numerics In COntrol NETwork). Click here to see a list of all its members. SLICOT provides Fortran 77 implementations of numerical algorithms for computations in systems and control theory. Based on numerical linear algebra routines from the BLAS and LAPACK libraries, SLICOT provides methods for the design and analysis of control systems. At present, SLICOT contains 175 user-callable subroutines and 80 low-level subroutines. SLICOT is organized in the following chapters: The documentation of SLICOT is available on-line. It contains complete descriptions of each available subroutine. To see a sample documentation of a routine (AB01MD.f), click
CCCG 2001: Canadian Conference On Computational Geometry
CCCG focuses on the mathematics of discrete geometry from a computational point of view. Despite its international following, CCCG maintains the informality of a smaller workshop (7085 attendees) and attracts a large number of students. August 13-15, 2001; Waterloo, Canada.
http://compgeo.math.uwaterloo.ca/~cccg01/

Extractions: Printable version CCCG 2001 is over! Look at http://www.cccg.ca for the information on current CCCG conference. The Canadian Conference on Computational Geometry (CCCG) focuses on the mathematics of discrete geometry from a computational point of view. Abstracting and studying the geometry problems that underly important applications of computing (such as geographic information systems, computer-aided design, simulation, robotics, solid modeling, databases, and graphics) leads not only to new mathematical results, but also to improvements in these applications. Despite its international following, CCCG maintains the informality of a smaller workshop (70-85 attendees) and attracts a large number of students. The CCCG 2001 conference is sponsored by:
Paul Garrett: Crypto And Number Theory
Introduction to cryptology, numbertheory, and algorithms. Protocols. Symmetric versus asymmetric systems. Stream, block ciphers. One-way functions, signatures. Key management. (Pseudo-) random number generation. Permutation groups. Primes, Euclidean algorithm. Finite fields. Quadratic reciprocity. discrete logs, RSA. Pseudoprimes, rho method. Elliptic curve methods.
http://www.math.umn.edu/~garrett/crypto/

Extractions: my homepage updated 14:50, 17 May 04] [this page is http://www.math.umn.edu/~garrett/crypto/] (No, I will not be teaching Crypto in 2004-05.) Some overheads from Fall '03 class: general info updated 14:55, 17 May 04] 08 Sept 2003 updated 10:44, 10 Sep 03] 10 Sept 2003 updated 18:15, 10 Sep 03] 15 Sept 2003 updated 14:43, 15 Sep 03] 17 Sept 2003 updated 15:10, 17 Sep 03] 22 Sept 2003 updated 18:22, 22 Sep 03] 24 Sept 2003 updated 13:14, 24 Sep 03] 29 Sept 2003 updated 15:20, 07 Oct 03] 01 Oct 2003, Vigenere updated 12:36, 01 Oct 03] 01 and 06 Oct 2003, Intro RSA, Diffie-Hellman, public-key issues updated 18:12, 06 Oct 03] 13 Oct 2003 updated 11:12, 15 Oct 03] 15-20 Oct 2003 updated 17:56, 21 Oct 03] 20 Oct 2003 updated 17:09, 20 Oct 03] 22 Oct 2003 updated 15:13, 22 Oct 03] 27 Oct 2003 updated 13:50, 28 Oct 03] 29 Oct 2003 updated 16:17, 18 Nov 03] 03 Nov 2003 updated 17:38, 04 Nov 03] comments on projects updated 14:04, 08 Nov 03] 10 Nov 2003 updated 18:58, 10 Nov 03] 17 Nov 2003 updated 12:09, 22 Nov 03]
5TH LATTICE PATH COMBINATORICS AND DISCRETE DISTRIBUTIONS
Dedicated to the memory of Istvan Vincze. Athens, Greece; 57 June 2002.
http://www.math.uoa.gr/~lattice/
CADCOM-Applications
Hwang, AT T Bell Laboratories, USA. The discrete Logarithm Problem in Cryptography , Alfred J. Menezes, Auburn University, USA.
http://www.dms.auburn.edu/~rodgec1/cadcom/applications/

Extractions: Accessing Memory Devices in Parallel , C.J.Colbourn, University of Vermont, Canada. Graph Drawing , Peter Eades, University of Newcastle, Australia. Flexible Manufacturing System Design , Les Foulds, University of Waikato, New Zealand. Combinatorial Group Testing The Discrete Logarithm Problem in Cryptography , Alfred J. Menezes, Auburn University, USA.
Colorful Mathematics/Background
Please use electronic mail to laf@math.ucalgary.ca or write to LAF Software 5904 Silver Ridge Dr. NW Calgary, Alberta Canada T3B 3R9.
http://www.math.ucalgary.ca/~laf/colorful/backgr.html

Extractions: The goal of these coloring games is to help students experience a mathematics problem, and understand its difficulties while achieving partial solutions. This process is at the root of mathematical and scientific reasoning, and the aim of this software is to help develop this skill. Concrete mathematical and computer science problems from graph theory. have been chosen and transformed into coloring games. The computer offers appealing tools for drawing and coloring, and is also used to provide immediate feedback to individual students reflecting their particular level of achievement. Throughout the course of each game, the computer checks for mistakes and simple algorithms have been programmed to challenge the students to improve on their results. Comments and suggestions are most welcome!
REU: Research Experience For Undergraduates - Summer 2004
Research Experiences for Undergraduates Summer 2004. DIMACS REU, DIMACS/DIMATIA REU. June 7 - July 30, 2004. DIMACS/DIMATIA participants
http://dimacs.rutgers.edu/REU/

Extractions: Research Experiences for Undergraduates - Summer 2004 DIMACS REU DIMACS/DIMATIA REU DIMACS, with National Science Foundation sponsorship, has offered an REU program since 1992. There are two REU programs associated with this program: Both programs offer the same stipend, housing and office accommodations. These REU pages have information on: General description of the REU Programs. Interested in researching in Prague? Information on the

101-116 of 116 Back | 1 | 2 | 3 | 4 | 5 | 6