Available online
Description
This introductory programme signposts the rest of the course. It picks out four areas - graphs, networks, design and enumeration - and looks at each by showing excerpts from later television programmes.
This introductory programme signposts the rest of the course. It picks out four areas - graphs, networks, design and enumeration - and looks at each by showing excerpts from later television programmes.
| Module code and title: | TM361, "Graphs, networks and design" |
|---|---|
| Item code: | TM361; 01 |
| First transmission date: | 04-03-1981 |
| Published: | 1981 |
| Rights Statement: | |
| Restrictions on use: | |
| Duration: | 00:24:21 |
| + Show more... | |
| Publisher: | BBC Open University |
| Keyword(s): | Construction; Design; Enumeration; Existence; Graphs; Networks; Optimisation |
| Footage description: | Roy Nelson, standing on studio scaffolding, introduces the programme. He points out how difficult it is to define combinatorics. Then, using excerpts from TV 2 which shows various pieces of telephone equipment, Nelson lists the sorts of problems which involve combinatorics. Robin Wilson lists the four basic concepts the course - graphs, networks, design and enumeration - and gives examples of each. Roy Nelson introduces a practical application, that of modelling a traffic system to reduce traffic congestion. In this example a firm of consultants modelled the traffic flow in Godalming so that the effect of a proposed by-pass could be determined. Shots of Godalming. Gareth Jones, the consultant explains how he set about the problem. Roy Nelson, again standing on studio scaffolding, lists four ways in which practical problems of combinatorics can divided. He labels them existence, construction, enumeration and optimisation. As as example of existence problems, an excerpt from a later T.V. programme dealing with the four colour problem is shown. Shots of several maps illustrate the problem. Commentary by Robin Wilson. The programme goes on to look at an example of a construction problem, in this case an algorithm. As an example, excerpts from a later TV programme which look, at a truck assembly line are shown. Commentary by Roy Nelson talks through the process step by step. Norman Biggs, with the aid of a network diagram, looks at the problem of dealing with networks of any size in mathematical terms. Robin Wilson and Allan Solomon look at an enumeration problem with the aid of an excerpt from a later TV programme. The excerpt shows an experiment with liquid helium in which certain properties of helium can be interpreted in terms of counting procedures. Wilson demonstrates the principle behind the experiment with the aid of coloured balls and slots for them to fit in. Using film shots of offshore pipelines being manufactured and installed, Roy Nelson discusses the fourth problem optimisation. Here combinations are used to determine which of two methods of pipeline construction is best for a particular application. Howard Frank of Network Analysis Corporation explains how he would approach a problem such as the pipeline construction problem above. He uses a network diagram to illustrate his points. Roy Nelson, in the studio, summarises the programme. |
| Production number: | FOUT086L |
| Videofinder number: | 1522 |
| Available to public: | no |
