Supercattering Channels of Nonspherical structurers

A superscattering structure is an efficient energy-mapping device that of particular importance for various electromagnetic experiment methods, with potential sensing and energy harvesting applications. We study in this work the scattering cross-section of outgoing channels in the irreducible and singular basis for an arbitrary shape scatterer. The superscattering status is shown to occur within a single outgoing channel of an optimized cluster of cylinders, a forbidden mechanism in spherically symmetric Mie resonators.

A New Technique for File Sharing Mechanism Ad hoc Networks

Network coding is a data transmission technique which allows intermediate nodes in a network to re-code data in transit. In contrast to traditional network communication where a node repeats incoming data to its outgoing channel without modifying the payload, a node implementing network coding not only repeats but also alters data. Network coding has been demonstrated to increase network throughput compared to the traditional forwarding transmission. It has potentially broad applications in many areas, including traditional computer networks, wireless ad-hoc networks, and peer to peer systems. This paper process a new technique for file sharing in P2P.

Texture Gradient in a Single Pass ECAPed Pure Mg by Neutron Radiation

Single pass ECAP of pure Magnesium was performed and stopped after 50 % deformation; textures thereafter at the ingoing, the deformation and the outgoing channel were characterized by neutron radiation and related to the deformation mode. A gradient texture evolution was obtained, which was attributed to the inhomogeneous distribution of the effective stress and strain, and also the inevitable existence of friction.

DEADLOCK-FREE ROUTING IN IRREGULAR NETWORKS USING PREFIX ROUTING

We propose a deadlock-free routing scheme in irregular networks using prefix routing. Prefix routing is a special type of routing with a compact routing table associated with each node (processor). Basically, each outgoing channel of a node is assigned a special label and an outgoing channel is selected if its label is a prefix of the label of the destination node. Node and channel labeling in an irregular network is done through constructing a spanning tree. The routing process follows a two-phase process of going up and then down along the spanning tree, with a possible cross channel (shortcut) between two branches of the tree between two phases. We show that the proposed routing scheme is deadlock- and livelock-free. We also compare prefix routing with the existing up*/down* routing which has been widely used in irregular networks. Possible extensions are also discussed.