Kaito Fujii

Senior Lecturer

Kyoto University
Country flagJapan

Research Interests

ApplyKite TwinLearns as you apply

Make your next move.

Prepare your application

Review drafts before you send them.

Explore related searches

Articles (3)

Year:

2025

The north–south (NS) anisotropy of galactic cosmic rays (GCRs) is dominated by a diamagnetic drift flow of GCRs in the interplanetary magnetic field (IMF), allowing us to derive key parameters of cosmic-ray propagation, such as the density gradient and diffusion coefficient. We propose a new method to analyze the rigidity spectrum of GCR anisotropy and reveal a solar cycle variation of the NS anisotropy’s spectrum using ground-based muon detectors in Nagoya, Japan, and Hobart, Australia. The physics-based correction method for the atmospheric temperature effect on muons is used to combine the different-site detectors free from local atmospheric effects. NS channel pairs in the multidirectional muon detectors are formed to enhance sensitivity to the NS anisotropy, and in this process, general graph matching in graph theory is introduced to survey optimized pairs. Moreover, Bayesian estimation with the Gaussian process allows us to unfold the rigidity spectrum without supposing any analytical function for the spectral shape. Thanks to these novel approaches, it has been discovered that the rigidity spectrum of the NS anisotropy is dynamically varying with solar activity every year. It is attributed to a rigidity-dependent variation of the radial density gradient of GCRs based on the nature of the diamagnetic drift in the IMF. The diffusion coefficient and mean free path length of GCRs as functions of the rigidity are also derived from the diffusion–convection flow balance. This analysis expands the estimation limit of the mean free path length into the ≤200 GV rigidity region from the <10 GV region achieved by solar energetic particle observations.

Year:

2024

The value maximization version of the secretary problem is the problem of hiring a candidate with the largest value from a randomly ordered sequence of candidates. In this work, we consider a setting where predictions of candidate values are provided in advance. We propose an algorithm that achieves a nearly optimal value if the predictions are accurate and results in a constant-factor competitive ratio otherwise. We also show that the worst-case competitive ratio of an algorithm cannot be higher than some constant [Formula: see text], which is the best possible competitive ratio when we ignore predictions, if the algorithm performs nearly optimally when the predictions are accurate. Additionally, for the multiple-choice secretary problem, we propose an algorithm with a similar theoretical guarantee. We empirically illustrate that if the predictions are accurate, the proposed algorithms perform well; meanwhile, if the predictions are inaccurate, performance is comparable to existing algorithms that do not use predictions.

Year:

2024

Collaborators (3)

Shoko Miyake

Senior Staff Scientist

Okinawa Institute of Science and Technology Graduate University

JAPAN
View details

Marcus Duldig

Honorary lecturer/researcher (various titles)

University of Tasmania

AUSTRALIA
View details

AKIRA KADOKURA

National Institute of Polar Research

JAPAN
View details