The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
A class of simple network topologies is proposed and analyzed in this paper as part of the research on a polymorphous array architecture for graphics and image processing. The topologies are extended from the mesh network topology and are amenable to VLSI implementation. Simulation and theoretical analyses show that these topologies have many advantages over the mesh and Xmesh topologies. Routing...
The inaccuracies for air velocity measured by Pitots with different diameter have been demonstrated by several experiments. It is defined that the measurement ranges of air velocity by Pitots with different outer diameter. Experiments show that: measurements by Pitot are larger than the true values. The measurement error of air velocity will be smaller if using the Pitot with a smaller outer diameter...
This paper includes a detailed study of Raman G peak analysis for metallic Single Wall Carbon Nanotubes. The higher frequency Lorentzian line shape and the lower frequency Breit-Wigner-Fano (BWF) line shape are two most intense features of Raman G peaks. BWF line shape originated from the Phonon-Plasmon coupling to an electronic continuum is an intrinsic property for metallic SWNTs. From different...
'A wormhole attack'-where an attacker receives packets at one location in the network, tunnels and then replays them at another remote location in the network. The route request can be tunneled to the target area by the attacker through wormholes. Thus, the sensor nodes in the target area build the route through the attacker. Later, the attacker can tamper the data, messages, or selectively forward...
Double-loop networks have been widely studied as architecture for local area networks. A double-loop digraph G(N; s1, s2) has N vertices 0, 1,..., N-l and 2N edges of two types: s1-edge: i??1 + s (mod N); i=0, 1,..., N-l, and s2-edge: i?? s + s2 (modN); i=0, 1,..., N-l, for some fixed steps 1?? s1<s2<N with gcd(N; s1, s2) = 1. Let D(N; s1, s2) be the diameter of G and let us define D(N) = min{...
Routing is a problem domain with an infinite number of end-solutions. One possible approach is to solve such problems using of graph theory. This paper presents a mathematical analysis for a routing problem, based on circular graphs, where the focus is on searching for the shortest path on a circular graph. The theoretical section will be argued by an example where we look for the fastest path and...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.