Skip to main content

Research Repository

Advanced Search

All Outputs (2743)

A Trajectory-Preserving Synchronization Method for Collaborative Visualization (2006)
Journal Article
Li, L., Li, F., & Lau, R. (2006). A Trajectory-Preserving Synchronization Method for Collaborative Visualization. IEEE Transactions on Visualization and Computer Graphics, 12(5), 989-996. https://doi.org/10.1109/tvcg.2006.114

In the past decade, a lot of research work has been conducted to support collaborative visualization among remote users over the networks, allowing them to visualize and manipulate shared data for problem solving. There are many applications of colla... Read More about A Trajectory-Preserving Synchronization Method for Collaborative Visualization.

Software Architecture-based Regression Testing (2006)
Journal Article
Muccini, H., Dias, M., & Richardson, D. (2006). Software Architecture-based Regression Testing. Journal of Systems and Software, 79(10), 1379-1396. https://doi.org/10.1016/j.jss.2006.02.059

Software architectures are becoming centric to the development of quality software systems, being the first concrete model of the software system and the base to guide the implementation of software systems. When architecting dependable systems, in a... Read More about Software Architecture-based Regression Testing.

Web services : an approach to business integration models for micro-payment (2006)
Journal Article
Song, W., Chen, D., & Chung, J. (2006). Web services : an approach to business integration models for micro-payment. International Journal of Electronic Business, 4(3/4), 265-280. https://doi.org/10.1504/ijeb.2006.010866

The introduction of the semantic web and web service technologies enables business processes, modelling and management to enter an entirely new stage. Traditional web-based business data and transactions can now be extracted to discover new business... Read More about Web services : an approach to business integration models for micro-payment.

Stop-list Slicing (2006)
Presentation / Conference Contribution
Gallagher, K., Binkley, D., Harman, M., Di Penta, M., & Moonen, L. (2006). Stop-list Slicing. In 6th IEEE International Workshop on Source Code Analysis and Manipulation, SCAM '06, 11-20 September 2006, Philadelphia USA ; proceedings (11-20). https://doi.org/10.1109/scam.2006.30

Traditional program slicing requires two parameters: a program location and a variable, or perhaps a set of variables, of interest. Stop-list slicing adds a third parameter to the slicing criterion: those variables that are not of interest. This thir... Read More about Stop-list Slicing.

Identifying X-Trees with Few Characters (2006)
Journal Article
Bordewich, M., Semple, C., & Steel, M. (2006). Identifying X-Trees with Few Characters. Electronic Journal of Combinatorics, 13(1),

Previous work has shown the perhaps surprising result that, for any binary phylogenetic tree T, there is a set of four characters that define T. Here we deal with the general case, where T is an arbitrary X-tree. We show that if d is the maximum degr... Read More about Identifying X-Trees with Few Characters.

The complexity of soft constraint satisfaction (2006)
Journal Article
Cohen, D., Cooper, M., Jeavons, P., & Krokhin, A. (2006). The complexity of soft constraint satisfaction. Artificial Intelligence, 170(11), 983-1016. https://doi.org/10.1016/j.artint.2006.04.002

Over the past few years there has been considerable progress in methods to systematically analyse the complexity of constraint satisfaction problems with specified constraint types. One very powerful theoretical development in this area links the com... Read More about The complexity of soft constraint satisfaction.

Stopping times, metrics and approximate counting (2006)
Presentation / Conference Contribution
Bordewich, M., Dyer, M., & Karpinski, M. (2006). Stopping times, metrics and approximate counting. In M. Bugliesi, B. Preneel, V. Sassone, & I. Wegener (Eds.), Automata, languages and programming : 33rd International Colloquium, ICALP 2006, 10-14 July 2006, Venice, Italy ; proceedings, part I (108-119). https://doi.org/10.1007/11786986_11

In this paper we examine the importance of the choice of metric in path coupling, and its relationship to stopping time analysis. We give strong evidence that stopping time analysis is no more powerful than standard path coupling. In particular, we p... Read More about Stopping times, metrics and approximate counting.

Extending the limits of supertree methods (2006)
Journal Article
Bordewich, M., Evans, G., & Semple, C. (2006). Extending the limits of supertree methods. Annals of Combinatorics, 10, 31-51

Recently, two exact polynomial-time supertree methods have been developed in which the traditional input of rooted leaf-labelled trees has been extended in two separate ways. The first method, called RANKEDTREE, allows for the inclusion of relative d... Read More about Extending the limits of supertree methods.

Listening to Program Slices (2006)
Presentation / Conference Contribution
Berman, L., & Gallagher, K. (2006). Listening to Program Slices.

Comprehending a computer program can be a daunting task. There is much to understand, including the interaction among different parts of the code. Program slicing is a vehicle that can help one understand this interaction. Because present-day visual... Read More about Listening to Program Slices.

