Outputs (64)

International workshop on realising evidence-based software engineering (2005)
Presentation / Conference Contribution
Budgen, D., Brereton, P., Kitchenham, B., & Linkman, S. (2005, February). International workshop on realising evidence-based software engineering. Presented at Proceedings - International Conference on Software Engineering, St Louis, USA

This workshop is concerned with defining the procedures that are needed to establish a sound empirical foundation for the practices of Software Engineering. Our goal is to begin building a community that will review, analyse, codify and promulgate so... Read More about International workshop on realising evidence-based software engineering.

Realising evidence-based software engineering (2005)
Presentation / Conference Contribution
Kitchenham, B., Budgen, D., Brereton, P., & Linkman, S. H. (2005, February). Realising evidence-based software engineering. Presented at Proceedings of the 2005 Workshop on Realising Evidence-Based Software Engineering, REBSE '05, St Louis, USA

This paper provides an introduction to the papers for the Workshop on Realising Evidence-Based Software Engineering. Copyright 2005 ACM.

A conceptual model for virtual organizations in the grid (2005)
Presentation / Conference Contribution
Song, W., Li, X., Zhuge, H., & Fox, G. (2005, November). A conceptual model for virtual organizations in the grid. Presented at Fourth International Conference on Grid and Cooperative Computing, Beijing, China

One of the key problems with virtual organizations in the context of the (Semantic) Grid is we don’t know how to describe the components used in virtual organizations because they appear to be dynamic, dispersed, transient, type-vague (or we don’t kn... Read More about A conceptual model for virtual organizations in the grid.

Finding Frequent Patterns in a String in Sublinear Time (2005)
Presentation / Conference Contribution
Berenbrink, P., Ergun, F., & Friedetzky, T. (2005, October). Finding Frequent Patterns in a String in Sublinear Time. Presented at 13th Annual European Symposium on Algorithms : ESA 2005, Ibiza, Spain

We consider the problem of testing whether (a large part of) a given string X of length n over some finite alphabet is covered by multiple occurrences of some (unspecified) pattern Y of arbitrary length in the combinatorial property testing model. Ou... Read More about Finding Frequent Patterns in a String in Sublinear Time.

Business integration models in the context of web services (2005)
Presentation / Conference Contribution
Song, W., Chen, D., Chung, J.-Y., Chen, G., & Ni, L. (2005, October). Business integration models in the context of web services. Presented at IEEE International Conference on e-Business Engineering 2005 : ICEBE 2005., Beijing, China

E-commerce development and applications have been bringing the Internet to business and marketing and reforming our current business styles and processes. The rapid development of the Web, in particular, the introduction of the semantic web and web s... Read More about Business integration models in the context of web services.

Approximate counting and quantum computation (2005)
Journal Article
Bordewich, M., Freedman, M., Lovasz, L., & Welsh, D. (2005). Approximate counting and quantum computation. Combinatorics, Probability and Computing, 14(5-6), 737-754. https://doi.org/10.1017/s0963548305007005

Motivated by the result that an `approximate' evaluation of the Jones polynomial of a braid at a $5^{th}$ root of unity can be used to simulate the quantum part of any algorithm in the quantum complexity class BQP, and results relating BQP to the cou... Read More about Approximate counting and quantum computation.

Backdoor Sets for DLL Subsolvers (2005)
Journal Article
Szeider, S. (2005). Backdoor Sets for DLL Subsolvers. Journal of Automated Reasoning, 35(1-3), 73-88. https://doi.org/10.1007/s10817-005-9007-9

We study the parameterized complexity of detecting small backdoor sets for instances of the propositional satisfiability problem (SAT). The notion of backdoor sets has been recently introduced by Williams, Gomes, and Selman for explaining the ‘heavy-... Read More about Backdoor Sets for DLL Subsolvers.

Pedagogic data as a basis for Web service fault models (2005)
Presentation / Conference Contribution
Looker, N., Burd, L., Drummond, S., Xu, J., & Munro, M. (2005, October). Pedagogic data as a basis for Web service fault models. Presented at IEEE International Workshop on Service-Oriented System Engineering (SOSE'05)., Beijing, PRC

This paper outlines our method for deriving Fault Models for use with our WS-FIT tool that can be used to assess the dependability of SOA. Since one of the major issues with extracting these heuristic rules and Fault Models is the availability of sof... Read More about Pedagogic data as a basis for Web service fault models.

Identifying Structural Features of Java Programs by Analysing the Interaction of Classes at Runtime (2005)
Presentation / Conference Contribution
Smith, M., & Munro, M. (2005, September). Identifying Structural Features of Java Programs by Analysing the Interaction of Classes at Runtime. Presented at International Workshop on Visualizing Software for Understanding and Analysis (VISSOFT), Budapest

Identifying phylogenetic trees (2005)
Journal Article
Bordewich, M., Huber, K., & Semple, C. (2005). Identifying phylogenetic trees. Discrete Mathematics, 300(1-3), 30-43. https://doi.org/10.1016/j.disc.2005.06.015

A central problem that arises in evolutionary biology is that of displaying partitions of subsets of a finite set X on a tree whose vertices are partially labelled with the elements of X. Such a tree is called an X-tree and, for a collection C of par... Read More about Identifying phylogenetic trees.