DNA computing often makes use of annealing or hybridization, whether for vastly generating the initial candidate answers or amplification by using polymerase chain reaction. The main idea behind molecular search or DNA computing approaches for solving weighted graph problems is by controlling the degree of hybridization in order to generate more double stranded DNA, which represent the answer o...

let $g$ be a connected graph, and let $d[g]$ denote the double graph of $g$. in this paper, we first derive closed-form formulas for different distance based topological indices for $d[g]$ in terms of that of $g$. finally, as illustration examples, for several special kind of graphs, such as, the complete graph, the path, the cycle, etc., the explicit formulas for some distance based topologica...

In this paper, we present a method for handling double-talk. This approach uses a robust fast recursive least-squares algorithm (FRLS) and the normalized cross-correlation double-talk detector (NCC DTD). The NCC DTD is developed into a fast version, called FNCC, by reusing computational results from the FRLS algorithm. The major advantage of this detector is that it is much less dependent on th...

This paper addresses the problem of detection and discrimination of the two phenomena double talk and echo path change in a telephone channel. It is of uttermost importance to quickly detect a change in the echo path while not confusing it with double talk, since the echo canceller should react di erently whether an echo path change or double talk has occurred. In this paper, novel algorithms o...