All Outputs (8)

Broadcasting On-Line Social Interaction as Inhabited Television (1999)
Presentation / Conference Contribution
Benford, S., Greenhalgh, C., Craven, M., Walker, G., Regan, T., Morphett, J., Wyver, J., & Bowers, J. (1999, September). Broadcasting On-Line Social Interaction as Inhabited Television. Presented at Sixth European Conference on Computer Supported Cooperative Work, Copenhagen, Denmark

Inhabited TV combines collaborative virtual environments (CVEs) with broadcast TV so that on-line audiences can participate in TV shows within shared virtual worlds. Three early experiments with inhabited TV raised fundamental questions concerning th... Read More about Broadcasting On-Line Social Interaction as Inhabited Television.

Patterns of network and user activity in an inhabited television event (1999)
Presentation / Conference Contribution
Greenhalgh, C., Benford, S., & Craven, M. (1999, December). Patterns of network and user activity in an inhabited television event. Presented at ACM Symposium on Virtual Reality Software and Technology, Proceedings, VRST, London, UK

Inhabited Television takes traditional broadcast television and combines it with multiuser virtual reality, to give new possibilities for interaction and participation in and around shows or channels. 'Out Of This World' was an experimental inhabited... Read More about Patterns of network and user activity in an inhabited television event.

Three dimensional visualization of the World Wide Web (1999)
Journal Article
Benford, S., Taylor, I., Brailsford, D. F., Koleva, B., Craven, M. P., Fraser, M., Reynard, G., & Greenhalgh, C. (1999). Three dimensional visualization of the World Wide Web. ACM Computing Surveys, 31(4es),

Although large-scale public hypermedia structures such as the World Wide Web are popularly referred to as "cyberspace", the extent to which they constitute a space in the everyday sense of the word is questionable. This paper reviews recent work in t... Read More about Three dimensional visualization of the World Wide Web.

Separable Hyperstructure and Delayed Link Binding (1999)
Journal Article
Brailsford, D. F. (1999). Separable Hyperstructure and Delayed Link Binding. ACM Computing Surveys, 31(4es), https://doi.org/10.1145/345966.346029

As the amount of material on the World Wide Web continues to grow, users are discovering that the Web's embedded, hard-coded, links are difficult to maintain and update. Hyperlinks need a degree of abstraction in the way they are specified together w... Read More about Separable Hyperstructure and Delayed Link Binding.

Genetic algorithms for multiple-choice problems (1999)
Thesis
Aickelin, U. Genetic algorithms for multiple-choice problems. (Thesis). University of Wales Swansea. https://nottingham-repository.worktribe.com/output/1163583

This thesis investigates the use of problem-specific knowledge to enhance a genetic algorithm approach to multiple-choice optimisation problems. It shows that such information can significantly enhance performance, but that the choice of information... Read More about Genetic algorithms for multiple-choice problems.

A Tutorial on the Universality and Expressiveness of Fold (1999)
Journal Article
Hutton, G. (1999). A Tutorial on the Universality and Expressiveness of Fold. Journal of Functional Programming, 9(4), https://doi.org/10.1017/s0956796899003500

In functional programming, fold is a standard operator that encapsulates a simple pattern of recursion for processing lists. This article is a tutorial on two key aspects of the fold operator for lists. First of all, we emphasize the use of the uni... Read More about A Tutorial on the Universality and Expressiveness of Fold.

Using a Generalisation Critic to find Bisimulations for Coinductive Proofs (1999)
Presentation / Conference Contribution
Dennis, L. A., Bundy, A., & Green, I. Using a Generalisation Critic to find Bisimulations for Coinductive Proofs. Presented at 14th International Conference on Automated Deduction (CADE-14)

Coinduction is a method of growing importance in reasoning about functional languages, due to the increasing prominence of lazy data structures. Through the use of bisimulations and proofs that bisimilarity is a congruence in various domains it can... Read More about Using a Generalisation Critic to find Bisimulations for Coinductive Proofs.

Proof methods for structured corecursive programs (1999)
Presentation / Conference Contribution
Gibbons, J., & Hutton, G. Proof methods for structured corecursive programs. Presented at 1st Scottish Functional Programming Workshop

Corecursive programs produce values of greatest fixpoint types, in contrast to recursive programs, which consume values of least fixpoint types. There are a number of widely used methods for proving properties of corecursive programs, including fixp... Read More about Proof methods for structured corecursive programs.