Skip to main content

Posts

Showing posts with the label signal flow graph

Computations of the Eight Basic Measures in Diagnostic Testing | Chapter 06 | Advances in Mathematics and Computer Science Vol. 2

Diagnostic testing concerning categorical or dichotomized variables is ubiquitous in many fields including, in particular, the field of clinical or epidemiological testing. Typically, results are aggregated in two-by-two contingency-table format, from which a surprisingly huge number of indicators or measures are obtained. In this chapter, we study the eight most prominent such measures, using their medical context. Each of these measures is given as a conditional probability as well as a quotient of certain natural frequencies. Despite its fundamental theoretical importance, the conditional probability interpretation does not seem to be appealing to medical students and practitioners. This paper attempts a partial remedy of this situation by visually representing conditional probability formulas first in terms of two-variable Karnaugh maps and later in terms of simplified acyclic (Mason) Signal Flow Graph (SFGs), resembling those used in digital communications or DNA replication. Th...

Recursive Computation of Binomial and Multinomial Coefficients and Probabilities | Chapter 07 | Advances in Mathematics and Computer Science Vol. 1

This chapter studies a prominent class of recursively-defined combinatorial functions, namely, the binomial and multinomial coefficients and probabilities. The chapter reviews the basic notions and mathematical definitions of these four functions. Subsequently, it characterizes each of these functions via a recursive relation that is valid over a certain two-dimensional or multi-dimensional region and is supplemented with certain boundary conditions. Visual interpretations of these characterizations are given in terms of regular acyclic signal flow graphs. The graph for the binomial coefficients resembles a Pascal Triangle, while that for trinomial or multinomial coefficients looks like a Pascal Pyramid, Tetrahedron, or Hyper-Pyramid. Each of the four functions is computed using both its conventional and recursive definitions. Moreover, the recursive structures of the binomial coefficient and the corresponding probability are utilized in an iterative scheme, which is substantially m...