Logo

Mathematical Sciences Research Institute

Home » Emerging Applications of Combinatorial Design

Workshop

Emerging Applications of Combinatorial Design November 05, 2000 - November 10, 2000
Registration Deadline: November 10, 2000 almost 14 years ago
To apply for Funding you must register by: August 05, 2000 about 14 years ago
Organizers Esther Lamken (chair), (Caltech Mathematics), Charlie Colbourn (VermontComputer Science), Jeff Dinitz (Vermont Mathematics)
Speaker(s)

Show List of Speakers

Description

This workshop will emphasize constructions and computational methods for combinatorial designs and the growing number of new and useful applications of designs in biology/biotechnology, computer science, information theory, and numerical finance.

Examples of areas of application in computer science include data mining, storage in disk arrays, the design of parallel algorithms, software testing, database formatting, file organization, the analysis of algorithms, the design of networks, and interconnection strategies for networks. Examples of other applications in information theory include wireless networking (the design of radio and satellite networks), internet communication protocols, signal processing, and multiaccess communications.

Many of the applications in molecular biology/biotechnology come from the human genome project: mapping genomes, forming the clone libraries, and designing chips for DNA probes. In the past year and a half, a new application of designs has come out of Wall Street; (t,m,s)-nets are being used in numerical integration problems in financial mathematics. All of these applications share a common feature; they require the construction of highly structured combinatorial designs.


Funding & Logistics Show All Collapse

Show Funding

To apply for funding, you must register by the funding application deadline displayed above.

Students, recent Ph.D.'s, women, and members of underrepresented minorities are particularly encouraged to apply. Funding awards are typically made 6 weeks before the workshop begins. Requests received after the funding deadline are considered only if additional funds become available.

Show Lodging

MSRI has preferred rates at the Rose Garden Inn, depending on room availability. Reservations may be made by calling 1-800-992-9005 OR directly on their website. Click on Corporate at the bottom of the screen and when prompted enter code MATH (this code is not case sensitive). By using this code a new calendar will appear and will show the MSRI rate on all room types available.

MSRI has preferred rates at the Hotel Durant. Reservations may be made by calling 1-800-238-7268. When making reservations, guests must request the MSRI preferred rate. If you are making your reservations on line, please go to this link and enter the promo/corporate code MSRI123. Our preferred rate is $129 per night for a Deluxe Queen/King, based on availability.

MSRI has preferred rates of $149 - $189 plus tax at the Hotel Shattuck Plaza, depending on room availability. Guests can either call the hotel's main line at 510-845-7300 and ask for the MSRI- Mathematical Science Research Inst. discount; or go to www.hotelshattuckplaza.com and click Book Now. Once on the reservation page, click “Promo/Corporate Code“ and input the code: msri.

MSRI has preferred rates of $110 - $140 at the Berkeley Lab Guest House, depending on room availability. Reservations may be made by calling 510-495-8000 or directly on their website. Select “I am an individual traveler affiliated with MSRI”.

Additional lodging options may be found on our short term housing page.

Show Directions to Venue

Show Visa/Immigration

Schedule
Show All Collapse
Nov 05, 2000
Sunday
02:00 PM - 03:00 PM
  Scheduling Tournaments and Leagues
Jeff Dinitz (University of Vermont)
Nov 06, 2000
Monday
09:00 AM - 10:30 AM
  Applications of combinatorial designs in communications and networking
Charles Colbourn (Arizona State University)
10:30 AM - 01:30 PM
  A survey of packing and covering designs
Ronald Mullin
01:30 PM - 02:30 PM
  Factor-covering designs for testing software
Sid Dalal
02:30 PM - 03:30 PM
  Constructing Large Designs
Malcolm Greig
Nov 07, 2000
Tuesday
09:00 AM - 10:30 AM
  Combinatorial problems arising in high dimensional integration and approximation
Art Owen
10:30 AM - 11:30 AM
  Small and beautiful: Designing DNA sequences for molecular recognition
Benno Schwikowski
11:30 AM - 02:00 PM
  Combinatorics of the ordered Hamming space
William Martin
02:00 PM - 02:30 PM
  Recent results on difference sets with classical parameters
Qing Xiang
02:30 PM - 03:00 PM
  Ladder orderings for double erasure codes
Myra Cohen
03:00 PM - 04:00 PM
  The integer programming approach for generating designs
Lucia Moura
04:00 PM - 05:00 PM
  Computational methods for combinatorial design construction
Peter Gibbons
Nov 08, 2000
Wednesday
09:00 AM - 10:30 AM
  Applications of combinatorial designs in digital communication
Vladimir Tonchev (Michigan Technological University)
10:30 AM - 11:30 AM
  Using combinatorial designs in the construciton of pool designs for clone screening
Frank Hwang
11:30 AM - 02:00 PM
  The need for speed: Combinatorial implications of an important application of Monte Carlo methods in financial risk management
Mark Lawrence
02:00 PM - 03:30 PM
  Sharp asymptotic bounds on two-stage group testing efficiency
Toby Berger
03:30 PM - 04:30 PM
  Designing storage area network fabrics
Julie Ward
Nov 09, 2000
Thursday
09:00 AM - 10:30 AM
  Quality control in manufacturing DNA arrays: A combinatorial design approach
Martin Tompa
10:30 AM - 11:30 AM
  Some applications of combinatorial designs to extremal graph theory
Alan Ling
11:30 AM - 01:30 PM
  Biologically motivated design problems
David Torney
01:30 PM - 02:00 PM
  Hamilton decompositions of directed wrapped butterfly graphs
Helen Verrall
02:00 PM - 03:30 PM
  Selected applications of combinatorial designs
Tran Trung
03:30 PM - 04:00 PM
  Two applications of combinatorial design theory
Jonathan Jedwab