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.     

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.

     

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.     

基于调用环境树的软件度量研究

通过对调用环境树的扩展,并针对方法的类内和类间度量,在提出新的度量公式的基础上,证明了相关的度量可行性需满足的性质。     

音乐推荐系统中的用户冷启动问题

利用新用户使用音乐时的上下文环境信息来解决冷启动问题.当用户播放音乐时，提取用户当时场景的时间、天气、状态等信息，利用这些信息构建决策树分类模型.当新用户使用音乐推荐系统时，提取当前情景的上下文信息，根据决策树分支和上下文信息判断新用户的兴趣，向新用户推荐音乐.实验结果表明，当采用上下文相关音乐推荐算法，推荐数目不超过6项时，新用户对推荐结果的满意度超过TopN算法.     

三角网格模型五轴加工刀轴矢量调整及优化

为消除全局干涉,提出了一种基于K-D树及刀具离散的高效刀轴矢量调整算法.算法首先以有限个点离散表示刀具,然后利用K-D树快速查找刀具的可能干涉点,并在此基础上计算调整后的刀轴矢量.为避免过大的刀轴矢量突变,提出一种分角度区域方法优化刀轴矢量.实例验证表明:算法能够高效实现全局干涉避免及刀轴矢量优化.     

非连通图3C8m∪C8m-1∪G的优美标号

研究非连通图3C8m∪C8m-1∪G的优美性.证明如下结论：对任意正整数m,若图G是特征为k且缺标号值k＋24m-2的交错图,则非连通图3C8m∪C8m-1∪G存在缺标号值k＋1的优美标号.     

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.