Colonization and osteogenic differentiation of different stem cell sources on electrospun nanofiber meshes

Numerous challenges remain in the successful clinical translation of cell-based therapies for musculoskeletal tissue repair, including the identification of an appropriate cell source and a viable cell delivery system. The aim of this study was to investigate the attachment, colonization, and osteogenic differentiation of two stem cell types, human mesenchymal stem cells (hMSCs) and human amniotic fluid stem (hAFS) cells, on electrospun nanofiber meshes. We demonstrate that nanofiber meshes are able to support these cell functions robustly, with both cell types demonstrating strong osteogenic potential. Differences in the kinetics of osteogenic differentiation were observed between hMSCs and hAFS cells, with the hAFS cells displaying a delayed alkaline phosphatase peak, but elevated mineral deposition, compared to hMSCs. We also compared the cell behavior on nanofiber meshes to that on tissue culture plastic, and observed that there is delayed initial attachment and proliferation on meshes, but enhanced mineralization at a later time point. Finally, cell-seeded nanofiber meshes were found to be effective in colonizing three-dimensional scaffolds in an in vitro system. This study provides support for the use of the nanofiber mesh as a model surface for cell culture in vitro, and a cell delivery vehicle for the repair of bone defects in vivo.

A preconditioned Lanczos method for space-fractional reaction-diffusion equations on two-dimensional unstructured meshes

We consider a two-dimensional space-fractional reaction diffusion equation with a fractional Laplacian operator and homogeneous Neumann boundary conditions. The finite volume method is used with the matrix transfer technique of Ilić et al. (2006) to discretise in space, yielding a system of equations that requires the action of a matrix function to solve at each timestep. Rather than form this matrix function explicitly, we use Krylov subspace techniques to approximate the action of this matrix function. Specifically, we apply the Lanczos method, after a suitable transformation of the problem to recover symmetry. To improve the convergence of this method, we utilise a preconditioner that deflates the smallest eigenvalues from the spectrum. We demonstrate the efficiency of our approach for a fractional Fisher’s equation on the unit disk.

Round scallops and square meshes: a comparison of four codend types on the catch rates of target species and by-catch in the Queensland (Australia) saucer scallop (Amusium balloti) trawl fishery

Concern over the amount of by-catch from benthic trawl fisheries and research into the problem have increased in recent years. The present paper demonstrated that by-catch rates in the Queensland (Australia) saucer scallop (Amusium balloti) trawl fishery can be reduced by 77% (by weight) using nets fitted with a turtle excluder device (TED) and a square-mesh codend, compared with a standard diamond-mesh codend with no TED. This large reduction was achieved with no significant effect on the legal size scallop catch rate and 39% fewer undersize scallops were caught. In total, 382 taxa were recorded in the by-catch, which was dominated by sponges, portunid crabs, small demersal and benthic fish (e.g. leatherjackets, stingerfish, bearded ghouls, nemipterids, longspine emperors, lizard fish, triggerfish, flounders and rabbitfish), elasmobranchs (e.g. mainly rays) and invertebrates (e.g. sea stars, sea urchins, sea cucumbers and bivalve molluscs). Extremely high reductions in catch rate (i.e. ≥85%) were demonstrated for several by-catch species owing to the square-mesh codend. Square-mesh codends show potential as a means of greatly reducing by-catch and lowering the incidental capture and mortality of undersize scallops and Moreton Bay bugs (Thenus australiensis) in this fishery

Link Conditions for Simplifying Meshes with Embedded Structures

Interactive visualization applications benefit from simplification techniques that generate good-quality coarse meshes from high-resolution meshes that represent the domain. These meshes often contain interesting substructures, called embedded structures, and it is desirable to preserve the topology of the embedded structures during simplification, in addition to preserving the topology of the domain. This paper describes a proof that link conditions, proposed earlier, are sufficient to ensure that edge contractions preserve the topology of the embedded structures and the domain. Excluding two specific configurations, the link conditions are also shown to be necessary for topology preservation. Repeated application of edge contraction on an extended complex produces a coarser representation of the domain and the embedded structures. An extension of the quadric error metric is used to schedule edge contractions, resulting in a good-quality coarse mesh that closely approximates the input domain and the embedded structures.

Automatic decomposition of unstructured meshes employing genetic algorithms for parallel FEM computations

