Why does it pay to be selfish in a MANET?

Routing protocols for a mobile ad hoc network have assumed that all mobile nodes voluntarily participate in forwarding others' packets. This was a reasonable assumption because all MNs in a MANET belonged to a single authority. In the near future, however, a MANET may consist of MNs that belong to many different organizations since numerous civilian applications are expected to crop up. In this situation, some MNs may run independently and purposely decide not to forward packets so as to save their own energy. This could potentially lead to network partitioning and corresponding performance degradation. To minimize such situations in MANETs, many studies have explored the use of both the carrot and the stick approaches by having reputation-based, credit-payment, and game theory schemes. This article summarizes existing schemes, identifies their relative advantages, and projects future directions     

Mathematical model for computer simulation and control of steelmaking

A dynamic model for computer simulation and control of steelmaking has been developed. It is essentially based on multicomponent mixed transport control theory with the incorporation of energy balance calculations. The model is applicable to both steelmaking in electric furnaces as well as in oxygen steelmaking converters. The adjustable parameters of the model for simulation of oxygen steelmaking are gas evolution rate (G_co). oxygen flux factor (F_o) and emulsification factor (EM). These simulation parameters, when combined with on-line measurement of off-gas composition and temperature, enable complete dynamic control of the process. The model developed is applied, as an example, to an industrially produced heat in a top blown oxygen steelmaking converter and the results of simulation are discussed.     

Non-pinched, minimum energy distillation designs

Non-pinched, minimum energy solutions are important class of distillation designs that offer the potential advantage of a better trade-off between capital investment and operating costs. In this paper, two important tasks associated with non-pinched distillation designs are studied. Thus the novel contributions of this work to the literature are

(1) A comprehensive methodology for finding non-pinched minimum energy designs.

(2) Understanding of the reasons for the existence of non-pinched distillation designs.

It is shown that the recent shortest stripping line distance approach of Lucia et al. [Lucia, A., Amale, A. and Taylor, R., 2007, Distillation pinch points and more. Comput Chem Eng, available on-line] is capable of systematically and reliably finding non-pinched, minimum energy distillation designs. In addition, we provide an understanding of the reasons behind the existence of non-pinched designs, which include trajectories that follow unstable branches of a pinch point curve in azeotropic systems, the inherent looping structure of trajectories in hydrocarbon separations, and the presence of ancillary constraints in multi-unit processes like extraction/distillation. Several distillation examples are studied and many numerical results and geometric illustrations are presented that show the shortest stripping line distance methodology is indeed a powerful and systematic tool for computing non-pinched, minimum energy designs and that support the underlying reason we provide for the existence of non-pinched designs.     

Seeking the truth about ad hoc join costs

In this paper, we re-examine the results of prior work on methods for computing ad hoc joins. We develop a detailed cost model for predicting join algorithm performance, and we use the model to develop cost formulas for the major ad hoc join methods found in the relational database literature. We show that various pieces of “common wisdom” about join algorithm performance fail to hold up when analyzed carefully, and we use our detailed cost model to derive op timal buffer allocation schemes for each of the join methods examined here. We show that optimizing their buffer allocations can lead to large performance improvements, e.g., as much as a 400% improvement in some cases. We also validate our cost model's predictions by measuring an actual implementation of each join algorithm considered. The results of this work should be directly useful to implementors of relational query optimizers and query processing systems. Edited by M. Adiba. Received May 1993 / Accepted April 1996     

ROLE OF COMPOSITION ON THE VISCOSITY AND SHEAR STRESS TEMPERATURE BEHAVIOUR OF SOME LUBE OIL BASE STOCKS

Lubricating oil base stocks differ greatly in their chemical composition and consequently in their physical properties and applications. Influence of waxes and various hydrocarbon type constituents viz saturates and aromatic components on the viscosity and shear stress as a function of temperature in different lube oil base stocks has been studied in the present paper.     

Visual insights into high-resolution earthquake Simulations.

This study focuses on the visualization of a series of large earthquake simulations collectively called TeraShake. The simulation series aims to assess the impact of San Andreas Fault earthquake scenarios in Southern California. We discuss the role of visualization in gaining scientific insight and aiding unexpected discoveries.     

Multishell Carrier Transport in Multiwalled Carbon Nanotubes

Understanding carrier transport in carbon nanotubes (CNTs) and their networks is important for harnessing CNTs for device applications. Here, we report multishell carrier transport in individual multiwalled CNTs, and films of randomly dispersed multiwalled CNTs, as a function of electric field and temperature. Electrical measurements and first-principles density functional theory calculations indicate transport across CNT shells. Intershell conduction occurs across an energy barrier range of 60-250 meV in individual CNTs, and ~ 60 meV in CNT networks. In both cases, the conductance behavior can be explained based upon field-enhanced carrier injection and defect-enhanced transport, as described by the Poole-Frenkel model.     

Feedback-based flow control of B-ISDN/ATM networks

We consider a system comprising of a single bottleneck switch/node that is fed by N independent Markov-modulated fluid sources. There is a fixed propagation delay incurred by the traffic between these sources and the switch. We assume that the switch sends periodic feedback in the form of a single congestion indicator bit. This feedback also incurs a fixed propagation delay in reaching the sources. Upon reaching the sources (or the access controllers associated with the sources), this congestion indicator bit is used to choose between two rates for the excess traffic, high or low, possibly depending on the state of that source. The switch employs a threshold mechanism based on its buffer level to discard excess traffic. We show that the stationary distribution of this system satisfies a set of first-order linear differential equations along with a set of split boundary conditions. We obtain an explicit solution to these using spectral decomposition. To this end we investigate the related eigenvalue problem. Based on these results we investigate the role of delayed feedback vis-a-vis various time-constants and traffic parameters associated with the system. In particular, we identify conditions under which the feedback scheme offers significant improvement over the open-loop scheme     

Modular synchronization in distributed, multiversion databases:version control and concurrency control

A version control mechanism is proposed that enhances the modularity and extensibility of multiversion concurrency control algorithms. The multiversion algorithms are decoupled into two components: version control and concurrency control. This permits modular development of multiversion protocols and simplifies the task of proving the correctness of these protocols. A set of procedures for version control is described that defines the interface with the version control component. It is shown that the same interface can be used by the database actions of both two-phase locking and time-stamp concurrency control protocols to access multiversion data. An interesting feature of the framework is that the execution of read-only transactions becomes completely independent of the underlying concurrency control implementation. Unlike other multiversion algorithms, read-only transactions in this scheme do not modify any version-related information, and therefore do not interfere with the execution of read-write transactions. The extension of the multiversion algorithms to a distributed environment becomes very simple