Equivalence Classes

Real-world datasets are often vague and redundant, creating problem to take decision accurately. Very recently, Rough-set theory has been used successfully for dimensionality reduction but is applicable only on discrete dataset. Discreti-sation of data leads to information loss and may add inconsistency in the datasets. The paper aims at applying fuzzy-rough concept to overcome the above limitations. However, handling of non discretized values increases computational complexity of the system. Therefore, to build an efficient classifier Genetic Algorithm (GA) has been applied to obtain optimal subset of attributes, sufficient to classify the objects. The proposed algorithm reduces dimensionality to a great extent without degrading the accuracy of classification and avoid of being trapped at local minima. Results are compared with the existing algorithms , demonstrate compatible outcome.

Object-oriented (OO) programming techniques can be applied to equational specification logics by distinguishing visible data from hidden data (that is, by distinguishing the output of methods from the objects to which the methods apply), and then focusing on the behavioural equivalence of hidden data in the sense introduced by H. Reichel in 1984. Equational specification logics structured in this way are called hidden equational logics, HELs. The central problem is how to extend the specification of a given HEL to a specification of behavioural equivalence in a computationally effective way. S. Buss and G. Roşu showed in 2000 that this is not possible in general, but much work has been done on the partial specification of behavioural equivalence for a wide class of HELs. The OO connection suggests the use of coalgebraic methods, and J. Goguen and his collaborators have developed coinductive processes that depend on an appropriate choice of a cobasis, which is a special set of contex...

In the paper it is shown that every Hausdorff continuous interval-valued function corresponds uniquely to an equivalence class of quasicontinuous functions. This one-to-one correspondence is used to construct the Dedekind order completion of C(X), the set of all real-valued continuous functions, when X is a compact Hausdorff topological space or a complete metric space.

Combinatorial Hopf algebras of trees exemplify the connections between operads and bialgebras. Painted trees were introduced recently as examples of how graded Hopf operads can bequeath Hopf structures upon compositions of coalgebras. We put these trees in context by exhibiting them as the minimal elements of face posets of certain convex polytopes. The full face posets themselves often possess the structure of graded Hopf algebras (with one-sided unit). We can enumerate faces using the fact that they are structure types of substitutions of combinatorial species. Species considered here include ordered and unordered binary trees and ordered lists (labeled corollas). Some of the polytopes that constitute our main results are well known in other contexts. First we see the classical permutahedra, and then certain generalized permutahedra: specifically the graph-associahedra of suspensions of certain simple graphs. As an aside we show that the stellohedra also appear as liftings of generalized permutahedra: graph composihedra for complete graphs. Thus our results give examples of Hopf algebras of tubings and marked tubings of graphs. We also show an alternative associative algebra structure on the graph tubings of star graphs.

Combinatorial Hopf algebras of trees exemplify the connections between operads and bialgebras. Painted trees were introduced recently as examples of how graded Hopf operads can bequeath Hopf structures upon compositions of coalgebras. We put these trees in context by exhibiting them as the minimal elements of face posets of certain convex polytopes. The full face posets themselves often possess the structure of graded Hopf algebras (with one-sided unit). We can enumerate faces using the fact that they are structure types of substitutions of combinatorial species. Species considered here include ordered and unordered binary trees and ordered lists (labeled corollas). Some of the polytopes that constitute our main results are well known in other contexts. First we see the classical permutahedra, and then certain generalized permutahedra: specifically the graph-associahedra of suspensions of certain simple graphs. As an aside we show that the stellohedra also appear as liftings of generalized permutahedra: graph composihedra for complete graphs. Thus our results give examples of Hopf algebras of tubings and marked tubings of graphs. We also show an alternative associative algebra structure on the graph tubings of star graphs.

We propose a complete procedure for verifying register-transfer logic against its scheduled behavior in a high-level synthesis environment Our proposal advances the state of the art because it is the first such verification procedure that is both complete and practical. Hardware verification is known to be a hard problem and the proposed verification technique leverages off the fact that highlevel synthesis-performed manually or by means of high-level synthesis software-proceeds from the algorithmic description of the design to structural RTL through a sequence of very well defined steps, each limited in its scope. The major contribution is the partitioning of the equivalence checking task into two simpler subtasks, verifying the validity of register sharing, and verifying correct synthesis of the RTL interconnect and control. While state space traversal is unavoidable for verifying validity of the register sharing, we automatically abstract out irrelevant portions oftbe design, significantly simpliQing the task that must be performed by a back-end model checker. The second task of verifying the RTL is not only shown to reduce to a combinational equivalence check,we present a novel and fast RTL technique for combinational equivalence check instead of using slower gate level techniques. The verification procedure has been applied to several large circuits, and is illustrated on the implementation of a sort algorithm.

