Performance enhancements for algebraic soft decision decoding of Reed-Solomon codes

In an attempt to determine the ultimate capabilities of the Sudan-Guruswami-Sudan-Kotter-Vardy algebraic soft decision decoding algorithm for Reed-Solomon codes, we present a new method, based on the Chernoff bound, for constructing multiplicity matrices. In many cases, this technique predicts that the potential performance of ASD decoding of RS codes is significantly better than previously thought

Maximal-entropy random walk unifies centrality measures

In this paper analogies between different (dis)similarity matrices are derived. These matrices, which are connected to path enumeration and random walks, are used in community detection methods or in computation of centrality measures for complex networks. The focus is on a number of known centrality measures, which inherit the connections established for similarity matrices. These measures are based on the principal eigenvector of the adjacency matrix, path enumeration, as well as on the stationary state, stochastic matrix or mean first-passage times of a random walk. Particular attention is paid to the maximal-entropy random walk, which serves as a very distinct alternative to the ordinary random walk used in network analysis. The various importance measures, defined both with the use of ordinary random walk and the maximal-entropy random walk, are compared numerically on a set of benchmark graphs. It is shown that groups of centrality measures defined with the two random walks cluster into two separate families. In particular, the group of centralities for the maximal-entropy random walk, connected to the eigenvector centrality and path enumeration, is strongly distinct from all the other measures and produces largely equivalent results.Comment: 7 pages, 2 figure

RAFCON: a Graphical Tool for Task Programming and Mission Control

There are many application fields for robotic systems including service robotics, search and rescue missions, industry and space robotics. As the scenarios in these areas grow more and more complex, there is a high demand for powerful tools to efficiently program heterogeneous robotic systems. Therefore, we created RAFCON, a graphical tool to develop robotic tasks and to be used for mission control by remotely monitoring the execution of the tasks. To define the tasks, we use state machines which support hierarchies and concurrency. Together with a library concept, even complex scenarios can be handled gracefully. RAFCON supports sophisticated debugging functionality and tightly integrates error handling and recovery mechanisms. A GUI with a powerful state machine editor makes intuitive, visual programming and fast prototyping possible. We demonstrated the capabilities of our tool in the SpaceBotCamp national robotic competition, in which our mobile robot solved all exploration and assembly challenges fully autonomously. It is therefore also a promising tool for various RoboCup leagues.Comment: 8 pages, 5 figure

Separation of Test-Free Propositional Dynamic Logics over Context-Free Languages

For a class L of languages let PDL[L] be an extension of Propositional Dynamic Logic which allows programs to be in a language of L rather than just to be regular. If L contains a non-regular language, PDL[L] can express non-regular properties, in contrast to pure PDL. For regular, visibly pushdown and deterministic context-free languages, the separation of the respective PDLs can be proven by automata-theoretic techniques. However, these techniques introduce non-determinism on the automata side. As non-determinism is also the difference between DCFL and CFL, these techniques seem to be inappropriate to separate PDL[DCFL] from PDL[CFL]. Nevertheless, this separation is shown but for programs without test operators.Comment: In Proceedings GandALF 2011, arXiv:1106.081

Pharyngeal mesoderm regulatory network controls cardiac and head muscle morphogenesis

Harel, Itamar et al.The search for developmental mechanisms driving vertebrate organogenesis has paved the way toward a deeper understanding of birth defects. During embryogenesis, parts of the heart and craniofacial muscles arise from pharyngeal mesoderm (PM) progenitors. Here, we reveal a hierarchical regulatory network of a set of transcription factors expressed in the PM that initiates heart and craniofacial organogenesis. Genetic perturbation of this network in mice resulted in heart and craniofacial muscle defects, revealing robust cross-regulation between its members. We identified Lhx2 as a previously undescribed player during cardiac and pharyngeal muscle development. Lhx2 and Tcf21 genetically interact with Tbx1, the major determinant in the etiology of DiGeorge/velo-cardio-facial/22q11.2 deletion syndrome. Furthermore, knockout of these genes in the mouse recapitulates specific cardiac features of this syndrome. We suggest that PM-derived cardiogenesis and myogenesis are network properties rather than properties specific to individual PM members. These findings shed new light on the developmental underpinnings of congenital defects.This work was supported by grants to E.T. from the European Research Council; Israel Science Foundation; United States-Israel Binational Science Foundation; German Israeli Foundation; Association Française Contre les Myopathies; Kirk Center for Childhood Cancer and Immunological Disorders; Jeanne and Joseph Nissim Foundation for Life Sciences Research; and a donation from the Jack Gitlitz Estate. CK was supported by NIH-NIAMS grant AR054406. J.W.C was supported by a Studentship from The Institute Of Cancer Research, London. J.J.C. was partly supported by a Ministry of Science and Innovation (MICINN) grant [BFU2011-22928].Peer reviewe

Poset belief propagation-experimental results

Poset belief propagation, or PBP, is a flexible generalization of ordinary belief propagation which can be used to (approximately) solve many probabilistic inference problems. In this paper, we summarize some experimental results comparing the performance of PBP to conventional BP techniques

Holding a Stick at Both Ends: On Faces and Expertise

Ever since Diamond and Carey\u27s (1986) seminal work, object expertise has often been viewed through the prism of face perception (for a thorough discussion, see Tanaka and Gauthier, 1997; Sheinberg and Tarr, 2010). According to Wong and Wong (2014, W&W), however, this emphasis has simply been a response to the question of modularity of face perception, and has not been about expertise in and of itself. It is precisely this conflation of questions of expertise and modularity, the consequent focus on FFA, and the detrimental effect this had on the field of object expertise research that we discussed as part of our original review (Harel et al., 2013)