Network reconstruction, i.e., obtaining network structure from data, is a central theme in systems biology, economics and engineering. In some previous work, we introduced dynamical structure functions as a tool for posing and solving the problem of network reconstruction between measured states. While recovering the network structure between hidden states is not possible since they are not mea...

Logic programming with abductive reasoning is used during the realization of a data dictionary with a particular methodology. Some methodological steps are represented by means of a set of rules augmented with integrity constraints which capture the presence of incompatible concepts. Explanations for incompatibility can be inferred by exploiting abductive reasoning. To this end a new proposal f...

In mobile communications systems complexity and efficiency are issues of paramount importance. Therefore when implementing integer factor sample-rate conversion, comb-filters especially cascaded-integratorcomb (CIC) filters are a good choice of realizing linearphase filters with low complexity. However, neither the direct implementation of comb-filters as transversal filters nor their implement...

Given a set F of graphs, a graph G is F-free if G does not contain any member of F as an induced subgraph. Barrus, Kumbhat, and Hartke [4] called F a degree-sequence-forcing (DSF) set if, for each graph G in the class C of F-free graphs, every realization of the degree sequence of G is also in C. A DSF set is minimal if no proper subset is also DSF. In this paper, we present new properties of m...

We investigate solutions to the minimal surface problem with Dirichlet boundary conditions in the roto-translation group equipped with a subRiemannian metric. By work of G. Citti and A. Sarti, such solutions are amodal completions of occluded visual data when using a model of the first layer of the visual cortex. Using a characterization of smooth minimal surfaces as ruled surfaces, we give a m...

We address the concept of “minimal polynomial encoder” for finite support linear convolutional codes over Zpr . These codes can be interpreted as polynomial modules which enables us to apply results from the 2007-paper [8] to introduce the notions of “p-encoder” and “minimal p-encoder”. Here the latter notion is the ring analogon of a row reduced polynomial encoder from the field case. We show ...

There are two broad approaches to formal statistical inference taken as concerned with the development of methods for analysing noisy empirical data and in particular as the attaching of measures of uncertainty to conclusions. The object of this paper is to summarize what is involved. The issue is this. We have data represented collectively by y and taken to be the observed value of a vector ra...

This paper presents the issues necessary to solve in the designing process of multichannel optical communication systems topologies. The main design assumption is the acceptance of multichanneling in communication system realization. In particular, the basics of designing physical and logical topologies are shown. Also cost aspects of physical and logical topologies realization are shown.

We investigate the gauging of conformal algebras with relations between the generators. We treat the W 5/2 –algebra as a specific example. We show that the gauge-algebra is in general reducible with an infinite number of stages. We show how to construct the BV-extended action, and hence the classical BRST charge. An important conclusion is that this can always be done in terms of the generators...