Solvent-templated supramolecular isomerism in 2D coordination polymer constructed by (Ni2CoII)-Co-II nodes and dicyanamido spacers: drastic change in magnetic behaviours

Two heterometallic coordination polymers (CPs) have been prepared using (NiL)-L-II](2)Co-II (where H2L = N,N'-bis(salicylidene)-1,3-propanediamine) as nodes and dicyanamido spacers by varying the solvent for synthesis. Structural characterizations revealed that methanol assisted the formation of a two-dimensional (4,4) connected rhombic grid network of (NiL)(2)Co(NCNCN)2](infinity) (1a) whereas relatively less polar acetonitrile afforded a different superstructure {(NiL)(2)Co(NCNCN)(2)]center dot CH3CN}(infinity) (1b) with a two-dimensional (4,4) connected square grid network. The presence of acetonitrile molecules in the structure of 1b seems to change the spatial orientation of the terminal metalloligands NiL] from pseudo-eclipsed in 1a to staggered-like in 1b around the central Co(II). These structural changes in the nodes together with the conformationally flexible dicyanamido spacers, which are cis coordinated to the Co(II) in both trinuclear units, led to the differences in the final 2D network. Variable-temperature magnetic susceptibility measurements revealed that this supramolecular isomerism led to a drastic transition from spin-frustrated antiferromagnetism for 1a to a dominant ferromagnetic behaviour for 1b. The geometrical differences in Ni2Co coordination clusters (CCs) which are scalene triangular in 1a but nearly linear in 1b, are held responsible for the changes of the magnetic properties. The DFT calculations of exchange interactions between metal centres provide a clear evidence of the role played by the fundamental geometrical factors on the nature and magnitude of the magnetic coupling in these pseudo-polymorphic CPs.

Joint Evaluation of Reduced Feedback Scheme, Scheduling, and Rate Adaptation in OFDMA Systems with Feedback Delays

Orthogonal frequency division multiple access (OFDMA) systems exploit multiuser diversity and frequency-selectivity to achieve high spectral efficiencies. However, they require considerable feedback for scheduling and rate adaptation, and are sensitive to feedback delays. We develop a comprehensive analysis of the OFDMA system throughput as a function of the feedback scheme, frequency-domain scheduler, and discrete rate adaptation rule in the presence of feedback delays. We analyze the popular best-n and threshold-based feedback schemes. We show that for both the greedy and round-robin schedulers, the throughput degradation, given a feedback delay, depends primarily on the fraction of feedback reduced by the feedback scheme and not the feedback scheme itself. Even small feedback delays at low vehicular speeds are shown to significantly degrade the throughput. We also show that optimizing the link adaptation thresholds as a function of the feedback delay can effectively counteract the detrimental effect of delays.

Variations in Magnetic Properties of Nanostructured Nickel

The magnetic properties of carbon nanotube encapsulated nickel nanowires (C. E. nanowires of diameter similar to 10 nm), and its comparison to other forms of Ni are carried out in this work. The saturation magnetization (M-s) and coercivity (H-c) for C. E. nanowires are 1.0 emu/g and 230 Oe. The temperature dependence of coercivity follows T-0.77 dependence indicating a superparamagnetic behavior. The field-cooled and zero-field-cooled plots indicate that the blocking temperature (T-B) similar to 300 K. These altered magnetic properties of C. E. nanowires are mainly due to the nanoscale confinement effect from carbon nanotube encapsulation. The shape and magnetic environment enhance the total magnetic anisotropy of C. E. nanowires by a factor of four.

Fair Scheduling in Cellular Systems in the Presence of Noncooperative Mobiles

We consider the problem of ``fair'' scheduling the resources to one of the many mobile stations by a centrally controlled base station (BS). The BS is the only entity taking decisions in this framework based on truthful information from the mobiles on their radio channel. We study the well-known family of parametric alpha-fair scheduling problems from a game-theoretic perspective in which some of the mobiles may be noncooperative. We first show that if the BS is unaware of the noncooperative behavior from the mobiles, the noncooperative mobiles become successful in snatching the resources from the other cooperative mobiles, resulting in unfair allocations. If the BS is aware of the noncooperative mobiles, a new game arises with BS as an additional player. It can then do better by neglecting the signals from the noncooperative mobiles. The BS, however, becomes successful in eliciting the truthful signals from the mobiles only when it uses additional information (signal statistics). This new policy along with the truthful signals from mobiles forms a Nash equilibrium (NE) that we call a Truth Revealing Equilibrium. Finally, we propose new iterative algorithms to implement fair scheduling policies that robustify the otherwise nonrobust (in presence of noncooperation) alpha-fair scheduling algorithms.

Joint Approximately Sparse Channel Estimation and Data Detection in OFDM Systems Using Sparse Bayesian Learning

It is well known that the impulse response of a wide-band wireless channel is approximately sparse, in the sense that it has a small number of significant components relative to the channel delay spread. In this paper, we consider the estimation of the unknown channel coefficients and its support in OFDM systems using a sparse Bayesian learning (SBL) framework for exact inference. In a quasi-static, block-fading scenario, we employ the SBL algorithm for channel estimation and propose a joint SBL (J-SBL) and a low-complexity recursive J-SBL algorithm for joint channel estimation and data detection. In a time-varying scenario, we use a first-order autoregressive model for the wireless channel and propose a novel, recursive, low-complexity Kalman filtering-based SBL (KSBL) algorithm for channel estimation. We generalize the KSBL algorithm to obtain the recursive joint KSBL algorithm that performs joint channel estimation and data detection. Our algorithms can efficiently recover a group of approximately sparse vectors even when the measurement matrix is partially unknown due to the presence of unknown data symbols. Moreover, the algorithms can fully exploit the correlation structure in the multiple measurements. Monte Carlo simulations illustrate the efficacy of the proposed techniques in terms of the mean-square error and bit error rate performance.

Role of Cu2+ ions substitution in magnetic and conductivity behavior of nano-CoFe2O4

Cobalt copper ferrite nanopowders with composition Co1-xCu5Fe2O4 (0.0 <= x <= 0.5) was synthesized by solution combustion method. The powder X-ray diffraction studies reveal the formation of single ferrite phase with particle size of similar to 11-35 nm. Due to increase in electron density with in a material, X-ray density increase with increase of Cu2+ ions concentration. As Cu2+ ions concentration increases, saturation magnetization decreases from 38.5 to 26.7 emu g(-1). Further, the squareness ratio was found to be similar to 0.31-0.46 which was well below the typical value 1, which indicates the existence of single domain isolated ferrimagnetic samples. The dielectric and electrical modulus was studied over a frequency range of 1 Hz to 1 MHz at room temperature using the complex impedance spectroscopy technique. Impedance plots showed only one semi-circle which corresponds to the contributions of grain boundaries. The lower values of dielectric loss at higher frequency region may be quite useful for high frequency applications such as microwave devices. (C) 2014 Elsevier B.V. All rights reserved.

High Value of Proton Relaxivity Achieved by Graphene Oxide-Cobalt Ferrite Nanoparticle Composite: A Potential Contrast Agent in Magnetic Resonance Imaging

This work investigates the potential of graphene oxide-cobalt ferrite nanoparticle (GO-CoFe2O4) composite as image contrast enhancing material in Magnetic Resonance Imaging (MRI). In the preset work, GO-CoFe2O4 composites were produced by a two-step synthesis process. In the first step, graphene oxide (GO) was synthesized, and in the second step CoFe2O4 nanoparticles were synthesized in a reaction mixture containing GO to yield graphene GO-CoFe2O4 composite. Proton relaxivity value obtained from the composite was 361 mM(-1)s(-1). This value of proton relaxivity is higher than a majority of reported relaxivity values obtained using several ferrite based contrast agents.

Tailoring local density of optical states to control emission intensity and anisotropy of quantum dots in hybrid photonic-plasmonic templates

We report results of controlled tuning of the local density of states (LDOS) in versatile, flexible, and hierarchical self assembled plasmonic templates. Using 5 nm diameter gold (Au) spherical nanoantenna within a polymer template randomly dispersed with quantum dots, we show how the photoluminescence intensity and lifetime anisotropy of these dots can be significantly enhanced through LDOS tuning. Finite difference time domain simulations corroborate the experimental observations and extend the regime of enhancement to a wider range of geometric and spectral parameters bringing out the versatility of these functional plasmonic templates. It is also demonstrated how the templates act as plasmonic resonators for effectively engineer giant enhancement of the scattering efficiency of these nano antenna embedded in the templates. Our work provides an alternative method to achieve spontaneous emission intensity and anisotropy enhancement with true nanoscale plasmon resonators. (C) 2015 AIP Publishing LLC.

Spatio-temporal correlations in aqueous systems: computational studies of static and dynamic heterogeneity by 2D-IR spectroscopy

Local heterogeneity is ubiquitous in natural aqueous systems. It can be caused locally by external biomolecular subsystems like proteins, DNA, micelles and reverse micelles, nanoscopic materials etc., but can also be intrinsic to the thermodynamic nature of the aqueous solution itself (like binary mixtures or at the gas-liquid interface). The altered dynamics of water in the presence of such diverse surfaces has attracted considerable attention in recent years. As these interfaces are quite narrow, only a few molecular layers thick, they are hard to study by conventional methods. The recent development of two dimensional infra-red (2D-IR) spectroscopy allows us to estimate length and time scales of such dynamics fairly accurately. In this work, we present a series of interesting studies employing two dimensional infra-red spectroscopy (2D-IR) to investigate (i) the heterogeneous dynamics of water inside reverse micelles of varying sizes, (ii) supercritical water near the Widom line that is known to exhibit pronounced density fluctuations and also study (iii) the collective and local polarization fluctuation of water molecules in the presence of several different proteins. The spatio-temporal correlation of confined water molecules inside reverse micelles of varying sizes is well captured through the spectral diffusion of corresponding 2D-IR spectra. In the case of supercritical water also, we observe a strong signature of dynamic heterogeneity from the elongated nature of the 2D-IR spectra. In this case the relaxation is ultrafast. We find remarkable agreement between the different tools employed to study the relaxation of density heterogeneity. For aqueous protein solutions, we find that the calculated dielectric constant of the respective systems unanimously shows a noticeable increment compared to that of neat water. However, the `effective' dielectric constant for successive layers shows significant variation, with the layer adjacent to the protein having a much lower value. Relaxation is also slowest at the surface. We find that the dielectric constant achieves the bulk value at distances more than 3 nm from the surface of the protein.

Simultaneous perturbation methods for adaptive labor staffing in service systems

We consider the problem of optimizing the workforce of a service system. Adapting the staffing levels in such systems is non-trivial due to large variations in workload and the large number of system parameters do not allow for a brute force search. Further, because these parameters change on a weekly basis, the optimization should not take longer than a few hours. Our aim is to find the optimum staffing levels from a discrete high-dimensional parameter set, that minimizes the long run average of the single-stage cost function, while adhering to the constraints relating to queue stability and service-level agreement (SLA) compliance. The single-stage cost function balances the conflicting objectives of utilizing workers better and attaining the target SLAs. We formulate this problem as a constrained parameterized Markov cost process parameterized by the (discrete) staffing levels. We propose novel simultaneous perturbation stochastic approximation (SPSA)-based algorithms for solving the above problem. The algorithms include both first-order as well as second-order methods and incorporate SPSA-based gradient/Hessian estimates for primal descent, while performing dual ascent for the Lagrange multipliers. Both algorithms are online and update the staffing levels in an incremental fashion. Further, they involve a certain generalized smooth projection operator, which is essential to project the continuous-valued worker parameter tuned by our algorithms onto the discrete set. The smoothness is necessary to ensure that the underlying transition dynamics of the constrained Markov cost process is itself smooth (as a function of the continuous-valued parameter): a critical requirement to prove the convergence of both algorithms. We validate our algorithms via performance simulations based on data from five real-life service systems. For the sake of comparison, we also implement a scatter search based algorithm using state-of-the-art optimization tool-kit OptQuest. From the experiments, we observe that both our algorithms converge empirically and consistently outperform OptQuest in most of the settings considered. This finding coupled with the computational advantage of our algorithms make them amenable for adaptive labor staffing in real-life service systems.

Throughput Analysis of Best-m Feedback in OFDM Systems with Uniformly Correlated Subchannels

Practical orthogonal frequency division multiplexing (OFDM) systems, such as Long Term Evolution (LTE), exploit multi-user diversity using very limited feedback. The best-m feedback scheme is one such limited feedback scheme, in which users report only the gains of their m best subchannels (SCs) and their indices. While the scheme has been extensively studied and adopted in standards such as LTE, an analysis of its throughput for the practically important case in which the SCs are correlated has received less attention. We derive new closed-form expressions for the throughput when the SC gains of a user are uniformly correlated. We analyze the performance of the greedy but unfair frequency-domain scheduler and the fair round-robin scheduler for the general case in which the users see statistically non-identical SCs. An asymptotic analysis is then developed to gain further insights. The analysis and extensive numerical results bring out how correlation reduces throughput.

Continuous synthesis of high quality CdSe quantum dots in supercritical fluids

We demonstrate in here a powerful scalable technology to synthesize continuously high quality CdSe quantum dots (QDs) in supercritical hexane. Using a low cost, highly thermally stable Cd-precursor, cadmium deoxycholate, the continuous synthesis is performed in 400 mu m ID stainless steel capillaries resulting in CdSe QDs having sharp full-width-at-half-maxima (23 nm) and high photoluminescence quantum yields (45-55%). Transmission electron microscopy images show narrow particles sizes distribution (sigma <= 5%) with well-defined crystal lattices. Using two different synthesis temperatures (250 degrees C and 310 degrees C), it was possible to obtain zinc blende and wurtzite crystal structures of CdSe QDs, respectively. This synthetic approach allows achieving substantial production rates up to 200 mg of QDs per hour depending on the targeted size, and could be easily scaled to gram per hour.

Broadcast Control Mechanism for Positional Consensus in Multiagent Systems

In this paper, a strategy for controlling a group of agents to achieve positional consensus is presented. The problem is constrained by the requirement that every agent must be given the same control input through a broadcast communication mechanism. Although the control command is computed using state information in a global framework, the control input is implemented by the agents in a local coordinate frame. We propose a novel linear programming (LP) formulation that is computationally less intensive than earlier proposed methods. Moreover, a random perturbation input in the control command that helps the agents to come close to each other even for a large number of agents, which was not possible with an existing strategy in the literature, is introduced. The method is extended to achieve positional consensus at a prespecified location. The effectiveness of the approach is illustrated through simulation results. A comparison between the LP approach and the existing second-order cone programming-based approach is also presented. The algorithm was successfully implemented on a robotic platform with three robots.

Load Balancing with Availability Checker and Load Reporters (LB-ACLRs) for improved Performance in Distributed Systems

Distributed system has quite a lot of servers to attain increased availability of service and for fault tolerance. Balancing the load among these servers is an important task to achieve better performance. There are various hardware and software based load balancing solutions available. However there is always an overhead on Servers and the Load Balancer while communicating with each other and sharing their availability and the current load status information. Load balancer is always busy in listening to clients' request and redirecting them. It also needs to collect the servers' availability status frequently, to keep itself up-to-date. Servers are busy in not only providing service to clients but also sharing their current load information with load balancing algorithms. In this paper we have proposed and discussed the concept and system model for software based load balancer along with Availability-Checker and Load Reporters (LB-ACLRs) which reduces the overhead on server and the load balancer. We have also described the architectural components with their roles and responsibilities. We have presented a detailed analysis to show how our proposed Availability Checker significantly increases the performance of the system.