We describe a complete method for the latch mapping problem that is based on the efficient integration of previously proposed techniques for latch mapping as well as novel optimizations for further improvement. The highlights of the proposed approach include a new method of integrating complete methods and incomplete methods for latch mapping, the use of incremental reasoning to optimize the overall algorithm and the use of a conventional combinational equivalence checking tool as the core engine. Experiments confirm that the proposed method retains much of the efficiency and capacity of incomplete methods while providing the completeness of complete methods and derives significant performance improvements from the proposed optimizations.

Equivalence – Equivalence responding (Barnes et al., 1997), based on derived or non-explicitly trained relational responding, supports a behaviour-analytic model of analogical reasoning. Conditional discriminations are the most common procedure used to train its prerequisites. In this exploratory work we test Vaughan’s (1988) simple discrimination procedure instead to derive Eq-Eq responses in children. Two factors were assessed: type of reinforcer used (primary or secondary) and age of participants (9-10 or 12-13 years). The procedure successfully leaded to the derivation of equivalence – equivalence responses, and both factors influenced the results: selecting older children and applying primary reinforcement leaded to faster learning and better results in the equivalence – equivalence test. No interaction between factors was found. This training procedure can provide a new way to investigate the behavioural prerequisites of this important ability

Equivalence – Equivalence responding (Barnes et al., 1997), based on derived or non-explicitly trained relational responding, supports a behaviour-analytic model of analogical reasoning. Conditional discriminations are the most common procedure used to train its prerequisites. In this exploratory work we test Vaughan’s (1988) simple discrimination procedure instead to derive Eq-Eq responses in children. Two factors were assessed: type of reinforcer used (primary or secondary) and age of participants (9-10 or 12-13 years). The procedure successfully leaded to the derivation of equivalence – equivalence responses, and both factors influenced the results: selecting older children and applying primary reinforcement leaded to faster learning and better results in the equivalence – equivalence test. No interaction between factors was found. This training procedure can provide a new way to investigate the behavioural prerequisites of this important ability

Equivalence – Equivalence responding (Barnes et al., 1997), based on derived or non-explicitly trained relational responding, supports a behaviour-analytic model of analogical reasoning. Conditional discriminations are the most common procedure used to train its prerequisites. In this exploratory work we test Vaughan’s (1988) simple discrimination procedure instead to derive Eq-Eq responses in children. Two factors were assessed: type of reinforcer used (primary or secondary) and age of participants (9-10 or 12-13 years). The procedure successfully leaded to the derivation of equivalence – equivalence responses, and both factors influenced the results: selecting older children and applying primary reinforcement leaded to faster learning and better results in the equivalence – equivalence test. No interaction between factors was found. This training procedure can provide a new way to investigate the behavioural prerequisites of this important ability

Bayesian networks [21, 27] are defined by: a network structure, a directed acyclic graph G = (V, A), in which each node vi ∈ V corresponds to a random variable Xi; a global probability distribution, X, which can be factorised into smaller local probability distributions according to the arcs aij ∈ A present in the graph. The main role of the network structure is to express the conditional independence relationships among the variables in the model through graphical separation, thus specifying the factorisation of the global distribution: P(X) = p∏ i=1 P(Xi | ΠXi) where ΠXi = {parents of Xi}

El propósito de este estudio fue evaluar los efectos diferenciales del cambio de consecuencias (de contingencias de reforzamiento a contingencias de castigo) sobre el aprendizaje de discriminaciones condicionales y las relaciones derivadas de estímulos. Se entrenó a siete participantes para que discriminaran cuatro pares de estímulos a través del procedimiento de igualación a la muestra (primer entrenamiento), y se probaron las relaciones derivadas. Posteriormente, los conjuntos de pares fueron reorganizados para establecer las nuevas funciones discriminativas condicionales entre estímulos (segundo entrenamiento; incongruente respecto al inicial). Las respuestas relacionales consistentes con el segundo entrenamiento fueron castigadas en la siguiente fase. Finalmente, las funciones discriminativas condicionales (la entrenada directamente y la derivada) fueron probadas. Un alto número de participantes mostró el fenómeno de resurgencia, el cual es un patrón conductual consistente con el primer entrenamiento de relaciones entre estímulos. Los resultados pueden apoyar la idea de que la resurgencia de conductas es una alteración común tanto en la conducta moldeada por las consecuencias como en la conducta novedosa. Palabras clave: respuesta relacional derivada, resurgencia, relaciones de equivalencia, humanos.

