Skip to main content

Research Repository

Advanced Search

Outputs (3179)

CbSSDF and OWL-S, A Scenario based Solution Analysis and Comparison (2009)
Presentation / Conference Contribution
Du, X., Song, W., & Munro, M. (2009, December). CbSSDF and OWL-S, A Scenario based Solution Analysis and Comparison. Presented at 18th International Conference on Information System development (ISD2009), Nanchang, China

To tackle the semantic issues of web services, we proposed a comprehensive semantic service description framework – CbSSDF – and a two-step service discovery mechanism based on CbSSDF to help service users to easily locate their required services. In... Read More about CbSSDF and OWL-S, A Scenario based Solution Analysis and Comparison.

Objectivity in Research: Challenges from the Evidence-Based Paradigm. (2009)
Presentation / Conference Contribution
Charters, S., Budgen, D., Turner, M., Kitchenham, B., Brereton, P., & Linkman, S. (2009, December). Objectivity in Research: Challenges from the Evidence-Based Paradigm. Presented at 20th Australian Software Engineering Conference, ASWEC 2009

For other domains that have adopted the evidence-based paradigm, the impact has included research outcomes having greater influence in terms of informing and influencing practitioners and policy-makers. We examine how evidence-based practices are bei... Read More about Objectivity in Research: Challenges from the Evidence-Based Paradigm..

Active Contour Projection for Mesh Segmentation (2009)
Presentation / Conference Contribution
Yang, F., Li, F., & Lau, R. (2009, December). Active Contour Projection for Mesh Segmentation. Presented at IEEE Joint Conferences on Pervasive Computing (JCPC), Taipei, Taiwan

Active contour methods can be used to segment a 3D mesh into parts by iteratively moving the contour to the mesh region that minimizes the contour energy. However, as the contour moves, it often does not lie on the mesh surface. To address this probl... Read More about Active Contour Projection for Mesh Segmentation.

Bisque: a platform for bioimage analysis and management (2009)
Journal Article
Kvilekval, K., Fedorov, D., Obara, B., Singh, A. K., & Manjunath, B. (2010). Bisque: a platform for bioimage analysis and management. Bioinformatics, 26(4), 544-552. https://doi.org/10.1093/bioinformatics/btp699

Motivation: Advances in the field of microscopy have brought about the need for better image management and analysis solutions. Novel imaging techniques have created vast stores of images and metadata that are difficult to organize, search, process a... Read More about Bisque: a platform for bioimage analysis and management.

Using Facebook to improve communication in undergraduate software development teams (2009)
Journal Article
Charlton, T., Devlin, M., & Drummond, S. (2009). Using Facebook to improve communication in undergraduate software development teams. Computer Science Education, 19(4), 273-292. https://doi.org/10.1080/08993400903384935

As part of the CETL ALiC initiative (Centre of Excellence in Teaching and Learning: Active Learning in Computing), undergraduate computing science students at Newcastle and Durham universities participated in a cross-site team software development pr... Read More about Using Facebook to improve communication in undergraduate software development teams.

Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs (2009)
Presentation / Conference Contribution
Broersma, H. J., Fomin, F. V., Hof van 't, P., & Paulusma, D. (2009, June). Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs. Presented at 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2009), Montpellier, France

The Hamiltonian Cycle problem asks if an n-vertex graph G has a cycle passing through all vertices of G. This problem is a classic NP-complete problem. So far, finding an exact algorithm that solves it in O *(α n ) time for some constant α< 2 is a no...

Induced packing of odd cycles in a planar graph (2009)
Presentation / Conference Contribution
Golovach, P. A., Kaminski, M., Paulusma, D., & Thilikos, D. M. (2009, December). Induced packing of odd cycles in a planar graph. Presented at 20th International Symposium on Algorithms and Computation (ISAAC 2009), Honolulu, Hawaii, United States

Pancyclicity and panconnectivity in augmented k-ary n-cubes (2009)
Presentation / Conference Contribution
Xiang, Y., & Stewart, I. (2009, December). Pancyclicity and panconnectivity in augmented k-ary n-cubes. Presented at The Fifteenth International Conference on Parallel and Distributed Systems : ICPADS'09, Shenzhen, China

The augmented k-ary n-cube AQ_{n,k} is a recently proposed interconnection network that incorporates an extension of a k-ary n-cube Q_n^k inspired by the extension of a hypercube Q_n to the augmented hypercube AQ_n (as developed by Choudom and Sunita... Read More about Pancyclicity and panconnectivity in augmented k-ary n-cubes.

Finding Induced Paths of Given Parity in Claw-Free Graphs (2009)
Presentation / Conference Contribution
Hof van 't, P., Kaminski, M., & Paulusma, D. (2009, December). Finding Induced Paths of Given Parity in Claw-Free Graphs. Presented at 35th International Workshop on Graph-Theoretic Concepts in Computer Science, Montpellier, France

The Parity Path problem is to decide if a given graph G contains both an odd length and an even length induced path between two specified vertices s and t. In the related problems Odd Induced Path and Even Induced Path, the goal is to determine wheth... Read More about Finding Induced Paths of Given Parity in Claw-Free Graphs.