Leaf-wise intersections and Rabinowitz Floer homology

In this article we explain how critical points of a particular perturbation of the Rabinowitz action functional give rise to leaf-wise intersection points in hypersurfaces of restricted contact type. This is used to derive existence and multiplicity results for leaf-wise intersection points in hypersurfaces of restricted contact type in general exact symplectic manifolds. The notion of leaf-wise intersection points was introduced by Moser.Comment: 18 pages, 1 figure; v3: completely rewritten, improved result

EPOBF: Energy Efficient Allocation of Virtual Machines in High Performance Computing Cloud

Cloud computing has become more popular in provision of computing resources under virtual machine (VM) abstraction for high performance computing (HPC) users to run their applications. A HPC cloud is such cloud computing environment. One of challenges of energy efficient resource allocation for VMs in HPC cloud is tradeoff between minimizing total energy consumption of physical machines (PMs) and satisfying Quality of Service (e.g. performance). On one hand, cloud providers want to maximize their profit by reducing the power cost (e.g. using the smallest number of running PMs). On the other hand, cloud customers (users) want highest performance for their applications. In this paper, we focus on the scenario that scheduler does not know global information about user jobs and user applications in the future. Users will request shortterm resources at fixed start times and non interrupted durations. We then propose a new allocation heuristic (named Energy-aware and Performance per watt oriented Bestfit (EPOBF)) that uses metric of performance per watt to choose which most energy-efficient PM for mapping each VM (e.g. maximum of MIPS per Watt). Using information from Feitelson's Parallel Workload Archive to model HPC jobs, we compare the proposed EPOBF to state of the art heuristics on heterogeneous PMs (each PM has multicore CPU). Simulations show that the EPOBF can reduce significant total energy consumption in comparison with state of the art allocation heuristics.Comment: 10 pages, in Procedings of International Conference on Advanced Computing and Applications, Journal of Science and Technology, Vietnamese Academy of Science and Technology, ISSN 0866-708X, Vol. 51, No. 4B, 201

Coulomb correlation in presence of spin-orbit coupling: application to plutonium

Attempts to go beyond the local density approximation (LDA) of Density Functional Theory (DFT) have been increasingly based on the incorporation of more realistic Coulomb interactions. In their earliest implementations, methods like LDA+$U$, LDA + DMFT (Dynamical Mean Field Theory), and LDA+Gutzwiller used a simple model interaction $U$. In this article we generalize the solution of the full Coulomb matrix involving $F^{(0)}$ to $F^{(6)}$ parameters, which is usually presented in terms of an $\ell m_\ell$ basis, into a $jm_{j}$ basis of the total angular momentum, where we also include spin-orbit coupling; this type of theory is needed for a reliable description of $f$-state elements like plutonium, which we use as an example of our theory. Close attention will be paid to spin-flip terms, which are important in multiplet theory but that have been usually neglected in these kinds of studies. We find that, in a density-density approximation, the $jm_j$ basis results provide a very good approximation to the full Coulomb matrix result, in contrast to the much less accurate results for the more conventional $\ell m_\ell$ basis

On magnetic leaf-wise intersections

In this article we introduce the notion of a magnetic leaf-wise intersection point which is a generalization of the leaf-wise intersection point with magnetic effects. We also prove the existence of magnetic leaf-wise intersection points under certain topological assumptions.Comment: 43 page

Reversal of spin polarization in Fe/GaAs (001) driven by resonant surface states: First-principles calculations

A minority-spin resonant state at the Fe/GaAs(001) interface is predicted to reverse the spin polarization with voltage bias of electrons transmitted across this interface. Using a Green's function approach within the local spin density approximation we calculate spin-dependent current in a Fe/GaAs/Cu tunnel junction as a function of applied bias voltage. We find a change in sign of the spin polarization of tunneling electrons with bias voltage due to the interface minority-spin resonance. This result explains recent experimental data on spin injection in Fe/GaAs contacts and on tunneling magnetoresistance in Fe/GaAs/Fe magnetic tunnel junctions

Dynamic Set Intersection

Consider the problem of maintaining a family $F$ of dynamic sets subject to insertions, deletions, and set-intersection reporting queries: given $S,S'\in F$, report every member of $S\cap S'$ in any order. We show that in the word RAM model, where $w$ is the word size, given a cap $d$ on the maximum size of any set, we can support set intersection queries in $O(\frac{d}{w/\log^2 w})$ expected time, and updates in $O(\log w)$ expected time. Using this algorithm we can list all $t$ triangles of a graph $G=(V,E)$ in $O(m+\frac{m\alpha}{w/\log^2 w} +t)$ expected time, where $m=|E|$ and $\alpha$ is the arboricity of $G$. This improves a 30-year old triangle enumeration algorithm of Chiba and Nishizeki running in $O(m \alpha)$ time. We provide an incremental data structure on $F$ that supports intersection {\em witness} queries, where we only need to find {\em one} $e\in S\cap S'$. Both queries and insertions take O\paren{\sqrt \frac{N}{w/\log^2 w}} expected time, where $N=\sum_{S\in F} |S|$. Finally, we provide time/space tradeoffs for the fully dynamic set intersection reporting problem. Using $M$ words of space, each update costs $O(\sqrt {M \log N})$ expected time, each reporting query costs $O(\frac{N\sqrt{\log N}}{\sqrt M}\sqrt{op+1})$ expected time where $op$ is the size of the output, and each witness query costs $O(\frac{N\sqrt{\log N}}{\sqrt M} + \log N)$ expected time.Comment: Accepted to WADS 201