Skip to main content

Research Repository

Advanced Search

All Outputs (2741)

Advances in modal liquid crystals (2003)
Presentation / Conference Contribution
Kirby, A. K., Love, G. D., Naumov, A. F., & Kotova, S. (2003). Advances in modal liquid crystals.

CyberWalk : a web-based distributed virtual walkthrough environment (2003)
Journal Article
Chim, J., Lau, R. W., Leong, H., & Si, A. (2003). CyberWalk : a web-based distributed virtual walkthrough environment. IEEE Transactions on Multimedia, 5(4), 503-515. https://doi.org/10.1109/tmm.2003.819094

A distributed virtual walkthrough environment allows users connected to the geometry server to walk through a specific place of interest, without having to travel physically. This place of interest may be a virtual museum, virtual library or virtual... Read More about CyberWalk : a web-based distributed virtual walkthrough environment.

VSculpt : a distributed virtual sculpting environment for collaborative design (2003)
Journal Article
Li, F., Lau, R. W., & Ng, F. (2003). VSculpt : a distributed virtual sculpting environment for collaborative design. IEEE Transactions on Multimedia, 5(4), 570-580. https://doi.org/10.1109/tmm.2003.814795

A collaborative virtual sculpting system supports a team of geographically separated designers/engineers connected by networks to participate in designing three-dimensional (3-D) virtual engineering tools or sculptures. It encourages international co... Read More about VSculpt : a distributed virtual sculpting environment for collaborative design.

A fixpoint theory for non-monotonic parallelism (2003)
Journal Article
Chen, Y. (2003). A fixpoint theory for non-monotonic parallelism. Theoretical Computer Science, 308(1-3), 367-392. https://doi.org/10.1016/s0304-3975%2802%2900893-9

