Investigation of the perceived usefulness of a StudyNet group discussion facility by international students

Postgraduate international students at UK institutions of higher education often find difficulty dealing with seminar-type discussions. An attempt was made to help students with this by utilising the group discussion facility of StudyNet. However, as most of the students were from East Asia, where education is often considered as essentially a passive process rather than something they have to do for themselves, it was felt necessary to investigate this to see how seriously they took such an activity. A questionnaire was therefore given to the students and the results analysed. Despite some criticisms, the students were generally found to understand the purpose of the activity and think it beneficial. Thus, overall, when activities are clearly seen to be related to the learning outcomes and integrated into the course, they can be used with confidence with East Asian students.Peer reviewe

The 8-13 micron observations of Titan

Narrow band observations of Titan at selected wavelengths in the 8-13 micron range show evidence for a strong temperature inversion and the existence of at least one more spectroscopically active component in the atmosphere in addition to H2 and CH4

Study of state-of-the-art static inverter design Final report, 6 Jan. - 6 Jun. 1966

Multiple purpose inverter design based on phase demodulated inverter circuit selected from state-of-the-art assessment of ten inverter circuit

The peculiar planetary nebula in M22

The source discovered by the IRAS satellite near the center of the globular cluster M22, IRAS 18333-2357, has been studied using the IUE satellite and a ground-based optical telescope. The northern component of the close pair of stars is not a member of the cluster. The southern component is a hot star with T_(eff) ≈ 50,000 K illuminating a small planetary nebula and is a member of M22. Both the planetary nebula and its central star are extremely hydrogen deficient. The luminosity of the central star is in good agreement with that expected on theoretical grounds and with the observed luminosity of the tip of the red giant branch

Heuristic Coloring Algorithm for the Composite Graph Coloring Problem

A composite graph is a finite undirected graph in which a positive integer known as a chromaticity is associated with each vertex of the graph. The composite graph coloring problem (CGCP) is the problem of finding the chromatic number of a composite graph, i.e., the minimum number of colors (positive integers) required to assign a sequence of consecutive colors to each vertex of the graph in a manner such that adjacent vertices are not assigned sequences with colors in common and the sequence assigned to a vertex has the number of colors indicated by the chromaticity of the vertex. The CGCP problem is an NP-complete problem that has applications to scheduling and resource allocation problems in which the tasks to be scheduled are of unequal durations. The pigeonhole principle gives rise to a problem reduction technique for the CGCP and a vertex ordering used in the vertex-sequentia1-with-interchange (VSI) algorithm. LFPHI. An upper bound on the chromatic number of a composite graph is obtained from the definition of a color-sequential coloring algorithm for the CGCP. The performances of twelve heuristic coloring algorithms are compared on a variety of random composite graphs. Three VSI algorithms (LF1I, LFPHI, and LFCDI) performed superior to the other algorithms on graphs having the lower numbers of vertices and low edge densities while two color-sequential algorithms (RLF1 and RLFD1) were superior on graphs having the higher numbers of vertices and high edge densities

Information Theoretic Estimation of Clone Overlap Probabilities

This technical report describes preliminary research investigating the relationship between information theory and Bayes\u27 theory for estimation of the probability of clone overlap for the use in DNA restriction mapping. A number of languages (along with information theoretic metrics) capable of describing a hypothesized overlap are presented. For each language, the MML criterion is applied to the encoded overlaps of a pair of clones to search for that overlap which is most probable. The objective is to order the pair\u27s encoded overlaps, based on the MML criterion, from the most to the least probable. This ordering is compared to the ordering suggestion by the Bayesian probabilistic approach