Molecular dynamics and simulations study on the vibrational and electronic solvatochromism of benzophenone

Solvent plays a key role in diverse physico-chemical and biological processes. Therefore, understanding solute-solvent interactions at the molecular level of detail is of utmost importance. A comprehensive solvatochromic analysis of benzophenone (Bzp) was carried out in various solvents using Raman and electronic spectroscopy, in conjunction with Density Functional Theory (DFT) calculations of supramolecular solute-solvent clusters generated using classical Molecular Dynamics Simulations (c-MDSs). The >C=O stretching frequency undergoes a bathochromic shift with solvent polarity. Interestingly, in protic solvents this peak appears as a doublet: c-MDS and ad hoc explicit solvent ab initio calculations suggest that the lower and higher frequency peaks are associated with the hydrogen bonded and dangling carbonyl group of Bzp, respectively. Additionally, the dangling carbonyl in methanol (MeOH) solvent is 4 cm(-1) blue-shifted relative to acetonitrile solvent, despite their similar dipolarity/polarizability. This suggests that the cybotactic region of the dangling carbonyl group in MeOH is very different from its bulk solvent structure. Therefore, we propose that this blue-shift of the dangling carbonyl originates in the hydrophobic solvation shell around it resulting from extended hydrogen bonding network of the protic solvents. Furthermore, the 1(1)n pi* (band I) and 1(1)pi pi* (band II) electronic transitions show a hypsochromic and bathochromic shift, respectively. In particular, these shifts in protic solvents are due to differences in their excited state-hydrogen bonding mechanisms. Additionally, a linear relationship is obtained for band I and the >C=O stretching frequency (cm(-1)), which suggests that the different excitation wavelengths in band I correspond to different solvation states. Therefore, we hypothesize that the variation in excitation wavelengths in band I could arise from different solvation states leading to varying solvation dynamics. This will have implications for ultrafast processes associated with electron-transfer, charge transfer, and also the photophysical aspects of excited states. (C) 2016 AIP Publishing LLC.

Direct Link-Aware Relay Selection for Average Interference-Constrained Underlay Cognitive Radio

Cooperative relaying combined with selection exploits spatial diversity to significantly improve the performance of interference-constrained secondary users in an underlay cognitive radio network. We present a novel and optimal relay selection (RS) rule that minimizes the symbol error probability (SEP) of an average interference-constrained underlay secondary system that uses amplify-and-forward relays. A key point that the rule highlights for the first time is that, for the average interference constraint, the signal-to-interference-plus-noise-ratio (SINR) of the direct source-to-destination (SI)) link affects the choice of the optimal relay. Furthermore, as the SINR increases, the odds that no relay transmits increase. We also propose a simpler, more practical, and near-optimal variant of the optimal rule that requires just one bit of feedback about the state of the SD link to the relays. Compared to the SD-unaware ad hoc RS rules proposed in the literature, the proposed rules markedly reduce the SEP by up to two orders of magnitude.

Fatigue Laws Via Functional Equations

