Co-Evolution of Content Spread and Popularity in Mobile Opportunistic Networks

We consider a setting in which a single item of content is disseminated in a population of mobile nodes by opportunistic copying when pairs of nodes come in radio contact. The nodes in the population may either be interested in receiving the content (referred to as destinations) or not yet interested in receiving the content (referred to as relays). We consider a model for the evolution of popularity, the process by which relays get converted into destinations. A key contribution of our work is to model and study the joint evolution of content popularity and its spread in the population. Copying the content to relay nodes is beneficial since they can help spread the content to destinations, and could themselves be converted into destinations. We derive a fluid limit for the joint evolution model and obtain optimal policies for copying to relay nodes in order to deliver content to a desired fraction of destinations, while limiting the fraction of relay nodes that get the content but never turn into destinations. We prove that a time-threshold policy is optimal for controlling the copying to relays, i.e., there is an optimal time-threshold up to which all opportunities for copying to relays are exploited, and after which relays are not copied to. We then utilize simulations and numerical evaluations to provide insights into the effects of various system parameters on the optimally controlled co-evolution model.

Energy-Efficient Decentralized Cooperative Routing in Wireless Networks

Wireless adhoc networks transmit information from a source to a destination via multiple hops in order to save energy and, thus, increase the lifetime of battery-operated nodes. The energy savings can be especially significant in cooperative transmission schemes, where several nodes cooperate during one hop to forward the information to the next node along a route to the destination. Finding the best multi-hop transmission policy in such a network which determines nodes that are involved in each hop, is a very important problem, but also a very difficult one especially when the physical wireless channel behavior is to be accounted for and exploited. We model the above optimization problem for randomly fading channels as a decentralized control problem - the channel observations available at each node define the information structure, while the control policy is defined by the power and phase of the signal transmitted by each node. In particular, we consider the problem of computing an energy-optimal cooperative transmission scheme in a wireless network for two different channel fading models: (i) slow fading channels, where the channel gains of the links remain the same for a large number of transmissions, and (ii) fast fading channels, where the channel gains of the links change quickly from one transmission to another. For slow fading, we consider a factored class of policies (corresponding to local cooperation between nodes), and show that the computation of an optimal policy in this class is equivalent to a shortest path computation on an induced graph, whose edge costs can be computed in a decentralized manner using only locally available channel state information (CSI). For fast fading, both CSI acquisition and data transmission consume energy. Hence, we need to jointly optimize over both these; we cast this optimization problem as a large stochastic optimization problem. We then jointly optimize over a set of CSI functions of the local channel states, and a c- - orresponding factored class of control poli.

Design of nonequivalent self-routing networks based on a matrix model

In earlier work, nonisomorphic graphs have been converted into networks to realize Multistage Interconnection networks, which are topologically nonequivalent to the Baseline network. The drawback of this technique is that these nonequivalent networks are not guaranteed to be self-routing, because each node in the graph model can be replaced by a (2 × 2) switch in any one of the four different configurations. Hence, the problem of routing in these networks remains unsolved. Moreover, nonisomorphic graphs were obtained by interconnecting bipartite loops in a heuristic manner; the heuristic nature of this procedure makes it difficult to guarantee full connectivity in large networks. We solve these problems through a direct approach, in which a matrix model for self-routing networks is developed. An example is given to show that this model encompases nonequivalent self-routing networks. This approach has the additional advantage in that the matrix model itself ensures full connectivity.

Energy-Efficient Decentralized Routing with Localized Cooperation Suitable for Fast Fading

Wireless networks transmit information from a source to a destination via multiple hops in order to save energy and, thus, increase the lifetime of battery-operated nodes. The energy savings can be especially significant in cooperative transmission schemes, where several nodes cooperate during one hop to forward the information to the next node along a route to the destination. Finding the best multi-hop transmission policy in such a network which determines nodes that are involved in each hop, is a very important problem, but also a very difficult one especially when the physical wireless channel behavior is to be accounted for and exploited. We model the above optimization problem for randomly fading channels as a decentralized control problem – the channel observations available at each node define the information structure, while the control policy is defined by the power and phase of the signal transmitted by each node.In particular, we consider the problem of computing an energy-optimal cooperative transmission scheme in a wireless network for two different channel fading models: (i) slow fading channels, where the channel gains of the links remain the same for a large number of transmissions, and (ii) fast fading channels,where the channel gains of the links change quickly from one transmission to another. For slow fading, we consider a factored class of policies (corresponding to local cooperation between nodes), and show that the computation of an optimal policy in this class is equivalent to a shortest path computation on an induced graph, whose edge costs can be computed in a decentralized manner using only locally available channel state information(CSI). For fast fading, both CSI acquisition and data transmission consume energy. Hence, we need to jointly optimize over both these; we cast this optimization problem as a large stochastic optimization problem. We then jointly optimize over a set of CSI functions of the local channel states, and a corresponding factored class of control policies corresponding to local cooperation between nodes with a local outage constraint. The resulting optimal scheme in this class can again be computed efficiently in a decentralized manner. We demonstrate significant energy savings for both slow and fast fading channels through numerical simulations of randomly distributed networks.