The nominal approach to abstract syntax deals with the issues of bound names and α-equivalence by considering constructions and properties that are invariant with respect to permuting names. The use of permutations gives rise to an attractively simple formalization of common, but often technically incorrect uses of structural recursion and induction for abstract syntax modulo α-equivalence. At the heart of this approach is the notion of finitely supported mathematical objects. This article explains the idea in as concrete a way as possible and gives a new derivation within higher-order classical logic of principles of α- structural recursion and induction for α-equivalence classes from the ordinary versions of these principles for abstract syntax trees.

The idea of a context lemma spans a range of programminglanguage models: from Milner's original through the CIU theorem to 'CIU-like' results for multiple language features. Each shows that to prove observational equivalence between program terms it is enough to test only some restricted class of contexts: applicative, evaluation, reduction, etc. We formally reconstruct a distinctive proof method for context lemmas based on cyclic inclusion of three program approximations: by triangulating between 'applicative' and 'logical' relations we prove that both match the observational notion, while being simpler to compute. Moreover, the observational component of the triangle condenses a series of approximations covering variation in the literature around what variable-capturing structure qualifies as a 'context'. Although entirely concrete, our approach involves no term dissection or inspection of reduction sequences; instead we draw on previous context lemmas using operational logical relations and biorthogonality. We demonstrate the method for a fine-grained call-by-value presentation of the simplytyped lambda-calculus, and extend to a CIU result formulated with frame stacks. All this is formalised and proved in Agda: building on work of Allais et al., we exploit dependent types to specify lambdacalculus terms as well-typed and well-scoped by construction. By doing so, we seek to dispel any lingering anxieties about the manipulation of concrete contexts when reasoning about bound variables, capturing substitution, and observational equivalences.

In this paper we will explain our approach for generating test cases for a UML system model. Despite the fact that UML authors claim that UML semantics are precise enough to define non-ambiguous models, we find that the overlap of the different views makes it difficult to explore and make deduction on the state space of the modeled system in order to generate test cases. Our approach is thus based on a subset of UML (inspired from the Fondue approach) for which we have defined clear transformation semantics. We provide these semantics by delineating transformation rules using MDA (Model Driven Architecture) architecture as foundation. We transform UML models into CO-OPN (Concurrent Object Oriented Petri Nets) ones, CO-OPN being a formal specification language defined in our Laboratory. We have also defined a language for expressing test intentions for CO-OPN models. This language allows selecting interesting executions (tests cases) of a model by providing constraints over all possible traces of that model. By exploring the model's semantics with the tools we have built for our CO-OPN language we are able to generate test cases based on those test intentions. We are also able to partially eliminate redundancy in the produced test cases by finding equivalence classes in the model operation's inputs.

Image segmentation is a critical step in computer vision tasks constituting an essential issue for pattern recognition and visual interpretation. In this paper, we study the behavior of entropy in digital images through an iterative algorithm of mean shift filtering. The order of a digital image in gray levels is defined. The behavior of Shannon entropy is analyzed and then compared, taking into account the number of iterations of our algorithm, with the maximum entropy that could be achieved under the same order. The use of equivalence classes it induced, which allow us to interpret entropy as a hyper-surface in real mdimensional space. The difference of the maximum entropy of order n and the entropy of the image is used to group the the iterations, in order to caractrizes the performance of the algorithm.

Let H = (X, E) be a simple hypergraph and let f (H,) denote its chromatic polynomial. Two hypergraphs H 1 and H 2 are chromatic equivalent if f (H 1 ,) = f (H 2 ,). The equivalence class of H is denoted by H. Let K and H be two classes of hypergraphs. H is said to be chromatically characterized in K if for every H ∈ H ∩ K we have H ∩ K = H ∩ K. In this paper we prove that uniform hypertrees and uniform unicyclic hypergraphs are chromatically characterized in the class of linear hypergraphs.

