Skip to main content

Research Repository

Advanced Search

Outputs (1517)

Spontaneous symmetry breaking and circulation by optically bound microparticle chains in Gaussian beam traps (2009)
Journal Article
Taylor, J., & Love, G. (2009). Spontaneous symmetry breaking and circulation by optically bound microparticle chains in Gaussian beam traps. Physical Review A, 80(5), Article 053808. https://doi.org/10.1103/physreva.80.053808

It has been known for some time that simple “optically bound” chains of dielectric microparticles can form in a counter propagating Gaussian beam optical trap. Here we report experimental observations of more complex trapped states, which do not refl... Read More about Spontaneous symmetry breaking and circulation by optically bound microparticle chains in Gaussian beam traps.

On the power of deep pushdown stacks (2009)
Journal Article
Arratia-Quesada, A., & Stewart, I. (2009). On the power of deep pushdown stacks. Acta Informatica, 46(7), 509-531. https://doi.org/10.1007/s00236-009-0103-x

Inspired by recent work of Meduna on deep pushdown automata, we consider the computational power of a class of basic program schemes, NPSDSs, based around assignments, while-loops and non-deterministic guessing but with access to a deep pushdown stac... Read More about On the power of deep pushdown stacks.

Sharp upper bounds for the minimum number of components of 2-factors in claw-free graphs (2009)
Journal Article
Broersma, H., Paulusma, D., & Yoshimoto, K. (2009). Sharp upper bounds for the minimum number of components of 2-factors in claw-free graphs. Graphs and Combinatorics, 25(4), 427-460. https://doi.org/10.1007/s00373-009-0855-7

Let G be a claw-free graph with order n and minimum degree δ. We improve results of Faudree et al. and Gould & Jacobson, and solve two open problems by proving the following two results. If δ = 4, then G has a 2-factor with at most (5n − 14)/18 compo... Read More about Sharp upper bounds for the minimum number of components of 2-factors in claw-free graphs.

A biosegmentation benchmark for evaluation of bioimage analysis methods (2009)
Journal Article
Drelie Gelasca, E., Obara, B., Fedorov, D., Kvilekval, K., & Manjunath, B. (2009). A biosegmentation benchmark for evaluation of bioimage analysis methods. BMC Bioinformatics, 10, Article 368. https://doi.org/10.1186/1471-2105-10-368

Background: We present a biosegmentation benchmark that includes infrastructure, datasets with associated ground truth, and validation methods for biological image analysis. The primary motivation for creating this resource comes from the fact that i... Read More about A biosegmentation benchmark for evaluation of bioimage analysis methods.

Curve subdivision with arc-length control. (2009)
Journal Article
Hernandez-Mederos, V., Estrada-Sarlabous, J., Morales, S., & Ivrissimtzis, I. (2009). Curve subdivision with arc-length control. Computing, 86(2-3), 151-169. https://doi.org/10.1007/s00607-009-0068-1

In this paper we present a new nonstationary, interpolatory, curve subdivision scheme. We show that the scheme converges and the subdivision curve is continuous. Moreover, starting with the chord length parametrization of the initial polygon, we obta... Read More about Curve subdivision with arc-length control..

New PDE-based methods for image enhancement using SOM and Bayesian inference in various discretization schemes (2009)
Journal Article
Karras, D., & Mertzios, G. (2009). New PDE-based methods for image enhancement using SOM and Bayesian inference in various discretization schemes. Measurement Science and Technology, 20(10), Article 104012. https://doi.org/10.1088/0957-0233/20/10/104012

A novel approach is presented in this paper for improving anisotropic diffusion PDE models, based on the Perona–Malik equation. A solution is proposed from an engineering perspective to adaptively estimate the parameters of the regularizing function... Read More about New PDE-based methods for image enhancement using SOM and Bayesian inference in various discretization schemes.

On the core and f-nucleolus of flow games (2009)
Journal Article
Kern, W., & Paulusma, D. (2009). On the core and f-nucleolus of flow games. Mathematics of Operations Research, 34(4), 981-991. https://doi.org/10.1287/moor.1090.0405

Using the ellipsoid method, both Deng et al. [Deng, X., Q. Fang, X. Sun. 2006. Finding nucleolus of flow game. Proc. 17th ACM-SIAM Sympos. Discrete Algorithms. ACM Press, New York, 124–131] and Potters et al. [Potters, J., H. Reijnierse, A. Biswas. 2... Read More about On the core and f-nucleolus of flow games.

Mixing 3-colourings in bipartite graphs (2009)
Journal Article
Cereceda, L., van den Heuvel, J., & Johnson, M. (2009). Mixing 3-colourings in bipartite graphs. European Journal of Combinatorics, 30(7), 1593-1606. https://doi.org/10.1016/j.ejc.2009.03.011

For a 3-colourable graph G, the 3-colour graph of G, denoted C_3(G), is the graph with node set the proper vertex 3-colourings of G, and two nodes adjacent whenever the corresponding colourings differ on precisely one vertex of G. We consider the fol... Read More about Mixing 3-colourings in bipartite graphs.

Cross-domain investigation of empirical practices (2009)
Journal Article
Budgen, D., Bailey, J., Turner, M., Kitchenham, B., Brereton, P., & Charters, S. (2009). Cross-domain investigation of empirical practices. IET Software, 3(5), 410-421. https://doi.org/10.1049/iet-sen.2008.0106

The authors are seeking the best ways to employ evidence-based practices in software engineering research and practice so that the outcomes can inform practice and policy-making. The objective of this study is to investigate how other academic discip... Read More about Cross-domain investigation of empirical practices.