Probing the Neutral Edge Modes in Transport across a Point Contact via Thermal Effects in the Read-Rezayi Non-Abelian Quantum Hall States

Non-Abelian quantum Hall states are characterized by the simultaneous appearance of charge and neutral gapless edge modes, with the structure of the latter being intricately related to the existence of bulk quasiparticle excitations obeying non-Abelian statistics. Here we propose a scenario for detecting the neutral modes by having two point contacts in series separated by a distance set by the thermal equilibration length of the charge mode. We show that by using the first point contact as a heating device, the excess charge noise measured at the second point contact carries a nontrivial signature of the presence of the neutral mode. We also obtain explicit expressions for the thermal conductance and corresponding Lorentz number for transport across a quantum point contact between two edges held at different temperatures and chemical potentials.

The nature of non-equilibrium solidification of undercooled Agsingle bondCu alloys in contact with primary copper dendrites

Liquids of silver-copper alloys with near eutectic compositions embedded in a copper matrix were undercooled. The structural and microstructural investigations of these alloys solidified from undercooled temperature indicated the absence of both the eutectic reaction and diffusionless transformation below the equal free energy curve (T0). Instead the liquid maintained local equilibrium with the copper dendrites continuously until it intersected the extended solidus of the silver rich solid solution.

Two-dimensional solidification in a cylindrical mold with imperfect mold contact

A two-dimensional axisymmetric problem of solidification of a superheated liquid in a long cylindrical mold has been studied in this paper by employing a new embedding technique. The mold and the melt has an imperfect contact and the heat transfer coefficient has been taken as a function of space and time. Short-time exact analytical solutions for the moving boundary and temperature distributions in the liquid, solid and mold have been obtained. The numerical results indicate that with the present solution, for some parameter values, substantial solidified thickness can be obtained. The method of solution is simple and straightforward, and consists of assuming fictitious initial temperatures for some suitable fictitious extensions of the actual regions. Sufficient conditions for the commencement of the solidification have been discussed.

Effect of inter-edge Coulomb interactions on transport through a point contact in nu=5/2 quantum Hall state

We study transport across a point contact separating two line junctions in a nu = 5/2 quantum Hall system. We analyze the effect of inter-edge Coulomb interactions between the chiral bosonic edge modes of the half-filled Landau level (assuming a Pfaffian wave function for the half-filled state) and of the two fully filled Landau levels. In the presence of inter-edge Coulomb interactions between all the six edges participating in the line junction, we show that the stable fixed point corresponds to a point contact that is neither fully opaque nor fully transparent. Remarkably, this fixed point represents a situation where the half-filled level is fully transmitting, while the two filled levels are completely backscattered; hence the fixed point Hall conductance is given by G(H) = 1/2e(2)/h. We predict the non-universal temperature power laws by which the system approaches the stable fixed point from the two unstable fixed points corresponding to the fully connected case (G(H) = 5/2e(2)/h) and the fully disconnected case (G(H) = 0).

A fuzzy dynamic flood routing model for natural channels

A fuzzy dynamic flood routing model (FDFRM) for natural channels is presented, wherein the flood wave can be approximated to a monoclinal wave. This study is based on modification of an earlier published work by the same authors, where the nature of the wave was of gravity type. Momentum equation of the dynamic wave model is replaced by a fuzzy rule based model, while retaining the continuity equation in its complete form. Hence, the FDFRM gets rid of the assumptions associated with the momentum equation. Also, it overcomes the necessity of calculating friction slope (S-f) in flood routing and hence the associated uncertainties are eliminated. The fuzzy rule based model is developed on an equation for wave velocity, which is obtained in terms of discontinuities in the gradient of flow parameters. The channel reach is divided into a number of approximately uniform sub-reaches. Training set required for development of the fuzzy rule based model for each sub-reach is obtained from discharge-area relationship at its mean section. For highly heterogeneous sub-reaches, optimized fuzzy rule based models are obtained by means of a neuro-fuzzy algorithm. For demonstration, the FDFRM is applied to flood routing problems in a fictitious channel with single uniform reach, in a fictitious channel with two uniform sub-reaches and also in a natural channel with a number of approximately uniform sub-reaches. It is observed that in cases of the fictitious channels, the FDFRM outputs match well with those of an implicit numerical model (INM), which solves the dynamic wave equations using an implicit numerical scheme. For the natural channel, the FDFRM Outputs are comparable to those of the HEC-RAS model.

Vibrations of a Beam in Variable Contact With a Flat Surface