Résumé. Dans la littérature, les travaux se sont principalement focalisés sur l’extraction des motifs fréquents. Toutefois, récemment, la fouille des motifs rares s’est avérée intéressante puisque ces motifs permettent de véhiculer des connaissances concernant des événements rares, inattendus. Ils ont ainsi prouvé leur grande utilité dans plusieurs domaines d’application. Cependant, un constat important associé à l’extraction des motifs rares est d’une part leur nombre très élevé et d’autre part la qualité faible de plusieurs motifs extraits. Ces derniers peuvent en effet ne pas présenter des corrélations fortes entre les items les constituant. Afin de pallier ces inconvénients, nous proposons dans cet article d’intégrer la mesure de corrélation bond afin d’extraire seulement l’ensemble des motifs rares vérifiant cette mesure. Une caractérisation de l’ensemble résultant, des motifs corrélés rares, est alors réalisée en se basant sur l’étude des contraintes de nature différentes indu...

A preorder consists of linearly ordered equivalence classes called blocks, and an alignment is a sequence of cycles on n labelled elements. We investigate the block structure of a random preorder chosen uniformly at random among all preorders on n elements, and also the distribution of cycles in a random alignment chosen uniformly at random among all alignments on n elements, as n → ∞.

The probability of equivalence class formation was assessed in three matching to sample procedures (standard, semi-standard, and linear series), and three training structures (one-to-many, many-to-one, and altered) in a 3x3 factorial design. The matching to sample procedures trained the same positive relations (sample-S+), but they differed in the kind of negative relations (sample-S-) that they trained. With the standard procedure only negative relations among stimuli of different classes (among-class relations) were trained; with the semi-standard procedure some among-class negative relations and others with stimuli that did not belong to any class (stimuli X) were trained; finally, with altered procedure negative relations only with X stimuli were trained. The baseline positive and negative relations were assessed, with trials with novel stimuli and a blank comparison stimulus. There was not an interaction effect between the matching procedure and the training structure. The stan...

This study aimed to determine whether the exclusive positive conditional relations established by the matching-to-sample (MTS) procedure are sufficient for equivalence class formation, or whether the negative conditional relations established with stimuli of alternative classes are necessary for it. In Experiment 1, two 3-choice MTS procedures were compared regarding equivalence class formation. The standard MTS procedure, where negative relations among stimuli of alternative classes are trained, was compared to an altered MTS procedure, where negative relations with stimuli that were not positive to any sample were trained. In Experiment 2, the positive and negative control patterns established by the standard and altered MTS procedures were assessed. Experiment 3 compared 2 further variations: (a) training only 1 negative relation with stimuli of alternative classes in each training trial type (semi-standard MTS procedure) or (b) varying the negative stimuli that did not belong to any class (varied-altered MTS procedure). The overall results indicate that for participants demonstrating high positive conditional baseline relations and high negative relations to stimuli from alternative classes, the probability of equivalence class formation was high, but when participants showed only high positive conditional baseline relations, the probability of equivalence class formation was very low. All main theories of equivalence class formation have difficulty accounting for these results, and an account based on a learning history of classifying behavior is offered.

It has been proved that almost all n-bit Boolean functions have exact classical query complexity n. However, the situation seemed to be very different when we deal with exact quantum query complexity. In this paper, we prove that almost all n-bit Boolean functions can be computed by an exact quantum algorithm with less than n queries. More exactly, we prove that AND n is the only n-bit Boolean function, up to isomorphism, that requires n queries.

A base-station (BS) equipped with multiple antennas can use its spatial dimensions in three different ways: (1) to serve multiple users, thereby achieving a multiplexing gain, (2) to provide spatial diversity in order to improve user rates and (3) to null interference in neighboring cells. This paper answers the following question: What is the optimal balance between these three competing benefits? We answer this question in the context of the downlink of a cellular network, where multi-antenna BSs serve multiple single-antenna users using zero-forcing beamforming with equal power assignment, while nulling interference at a subset of out-of-cell users. Any remaining spatial dimensions provide transmit diversity for the scheduled users. Utilizing tools from stochastic geometry, we show that, surprisingly, to maximize the per-BS ergodic sum rate, with an optimal allocation of spatial resources, interference nulling does not provide a tangible benefit. The strategy of avoiding inter-cell interference nulling, reserving some fraction of spatial resources for multiplexing and using the rest to provide diversity, is already close-to-optimal in terms of the sum-rate. However, interference nulling does bring significant benefit to cell-edge users, particularly when adopting a rangeadaptive nulling strategy where the size of the cooperating BS cluster is increased for cell-edge users.

