9,495 research outputs found

    Interface Effects on Tunneling Magnetoresistance in Organic Spintronics with Flexible Amine-Au Links

    Full text link
    Organic spintronics is a promising emerging field, but the sign of the tunneling magnetoresistance (TMR) is highly sensitive to interface effects, a crucial hindrance to applications. A key breakthrough in molecular electronics was the discovery of amine-Au link groups that give reproducible conductance. Using first principles calculations, we predict that amine-Au links give improved reproducibility in organic spintronics junctions with Au-covered Fe leads. The Au layers allow only states with sp character to tunnel into the molecule, and the flexibility of amine-Au links results in a narrow range of TMR for fixed number of Au layers. Even as the Au thickness changes, TMR remains positive as long as the number of Au layers is the same on both sides of the junction. Since the number of Au layers on Fe surfaces or Fe nanoparticles can now be experimentally controlled, amine-Au links provide a route towards robust TMR in organic spintronics

    Generalized robust shrinkage estimator and its application to STAP detection problem

    Full text link
    Recently, in the context of covariance matrix estimation, in order to improve as well as to regularize the performance of the Tyler's estimator [1] also called the Fixed-Point Estimator (FPE) [2], a "shrinkage" fixed-point estimator has been introduced in [3]. First, this work extends the results of [3,4] by giving the general solution of the "shrinkage" fixed-point algorithm. Secondly, by analyzing this solution, called the generalized robust shrinkage estimator, we prove that this solution converges to a unique solution when the shrinkage parameter β\beta (losing factor) tends to 0. This solution is exactly the FPE with the trace of its inverse equal to the dimension of the problem. This general result allows one to give another interpretation of the FPE and more generally, on the Maximum Likelihood approach for covariance matrix estimation when constraints are added. Then, some simulations illustrate our theoretical results as well as the way to choose an optimal shrinkage factor. Finally, this work is applied to a Space-Time Adaptive Processing (STAP) detection problem on real STAP data

    The Effects of Finger-Walking in Place (FWIP) on Spatial Knowledge Acquisition in Virtual Environments

    Get PDF
    Spatial knowledge, necessary for efficient navigation, comprises route knowledge (memory of landmarks along a route) and survey knowledge (overall representation like a map). Virtual environments (VEs) have been suggested as a power tool for understanding some issues associated with human navigation, such as spatial knowledge acquisition. The Finger-Walking-in-Place (FWIP) interaction technique is a locomotion technique for navigation tasks in immersive virtual environments (IVEs). The FWIP was designed to map a human’s embodied ability overlearned by natural walking for navigation, to finger-based interaction technique. Its implementation on Lemur and iPhone/iPod Touch devices was evaluated in our previous studies. In this paper, we present a comparative study of the joystick’s flying technique versus the FWIP. Our experiment results show that the FWIP results in better performance than the joystick’s flying for route knowledge acquisition in our maze navigation tasks

    Multi-layer Unmanned Aerial Vehicle Networks: Modeling and Performance Analysis

    Full text link
    Since various types of unmanned aerial vehicles (UAVs) with different hardware capabilities are introduced, we establish a foundation for the multi-layer aerial network (MAN). First, the MAN is modeled as K layer ANs, and each layer has UAVs with different densities, floating altitudes, and transmission power. To make the framework applicable for various scenarios in MAN, we consider the transmitter- and the receiver-oriented node association rules as well as the air-to-ground and air-to-air channel models, which form line of sight links with a location-dependent probability. We then newly analyze the association probability, the main link distance distribution, successful transmission probability (STP), and area spectral efficiency (ASE) of MAN. The upper bounds of the optimal densities that maximize STP and ASE are also provided. Finally, in the numerical results, we show the optimal UAV densities of an AN that maximize the ASE and the STP decrease with the altitude of the network. We also show that when the total UAV density is fixed for two layer AN, the use of single layer in higher(lower) altitude only for all UAVs can achieve better performance for low(high) total density case, otherwise, distributing UAVs in two layers, i.e., MAN, achieves better performance

    Optimal Charging of Electric Vehicles in Smart Grid: Characterization and Valley-Filling Algorithms

    Full text link
    Electric vehicles (EVs) offer an attractive long-term solution to reduce the dependence on fossil fuel and greenhouse gas emission. However, a fleet of EVs with different EV battery charging rate constraints, that is distributed across a smart power grid network requires a coordinated charging schedule to minimize the power generation and EV charging costs. In this paper, we study a joint optimal power flow (OPF) and EV charging problem that augments the OPF problem with charging EVs over time. While the OPF problem is generally nonconvex and nonsmooth, it is shown recently that the OPF problem can be solved optimally for most practical power networks using its convex dual problem. Building on this zero duality gap result, we study a nested optimization approach to decompose the joint OPF and EV charging problem. We characterize the optimal offline EV charging schedule to be a valley-filling profile, which allows us to develop an optimal offline algorithm with computational complexity that is significantly lower than centralized interior point solvers. Furthermore, we propose a decentralized online algorithm that dynamically tracks the valley-filling profile. Our algorithms are evaluated on the IEEE 14 bus system, and the simulations show that the online algorithm performs almost near optimality (<1<1% relative difference from the offline optimal solution) under different settings.Comment: This paper is temporarily withdrawn in preparation for journal submissio
    corecore