In this paper, we give a simple combinatorial explanation of a formula of A. Postnikov relating bicolored rooted trees to bicolored binary trees. We also present generalized formulas for the number of labeled k-ary trees, rooted labeled trees, and labeled plane trees.

Many quality measures for rule discovery are binary measures, they are designed to rate binary rules (rules which separate the database examples into two categories eg. “it is a bird” vs. “it is not a bird”) and they cannot rate N -ary rules (rules which separate the database examples into N categories eg. “it is a bird” or “it is an insect” or “it is a fish”). Many quality measures for classif...

We devise a condition strictly between the existence of an $n$-ary and $n{+}1$-ary near-unanimity term. evaluate exactly distributivity modularity levels implied by such condition.

Here we develop a technique of computing the invariants of n−ary forms and systems of forms using the discriminants of corresponding multilinear forms buit of their partial derivatives, which should be cosidered as generalizations of classical discriminants and resultants for binary forms. 0 Introduction Let f(y0, y1, ..., yn) = ∑ α1≤...≤αd cα1...αdyα1 ...yαd be an n + 1−ary form of degree d, w...

We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a rooted, balanced dary tree of height h, whose internal nodes are labelled with d-ary functions on [k] = {1, . . . , k}, and whose leaves are labelled with elements of [k]. Each node obtains a value in [k] equal to its d-ary...

fractional calculus has been used to model physical and engineering processes that are found to be best described by fractional differential equations. therefore, a reliable and efficient technique as a solution is regarded.this paper develops approximate solutions for boundary value problems ofdifferential equations with non-integer order by using the shannon waveletbases. wavelet bases have d...

This paper reviews a competent Pittsburgh LCS that automatically mines important substructures of the underlying problems and takes problems that were intractable with firstgeneration Pittsburgh LCS and renders them tractable. Specifically, we propose a χ-ary extended compact classifier system (χeCCS) which uses (1) a competent genetic algorithm (GA) in the form of χ-ary extended compact geneti...

This paper proposes a competent Pittsburgh LCS that automatically mines important substructures of the underlying problems and takes problems that were intractable with first-generation Pittsburgh LCS and renders them tractable. Specifically, we propose a χ-ary extended compact classifier system (χeCCS) which uses (1) a competent genetic algorithm (GA) in the form of χ-ary extended compact gene...