Studies of branch prediction have tended to emphasize aggregate measurement of prediction performance. Instead, we have taken the approach that there are likely to be a small number of branch addresses (“sites”) in the program causing the majority of all mispredictions. Using a graphical tool we developed for analyzing program traces on-the-fly, we present three interesting results, all based o...

In this paper, we examine in detail the principal branches of solutions that arise in vector discrete models with nonlinear intercomponent coupling and four wave mixing. The relevant four branches of solutions consist of two single mode branches (transverse electric and transverse magnetic) and two mixed mode branches, involving both components (linearly polarized and elliptically polarized). T...

Giant branched nanotubes were successfully constructed using cyclodextrin-based amphiphiles. The 'backbone' of the nanotubes could branch out into two or multiple branches, from which thinner branches grow out.

In this paper, we present a procedure to approximate the cover map generated from a remotely sensed image. The procedure can detect the nodes and branches from a segmented description of an image resembling a network. In the first of a two part algorithm, the nodes and branches of the mesh are detected. Once this has been completed, all those branches encapsulating a segment are used to generat...

It is proved that the set of branches of a graph G is reconstructible except in a very special case. More precisely the set of branches of a graph G is reconstructible unless all the following hold: (1) the pruned center of G is a vertex or an edge, (2) G has exactly two branches, (3) one branch contains all the vertices of degree one of G and the other branch contains exactly one end-block. Th...