‎Bucket recursive trees are an interesting and natural‎ ‎generalization of ordinary recursive trees and have a connection‎ to mathematical chemistry‎. ‎In this paper‎, ‎we give the lower and upper bounds for the moment generating‎ ‎function and moments of the multiplicative Zagreb indices in a‎ ‎randomly chosen bucket recursive tree of size $n$ with maximal bucket size $bgeq1$‎. Also, ‎we consi...

in this paper, we propose to extend the hierarchical bivariatehermite interpolant to the spherical case. let $t$ be an arbitraryspherical triangle of the unit sphere $s$ and  let $u$ be a functiondefined over the triangle $t$. for $kin mathbb{n}$, we consider ahermite spherical interpolant problem $h_k$ defined by some datascheme $mathcal{d}_k(u)$ and which admits a unique solution $p_k$in the ...

This paper presents an intertemporal model of growing awareness. It provides a framework for analyzing problems with long time horizons in the presence awareness and unawareness. The generalizes both standard event-tree from Karni Vierø (2017) Axioms representation are provided along recursive formulation utility. allows tractable consistent analysis To illustrate relevance dynamic decision mak...

This report introduces an online, fully adaptive HybridANN approach for the estimation of product properties across multiple crude distillation processes. An extension of eTS+ is considered, utilizing recursive density estimation (RDE), eClustering+ and fuzzily weighted recursive leastsquares (fwRLS) for one-step prediction of fuel quality in a data-sparse, sensor-heavy environment.[49] eTS+ ha...

In the ever-growing world, concepts of High-utility Itemset Mining (HUIM) as well Frequent (FIM) are fundamental works in knowledge discovery. Several algorithms have been designed successfully. However, these only used one factor to estimate an itemset. past, skyline pattern mining by considering both aspects frequency and utility has extensively discussed. most cases, however, people tend foc...

A number of dynamic models in economics are formulated with forward-looking elements in the constraints – for example, models of risk-sharing with participation constraints and models of optimal policy. Here, standard dynamic programming does not apply. Recent contributions show how to reformulate these models by either rewriting the forward-looking constraints (promised utility approach) or by...

This paper reviews P´olya urn models and their connection to random trees. Basic results are presented, together with proofs that underly the historical evolution of the accompanying thought process. Extensions and generalizations are given according to chronology: • P´olya-Eggenberger’s urn • Bernard Friedman’s urn • Generalized P´olya urns • Extended urn schemes • Invertible urn schemes ...

PVS is a highly automated framework for speciication and veriication. We show how the language and deduction features of PVS can be used to formalize, mechanize , and apply some useful program transformation techniques. We examine two such examples in detail. The rst is a fusion theorem due to Bird where the composition of a catamorphism (a recursive operation on the structure of a datatype) an...

PVS is a highly automated framework for speciication and veriication. We show how the language and deduction features of PVS can be used to formalize, mechanize , and apply some useful program transformation techniques. We examine two such examples in detail. The rst is a fusion theorem due to Bird where the composition of a catamorphism (a recursive operation on the structure of a datatype) an...