Mining frequent itemsets (FIs) has been developing in recent years. However, little attention has been paid to efficient methods for mining in multidimensional databases. In this paper, we propose a new method with a supporting structure called AIO-tree (Attributes Itemset Object identifications-tree) for mining FIs from multidimensional databases. This method need not transform the database into the transaction database, and it is based on the intersections of object identifications for fast computing the support of itemsets. We compare our method to dEclat (after transformation to a transaction database) and indeed claim that they are faster than dEclat.

The current study was presented as a paper at the Association for Behavior Analysis International conference in Chicago in 2008. The authors are very grateful to Dag-Erik Eilertsen for help with the statistical analyses and to Lill-Beathe Halstadtro for assistance in organizing the lab facilities in one of the laboratories. Furthermore, we want to thank three anonymous reviewers and David Dickins for valuable comments to earlier versions of the article.

The present experiment examined number of training trials as a function of a required response to sample in establishing conditional discriminations and testing for responding accordance with stimulus equivalence. Reaction times were also examined. Twenty participants in 4 different experimental groups were compared in a between-groups design. The participants were trained to form 4 classes of 3 stimuli each with a linear series (LS) training structure. Unreinforced trials for directly trained relations were included in the test. Results from the present study show that a required response to sample increased chances to learn the discriminations more quickly. This may imply that the required response can increase the observing behavior. Required response to sample did not affect responding according to emergent relations in the test in any substantial way. Reaction time data show that there are systematic differences in reaction latency depending on the trial type in the test, and that incorrect responses may not be randomly selected.

Este estudo teve como objetivo investigar se um procedimento de ensino por modelação pode produzir discriminações condicionais, formar classes de estímulos equivalentes, e expansão de classes, em seis estudantes universitários. Foram ensinadas discriminações condicionais entre cinco conjuntos de estímulos, através de tarefas de escolha de acordo com o modelo. Foram usados como estímulos desenhos de objetos comuns produzidos em linhas pretas sobre fundo branco. As relações BA foram ensinadas da maneira tipicamente descrita pela literatura, sem modelo, seguidas de ensino das relações CA, com modelo. No ensino das relações BA, os participantes escolhiam os estímulos de comparação e recebiam conseqüências diferenciais para escolhas corretas e incorretas. No ensino de CA, assim como no de DA e EA, os participantes foram instruídos a observar um demonstrador que selecionava os estímulos de comparação e recebia conseqüências diferenciais por suas escolhas. Após o ensino das relações BA CA, foram introduzidos os testes para verificar a emergência de simetria, transitividade e equivalência. Todos os participantes mostraram formação de classes equivalentes e cinco deles expansão de classes para os estímulos D e E. Discute-se se os resultados produzidos foram função exclusiva do ensino por modelação, ou uma combinação desses com efeitos seqüenciais do ensino individual e direto da primeira relação condicional. Palavras-chave: ensino por modelação, equivalência de estímulos, discriminações condicionais, escolha de acordo com o modelo, aprendizagem observacional ABSTRACT This study investigated conditional discrimination acquisition, stimulus class formation and stimulus class expansion through a modeling procedure. Six college students were taught conditional discriminations with five stimulus sets. Stimuli were black line drawings of common objects against white backgrounds. BA relations were taught individually, in a manner similar to that typically described by the literature, without modeling, followed by the teaching of CA relations, taught through a modeling procedure. During the teaching of BA relations, correct and incorrect comparison selections were followed by differential reinforcement. During CA, subsequent DA relations and EA relations training, subjects were instructed to observe a model that actually made the selections and received differential reinforcement for that. After the teaching of BA and CA relations, symmetry, transitivity and equivalence tests were introduced, followed by DA and EA teaching and tests for equivalence class expansion. All participants showed equivalence class formation and all but one participant showed expanded classes to include stimulus sets D and E into the previously formed class. Whether the observed results were an exclusive function of modeling or a combination of modeling and sequential effects of the directing teaching of BA requires further investigation.

Distance labeling schemes are schemes that label the vertices of a graph with short labels in such a way that the distance between any two vertices u and v can be determined efficiently by merely inspecting the labels of u and v, without using any other information. Similarly, routing labeling schemes label the vertices of a graph in a such a way that given the labels of a source node and a destination node, it is possible to compute efficiently the port number of the edge from the source that heads in the direction of the destination. One of important problems is finding natural classes of graphs admitting distance and/or routing labeling schemes with labels of polylogarithmic size. In this paper, we show that the class of cube-free median graphs on n nodes enjoys distance and routing labeling schemes with labels of O(log 3 n) bits.