We study small vibrations of cantilever beams contacting a rigid surface. We study two cases: the first is a beam that sags onto the ground due to gravity, and the second is a beam that sticks to the ground through reversible adhesion. In both cases, the noncontacting length varies dynamically. We first obtain the governing equations and boundary conditions, including a transversality condition involving an end moment, using Hamilton's principle. Rescaling the variable length to a constant value, we obtain partial differential equations with time varying coefficients, which, upon linearization, give the natural frequencies of vibration. The natural frequencies for the first case (gravity without adhesion) match that of a clamped-clamped beam of the same nominal length; frequencies for the second case, however, show no such match. We develop simple, if atypical, single degree of freedom approximations for the first modes of these two systems, which provide insights into the role of the static deflection profile, as well as the end moment condition, in determining the first natural frequencies of these systems. Finally, we consider small transverse sinusoidal forcing of the first case and find that the governing equation contains both parametric and external forcing terms. For forcing at resonance, w find that either the internal or the external forcing may dominate.

2 Algorithms For 3-Layer Channel Routing

A channel router is an important design aid in the design automation of VLSI circuit layout. Many algorithms have been developed based on various wiring models with routing done on two layers. With the recent advances in VLSI process technology, it is possible to have three independent layers for interconnection. In this paper two algorithms are presented for three-layer channel routing. The first assumes a very simple wiring model. This enables the routing problem to be solved optimally in a time of O(n log n). The second algorithm is for a different wiring model and has an upper bound of O(n2) for its execution time. It uses fewer horizontal tracks than the first algorithm. For the second model the channel width is not bounded by the channel density.

Finite element analysis of moving contact in mechanically fastened joints

The Finite Element Method (FEM) has made a number of otherwise intractable problems solvable. An important aspect for achieving an economical and accurate solution through FEM is matching the formulation and the computational organisation to the problem. This was realised forcefully in the present case of the solution of a class of moving contact boundary value problems of fastener joints. This paper deals with the problem of changing contact at the pin-hole interface of a fastener joint. Due to moving contact, the stresses and displacements are nonlinear with load. This would, in general, need an interactive-incremental approach for solution. However, by posing the problem in an inverse way, a solution is sought for obtaining loads to suit given contact configuration. Numerical results are given for typical isotropic and composite plates with rigid pins. Two cases of loading are considered: (i) load applied only at the edges of the plate and (ii) load applied at the pin and reacted at a part of the edge of the plate. Load-contact relationships, compliance and stress-patterns are investigated. This paper clearly demonstrates the simplification achieved by a suitable formulation of the problem. The results are of significance to the design and analysis of fastener joints.

Finite element analysis of moving contact in mechanically fastened joints

The Finite Element Method (FEM) has made a number of otherwise intractable problems solvable. An important aspect for achieving an economical and accurate solution through FEM is matching the formulation and the computational organisation to the problem. This was realised forcefully in the present case of the solution of a class of moving contact boundary value problems of fastener joints. This paper deals with the problem of changing contact at the pin-hole interface of a fastener joint. Due to moving contact, the stresses and displacements are nonlinear with load. This would, in general, need an interactive-incremental approach for solution. However, by posing the problem in an inverse way, a solution is sought for obtaining loads to suit given contact configuration. Numerical results are given for typical isotropic and composite plates with rigid pins. Two cases of loading are considered: (i) load applied only at the edges of the plate and (ii) load applied at the pin and reacted at a part of the edge of the plate. Load-contact relationships, compliance and stress-patterns are investigated. This paper clearly demonstrates the simplification achieved by a suitable formulation of the problem. The results are of significance to the design and analysis of fastener joints.

The real area of contact and compliance of rough cylinders in compression

Bearing area analysis has been used to study the real area of contact and compliance of rough turned steel cylinders in compression. Calculations show that the elastic real area of contact is very small compared to the plastic real area of contact, and that local compliance due to flattening of asperity tips is a small proportion of the total compliance obtained from experiments. The fact that increased load brings more and more new asperities under load rather than enlarging the contact spots leads to a rather simple load-compliance relation for a rough cylinder, viz., W' = Nh · K1δn, where W0 = K1δn defines the load-compliance relation of the individual asperities, and Nh represents the number of asperities bearing the load.

Implementation of placement and routing algorithms for computer aided design of printed circuit boards

The Printed Circuit Board (PCB) layout design is one of the most important and time consuming phases during equipment design process in all electronic industries. This paper is concerned with the development and implementation of a computer aided PCB design package. A set of programs which operate on a description of the circuit supplied by the user in the form of a data file and subsequently design the layout of a double-sided PCB has been developed. The algorithms used for the design of the PCB optimise the board area and the length of copper tracks used for the interconnections. The output of the package is the layout drawing of the PCB, drawn on a CALCOMP hard copy plotter and a Tektronix 4012 storage graphics display terminal. The routing density (the board area required for one component) achieved by this package is typically 0.8 sq. inch per IC. The package is implemented on a DEC 1090 system in Pascal and FORTRAN and SIGN(1) graphics package is used for display generation.