Majority-Carrier Mobilities in Undoped and \textit{n}-type Doped ZnO Epitaxial Layers

Transparent and conductive ZnO:Ga thin films are prepared by laser molecular-beam epitaxy. Their electron properties were investigated by the temperature-dependent Hall-effect technique. The 300-K carrier concentration and mobility were about $n_s \sim 10^{16}$ cm$^{-3}$ and 440 cm$^{2}$/Vs, respectively. In the experimental `mobility vs concentration' curve, unusual phenomenon was observed, i.e., mobilities at $n_s \sim 5\times$ 10$^{18}$ cm$^{-3}$ are significantly smaller than those at higher densities above $\sim 10^{20}$ cm$^{-3}$. Several types of scattering centers including ionized donors and oxygen traps are considered to account for the observed dependence of the Hall mobility on carrier concentration. The scattering mechanism is explained in terms of inter-grain potential barriers and charged impurities. A comparison between theoretical results and experimental data is made.Comment: 5 pages, 1 figure, conference on II-VI compounds, RevTe

A Nested Family of kk-total Effective Rewards for Positional Games

We consider Gillette's two-person zero-sum stochastic games with perfect information. For each k \in \ZZ_+ we introduce an effective reward function, called $k$-total. For $k = 0$ and $1$ this function is known as {\it mean payoff} and {\it total reward}, respectively. We restrict our attention to the deterministic case. For all $k$, we prove the existence of a saddle point which can be realized by uniformly optimal pure stationary strategies. We also demonstrate that $k$-total reward games can be embedded into $(k+1)$-total reward games

4.45 Pflops Astrophysical N-Body Simulation on K computer -- The Gravitational Trillion-Body Problem

As an entry for the 2012 Gordon-Bell performance prize, we report performance results of astrophysical N-body simulations of one trillion particles performed on the full system of K computer. This is the first gravitational trillion-body simulation in the world. We describe the scientific motivation, the numerical algorithm, the parallelization strategy, and the performance analysis. Unlike many previous Gordon-Bell prize winners that used the tree algorithm for astrophysical N-body simulations, we used the hybrid TreePM method, for similar level of accuracy in which the short-range force is calculated by the tree algorithm, and the long-range force is solved by the particle-mesh algorithm. We developed a highly-tuned gravity kernel for short-range forces, and a novel communication algorithm for long-range forces. The average performance on 24576 and 82944 nodes of K computer are 1.53 and 4.45 Pflops, which correspond to 49% and 42% of the peak speed.Comment: 10 pages, 6 figures, Proceedings of Supercomputing 2012 (http://sc12.supercomputing.org/), Gordon Bell Prize Winner. Additional information is http://www.ccs.tsukuba.ac.jp/CCS/eng/gbp201

Momentum-resolved spectral functions of SrVO3_3 calculated by LDA+DMFT

LDA+DMFT, the merger of density functional theory in the local density approximation and dynamical mean-field theory, has been mostly employed to calculate k-integrated spectra accessible by photoemission spectroscopy. In this paper, we calculate k-resolved spectral functions by LDA+DMFT. To this end, we employ the Nth order muffin-tin (NMTO) downfolding to set up an effective low-energy Hamiltonian with three t_2g orbitals. This downfolded Hamiltonian is solved by DMFT yielding k-dependent spectra. Our results show renormalized quasiparticle bands over a broad energy range from -0.7 eV to +0.9 eV with small ``kinks'', discernible in the dispersion below the Fermi energy.Comment: 21 pages, 8 figure

Approximating Source Location and Star Survivable Network Problems

In Source Location (SL) problems the goal is to select a mini-mum cost source set $S \subseteq V$ such that the connectivity (or flow) $\psi(S,v)$ from $S$ to any node $v$ is at least the demand $d_v$ of $v$. In many SL problems $\psi(S,v)=d_v$ if $v \in S$, namely, the demand of nodes selected to $S$ is completely satisfied. In a node-connectivity variant suggested recently by Fukunaga, every node $v$ gets a "bonus" $p_v \leq d_v$ if it is selected to $S$. Fukunaga showed that for undirected graphs one can achieve ratio $O(k \ln k)$ for his variant, where $k=\max_{v \in V}d_v$ is the maximum demand. We improve this by achieving ratio \min\{p^*\lnk,k\}\cdot O(\ln (k/q^*)) for a more general version with node capacities, where $p^*=\max_{v \in V} p_v$ is the maximum bonus and $q^*=\min_{v \in V} q_v$ is the minimum capacity. In particular, for the most natural case $p^*=1$ considered by Fukunaga, we improve the ratio from $O(k \ln k)$ to $O(\ln^2k)$. We also get ratio $O(k)$ for the edge-connectivity version, for which no ratio that depends on $k$ only was known before. To derive these results, we consider a particular case of the Survivable Network (SN) problem when all edges of positive cost form a star. We give ratio $O(\min\{\ln n,\ln^2 k\})$ for this variant, improving over the best ratio known for the general case $O(k^3 \ln n)$ of Chuzhoy and Khanna