Directed graph representation of half-rate additive codes over GF(4)

Techniques from coding theory are able to improve the efficiency of neuroinspired and neural associative memories by forcing some construction and constraints on the network. In this letter, the approach is to embed coding techniques into neural associative memory in order to increase their performance in the presence of partial erasures. The motivation comes from recent work by Gripon, Berrou, and coauthors, which revisited Willshaw networks and presented a neural network with interacting neurons that partitioned into clusters. The model introduced stores patterns as small-size cliques that can be retrieved in spite of partial error. We focus on improving the success of retrieval by applying two techniques: doing a local coding in each cluster and then applying a precoding step. We use a slightly different decoding scheme, which is appropriate for partial erasures and converges faster. Although the ideas of local coding and precoding are not new, the way we apply them is different. Simulations show an increase in the pattern retrieval capacity for both techniques. Moreover, we use self-dual additive codes over field [Formula: see text], which have very interesting properties and a simple-graph representation.

Download Full-text

Directed graph representation for root-signal set of median filters

Proceedings of the IEEE ◽

10.1109/proc.1987.13918 ◽

1987 ◽

Vol 75 (11) ◽

pp. 1542-1544 ◽

Cited By ~ 5

Author(s):

Dong Hong Yom ◽

Souguil Ann

Keyword(s):

Directed Graph ◽

Graph Representation ◽

Median Filters ◽

Signal Set ◽

Root Signal

Download Full-text

A New Framework for Analysis of Coevolutionary Systems—Directed Graph Representation and Random Walks

Evolutionary Computation ◽

10.1162/evco_a_00218 ◽

2019 ◽

Vol 27 (2) ◽

pp. 195-228 ◽

Cited By ~ 1

Author(s):

Siang Yew Chong ◽

Peter Tiňo ◽

Jun He ◽

Xin Yao

Keyword(s):

Markov Chain ◽

Random Walks ◽

Directed Graph ◽

Pairwise Comparison ◽

Complete Characterization ◽

Graph Representation ◽

The Rich ◽

Cycle Structures ◽

Expected Hitting Time ◽

New Framework

Studying coevolutionary systems in the context of simplified models (i.e., games with pairwise interactions between coevolving solutions modeled as self plays) remains an open challenge since the rich underlying structures associated with pairwise-comparison-based fitness measures are often not taken fully into account. Although cyclic dynamics have been demonstrated in several contexts (such as intransitivity in coevolutionary problems), there is no complete characterization of cycle structures and their effects on coevolutionary search. We develop a new framework to address this issue. At the core of our approach is the directed graph (digraph) representation of coevolutionary problems that fully captures structures in the relations between candidate solutions. Coevolutionary processes are modeled as a specific type of Markov chains—random walks on digraphs. Using this framework, we show that coevolutionary problems admit a qualitative characterization: a coevolutionary problem is either solvable (there is a subset of solutions that dominates the remaining candidate solutions) or not. This has an implication on coevolutionary search. We further develop our framework that provides the means to construct quantitative tools for analysis of coevolutionary processes and demonstrate their applications through case studies. We show that coevolution of solvable problems corresponds to an absorbing Markov chain for which we can compute the expected hitting time of the absorbing class. Otherwise, coevolution will cycle indefinitely and the quantity of interest will be the limiting invariant distribution of the Markov chain. We also provide an index for characterizing complexity in coevolutionary problems and show how they can be generated in a controlled manner.

Download Full-text

Solving Geometry Friends using Monte-Carlo Tree Search with directed graph representation

2014 IEEE Conference on Computational Intelligence and Games ◽

10.1109/cig.2014.6932923 ◽

2014 ◽

Cited By ~ 1

Author(s):

Hyun-Tae Kim ◽

Du-Mim Yoon ◽

Kyung-Joong Kim

Keyword(s):

Monte Carlo ◽

Directed Graph ◽

Graph Representation ◽

Tree Search ◽

Monte Carlo Tree Search

Download Full-text

Inference Procedures for Ordering Theory

Journal of Educational Statistics ◽

10.3102/10769986002003217 ◽

1977 ◽

Vol 2 (3) ◽

pp. 217-232 ◽

Cited By ~ 6

Author(s):

Frank B. Baker ◽

Lawrence J. Hubert

Keyword(s):

Directed Graph ◽

Permutation Test ◽

Test Procedure ◽

Point Of View ◽

Hierarchical Organization ◽

Graph Representation ◽

Data Set ◽

Test Items ◽

Basic Framework

Given observations on a set of n dichotomously scored test items representing certain skills or tasks, ordering theory attempts to identify a hierarchical organization among the n items. Using this basic framework, a directed graph representation for the empirically obtained hierarchy is discussed along with several assumptions that are necessary from a substantive point of view to justify the analysis that ordering theory provides. Furthermore, a permutation test procedure is introduced that allows a formal comparison of a postulated hierarchy among the n items to the hierarchy elicited from the available data set.

Download Full-text

Estimating Transactions Given Balance Sheets and an Income Statement

Issues in Accounting Education ◽

10.2308/iace.2000.15.3.393 ◽

2000 ◽

Vol 15 (3) ◽

pp. 393-411 ◽

Cited By ~ 2

Author(s):

Anil Arya ◽

John C. Fellingham ◽

Douglas A. Schroeder

Keyword(s):

Linear Algebra ◽

Directed Graph ◽

Traditional Approach ◽

Financial Statements ◽

Graph Representation ◽

Accounting System ◽

Balance Sheets ◽

Systematic Fashion ◽

Income Statement ◽

Double Entry

One way to develop an appreciation for the power and beauty of doubleentry is to derive consistent transaction vectors, i.e., start with financial statements and derive the transaction amounts that could have generated the statements. Working backward to uncover transactions (the inverting exercise) complements the more traditional approach of working forward from transactions to financial statements. In addition, the approach highlights a fundamental accounting activity: aggregation. Financial statements summarize a firm's transactions using only a relatively small number of account balances. A consequence of aggregation is that there are infinite consistent transaction vectors. However, because these infinite solutions are all prepared in accordance with double-entry, they are linked to each other in a systematic fashion. We show how a directed graph representation of the accounting system can be used as a parsimonious means of characterizing all consistent transaction vectors. As the number of accounts and transactions are increased, the inverting exercise becomes tedious if one does not make use of the directed graph. To emphasize this point, the inverting exercise is conducted using a set of published financial statements. We also discuss the issue of picking the most likely transaction vector from the set of consistent transaction vectors. The authors have used this note in undergraduate, M.B.A., and Ph.D. classes. For the Ph.D. class, the note has been supplemented by the more rigorous analyses in the linear algebra literature and the accounting literature.

Download Full-text