Embedding hypertrees into steiner triple systems

In this paper, we are interested in the following question: given an arbitrary Steiner triple system on vertices and any 3‐uniform hypertree on vertices, is it necessary that contains as a subgraph provided ? We show the answer is positive for a class of hypertrees and conjecture that the answer is always positive.     

A mixed hp FEM for the approximation of fourth‐order singularly perturbed problems on smooth domains

We consider fourth‐order singularly perturbed problems posed on smooth domains and the approximation of their solution by a mixed Finite Element Method on the so‐called Spectral Boundary Layer Mesh. We show that the method converges uniformly, with respect to the singular perturbation parameter, at an exponential rate when the error is measured in the energy norm. Numerical examples illustrate our theoretical findings.     

The local ultraconvergence of high‐order finite element method for second‐order elliptic problems with constant coefficients over a rectangular partition

In this article, we will discuss the local ultraconvergence of high‐degree finite element method based on a rectangular partition for the second‐degree elliptic problem with constant coefficients in Ω ? ?² , u( y ) = 0 on ?Ω . Based on suitable regularity, ultraconvergence of the displacement of the extrapolated kth (k ≥ 3) degree finite element solution has been obtained by an extrapolation technique. Finally, numerical experiments are applied to demonstrate our theoretical findings.     

Logging damage and injured tree mortality in tropical forest management

Using insights from the forest ecology literature, we analyze the effect of injured trees on stand composition and carbon stored in above‐ground biomass and the implications for forest management decisions. Results from a Faustmann model with data for a tropical forest on Kalimantan show that up to 50% of the basal area of the stand before harvest can consist of injured trees. Considering injured trees leads to an increase in the amount of carbon in above‐ground biomass of up to 165%. These effects are larger under reduced impact logging than under conventional logging. The effects on land expectation value and cutting cycle are relatively small. The results suggest that considering injured trees in models for tropical forest management is important for the correct assessment of the potential of financial programs to store carbon and conserve forest ecosystem services in managed tropical forests, such as reducing emissions from deforestation and forest degradation and payment for ecosystem services. Recommendations for Resource Managers

• Considering the role of injured trees is important for managing tropical forests
• These trees can cover up to 50% of basal area and contain more than 50% of the carbon stored in above‐ground biomass
• Reduced impact logging leads to a larger basal area of injured trees and more carbon stored in injured trees than conventional logging
• Injured trees play an important role when assessing the potential for carbon storage in the context of payment for forest ecosystem services.

     

Evaluation of RBFs for volume data interpolation in CFD

A greedy method for choosing an optimum reduced set of control points is integrated with RBF interpolation and evaluated for the purpose of interpolating large‐volume data sets in CFD. Given a function defined at a set of points, the greedy method selects a small subset of these points that is sufficient to keep the interpolation error at all the remaining points below a chosen bound. This is equivalent to a type of data compression and would have useful storage, post‐processing, and computational applications in CFD. To test the method in terms of both the point selection scheme and the suitability of reduced control point volume interpolation, a trial application of the interpolation to velocity fields in CFD volume meshes is considered. To optimise the point selection process, and attempt to be able to capture multiple length scales, a variable support radius formulation has also been included. Structured and unstructured mesh cases are considered for aerofoils, a wing case and a wing‐body case. For smooth volume functions, the method is shown to work well, producing accurate velocity interpolations using a very small number of the cells in the mesh. For general complex fields including large gradients, the method is still shown to be effective, although large gradients require more interpolation points to be used.Copyright © 2013 John Wiley & Sons, Ltd.     

Hierarchical Model-Based Clustering for Large Datasets

In recent years, hierarchical model-based clustering has provided promising results in a variety of applications. However, its use with large datasets has been hindered by a time and memory complexity that are at least quadratic in the number of observations. To overcome this difficulty, this article proposes to start the hierarchical agglomeration from an efficient classification of the data in many classes rather than from the usual set of singleton clusters. This initial partition is derived from a subgraph of the minimum spanning tree associated with the data. To this end, we develop graphical tools that assess the presence of clusters in the data and uncover observations difficult to classify. We use this approach to analyze two large, real datasets: a multiband MRI image of the human brain and data on global precipitation climatology. We use the real datasets to discuss ways of integrating the spatial information in the clustering analysis. We focus on two-stage methods, in which a second stage of processing using established methods is applied to the output from the algorithm presented in this article, viewed as a first stage.     

On weighting two criteria with a parameter in combinatorial optimization problems

Two criteria in a combinatorial problem are often combined in a weighted sum objective using a weighting parameter between 0 and 1. For special problem types, e.g., when one of the criteria is a bottleneck value, efficient algorithms are known that solve for a given value of the weighting parameter.     

Exact pressure integrations on submerged bodies in waves using a quadtree adaptive mesh algorithm

The development of an adaptive free surface, mesh cutting, methodology, in order to analytically integrate pressures on varying wet parts of partially submerged surfaces in the presence of waves, is presented. Given a function of free‐surface elevation, the algorithm checks for the intersection of the body with the free surface and, based on user‐defined parameters, modifies the initial mesh, by subdividing the elements where necessary and eliminating others, via a quadtree approach. Redundant sub‐divisions, generated in the quad‐division process, are partially eliminated, but the quadrilateral nature of the elements is always kept. The free‐surface function must be single‐valued and its definition domain simply connected. Hydrostatic and Froude–Krylov forces are computed exactly on each panel by means of analytical formulations, which are derived and presented, based on the theory of linear gravity waves and from applying Green's theorem. Copyright © 2014 John Wiley & Sons, Ltd.     

Método de elementos de borde jerárquico basado en el árbol de Barnes-Hut aplicado a flujo reptante exterior

In this work, a hierarchical variant of a boundary element method and its use in Stokes flow around three-dimensional rigid bodies in steady regime is presented. The proposal is based on the descending hierarchical low-order and self-adaptive algorithm of Barnes-Hut, and it is used in conjunction with an indirect boundary integral formulation of second class, whose source term is a function of the undisturbed velocity. The solution field is the double layer surface density, which is modified in order to complete the eigenvalue spectrum of the integral operator. In this way, the rigid modes are eliminated and both a non-zero force and a non-null torque on the body could be calculated. The elements are low order flat triangles, and an iterative solution by generalized minimal residual (GMRES) is used. Numerical examples include cases with analytical solutions, bodies with edges and vertices, or with intricate shapes. The main advantage of the presented technique is the possibility of considering a greater number of degrees of freedom regarding traditional collocation methods, due to the decreased demand of main memory and the reduction in the computation times.