Modal liquid crystal devices in optical tweezing: 3D control and oscillating potential wells (2006)
Journal Article
Hands, P., Tatarkova, S., Kirby, A., & Love, G. (2006). Modal liquid crystal devices in optical tweezing: 3D control and oscillating potential wells. Optics Express, 14(10), 4525-4537. https://doi.org/10.1364/oe.14.004525

We investigate the use of liquid crystal (LC) adaptive optics elements to provide full 3 dimensional particle control in an optical tweezer. These devices are suitable for single controllable traps, and so are less versatile than many of the competin... Read More about Modal liquid crystal devices in optical tweezing: 3D control and oscillating potential wells.

A Shack-Hartmann wavefront sensor projected on to the sky with reduced focal anisoplanatism (2006)
Journal Article
Butterley, T., Love, G., Wilson, R., Myers, R., & Morris, T. (2006). A Shack-Hartmann wavefront sensor projected on to the sky with reduced focal anisoplanatism. Monthly Notices of the Royal Astronomical Society, 368(2), 837-843. https://doi.org/10.1111/j.1365-2966.2006.10160.x

A method for producing a laser guide star wavefront sensor for adaptive optics with reduced focal anisoplanatism is presented. A theoretical analysis and numerical simulations have been carried out and the results are presented. The technique, named... Read More about A Shack-Hartmann wavefront sensor projected on to the sky with reduced focal anisoplanatism.

Clique-width minimization is NP-hard (2006)
Presentation / Conference Contribution
Fellows, M. R., Rosamond, F. A., Rotics, U., & Szeider, S. (2006). Clique-width minimization is NP-hard. . https://doi.org/10.1145/1132516.1132568

Clique-width is a graph parameter that measures in a certain sense the complexity of a graph. Hard graph problems (e.g., problems expressible in Monadic Second Order Logic with second-order quantification on vertex sets, that includes NP-hard problem... Read More about Clique-width minimization is NP-hard.

An infinite hierarchy in a class of polynomial-time program schemes (2006)
Journal Article
Gault, R., & Stewart, I. (2006). An infinite hierarchy in a class of polynomial-time program schemes. Theory of Computing Systems, 39(5), 753-783. https://doi.org/10.1007/s00224-005-1230-6

We define a class of program schemes RFDPS constructed around notions of forall-loops, repeat-loops, arrays and if-then-else instructions, and which take finite structures as inputs, and we examine the class of problems, denoted RFDPS also, accepted... Read More about An infinite hierarchy in a class of polynomial-time program schemes.

Verifying multi-agent programs by model checking (2006)
Journal Article
Bordini, R. H., Fisher, M., Visser, W., & Wooldridge, M. (2006). Verifying multi-agent programs by model checking. Autonomous Agents and Multi-Agent Systems, 12(2), 239-256. https://doi.org/10.1007/s10458-006-5955-7

This paper gives an overview of our recent work on an approach to verifying multi-agent programs. We automatically translate multi-agent systems programmed in the logic-based agent-oriented programming language AgentSpeak into either Promela or Java,... Read More about Verifying multi-agent programs by model checking.

The computational complexity of the parallel knock-out problem (2006)
Presentation / Conference Contribution
Broersma, H., Johnson, M., Paulusma, D., & Stewart, I. (2006). The computational complexity of the parallel knock-out problem. In LATIN 2006 : theoretical informatics: : 7th Latin American symposium, Valdivia, Chile, March 20-24, 2006 : proceedings (250-261). https://doi.org/10.1007/11682462_26

We consider computational complexity questions related to parallel knock-out schemes for graphs. In such schemes, in each round, each remaining vertex of a given graph eliminates exactly one of its neighbours. We show that the problem of whether, for... Read More about The computational complexity of the parallel knock-out problem.

Efficient Rendering of Deformable Objects for Real-time Applications (2006)
Journal Article
Cheung, G., Lau, R., & Li, F. (2006). Efficient Rendering of Deformable Objects for Real-time Applications. Computer Animation and Virtual Worlds, 17(1), 69-81. https://doi.org/10.1002/cav.71

Deformable objects can be used to model soft objects such as clothing, human faces and animal characters. They are important as they can improve the realism of the applications. However, most existing hardware accelerators cannot render deformable ob... Read More about Efficient Rendering of Deformable Objects for Real-time Applications.

Solution of parameter-varying linear matrix inequalities in Toeplitz form (2006)
Journal Article
Mertzios, G. (2006). Solution of parameter-varying linear matrix inequalities in Toeplitz form. Journal of applied functional analysis, 1(2), 131-152

In this paper the necessary and sufficient conditions are given for the solution of a system of parameter varying linear inequalities of the form A (t) x ≥ b (t) for all t ∈ T ,where T is an arbitrary set, x is the unknown vector, A (t) is a known tria... Read More about Solution of parameter-varying linear matrix inequalities in Toeplitz form.