Effect of spin relaxations on the spin mixing conductances for a bilayer structure

The spin current can result in a spin-transfer torque in the normal-metal(NM)|ferromagnetic-insulator(FMI) or normal-metal(NM)|ferromagnetic-metal(FMM) bilayer. In the earlier study on this issue, the spin relaxations were ignored or introduced phenomenologically. In this paper, considering the FMM or FMI with spin relaxations described by a non-Hermitian Hamiltonian, we derive an effective spin-transfer torque and an effective spin mixing conductance in the non-Hermitian bilayer. The dependence of the effective spin mixing conductance on the system parameters (such as insulating gap, \textit{s-d} coupling, and layer thickness) as well as the relations between the real part and the imaginary part of the effective spin mixing conductance are given and discussed. We find that the effective spin mixing conductance can be enhanced in the non-Hermitian system. This provides us with the possibility to enhance the spin mixing conductance

Aharonov-Bohm oscillations in the local density of topological surface states

We study Aharonov-Bohm (AB) oscillations in the local density of states (LDOS) for topological insulator (TI) and conventional metal Au(111) surfaces with spin-orbit interaction, which can be probed by spin-polarized scanning tunneling microscopy. We show that the spacial AB oscillatory period in the total LDOS is a flux quantum $\Phi_{0}\mathtt{=}hc/e$ (weak localization) in both systems. Remarkably, an analogous weak antilocalization with $\Phi_{0}/2$ periodic spacial AB oscillations in spin components of LDOS for TI surface is observed, while it is absent in Au(111).Comment: 4 APL pages, 3 figure

Transcoding proxy placement in en-route web caching

Copyright © 2004 IEEEWith the rapid growth of audio and video applications on the internet, caching media objects in transcoding proxies has become an important research topic in recent years. In this paper, we address the problem of finding the optimal locations for placing fixed number of transcoding proxies among the nodes in a network such that the specified objective is achieved. We present an original model for this problem, which makes transcoding proxy placement decisions on all the en-route nodes along the routing path in a coordinated way. In our model, proxy status information along the routing path of requests is used for optimally determining the locations for placing fixed number of transcoding proxies. We formulate this problem as an optimization problem and the optimal locations are obtained using a low-cost dynamic programming-based algorithm. We implement our algorithm and evaluate our model on different performance metrics through extensive simulation experiments. The implementation results show that our model significantly outperforms the random algorithm which places transcoding proxies among the nodes in a network randomly.Keqiu Li, Hong She

Coordinated en-route transcoding caching for tree networks

©2004 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.As transcoding caching is attracting an increasing amount of attention, it is important and necessary to find methods to distribute multiple versions of the same media object in the Internet. In this paper, we first present a mathematical model for the problem of optimally determining the locations in which to place multiple versions of the same media object in tree networks such that the specified objective is achieved. This problem is formulated as an optimization problem. Second, we propose a low-cost dynamic programming-based solution for solving this problem, by which the optimal locations are obtained. Finally, we evaluate our model on different performance metrics through extensive simulation experiments and compare the results of our model with those of existing models that consider transcoding caching either on a path or at individual nodes only.Keqiu Li, Hong She

Cache replacement for transcoding proxy caching

© 2005 IEEE.In this paper, we address the problem of cache replacement for transcoding proxy caching. First, an efficient cache replacement algorithm is proposed. Our algorithm considers both the aggregate effect of caching multiple versions of the same multimedia object and cache consistency. Second, a complexity analysis is presented to show the efficiency of our algorithm. Finally, some preliminary simulation experiments are conducted to compare the performance of our algorithm with some existing algorithms. The results show that our algorithm outperforms others in terms of the various performance metrics.Keqiu Li, Keishi Tajima, Hong She

Possible ΔΔ\Delta\Delta dibaryons in the quark cluster model

In the framework of RGM, the binding energy of one channel $\Delta\Delta_{(3,0)}$($d^*$) and $\Delta\Delta_{(0,3)}$ are studied in the chiral SU(3) quark cluster model. It is shown that the binding energies of the systems are a few tens of MeV. The behavior of the chiral field is also investigated by comparing the results with those in the SU(2) and the extended SU(2) chiral quark models. It is found that the symmetry property of the $\Delta\Delta$ system makes the contribution of the relative kinetic energy operator between two clusters attractive. This is very beneficial for forming the bound dibaryon. Meanwhile the chiral-quark field coupling also plays a very important role on binding. The S-wave phase shifts and the corresponding scattering lengths of the systems are also given.Comment: LeTex with 2 ps figure

Placement solutions for multiple versions of a multimedia object

Transcoding is an important technology which adapts the same multimedia object to diverse mobile appliances; thus, users' requests for a specified version of a multimedia object could be served by a more detailed version cached according to transcoding. Therefore, it is of particularly theoretical and practical necessity to determine the proper versions to be cached at a node such that the specified objective is achieved. In this paper, we address the problem of multimedia object placement. The performance objective is to minimize the total access cost by considering both transmission cost and transcoding cost. We present an optimal dynamic programming-based solution for this problem. The performance of the proposed solutions is evaluated with a set of carefully designed simulation experiments for various performance metrics over a wide range of system parameters. The simulation results show that our solution consistently and significantly outperforms comparison solutions in terms of all the performance metrics considered.Keqiu Li, Hong Shen, Francis Y. L. Chi