Parallel execution of computational mechanics codes requires efficient mesh-partitioning techniques. These mesh-partitioning techniques divide the mesh into specified number of submeshes of approximately the same size and at the same time, minimise the interface nodes of the submeshes. This paper describes a new mesh partitioning technique, employing Genetic Algorithms. The proposed algorithm operates on the deduced graph (dual or nodal graph) of the given finite element mesh rather than directly on the mesh itself. The algorithm works by first constructing a coarse graph approximation using an automatic graph coarsening method. The coarse graph is partitioned and the results are interpolated onto the original graph to initialise an optimisation of the graph partition problem. In practice, hierarchy of (usually more than two) graphs are used to obtain the final graph partition. The proposed partitioning algorithm is applied to graphs derived from unstructured finite element meshes describing practical engineering problems and also several example graphs related to finite element meshes given in the literature. The test results indicate that the proposed GA based graph partitioning algorithm generates high quality partitions and are superior to spectral and multilevel graph partitioning algorithms.

Multigrid algorithms for symmetric discontinuous Galerkin methods on graded meshes

We study a class of symmetric discontinuous Galerkin methods on graded meshes. Optimal order error estimates are derived in both the energy norm and the L 2 norm, and we establish the uniform convergence of V-cycle, F-cycle and W-cycle multigrid algorithms for the resulting discrete problems. Numerical results that confirm the theoretical results are also presented.

Application of kinetic schemes to all types of meshes

Kinetic schemes as pursued in CFD Centre are obtained by taking suitable moments of upwind schemes for Boltzmann equation without collision term. The primary ones among these are KFVS, LSKUM, KFMG and these have been applied successfully to a variety of flow problems using various meshes. These schemes have been found to be very robust.

Comparison of a priori and a posteriori meshes for singularly perturbed nonlinear parameterized problems

This paper deals with the adaptive mesh generation for singularly perturbed nonlinear parameterized problems with a comparative research study on them. We propose an a posteriori error estimate for singularly perturbed parameterized problems by moving mesh methods with fixed number of mesh points. The well known a priori meshes are compared with the proposed one. The comparison results show that the proposed numerical method is highly effective for the generation of layer adapted a posteriori meshes. A numerical experiment of the error behavior on different meshes is carried out to highlight the comparison of the approximated solutions. (C) 2015 Elsevier B.V. All rights reserved.

Perturbational Finite Volume Method For The Solution of 2-D Navier-Stokes Equations on Unstructured and Structured Colocated Meshes

Based on the first-order upwind and second-order central type of finite volume( UFV and CFV) scheme, upwind and central type of perturbation finite volume ( UPFV and CPFV) schemes of the Navier-Stokes equations were developed. In PFV method, the mass fluxes of across the cell faces of the control volume (CV) were expanded into power series of the grid spacing and the coefficients of the power series were determined by means of the conservation equation itself. The UPFV and CPFV scheme respectively uses the same nodes and expressions as those of the normal first-order upwind and second-order central scheme, which is apt to programming. The results of numerical experiments about the flow in a lid-driven cavity and the problem of transport of a scalar quantity in a known velocity field show that compared to the first-order UFV and second-order CFV schemes, upwind PFV scheme is higher accuracy and resolution, especially better robustness. The numerical computation to flow in a lid-driven cavity shows that the under-relaxation factor can be arbitrarily selected ranging from 0.3 to 0. 8 and convergence perform excellent with Reynolds number variation from 102 to 104.

Geometric discretization through primal-dual meshes

This thesis introduces new tools for geometric discretization in computer graphics and computational physics. Our work builds upon the duality between weighted triangulations and power diagrams to provide concise, yet expressive discretization of manifolds and differential operators. Our exposition begins with a review of the construction of power diagrams, followed by novel optimization procedures to fully control the local volume and spatial distribution of power cells. Based on this power diagram framework, we develop a new family of discrete differential operators, an effective stippling algorithm, as well as a new fluid solver for Lagrangian particles. We then turn our attention to applications in geometry processing. We show that orthogonal primal-dual meshes augment the notion of local metric in non-flat discrete surfaces. In particular, we introduce a reduced set of coordinates for the construction of orthogonal primal-dual structures of arbitrary topology, and provide alternative metric characterizations through convex optimizations. We finally leverage these novel theoretical contributions to generate well-centered primal-dual meshes, sphere packing on surfaces, and self-supporting triangulations.

Methods and tools for the assessment of daylight transmittance through expanded metal meshes

306 p.