Aida, Shin
Affiliation | Department of Computer Science and Engineering |
---|---|
Title | Assistant Professor |
Fields of Research | Theory of computational complexity / Algorithm theory |
Degree | Ph.D (Nagoya University) |
Academic Societies | Department of Computer Science and Engineering |
aida@ Please append "tut.jp" to the end of the address above. |
|
Researcher information URL(researchmap) | Researcher information |
Research
Theories of algorithm and computational complexity have been centered in computer science. The goal of the former is to find a solution for some given discrete problem efficiently; one of the latter is to search some hard problems which never been solved by any efficient computational way. These theories have contributed many results to our computer-controlled society so far, such as increasing efficiency for some network flow problems and verifying security of cryptographic communication.
My research interests are:
(1) constructing an algorithm solving graph isomorphism problem;
(2) clarifying relation among complexity classes recognized by alternating Turing machines and existing classes.
Theme2:Rescue and reconstruction assistance based on informatics
Overview
In the early stages of the Great East Japan Earthquake, a vast number of tweets were related to high-urgency rescue requests; however, most of these tweets were buried under many other tweets, including some well-intentioned retweets of the rescue
requests. To better handle such a situation, we have developed and published a website that automatically lists similar statements to extract rescue requests from Twitter on March 16, 2011. We analysis not only the technology of the system but also the start of a rescue project #99japan. The project takes particular note of the progress and completion reports of the rescue situations. uses this site as sources of rescue information. Note that #99japan originated from a thread of
the Japanese textboard 2channel, which was launched by some volunteers within two hours of the disaster's occurrence.