The "Typed Wildcard Forwarding Equivalence Class (FEC) Element" defines an extension to the Label Distribution Protocol (LDP) that can be used when requesting, withdrawing, or releasing all label bindings for a given FEC Element type is desired. However, a Typed Wildcard FEC Element must be individually defined for each FEC Element type. This specification defines the Typed Wildcard FEC Element...

Equivalence-Equivalence responding, based on equivalence class formation, is a key concept of the functional-analytic model of analogical reasoning held by RFT theorists. Relational stimulus control is supposed to play an important role in this arbitrary relational response. Previous research showed that mere training of the prerequisites for equivalence class formation is not always enough for...

the main goal of the present paper is to extend classical results from the measure theory and dynamical systems to the fuzzy subset setting. in this paper, the notion of  dynamic equivalence relation is introduced and then it is proved that this relation is an equivalence relation. also, a new metric on the collection of all equivalence classes is introduced and it is proved that this metric is...

This paper studies correction for chance for coefficients that are linear functions of the proportion of observed agreement. The fixed points of the correction for chance function are characterized. An equivalence relation on the set of linear functions is defined and it is shown that each linear function is mapped to the unique fixed point in its equivalence class. keywords: Chance-corrected c...

The decidability of equivalence for three important classes of tree transducers is discussed. Each class can be obtained as a natural restriction of deterministic macro tree transducers (MTTs): (1) no context parameters, i.e., top-down tree transducers, (2) linear size increase, i.e., MSO definable tree transducers, and (3) monadic input and output ranked alphabets. For the full class of MTTs, ...

This paper identifies various parametrized dynamic priority queue disciplines from literature which are complete in two class M/G/1 queue. Equivalence between these queue disciplines is established by obtaining non linear transformation in closed form. Motivation behind these completeness and equivalence results is discussed from optimal control perspective. Some comments on global FCFS policy ...

This is joint work with Ana Dias (University of Porto). A coupled cell network consists of a finite set of nodes (the cells) and a finite number of arrows. The cells represent the individual dynamics and the arrows the interactions between the individuals. An equivalence relation on the set of nodes can be defined symbolizing the following; two nodes are in the same cell equivalence class if th...

The paper considers the problem of learning classes of graphs closed under taking minors. It is shown that any such class can be properly learned in polynomial time using membership and equivalence queries. The representation of the class is in terms of a set of minimal excluded minors (obstruction set). Moreover, a negative result for learning such classes using only equivalence queries is als...

We present a method, called equivalence learning, which applies a two-class classification approach to object-pairs defined within a multi-class scenario. The underlying idea is that instead of classifying objects into their respective classes, we classify object pairs either as equivalent (belonging to the same class) or non-equivalent (belonging to different classes). The method is based on a...

Linear discriminant analysis (LDA) is a popular dimensionality reduction and classification method that simultaneously maximizes between-class scatter and minimizes within-class scatter. In this paper, we verify the equivalence of LDA and least squares (LS) with a set of dependent variable matrices. The equivalence is in the sense that the LDA solution matrix and the LS solution matrix have the...