Searcharxiv⌕ Search

arXiv subjects

Hiroki Nakayama

Publications and source records attributed to Hiroki Nakayama.

4 recordsLinked to original sources
arXiv2023

Impact of inherent energy barrier on spin-orbit torques in magnetic-metal/semimetal heterojunctions

Spintronic devices are based on heterojunctions of two materials with different magnetic and electronic properties. Although an energy barrier is naturally formed even at the interface of metallic heterojunctions, its impact on spin transport has been overlooked. Here, using diffusive spin Hall currents, we provide evidence that the inherent energy barrier governs the spin transport even in metallic systems. We find a sizable field-like torque, much larger than the damping-like counterpart, in Ni$_{81}$Fe$_{19}$/Bi$_{0.1}$Sb$_{0.9}$ bilayers. This is a distinct signature of barrier-mediated spin-orbit torques, which is consistent with our theory that predicts a strong modification of the spin mixing conductance induced by the energy barrier. Our results suggest that the spin mixing conductance and the corresponding spin-orbit torques are strongly altered by minimizing the work function difference in the heterostructure. These findings provide a new mechanism to control spin transport and spin torque phenomena by interfacial engineering of metallic heterostructures.

cond-mat.mtrl-sci↗
arXiv2021

An Investigation Between Schema Linking and Text-to-SQL Performance

Text-to-SQL is a crucial task toward developing methods for understanding natural language by computers. Recent neural approaches deliver excellent performance; however, models that are difficult to interpret inhibit future developments. Hence, this study aims to provide a better approach toward the interpretation of neural models. We hypothesize that the internal behavior of models at hand becomes much easier to analyze if we identify the detailed performance of schema linking simultaneously as the additional information of the text-to-SQL performance. We provide the ground-truth annotation of schema linking information onto the Spider dataset. We demonstrate the usefulness of the annotated data and how to analyze the current state-of-the-art neural models.

cs.CL↗
arXiv2002

Dualistic computational algebraic analyses of primal and dual minimum cost flow problems on acyclic tournament graphs

To integer programming problems, computational algebraic approaches using Grobner bases or standard pairs via the discreteness of toric ideals have been studied in recent years. Although these approaches have not given improved time complexity bound compared with existing methods for solving integer programming problems, these give algebraic analysis of their structures. In this paper, we focus on the case that the coefficient matrix is unimodular, especially on the primal and dual minimum cost flow problems, whose structure is rather well-known, but new structures can be revealed by our approach. We study the Grobner bases and standard pairs for unimodular programming, and give the maximum number of dual feasible bases in terms of the volume of polytopes. And for the minimum cost flow problems, we characterize reduced Grobner bases in terms of graphs, and give bounds for the number of dual (resp. primal) feasible bases of the primal (resp. dual) problems: for the primal problems the minimum and the maximum are shown to be 1 and the Catalan number $\frac{1}{d}\tbinom{2(d-1)}{d-1}$, while for the dual problems the lower bound is shown to be $Ω(2^{\lfloor d/6\rfloor})$. To analyze arithmetic degrees, we use two approaches: one is the relation between reduced Gr{ö}bner bases and standard pairs, where the corresponding relation on the minimum cost flow -- between a subset of circuits and dual feasible bases -- has not been so clear, the other is the results in combinatorics related with toric ideals.

math.CO↗