We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...
Several types of low power passive equalizer is proposed and optimized in this work. The equalizer topologies include T-junction, parallel R-C and series R-L structures. These str...
The use of bit-patterned media is one of the approaches being investigated to extend magnetic recording densities to 1 Tbit/in2 and beyond. In patterned media, track pitch may be s...
Most of the existing literature on cooperative relay networks has focused on frequency– nonselective channels or frequency–selective channels with multi–carrier transmission...
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...