Addendum to: “Hamilton-laceable bi-powers of locally finite bipartite graphs” [Discrete Math. 345 (2022) 112777]

In this addendum we give a short and easy negative answer to the two questions raised in the original article.     

Framed slotted ALOHA with grouping tactic and binary selection for anti-collision in RFID systems

9%-16.3% compared to other ALOHA-based tag anti-collision algorithms when the number of tags is 1 000.     

The effect of a market factor on information flow between stocks using the minimal spanning tree

We empirically investigated the effects of market factors on the information flow created from N(N−1)/2 linkage relationships among stocks. We also examined the possibility of employing the minimal spanning tree (MST) method, which is capable of reducing the number of links to N−1. We determined that market factors carry important information value regarding information flow among stocks. Moreover, the information flow among stocks showed time-varying properties according to the changes in market status. In particular, we noted that the information flow increased dramatically during periods of market crises. Finally, we confirmed, via the MST method, that the information flow among stocks could be assessed effectively with the reduced linkage relationships among all links among stocks from the perspective of the overall market.     

决策树分类模型在工程项目评标风险预警中的应用

本文将数据挖掘中的决策树分类方法运用到工程项目评标数据分析,从200多个天津市工程项目招投标打分数据中,随机抽取15个招投标项目中的67个承包商的评标专家打分数据进行分析,得到中标承包商技术和商务评分分界点,进而得到工程项目潜在风险的预警阈值,然后借助因子分析辨识出风险来源并进行预警。     

手持设备中股票软件数据存储方案的设计

针对股票软件中历史数据的特点.深入分析了B+树存储和线性表存储两种数据存储方案.这两种方案均能达到股票软件的应用要求,最后进一步从性能和资源耗费上对这两种方案进行了对比分析,指出了它们各自的优点与不足,对其他类似的设计具有很好的借鉴意义.     

决策树算法在老年性痴呆病因病机分析中的应用

通过决策树算法建立了老年性痴呆病型病因判断模型。文中详细研究了决策树算法C5.0及其修正方法,之后通过对太原市1500例数据的分析借助决策树C5.0算法构建了老年性痴呆的判断模型,并对其进行了修正,得到具有实际指导意义的判别模型。     

Eigenvalue estimates for Schrödinger operators on metric trees

We consider Schrödinger operators on radial metric trees and prove Lieb–Thirring and Cwikel–Lieb–Rozenblum inequalities for their negative eigenvalues. The validity of these inequalities depends on the volume growth of the tree. We show that the bounds are valid in the endpoint case and reflect the correct order in the weak or strong coupling limit.     

A phase transition for the heights of a fragmentation tree

We provide information about the asymptotic regimes for a homogeneous fragmentation of a finite set. We establish a phase transition for the asymptotic behavior of the shattering times, defined as the first instants when all the blocks of the partition process have cardinality less than a fixed integer. Our results may be applied to the study of certain random split trees. © 2010 Wiley Periodicals, Inc. Random Struct. Alg., 39, 247‐274, 2011     

An improved partial SPIHT with classified weighted rate-distortion optimization for interferential multispectral image compression

Based on the property analysis of interferential multispectral images, a novel compression algorithm of partial set partitioning in hierarchical trees (SPIHT) with classified weighted rate-distortion optimization is presented.After wavelet decomposition, partial SPIHT is applied to each zero tree independently by adaptively selecting one of three coding modes according to the probability of the significant coefficients in each bitplane.Meanwhile the interferential multispectral image is partitioned into two kinds of regions in terms of luminous intensity, and the rate-distortion slopes of zero trees are then lifted with classified weights according to their distortion contribution to the constructed spectrum.Finally a global ratedistortion optimization truncation is performed.Compared with the conventional methods, the proposed algorithm not only improves the performance in spatial domain but also reduces the distortion in spectral domain.     

A Polynomial Time Approximation Scheme for the Grade of Service Steiner Minimum Tree Problem

In this paper, we present the design of a Polynomial Time Approximation Scheme (PTAS) for the Grade of Service Steiner Minimum Tree (GOSST) problem, which is known to be NP-Complete. Previous research has focused on geometric analyses and different approximation algorithms have been designed. We propose a PTAS that provides a polynomial time, near-optimal solution with performance ratio 1+. The GOSST problem has some important applications. In network design, a fundamental issue for the physical construction of a network structure is the interconnection of many communication sites with the best choice of the connecting lines and the best allocation of the transmission capacities over these lines. Good solutions should provide paths with enough communication capacities between any two sites, with the least network construction costs. Also, the GOSST problem has applications in transportation, for road constructions and some potential uses in CAD in terms of interconnecting the elements on a plane to provide enough flux between any two elements.