The papers introduces a new complex of differential forms which provides a fine resolution for the sheaf of regular functions in two quaternionic variables and the sheaf of monogenic functions in two vector variables. The paper announces some applications of this complex to the construction of sheaves of quaternionic and Clifford hyperfunctions as equivalence classes of such differential forms.

XQuery is known to be a powerful XML query language with many bells and whistles. For many common queries we do not need all the expressive power of XQuery. We investigate the effect of omitting certain features of XQuery on the expressive power of the language. We start from a simple base fragment which can be extended by several optional features being aggregation functions such as count and sum, sequence generation, node construction, position information in for loops, and recursion. In this way we obtain 64 different XQuery fragments which can be divided into 17 different equivalence classes such that two fragments can express the same functions iff they are in the same equivalence class. Moreover, we investigate the relationships between these equivalence classes.

This paper investigates two approaches for Boolean matching using NPN equivalence matching. Luks' hypergraph method is implemented and compared to the Walsh Spectral Decision Diagram (SDD) method that we propose here. Both methods determine a canonical representation for each NPN equivalence class. The target functions are then transformed into a canonical representation and compared to the representative canonical forms for the NPN classes. This paper presents the implementation and results of the spectral method in detail. It is shown that the spectral method compares favorably to Luks' method and is better in terms of computational requirements for large functions.

El objetivo del presente trabajo es exponer una breve revisión del estudio del razonamiento analógico desde la Teoría de los Marcos Relacionales (TMR), considerando los modelos formulados hasta la actualidad y la exploración experimental. A su vez, se abordará el estudio del desarrollo del azonamiento analógico en la infancia, surgido en el marco de las controversias generadas por los distintos enfoques de la psicología. Se expondrán los hallazgos obtenidos utilizando métodos de imágenes cerebrales desde las ciencias cognitivas. Finalmente se comentarán las posibles aplicaciones de este paradigma. Los estudios revisados acerca del razonamiento analógico desde la TMR proveen relevante evidencia empírica, principalmente en el ámbito de la evaluación y sugieren ventajas de este paradigma en comparación con proximaciones cognitivistas. A su vez, se propone su implementación como instrumento de entrenamiento cognitivo. En conclusión, la TMR propone un modelo útil al estudio del razonamie...

En el presente estudio se investiga la influencia de la estructura de entrenamiento en la formación de relaciones de equivalencia y de “equivalencia-equivalencia”. Se estudiaron tres grupos de sujetos los cuales fueron entrenados con las estructuras: Muchos a Uno, Uno a Muchos o Serie Lineal para las relaciones condicionales. Se verificó el efecto de estructura de entrenamiento sobre la variable porcentaje de aciertos en el test de relaciones de equivalencia. Sin embargo, este fenómeno no se replicó en el test de relaciones de equivalencia-equivalencia. Los resultados indican que la estructura de entrenamiento influye cuando se forman relaciones de equivalencia, pero no cuando se forman relaciones de equivalencia-equivalencia. Se analizan los hallazgos considerando los requisitos para la formación de relaciones de equivalencia-equivalencia.The influence of training structure on the formation of equivalence relations and equivalence-equivalence relations was assessed. Three groups le...

Resumen El estudio de las relaciones de similitud física (RSF) y las relaciones arbitrarias resulta de interés ya que permite evaluar la capacidad de formación y discriminación de nuevas relaciones entre estímulos cuando está disponible un criterio de respuesta potencialmente más arraigado, como el de similitud física. El propósito del presente estudio fue investigar los efectos de la competencia de respuesta entre las relaciones derivadas de relaciones (RDR) y las RSF. Se consideraron como indicadores de respuesta el número de respuestas por las RDR y los tiempos de respuesta. Participaron del estudio 158 sujetos adultos. Los resultados demostraron que, cuando los participantes formaron RDR consistentemente, la presencia de competencia no generó dificultad para seleccionar respuestas por RDR. Los participantes que respondieron inconsistentemente a las RDR, sí presentaron efectos de competencia en ambos indicadores de respuesta. Se pone de manifiesto la conveniencia de utilizar los tiempos de respuesta además de la cantidad de respuestas por la RDR, como una medida más fina del control de estímulos y de estudiar tanto el desempeño de los participantes que responden consistentemente a todas las relaciones derivadas como el de aquellos que sólo exhiben consistencia en el establecimiento de clases de equivalencia de estímulos. Debe atenderse tanto a las relaciones que son estrictamente arbitrarias, como también a las RSF en tanto se sabe que la tendencia a considerar estas relaciones estaría también en la base del formación del razonamiento analógico. Palabras clave: relaciones derivadas; equivalencia-equivalencia; relaciones de similitud física; competencia; tiempos de respuesta.

