Associated to any finite tree, there are simple vector spaces over Z2 and linear transformations between them that relate collections of edge-disjoint paths, sets of leaves of even cardinality, and bipartitions of the leaf set. In this paper, we use this connection to introduce and study an apparently new integer-valued invariant, the ‘path index’ of a tree. In the case of trivalent (or ‘binary...

The aim of this article is to study the $L^p$-boundedness pseudo-differential operators on a homogeneous tree $ \mathfrak X $. For $p\in (1,2)$, we establish connection between $L^{p}$-boundedness \mathfr

The features of self-restoring plant communities in connection with the edaphic conditions dumps anthracite deposits are revealed. It is shown that development tree confined to areas bumpy terrain, and grassy horizontal areas.

Tree-like isometric subgraphs of hypercubes, or tree-like partial cubes as we shall call them, are a generalization of median graphs. Just as median graphs they capture numerous properties of trees, but encompass a larger class of graphs that may be easier to recognize than the class of median graphs. We investigate the structure of tree-like partial cubes, characterize them, and provide exampl...

Two algorithms for minimum cut linear arrangement of a class of graphs called p-q dags are proposed. A p-q dag represents the connection scheme of an adder tree, such as Wallace tree, and the VLSI layout problem of a bit slice of an adder tree is treated as the minimum cut linear arrangement problem of its corresponding p-q dag. One of the two algorithms is based on dynamic programming. It calc...

The Flory-Stockmayer theory for the polycondensation of branched polymers, modified for finite systems beyond the gel point, is applied to the connection (synapses) of neurons, which can be considered highly branched "monomeric" units. Initially, the process is a linear growth and tree-like branching between dendrites and axons of nonself-neurons. After the gel point and at the maximum "tree" s...

Decision Trees are considered to be one of the most popular approaches for representing classifier for various disciplines such as statistics, machine learning and data mining. Classification of Intrusion detection, according to their features into either intrusive or non intrusive class is a widely studied problem. Decision trees are useful to detect intrusion from connection records. In this ...

In this paper, we introduce a method of generating a prosodic tree structure from the F0 contour of an utterance in order to analyze the information expressed by prosody in Japanese spontaneous dialogue. The connection rate, which means the strength of the relationship between two prosodic units, is de ned. By repeatedly combining the two adjacent prosodic units where the rate is high, the tree...

We present an active learning algorithm for inferring extended finite state machines (EFSM)s, combining data flow and control behavior. Key to our learning technique is a novel learning model based on so-called tree queries. The learning algorithm uses the tree queries to infer symbolic data constraints on parameters, e.g., sequence numbers, time stamps, identifiers, or even simple arithmetic. ...

Optical Transport Networks (OTN) with automatical switching capabilities are named ASON. Hierarchical routing is required in the ASON recommendations to achieve scalability. Basically, hierarchical routing consists of three main components, an aggregation scheme, an update policy and a routing algorithm. This paper proposes a new network structure focusing on these three components. We propose ...