This paper studies parallel recursion. The trace specification language used in this paper incorporates sequentiality, nondeterminism, reactiveness (including infinite traces), three forms of parallelism (including conjunctive, fair-interleaving and... Read More about A fixpoint theory for non-monotonic parallelism.

Guaranteed inconsistency avoidance during software evolution (2003)
Journal Article
Gallagher, K., Harman, M., & Danicic, S. (2003). Guaranteed inconsistency avoidance during software evolution. Journal of software maintenance and evolution, 15(6), 393-416. https://doi.org/10.1002/smr.289

The attempt to design and integrate consistent changes to an existing system is the essence of software maintenance. Software developers also confront similar problems: there are changes during testing, and the release of new system builds. Whether i... Read More about Guaranteed inconsistency avoidance during software evolution.

Software evolution in an interdisciplinary environment. (2003)
Presentation / Conference Contribution
Bennett, K., Bradley, S., Glover, G., & Barnes, D. (2003). Software evolution in an interdisciplinary environment. In L. O'Brien, & N. Gold (Eds.), Eleventh Annual International Workshop on Software Technology and Engineering Practice: (STEP 2003): proceedings: Amsterdam, the Netherlands, September 9-21, 2003 (199-203). https://doi.org/10.1109/step.2003.30

At Durham, an interdisciplinary team has implemented the UK?s first web-centred data base of adult mental health service provision (we regard interdisciplinary research to be taking place when two or more groups from different disciplines work togeth... Read More about Software evolution in an interdisciplinary environment..

Reasoning about temporal relations : the maximal tractable subalgebras of Allen's interval algebra (2003)
Journal Article
Krokhin, A., Jeavons, P., & Jonsson, P. (2003). Reasoning about temporal relations : the maximal tractable subalgebras of Allen's interval algebra. Journal of the ACM, 50(5), 591-640. https://doi.org/10.1145/876638.876639

Allen's interval algebra is one of the best established formalisms for temporal reasoning. This article provides the final step in the classification of complexity for satisfiability problems over constraints expressed in this algebra. When the const... Read More about Reasoning about temporal relations : the maximal tractable subalgebras of Allen's interval algebra.

Moral dominance relations for program comprehension (2003)
Journal Article
Shaw, S., Goldstein, M., Munro, M., & Burd, E. (2003). Moral dominance relations for program comprehension. IEEE Transactions on Software Engineering, 29(9), 851-863. https://doi.org/10.1109/tse.2003.1232289

Dominance trees have been used as a means for reengineering legacy systems into potential reuse candidates. The dominance relation suggests the reuse candidates which are identified by strongly directly dominated subtrees. We review the approach and... Read More about Moral dominance relations for program comprehension.

CASE tool evaluation : experiences from an empirical study (2003)
Journal Article
Budgen, D., & Thomson, M. (2003). CASE tool evaluation : experiences from an empirical study. Journal of Systems and Software, 67(2), 55-75. https://doi.org/10.1016/s0164-1212%2802%2900088-2

While research activity in software engineering often results in the development of software tools and solutions that are intended to demonstrate the feasibility of an idea or concept, any resulting conclusions about the degree of success attained ar... Read More about CASE tool evaluation : experiences from an empirical study.

On relativisation and complexity gap for resolution-based proof systems (2003)
Presentation / Conference Contribution
Dantchev, S., & Riis, S. (2003). On relativisation and complexity gap for resolution-based proof systems. In Computer science logic : 17th International Workshop CSL 2003, 12th Annual Conference of the EACSL, 8th Kurt Gödel Colloquium, KGC 2003, 25-30 August 2003, Vienna, Austria ; proceedings (142-154). https://doi.org/10.1007/978-3-540-45220-1_14

We study the proof complexity of Taut, the class of Second-Order Existential (SO∃) logical sentences which fail in all finite models. The Complexity-Gap theorem for Tree-like Resolution says that the shortest Tree-like Resolution refutation of any su... Read More about On relativisation and complexity gap for resolution-based proof systems.

Amalgamations of connected k-factorizations (2003)
Journal Article
Hilton, A., Johnson, M., Rodger, C., & Wantland, E. (2003). Amalgamations of connected k-factorizations. Journal of Combinatorial Theory, Series B, 88(2), 267-279. https://doi.org/10.1016/s0095-8956%2803%2900030-3

In this paper, necessary and sufficient conditions are found for a graph with exactly one amalgamated vertex to be the amalgamation of a k-factorization of Kkn+1 in which each k-factor is connected. From this result, necessary and sufficient conditio... Read More about Amalgamations of connected k-factorizations.

The complexity of achievement and maintenance problems in agent-based systems (2003)
Journal Article
Stewart, I. (2003). The complexity of achievement and maintenance problems in agent-based systems. Artificial Intelligence, 146(2), 175-191. https://doi.org/10.1016/s0004-3702%2803%2900014-6

We completely classify the computational complexity of the basic achievement and maintenance agent design problems in bounded environments when these problems are parameterized by the number of environment states and the number of agent actions. The... Read More about The complexity of achievement and maintenance problems in agent-based systems.

Functions of multiple-valued logic and the complexity of constraint satisfaction: A short survey (2003)
Presentation / Conference Contribution
Krokhin, A., Bulatov, A., & Jeavons, P. (2003). Functions of multiple-valued logic and the complexity of constraint satisfaction: A short survey. In 33rd international symposium on multiple-valued logic, ISMVL'03, 16-19 May 2003, Meiji University, Tokyo, Japan ; proceedings (343-351). https://doi.org/10.1109/ismvl.2003.1201427

Many computational problems arising in artificial intelligence, computer science and elsewhere can be represented as constraint satisfaction and optimization problems. In this short survey we discuss an approach that is related to the algebraic compo... Read More about Functions of multiple-valued logic and the complexity of constraint satisfaction: A short survey.

Matching games : the least core and the nucleolus (2003)
Journal Article
Kern, W., & Paulusma, D. (2003). Matching games : the least core and the nucleolus. Mathematics of Operations Research, 28(2), 294-308. https://doi.org/10.1287/moor.28.2.294.14477

A matching game is a cooperative game defined by a graph G = (V, E). The player set is V and the value of a coalition S # V is defined as the size of a maximum matching in the subgraph induced by S. We show that the nucleolus of such games can be com... Read More about Matching games : the least core and the nucleolus.