Resumen El estudio de las relaciones de similitud física (RSF) y las relaciones arbitrarias resulta de interés ya que permite evaluar la capacidad de formación y discriminación de nuevas relaciones entre estímulos cuando está disponible un criterio de respuesta potencialmente más arraigado, como el de similitud física. El propósito del presente estudio fue investigar los efectos de la competencia de respuesta entre las relaciones derivadas de relaciones (RDR) y las RSF. Se consideraron como indicadores de respuesta el número de respuestas por las RDR y los tiempos de respuesta. Participaron del estudio 158 sujetos adultos. Los resultados demostraron que, cuando los participantes formaron RDR consistentemente, la presencia de competencia no generó dificultad para seleccionar respuestas por RDR. Los participantes que respondieron inconsistentemente a las RDR, sí presentaron efectos de competencia en ambos indicadores de respuesta. Se pone de manifiesto la conveniencia de utilizar los tiempos de respuesta además de la cantidad de respuestas por la RDR, como una medida más fina del control de estímulos y de estudiar tanto el desempeño de los participantes que responden consistentemente a todas las relaciones derivadas como el de aquellos que sólo exhiben consistencia en el establecimiento de clases de equivalencia de estímulos. Debe atenderse tanto a las relaciones que son estrictamente arbitrarias, como también a las RSF en tanto se sabe que la tendencia a considerar estas relaciones estaría también en la base del formación del razonamiento analógico. Palabras clave: relaciones derivadas; equivalencia-equivalencia; relaciones de similitud física; competencia; tiempos de respuesta.

El aprendizaje de categorías es uno de los temas de mayor amplitud y controversia de la psicología contemporánea. Siguiendo al enfoque "biocomportamental" se describirán algunos aspectos comportamentales, neurofisiológicos y neuropsicológicos reportados recientemente. Los ...

A new three-dimensional reconstruction technique is presented that uses an integer control parameter, denoted β, to produce a family of models from a given set of planar cross-sections. Parameter β supports multiple choices for solving the correspondence problem, i.e., the problem of deciding which regions from two consecutive cross-sections must be connected into a single component. Thus, unlike current reconstruction methods, the beta-connection algorithm enables the consideration of multiple alternatives when establishing region correspondence. In addition to this flexibility, which is useful in creating models with complex topologies, the algorithm produces PL-manifolds and respects the re-sampling condition, thus providing an interesting reconstruction solution for many practical visualization and numerical simulation applications.

Massive MIMO (multiple-input multiple-output) antenna technology can provide significant performance improvement for cellular systems in terms of both throughput and energy efficiency. It is widely recognized that inter-user interference can be eliminated with a large number of antennas because of the asymptotical orthogonality among users when linear MF (Matched Filter) downlink precoding is used in the eNodeB. In this paper, system level simulation performance for the downlink, based upon current LTE systems, provides an indication of the achievable potential system performance improvement by employing massive MIMO in future (5G) cellular networks. System simulations consider various performance limiting factors including non-ideal asymptotical orthogonality, transmit channel correlation, imperfect channel estimation and pilot contamination. It is demonstrated that even as the number of transmit antennas is increased to a large number, the accumulative effects of the non-ideal asymptotical orthogonality among different users constitute a significant limiting degradation to the system performance. Likewise, a significant performance decrease is also incurred due to transmit channel correlation, imperfect channel estimation, and pilot contamination.

This paper describes our participation in the WebCLEF 2008 task, targeted at snippet retrieval from new data. Our system assumes that the task can be tackled as a summarization problem and that the document retrieval and multilinguism treatment steps can be ignored. Our approach assumes also that the redundancy of information in the Web allows the system to be very restrictive when picking information pieces. Our evaluation results suggest that, while the first assumption is feasible, the second one is not always true.

For a (simple) graph G, the signless Laplacian of G is the matrix A(G) + D(G), where A(G) is the adjacency matrix and D(G) is the diagonal matrix of vertex degrees of G; the reduced signless Laplacian of G is the matrix (G) + B(G), where B(G) is the reduced adjacency matrix of G and (G) is the diagonal matrix whose diagonal entries are the common degrees for vertices belonging to the same neighborhood equivalence class of G. A graph is said to be (degree) maximal if it is connected and its degree sequence is not majorized by the degree sequence of any other connected graph. For a maximal graph, we obtain a formula for the characteristic polynomial of its reduced signless Laplacian and use the formula to derive a localization result for its reduced signless Laplacian eigenvalues, and to compare the signless Laplacian spectral radii of two wellknown maximal graphs. We also obtain a necessary condition for a maximal graph to have maximal signless Laplacian spectral radius among all connected graphs with given numbers of vertices and edges.

