Seeded-growth, nanocrystal-fusion, ion-exchange and inorganic-ligand mediated formation of semiconductor-based colloidal heterostructured nanocrystals

This article highlights different synthetic strategies for the preparation of colloidal heterostructured nanocrystals, where at least one component of the constituent nanostructure is a semiconductor. Growth of shell material on a core nanocrystal acting as a seed for heterogeneous nucleation of the shell has been discussed. This seeded-growth technique, being one of the most heavily explored mechanisms, has already been discussed in many other excellent review articles. However, here our discussion has been focused differently based on composition (semiconductor@semiconductor, magnet@semiconductor, metal@semiconductor and vice versa), shape anisotropy of the shell growth, and synthetic methodology such as one-step vs. multi-step. The relatively less explored strategy of preparing heterostructures via colloidal sintering of different nanostructures, known as nanocrystal-fusion, has been reviewed here. The ion-exchange strategy, which has recently attracted huge research interest, where compositional tuning of nanocrystals can be achieved by exchanging either the cation or anion of a nanocrystal, has also been discussed. Specifically, controlled partial ion exchange has been critically reviewed as a viable synthetic strategy for the fabrication of heterostructures. Notably, we have also included the very recent methodology of utilizing inorganic ligands for the fabrication of heterostructured colloidal nanocrystals. This unique strategy of inorganic ligands has appeared as a new frontier for the synthesis of heterostructures and is reviewed in detail here for the first time. In all these cases, recent developments have been discussed with greater detail to add upon the existing reviews on this broad topic of semiconductor-based colloidal heterostructured nanocrystals.

Highly compressible behavior of polymer mediated three-dimensional network of graphene foam

The compressive behavior of graphene foam (GF) and its polymer (polydimethyl siloxane) (PDMS) infiltrated structure are presented. While GF showed an irreversible compressibility, the GF/PDMS structure revealed a highly reversible mechanical behavior up to many cycles of compression and also possesses a six times higher compressive strength. In addition, the strain rate demonstrated a negligible effect on both the maximum achieved stress and energy absorption in the GF/PDMS structure. The mechanical responses of both GF and GF/PDMS structure are compared with carbon nanotubes based cellular structure and its composite with PDMS, where GF/PDMS presented a dominant mechanical characteristic among other carbon based micro foam structures. Therefore, the improved mechanical properties of GF/PDMS suggest its potential for dampers, cushions, packaging, etc.

Regulation of Off-Network Pricing in a Nonneutral Network

Representatives of several Internet service providers (ISPs) have expressed their wish to see a substantial change in the pricing policies of the Internet. In particular, they would like to see content providers (CPs) pay for use of the network, given the large amount of resources they use. This would be in clear violation of the ``network neutrality'' principle that had characterized the development of the wireline Internet. Our first goal in this article is to propose and study possible ways of implementing such payments and of regulating their amount. We introduce a model that includes the users' behavior, the utilities of the ISP and of the CPs, and, the monetary flow that involves the content users, the ISP and CP, and, in pUrticular, the CP's revenues from advertisements. We consider various game models and study the resulting equilibria; they are all combinations of a noncooperative game (in which the ISPs and CPs determine how much they will charge the users) with a ``cooperative'' one on how the CP and the ISP share the payments. We include in our model a possible asymmetric weighting parameter (that varies between zero to one). We also study equilibria that arise when one of the CPs colludes with the TSP. We also study two dynamic game models as well as the convergence of prices to the equilibrium values.

On the Maximum Number of Linearly Independent Cycles and Paths in a Network

Central to network tomography is the problem of identifiability, the ability to identify internal network characteristics uniquely from end-to-end measurements. This problem is often underconstrained even when internal network characteristics such as link delays are modeled as additive constants. While it is known that the network topology can play a role in determining the extent of identifiability, there is a lack in the fundamental understanding of being able to quantify it for a given network. In this paper, we consider the problem of identifying additive link metrics in an arbitrary undirected network using measurement nodes and establishing paths/cycles between them. For a given placement of measurement nodes, we define and derive the ``link rank'' of the network-the maximum number of linearly independent cycles/paths that may be established between the measurement nodes. We achieve this in linear time. The link rank helps quantify the exact extent of identifiability in a network. We also develop a quadratic time algorithm to compute a set of cycles/paths that achieves the maximum rank.

Stabilization of Co-3 - Oxoclusters in a pcu Net: Synthesis, Structure, Solvent Exchange (Single Crystal to Single Crystal) and Magnetic Studies

