Hayato Yamana
About the author:
No description available of Hayato Yamana...
Publications by Hayato Yamana (bibliography)
» 2007 «
Kasuya, Yuji and Yamana, Hayato (2007): MathBox: interactive pen-based interface for inputting mathematical expressions. In: Proceedings of the 2007 International Conference on Intelligent User Interfaces 2007. pp. 274-277. Available online
Inputting mathematical expressions with a mouse and a keyboard is a troublesome task. Thus, a number of mathematical expression recognition systems capable of recognizing handwritten mathematical expressions to input them into computers have been proposed. Even with these systems, however, structure recognition of mathematical expressions is still difficult. This paper presents MathBox, a new pen-based interface for inputting mathematical expressions into computers. MathBox interactively shows "boxes" in which the user can write one symbol. The boxes are shown along with the user's writing. For example, when the user writes 'x,' the boxes for a power and an index of 'x' and for the next symbol are shown. When the user inputs a fraction line, boxes for the numerator, denominator, and the next symbol are shown. MathBox skips recognizing the structures of expressions, which enables users to write mathematical expressions with practical accuracy.
Copyrights may apply
Tashiro, Takashi, Ueda, Takanori, Hori, Taisuke, Hirate, Yu and Yamana, Hayato (2007): EPCI: extracting potentially copyright infringement texts from the web. In: Proceedings of the 2007 International Conference on the World Wide Web 2007. pp. 1151-1152. Available online
In this paper, we propose a new system extracting potentially copyright infringement texts from the Web, called EPCI. EPCI extracts them in the following way: (1) generating a set of queries based on a given copyright reserved seed-text, (2) putting every query to search engine API, (3) gathering the search result Web pages from high ranking until the similarity between the given seed-text and the search result pages becomes less than a given threshold value, and (4) merging all the gathered pages, then re-ranking them in the order of their similarity. Our experimental result using 40 seed-texts shows that EPCI is able to extract 132 potentially copyright infringement Web pages per a given copyright reserved seed-text with 94% precision in average.
Copyrights may apply
» 1998 «
Yamana, Hayato, Tamura, Kent, Kawano, Hiroyuki, Kamei, Satoshi, Harada, Masanori, Nishimura, Hideki, Asai, Isao, Kusumoto, Hiroyuki, Shinoda, Yoichi and Muraoka, Yoichi (1998): Experiments of Collecting WWW Information using Distributed WWW Robots. In: Proceedings of the 21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval 1998. pp. 379-380. Available online
The world-wide web, in short the web, is a large distributed digital information space. It is the most popular internet service and is now indispensable for us. Since the web itself has no protocols for searching the web documents, we need to collect the documents on the web servers to make a database to search. In this paper, we propose distributed WWW robots to collect the web documents quickly. Our final goal is to collect all of the documents on the web in Japan within one day. Currently, eight distributed WWW robots, whose system code is mostly written in Java with some C, are running in Japan. We have already found 13,320 domains that have jp domain. The experimental results show that we are able to gain 5.8 to 9.7 times speedup when four distributed WWW robots are placed at different places in comparison with when only one WWW robot is used. We also expect that we are able to gain about (2.8 x n) times speedup at most when we use n WWW robots to collect the web documents.
Copyrights may apply
Yamana, Hayato, Koike, Hanpei, Kodama, Yuetsu, Sakane, Hirofumi and Yamaguchi, Yoshihisa (1998): Fast Speculative Search Engine on the Highly Parallel Computer EM-X. In: Proceedings of the 21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval 1998. p. 390. Available online
This demonstration presents the new World Wide Web search engine called "Fast Speculative Search Engine" that uses speculative execution on multiprocessor systems to shorten the total time to retrieve information from the WWW. The proposed search engine predicts users' next queries and initiates the searches with the predicted queries before receiving them to accelerate narrowing the search space. We have implemented the fast speculative search engine using the data speculation on the EM-X which consists of 80 processors. On the EM-X, idling processors are used to predict the next queries and no predictions are made when all processors are busy. Thus, we can provide minimum search service at busy time when there are many search requests, and provide maximum search service at free time when there are small number of search requests. We call such controlling scheme as Unlimited Speculative Execution. The experimental results, using the data set of WWW pages in our organization, show that the 42% of users' queries hit on the speculative searched results.
Copyrights may apply
SHOW THIS LIST ON YOUR HOMEPAGE
What do YOU think?
Give us your opinion! Do you have any comments/additions
that you would like other visitors to see?
You say:
Mar 20th, 2010
Changes to this page (author)
22 Feb 2010: Enabled abstracts to be shown on Hayato Yamana's author page.25 Jul 2007: Author was edited 24 Jul 2007: Author was edited
25 Jun 2007: Author was edited
25 Jun 2007: Author was added to the bibliography