We introduce McCarthy-Kleene fuzzy automata (MK-fuzzy automata) over a bimonoid K which is related to the fuzzification of the McCarthy-Kleene logic. Our automata are inspired by, and intend to contribute to, practical applications being in development in a project on runtime network monitoring based on predicate logic. We investigate closure properties of the class of recognizable MK-fuzzy languages accepted by MK-fuzzy automata as well as of deterministically recognizable MK-fuzzy languages accepted by their deterministic counterparts. Moreover, we establish a Nivatlike result for recognizable MK-fuzzy languages. We introduce an MK-fuzzy MSO logic and show the expressive equivalence of a fragment of this logic with MK-fuzzy automata, i.e., a Büchi type theorem.

En el presente estudio se investiga la influencia de la estructura de entrenamiento en la formación de relaciones de equivalencia y de “equivalencia-equivalencia”. Se estudiaron tres grupos de sujetos los cuales fueron entrenados con las estructuras: Muchos a Uno, Uno a Muchos o Serie Lineal para las relaciones condicionales. Se verificó el efecto de estructura de entrenamiento sobre la variable porcentaje de aciertos en el test de relaciones de equivalencia. Sin embargo, este fenómeno no se replicó en el test de relaciones de equivalencia-equivalencia. Los resultados indican que la estructura de entrenamiento influye cuando se forman relaciones de equivalencia, pero no cuando se forman relaciones de equivalencia-equivalencia. Se analizan los hallazgos considerando los requisitos para la formación de relaciones de equivalencia-equivalencia.The influence of training structure on the formation of equivalence relations and equivalence-equivalence relations was assessed. Three groups le...

The paradigm of equivalence classes has been widely used to study the formation of categories and concepts. After learning of arbitrary connections between stimuli, new relations are verified experimentally spontaneously although these were not directly trained. The ability to transfer responses to stimuli within a class might be a prerequisite for language development in humans. For this reason it is considered that the equivalence classes are similar to abstract categories. This generative capacity of the paradigm gives interest in the level of the practical applications. In this communication it will be reviewed the force of such applications. In particular, there will be mentioned the different clinical and education trials in which this methodology is used. It is concluded that the paradigm is useful for both in the context of the assessment and the cognitive rehabilitation, education and psychotherapy.El paradigma de clases de equivalencia ha sido ampliamente utilizado para el...

El aprendizaje de categorías es uno de los temas de mayor amplitud y controversia de la psicología contemporánea. Siguiendo al enfoque "biocomportamental" se describirán algunos aspectos comportamentales, neurofisiológicos y neuropsicológicos reportados recientemente. Los ...

Feature selection is the process of sieving features, in which informative features are separated from the redundant and irrelevant ones. This process plays an important role in machine learning, data mining and bioinformatics. However, traditional feature selection methods are only capable of processing centralized datasets and are not able to satisfy today's distributed data processing needs. These needs require a new category of data processing algorithms called privacypreserving feature selection, which protects users' data by not revealing any part of the data neither in the intermediate processing nor in the final results. This is vital for the datasets which contain individuals' data, such as medical datasets. Therefore, it is rational to either modify the existing algorithms or propose new ones to not only introduce the capability of being applied to distributed datasets, but also act responsibly in handling users' data by protecting their privacy. In this paper, we will review three privacy-preserving feature selection methods and provide suggestions to improve their performance when any gap is identified. We will also propose a privacy-preserving feature selection method based on the rough set feature selection. The proposed method is capable of processing both horizontally and vertically partitioned datasets in two-and multi-parties scenarios.

In the paper, information table for network traffic data is discretized by supervised learning using WEKA and from this discretized data, three different algorithms for calculation of rules are applied, genetic algorithm, covering algorithm and LEM2 algorithm. Rough set classification through three different table rule set are done and accuracies are observed. It has been concluded that out of these three methods of rule calculation, classification through table rule set using covering algorithm yields best accuracy. In fourth table of classification, rules have been calculated through reduct generation but in that case, rough set classification produces same total accuracy of classification through covering algorithm. RSES software is used for rule set calculation, reduct generation and rough set classification.