In this paper, we propose a butterfly−graph based stream authentication scheme for lossy networks where the streaming packets could be lost in both random and burst ways. Due to the nice properties of butterfly graph, the proposed scheme is quite robust and efficient. Theoretical analysis and simulation results show that the proposed scheme outperforms existing schemes in terms of overhead and ...

This paper describes in detail the design of a custom CMOS Fast Fourier Transform(FFT) processor for computing 256-point complex FFT. The FFT is well suited for real-time spectrum analysis in instrumentation and measurement applications. The FFT butterfly processor consists of one parallel-parallel multiplier and two adders. It is capable of computing one butterfly computation every 100ns thus ...

We present the case of a 50-year-old man who developed a delayed progressive swelling over the medial aspect of his right thigh, six weeks following minimally invasive plate osteosynthesis (MIPO) of a supracondylar femur fracture. Angiography showed a false aneurysm of the superficial femoral artery, caused by progressive displacement of a butterfly fragment. Open vascular repair was performed ...

The edge-bandwidth problem is an analog of the classical bandwidth problem, in which one has to label the edges of a graph by distinct integers such that the maximum difference of labels of any two incident edges is minimized. We prove tight bounds on the edge-bandwidth of hypercube and butterfly graphs and complete k-ary trees which extend and improve on previous known results. We also provide...

This paper defines a new network called the Extended Butterfly. The extended butterfly of degree n (XBn) has n 2 nodes, diameter equal to b3n/2c and a constant node degree of 8. XBn is symmetric and contains n distinct copies of Bn. We also show that XBn supports all cycle subgraphs except those of odd lengths when n is even and of odd lengths less than n.

We describe a new interconnection network called the Enhanced Butterfly (EBn). It is a Cayley graph with n2 nodes, each incident with five edges. This new network has a diameter n which compares favorably to the wrap-around butterfly (Bn) with the same number of nodes and a diameter of b3n/2c. Bn is a subgraph of EBn. The simple and optimal routing algorithms for this network are presented.

This paper describes in detail the design of a CMOS custom fast Fourier transform (FFT) processor for computing a 256-point complex FFT. The FFT is well-suited for realtime spectrum analysis in instrumentation and measurement applications. The FFT butterfly processor reported here consists of one parallel–parallel multiplier and two adders. It is capable of computing one butterfly computation e...

This paper presents a robust method for the automated segmentation and quantitative measurement of reflections from single ommatidia in the butterfly compound eye. Digital pictures of the butterfly eye shine recorded with a digital camera are processed to yield binary images from which single facet centers can be extracted using a morphological image analysis procedure. The location of the face...

The FFT performs butterfly computations on pairs of data elements that differ in a single bit. The computations start from the most significant bit in the index space and proceeds monotonically to the least significant bit. In a binary cube, adjacent nodes differ in a single bit in their addresses. Thus, mapping data to nodes by a binary encoding of the indices is suitable for the FFT. We assum...

Long term studies of Vietnamese Rhopalocera suggest that by using a taxonomic composition analysis of the modern fauna, with ecological and biogeographical characteristics and comparative data with butterfly faunas of adjacent regions, it is possible to offer a plausible account of the history and derivation of the Vietnamese fauna. In former works on the butterfly fauna of Vietnam and of the O...