Skip to main content

Research Repository

Advanced Search

All Outputs (2741)

Evolutions of Polygons in the Study of Subdivision Surfaces (2004)
Journal Article
Ivrissimtzis, I., & Seidel, H. (2004). Evolutions of Polygons in the Study of Subdivision Surfaces. Computing, 72(1-2), 93-103. https://doi.org/10.1007/s00607-003-0049-8

We employ the theory of evolving n-gons in the study of subdivision surfaces. We show that for subdivision schemes with small stencils the eige¬nanalysis of an evolving polygon, corresponding either to a face or to the 1-¬ring neighborhood of a verte... Read More about Evolutions of Polygons in the Study of Subdivision Surfaces.

Fast, large and controllable phase modulation using dual frequency liquid crystals (2004)
Journal Article
Kirby, A., & Love, G. (2004). Fast, large and controllable phase modulation using dual frequency liquid crystals. Optics Express, 12(7), 1470-1475. https://doi.org/10.1364/opex.12.001470

We report on a method for high speed, large stroke phase modulation using dual frequency control of liquid crystals. Our system uses an all-electronic feedback system in order to simplify the control. We show half wave phase modulations of ~120Hz wit... Read More about Fast, large and controllable phase modulation using dual frequency liquid crystals.

Understanding service-oriented software (2004)
Journal Article
Gold, N., Knight, C., Mohan, A., & Munro, M. (2004). Understanding service-oriented software. IEEE Software, 21(2), 71-77. https://doi.org/10.1109/ms.2004.1270766

Service-oriented software is being hailed as the next revolutionary approach to software development. Service orientation allows organizations to rapidly and dynamically form new software applications to meet changing business needs, thus alleviating... Read More about Understanding service-oriented software.

Dichotomies for classes of homomorphism problems involving unary functions (2004)
Journal Article
Feder, T., Madelaine, F., & Stewart, I. (2004). Dichotomies for classes of homomorphism problems involving unary functions. Theoretical Computer Science, 314(1-2), 1-43. https://doi.org/10.1016/j.tcs.2003.12.015

We study non-uniform constraint satisfaction problems where the underlying signature contains constant and function symbols as well as relation symbols. Amongst our results are the following. We establish a dichotomy result for the class of non-unifo... Read More about Dichotomies for classes of homomorphism problems involving unary functions.

A sensitive optical polarimetric imaging technique for surface defects detection of aircraft turbine engines (2004)
Journal Article
Giakos, G., Fraiwan, L., Patnekar, N., Sumrain, S., Mertzios, G., & Periyathamby, S. (2004). A sensitive optical polarimetric imaging technique for surface defects detection of aircraft turbine engines. IEEE Transactions on Instrumentation and Measurement, 53(1), 216-222. https://doi.org/10.1109/tim.2003.821497

The design of an optical polarimetric imaging system, aimed to detect cracks or structural defects on the surface of rotating aircraft engine shafts, is presented: The experimental results, clearly indicate that high. signal-to-noise ratio signals ca... Read More about A sensitive optical polarimetric imaging technique for surface defects detection of aircraft turbine engines.

Characterization of graphs with Hall number 2 (2004)
Journal Article
Eslachi, C., & Johnson, M. (2004). Characterization of graphs with Hall number 2. Journal of Graph Theory, 45(2), 81-100. https://doi.org/10.1002/jgt.10154

Hall's condition is a simple requirement that a graph G and list assignment L must satisfy if G is to have a proper L-colouring. The Hall number of G is the smallest integer m such that whenever the lists on the vertices each has size at least m and... Read More about Characterization of graphs with Hall number 2.

A generative classification of mesh refinement rules with lattice transformations (2004)
Journal Article
Ivrissimtzis, I., Dodgson, N., & Sabin, M. (2004). A generative classification of mesh refinement rules with lattice transformations. Computer Aided Geometric Design, 21(1), 99-109. https://doi.org/10.1016/j.cagd.2003.08.001

We give a classification of subdivision refinement rules using similarity transformations of lattices. Our work expands recent results in the classification of primal triangular subdivision. In the examples we concentrate on the cases with a low rati... Read More about A generative classification of mesh refinement rules with lattice transformations.

Approximating the number of acyclic orientations for a class of sparse graphs (2004)
Journal Article
Bordewich, M. (2004). Approximating the number of acyclic orientations for a class of sparse graphs. Combinatorics, Probability and Computing, 13(1), 1-16. https://doi.org/10.1017/s0963548303005844