In routine industrial design, fatigue life estimation is largely based on S-N curves and ad hoc cycle counting algorithms used with Miner's rule for predicting life under complex loading. However, there are well known deficiencies of the conventional approach. Of the many cumulative damage rules that have been proposed, Manson's Double Linear Damage Rule (DLDR) has been the most successful. Here we follow up, through comparisons with experimental data from many sources, on a new approach to empirical fatigue life estimation (A Constructive Empirical Theory for Metal Fatigue Under Block Cyclic Loading', Proceedings of the Royal Society A, in press). The basic modeling approach is first described: it depends on enforcing mathematical consistency between predictions of simple empirical models that include indeterminate functional forms, and published fatigue data from handbooks. This consistency is enforced through setting up and (with luck) solving a functional equation with three independent variables and six unknown functions. The model, after eliminating or identifying various parameters, retains three fitted parameters; for the experimental data available, one of these may be set to zero. On comparison against data from several different sources, with two fitted parameters, we find that our model works about as well as the DLDR and much better than Miner's rule. We finally discuss some ways in which the model might be used, beyond the scope of the DLDR.

Adsopption isotherms-A critique

The possibility or the impossibility of separating the particle and the electrode interactions is discussed in a wider context of the effects due to any two interaction potentials on the equation of state. The involved nature of the pressure dependence on two individually definable forces is illustrated through the Percus Yevick results for the adhesive hard spheres. An alternative form of the adsorption isotherm is given to bring home the intimate relationship between the actual equation of state and the free energy of adsorption. Thermodynamic consequences of congruence with respect to E (or q) as reflected through the linear plots of q (or E) vs. θ are well known. Mathematical consequences of simultaneous congruence have been pointed out recently. In this paper, the physical nature of congruence hypothesis is revealed. In passing "the pseudo-congruence" is also discussed. It is emphasised that the problem is no less ambiguous with regard to modelling the particle/particle interaction. The ad hoc nature of our dependence of the available equations of state is emphasised through a discussion on the HFL theory. Finally, a heuristic method for modelling ΔG mathematically-incorporating its behaviour at saturation coverages-is advanced. The more interesting aspects of this approach, which generalises almost all isotherms hitherto known, are sketched.

Average-Delay Optimal Policies for the Point-to-Point Channel

Average-delay optimal scheduflng of messages arriving to the transmitter of a point-to-point channel is considered in this paper. We consider a discrete time batch-arrival batch-service queueing model for the communication scheme, with service time that may be a function of batch size. The question of delay optimality is addressed within the semi-Markov decision-theoretic framework. Approximations to the average-delay optimal policy are obtained.

Design of incentive compatible protocols for wireless networks: A game theoretic approach

In this thesis work, we design rigorous and efficient protocols/mechanisms for different types of wireless networks using a mechanism design [1] and game theoretic approach [2]. Our work can broadly be viewed in two parts. In the first part, we concentrate on ad hoc wireless networks [3] and [4]. In particular, we consider broadcast in these networks where each node is owned by independent and selfish users. Being selfish, these nodes do not forward the broadcast packets. All existing protocols for broadcast assume that nodes forward the transit packets. So, there is need for developing new broadcast protocols to overcome node selfishness. In our paper [5], we develop a strategy proof pricing mechanism which we call immediate predecessor node pricing mechanism (IPNPM) and an efficient new broadcast protocol based on IPNPM. We show the efficacy of our proposed broadcast protocol using simulation results.

Online association policies in IEEE 802.11 WLANs

In this paper, we study the performance of client-Access Point (AP) association policies in IEEE 802.11 based WLANs. In many scenarios, clients have a choice of APs with whom they can associate. We are interested in finding association policies which lead to optimal system performance. More specifically, we study the stability of different association policies as a function of the spatial distribution of arriving clients. We find for each policy the range of client arrival rates for which the system is stable. For small networks, we use Lyapunov function methods to formally establish the stability or instability of certain policies in specific scenarios. The RAT heuristic policy introduced in our prior work is shown to have very good stability properties when compared to several other natural policies. We also validate our analytical results by detailed simulation employing the IEEE 802.11 MAC.

Online client-AP association in WLANs

In many IEEE 802.11 WLAN deployments, wireless clients have a choice of access points (AP) to connect to. In current systems, clients associate with the access point with the strongest signal to noise ratio. However, such an association mechanism can lead to unequal load sharing, resulting in diminished system performance. In this paper, we first provide a numerical approach based on stochastic dynamic programming to find the optimal client-AP association algorithm for a small topology consisting of two access points. Using the value iteration algorithm, we determine the optimal association rule for the two-AP topology. Next, utilizing the insights obtained from the optimal association ride for the two-AP case, we propose a near-optimal heuristic that we call RAT. We test the efficacy of RAT by considering more realistic arrival patterns and a larger topology. Our results show that RAT performs very well in these scenarios as well. Moreover, RAT lends itself to a fairly simple implementation.

Hot gaseous coronae of early-type galaxies and their radio luminosity function

Recent X-ray observations have revealed that early-type galaxies (which usually produce extended double radio sources) generally have hot gaseous haloes extending up to approx102kpc1,2. Moreover, much of the cosmic X-ray background radiation is probably due to a hotter, but extremely tenuous, intergalactic medium (IGM)3. We have presented4–7 an analytical model for the propagation of relativistic beams from galactic nuclei, in which the beams' crossing of the pressure-matched interface between the IGM and the gaseous halo, plays an important role. The hotspots at the ends of the beams fade quickly when their advance becomes subsonic with respect to the IGM. This model has successfully predicted (for typical double radio sources) the observed8 current mean linear-size (approx2Dsime350 kpc)4,5, the observed8–11 decrease in linear-size with cosmological redshift4–6 and the slope of the linear-size versus radio luminosity10,12–14 relation6. We have also been able to predict the redshift-dependence of observed numbers and radio luminosities of giant radio galaxies7,15. Here, we extend this model to include the propagation of somewhat weaker beams. We show that the observed flattening of the local radio luminosity function (LRLF)16–20 for radio luminosity Papproximately 1024 W Hz-1 at 1 GHz can be explained without invoking ad hoc a corresponding break in the beam power function Phi(Lb), because the heads of the beams with Lb < 1025 W Hz-1 are decelerated to sonic velocity within the halo itself, which leads to a rapid decay of radio luminosity and a reduced contribution of these intrinsically weaker sources to the observed LRLF.

Can equipartition fields produce the tilts of bipolar magnetic regions?

The effect of turbulence on the nonaxisymmetric flux rings of equipartition field strength in bipolar magnetic regions is studied on the basis of the small-scale momentum exchange mechanism and the giant cell drag combined with the Kelvin-Helmholtz drag mechanism. It is shown that the giant cell drag and small-scale momentum exchange mechanism can make equipartition flux loops emerge at low latitudes, in addition to making them exhibit the observed tilts. However, the sizes of the flux tubes have to be restricted to a couple of hundred kilometers. An ad hoc constraint on the footpoints of the flux loops is introduced by not letting them move in the phi direction, and it is found that equipartition fields of any size can be made to emerge at sunspot latitudes with the observed tilts by suitably adjusting the footpoint separations.

Delay and energy optimal two-hop relaying in delay tolerant networks

We study the trade-off between delivery delay and energy consumption in delay tolerant mobile wireless networks that use two-hop relaying. The source may not have perfect knowledge of the delivery status at every instant. We formulate the problem as a stochastic control problem with partial information, and study structural properties of the optimal policy. We also propose a simple suboptimal policy. We then compare the performance of the suboptimal policy against that of the optimal control with perfect information. These are bounds on the performance of the proposed policy with partial information. Several other related open loop policies are also compared with these bounds.

On optimal timer-based distributed selection for rate-adaptive multi-user diversity systems

We develop an optimal, distributed, and low feedback timer-based selection scheme to enable next generation rate-adaptive wireless systems to exploit multi-user diversity. In our scheme, each user sets a timer depending on its signal to noise ratio (SNR) and transmits a small packet to identify itself when its timer expires. When the SNR-to-timer mapping is monotone non-decreasing, timers of users with better SNRs expire earlier. Thus, the base station (BS) simply selects the first user whose timer expiry it can detect, and transmits data to it at as high a rate as reliably possible. However, timers that expire too close to one another cannot be detected by the BS due to collisions. We characterize in detail the structure of the SNR-to-timer mapping that optimally handles these collisions to maximize the average data rate. We prove that the optimal timer values take only a discrete set of values, and that the rate adaptation policy strongly influences the optimal scheme's structure. The optimal average rate is very close to that of ideal selection in which the BS always selects highest rate user, and is much higher than that of the popular, but ad hoc, timer schemes considered in the literature.

Efficient Key Management and Distribution for MANET

Ad hoc networks are being used in applications ranging from disaster recovery to distributed collaborative entertainment applications. Ad hoc networks have become one of the most attractive solution for rapid deployment of interconnecting large number of mobile personal devices. The user community of mobile personal devices are demanding a variety of value added multimedia entertainment services. The popularity of peer group is increasing and one or some members of the peer group need to send data to some or all members of the peer group. The increasing demand for group oriented value added services is driving for efficient multicast service over ad hoc networks. Access control mechanisms need to be deployed to provide guarantee that the unauthorized users cannot access the multicast content. In this paper, we present a topology aware key management and distribution scheme for secure overlay multicast over MANET to address node mobility related issues for multicast key management. We use overlay approach for key distribution and our objective is to keep communication overhead low for key management and distribution. We also incorporate reliability using explicit acknowledgments with the key distribution scheme. Through simulations we show that the proposed key management scheme has low communication overhead for rekeying and improves the reliability of key distribution.