Hiroyuki Hanada

Learn More
KamLAND has measured the flux of nu;(e)'s from distant nuclear reactors. We find fewer nu;(e) events than expected from standard assumptions about nu;(e) propagation at the 99.95% C.L. In a 162 ton.yr exposure the ratio of the observed inverse beta-decay events to the expected number without nu;(e) disappearance is 0.611+/-0.085(stat)+/-0.041(syst) for(More)
AIMS Oxidative stress is implicated in the progression of heart failure, and matrix metalloproteinase (MMP) activity is increased in patients with congestive heart failure. We examined the role of oxidative stress on MMP activity in humans. METHODS AND RESULTS We measured the MMP activity and the level of 8-iso-prostagandin F2alpha (8-iso-PGF2alpha), a(More)
The acyl-CoA:diacylglycerol acyltransferase (DGAT) enzymes DGAT1 and DGAT2 catalyze the final step in triglycerides biosynthesis. This study examined the relationships of baseline phenotypes and the common polymorphisms in DGAT1 and DGAT2 with the lipid responses to niacin.Lipid responses in Chinese patients with dyslipidemia treated with the extended(More)
Privacy concern has been increasingly important in many machine learning (ML) problems. We study empirical risk minimization (ERM) problems under secure multi-party computation (MPC) frameworks. Main technical tools for MPC have been developed based on cryptography. One of limitations in current cryptographically private ML is that it is computationally(More)
We study large-scale classification problems in changing environments where a small part of the dataset is modified, and the effect of the data modification must be quickly incorporated into the clas-sifier. When the entire dataset is large, even if the amount of the data modification is fairly small, the computational cost of retraining the classifier(More)
  • Hiroyuki Hanada, Shuhei Denzumi, Yuma Inoue, Hiroshi Aoki, Norihito Yasuda, Shogo Takeuchi +1 other
  • 2014
(Abstract) Given an undirected graph G, we consider enumerating all Eulerian trails, that is, walks containing each of the edges in G just once. We consider achieving it with the enumeration of Hamiltonian paths with the zero-suppressed decision diagram (ZDD), a data structure that can efficiently store a family of sets satisfying given conditions. First we(More)
In this paper we consider the problem of similar substring searching in the q-gram distance. The q-gram distance d q (x, y) is a similarity measure between two strings x and y defined by the number of different q-grams between them. The distance can be used instead of the edit distance due to its lower computation cost, O(|x| + |y|) vs. O(|x||y|), and its(More)
  • 1