The Tutte polynomial $T(G;x,y)$ of a graph evaluates to many interesting combinatorial quantities at various points in the $(x,y)$ plane, including the number of spanning trees, number of forests, number of acyclic orientations, the reliability polyn... Read More about Approximating the number of acyclic orientations for a class of sparse graphs.

Run-time mapping of applications to a heterogeneous reconfigurable tiled system on chip architecture (2004)
Presentation / Conference Contribution
Smit, L., Smit, G., Hurink, J., Broersma, H., Paulusma, D., & Wolkotte, P. (2004). Run-time mapping of applications to a heterogeneous reconfigurable tiled system on chip architecture. In 2004 IEEE International Conference on Field-Programmable Technology: Proceedings: December 6-8, 2004, the University of Queensland, Brisbane, Australia (421-424). https://doi.org/10.1109/fpt.2004.1393315

This work evaluates an algorithm that maps a number of communicating processes to a heterogeneous tiled system on chip (SoC) architecture at run-time. The mapping algorithm minimizes the total amount of energy consumption, while still providing an ad... Read More about Run-time mapping of applications to a heterogeneous reconfigurable tiled system on chip architecture.

Run-time assignment of tasks to multiple heterogeneous processors (2004)
Presentation / Conference Contribution
Smit, L., Smit, G., Hurink, J., Broersma, H., Paulusma, D., & Wolkotte, P. (2004). Run-time assignment of tasks to multiple heterogeneous processors.

This paper describes the implementation and evaluation of an algorithm that maps a number of communicating processes to a heterogeneous tiled System on Chip (SoC) architecture at run-time. The mapping algorithm minimizes the total amount of energy co... Read More about Run-time assignment of tasks to multiple heterogeneous processors.

Discretization schemes and numerical approximations of PDE impainting models and a comparative evaluation on novel real world MRI reconstruction applications (2004)
Presentation / Conference Contribution
Karras, D., & Mertzios, G. (2004). Discretization schemes and numerical approximations of PDE impainting models and a comparative evaluation on novel real world MRI reconstruction applications. In 2004 IEEE International Workshop on Imaging Systems and Techniques (IST) : 14 May 2004, Stresa, Italy ; proceedings (153-158). https://doi.org/10.1109/ist.2004.1397304

While various PDE models are in discussion since the last ten years and are widely applied nowadays in image processing and computer vision tasks, including restoration, filtering, segmentation and object tracking, the perspective adopted in the majo... Read More about Discretization schemes and numerical approximations of PDE impainting models and a comparative evaluation on novel real world MRI reconstruction applications.

First-Order Definable Retraction Problems for Posets and Reflexive Graphs (2004)
Presentation / Conference Contribution
Dalmau, V., Krokhin, A., & Larose, B. (2004). First-Order Definable Retraction Problems for Posets and Reflexive Graphs. In 19th annual IEEE symposium on logic in computer science, LICS'04, 13-17 July 2004, Turku, Finland ; proceedings (232-241). https://doi.org/10.1109/lics.2004.1319617

A retraction from a structure P to its substructure Q is a homomorphism from P onto Q that is the identity on Q. We present an algebraic condition which completely characterises all posets and all reflexive graphs Q with the following property: the c... Read More about First-Order Definable Retraction Problems for Posets and Reflexive Graphs.

Constraint satisfaction problems on intervals and lengths (2004)
Journal Article
Krokhin, A., Jeavons, P., & Jonsson, P. (2004). Constraint satisfaction problems on intervals and lengths. SIAM Journal on Discrete Mathematics, 17(3), 453-477. https://doi.org/10.1137/s0895480102410201

We study interval-valued constraint satisfaction problems (CSPs), in which the aim is to find an assignment of intervals to a given set of variables subject to constraints on the relative positions of intervals. Many well-known problems such as INTER... Read More about Constraint satisfaction problems on intervals and lengths.

Authoring for adaptive presentation (2003)
Presentation / Conference Contribution
Moore, A., Brailsford, T., Campus, J., Nottingham, N., Stewart, C., & Davies, P. (2003). Authoring for adaptive presentation.

A tractable class of soft constraints. (2003)
Presentation / Conference Contribution
Cohen, D., Cooper, M., Jeavons, P., & Krokhin, A. (2003). A tractable class of soft constraints. In G. Gottlob, & T. Walsh (Eds.),