The solvothermal reaction of CoCl(2)4H(2)O and 4,4-sulfonyldibenzoic acid (H(2)SDBA) resulted in the formation of a three-dimensional coordination polymer Co-3(C14H8O6S)(3)(DMA)(2)(MeOH)].DMA (Ia) consisting of trinuclear Co-3 oxo-cluster units. The Co-3 trimeric units are connected by SDBA(2-) anions leading to a three dimensional structure with a pcu topology. The terminal methanol molecules could be exchanged in a single crystal to single crystal (SCSC) fashion by other similar solvent molecules (ethanol, acetonitrile, water, ethyleneglycol). Magnetic studies on the parent compound, Ia, indicate antiferromagnetic interactions between the central metal atoms.

Exchange bias in strained SrRuO3 thin films

Recently, it was found that the ferromagnetic SrRuO3 when combined with another ferromagnet in thin film form gives rise to exchange bias (EB) effect. However, we observed EB in single, strained, SrRuO3 thin films grown on diamagnetic LaAlO3 (100) substrates. It displays the training effect, which essentially confirms EB. The temperature dependence of the EB reveals the blocking temperature to be around similar to 75 K. The strength of the exchange bias decreases with the increase in thickness of the film. We observe tensile strain in the out of plane direction. Further, the presence of in-plane compressive strain is observed through asymmetric reciprocal space mapping. Finally, we find a direct link between strain and EB. The evolution of strain with thickness matches well with the nature of scaled EB. It has been shown earlier by first principle calculations that this strain can induce EB in thin films. (C) 2014 AIP Publishing LLC.

Adaptive Flight-Control Design Using Neural-Network-Aided Optimal Nonlinear Dynamic Inversion

A neural-network-aided nonlinear dynamic inversion-based hybrid technique of model reference adaptive control flight-control system design is presented in this paper. Here, the gains of the nonlinear dynamic inversion-based flight-control system are dynamically selected in such a manner that the resulting controller mimics a single network, adaptive control, optimal nonlinear controller for state regulation. Traditional model reference adaptive control methods use a linearized reference model, and the presented control design method employs a nonlinear reference model to compute the nonlinear dynamic inversion gains. This innovation of designing the gain elements after synthesizing the single network adaptive controller maintains the advantages that an optimal controller offers, yet it retains a simple closed-form control expression in state feedback form, which can easily be modified for tracking problems without demanding any a priori knowledge of the reference signals. The strength of the technique is demonstrated by considering the longitudinal motion of a nonlinear aircraft system. An extended single network adaptive control/nonlinear dynamic inversion adaptive control design architecture is also presented, which adapts online to three failure conditions, namely, a thrust failure, an elevator failure, and an inaccuracy in the estimation of C-M alpha. Simulation results demonstrate that the presented adaptive flight controller generates a near-optimal response when compared to a traditional nonlinear dynamic inversion controller.

A Matroidal Framework for Network-Error Correcting Codes

Matroidal networks were introduced by Dougherty et al. and have been well studied in the recent past. It was shown that a network has a scalar linear network coding solution if and only if it is matroidal associated with a representable matroid. A particularly interesting feature of this development is the ability to construct (scalar and vector) linearly solvable networks using certain classes of matroids. Furthermore, it was shown through the connection between network coding and matroid theory that linear network coding is not always sufficient for general network coding scenarios. The current work attempts to establish a connection between matroid theory and network-error correcting and detecting codes. In a similar vein to the theory connecting matroids and network coding, we abstract the essential aspects of linear network-error detecting codes to arrive at the definition of a matroidal error detecting network (and similarly, a matroidal error correcting network abstracting from network-error correcting codes). An acyclic network (with arbitrary sink demands) is then shown to possess a scalar linear error detecting (correcting) network code if and only if it is a matroidal error detecting (correcting) network associated with a representable matroid. Therefore, constructing such network-error correcting and detecting codes implies the construction of certain representable matroids that satisfy some special conditions, and vice versa. We then present algorithms that enable the construction of matroidal error detecting and correcting networks with a specified capability of network-error correction. Using these construction algorithms, a large class of hitherto unknown scalar linearly solvable networks with multisource, multicast, and multiple-unicast network-error correcting codes is made available for theoretical use and practical implementation, with parameters, such as number of information symbols, number of sinks, number of coding nodes, error correcting capability, and so on, being arbitrary but for computing power (for the execution of the algorithms). The complexity of the construction of these networks is shown to be comparable with the complexity of existing algorithms that design multicast scalar linear network-error correcting codes. Finally, we also show that linear network coding is not sufficient for the general network-error correction (detection) problem with arbitrary demands. In particular, for the same number of network errors, we show a network for which there is a nonlinear network-error detecting code satisfying the demands at the sinks, whereas there are no linear network-error detecting codes that do the same.