Not enough data to create a plot.
Try a different view from the menu above.
National Institute of Informatics
How Artefacts Influence the Construction of Communications and Contexts during Collaboration in an Agile Software Development Team
Abdullah, Nik Nailah Binti (Mimos Berhad Company) | Sharp, Helen (The Open University) | Honiden, Shinichi (National Institute of Informatics)
We used a stimulus and response method in cognition to consider agents as situated in their specific (Binti Abdullah et al, 2010) to uncover correlation patterns context as it was realized that people are strongly affected of the physical artefact-communication during specific by, and possibly dependent on their environment contexts of communications. We found preliminary empirical (Susi & Ziemke, 2001). With this shift of focus, new interactive evidence that the physical artefacts influence the theories of cognition have emerged. These interactive communication process in a mutually constraining relationship theories such as situated cognition (Clancey, 1997), with the contexts. In which the context is made up and distributed cognition (Hutchins, 1999), are noted for of the teams' practice that includes how they collaborate, their emphasis on the relationship between cognition, and the physical setting, situations, and participation role.
The Multi-Round Balanced Traveling Tournament Problem
Hoshino, Richard (National Institute of Informatics) | Kawarabayashi, Ken-ichi (National Institute of Informatics)
Given an n -team sports league, the Traveling Tournament Problem (TTP) seeks to determine an optimal double round-robin schedule minimizing the sum total of distances traveled by the n teams as they move from city to city. In the TTP, the number of "rounds" is fixed at r = 2. In this paper, we propose the Multi-Round Balanced Traveling Tournament Problem (mb-TTP), inspired by the actual league structure of Japanese professional baseball, where n = 6 teams play 120 intra-league games over r = 8 rounds, subject to various constraints that ensure competitive balance. These additional balancing constraints enable us to reformulate the 2 k -round mb-TTP as a shortest path problem on a directed graph, for all k >= 1. We apply our theoretical algorithm to the 6-team Nippon (Japanese) Professional Baseball Central League, creating a distance-optimal schedule with 57836 kilometres of total travel, a 26.8% reduction compared to the 79067 kilometres traveled by these six teams during the 2010 regular season.
Evaluating Abductive Hypotheses using an EM Algorithm on BDDs
Inoue, Katsumi (National Institute of Informatics) | Sato, Taisuke (Tokyo Institute of Technology) | Ishihata, Masakazu (Tokyo Institute of Technology) | Kameya, Yoshitaka (Tokyo Institute of Technology) | Nabeshima, Hidetomo (University of Yamanashi)
Abductive inference is an important AI reasoning technique to find explanations of observations, and has recently been applied to scientific discovery. To find best hypotheses among many logically possible hypotheses, we need to evaluate hypotheses obtained from the process of hypothesis generation. We propose an abductive inference architecture combined with an EM algorithm working on binary decision diagrams (BDDs). This work opens a way of applying BDDs to compress multiple hypotheses and to select most probable ones from them. An implemented system has been applied to inference of inhibition in metabolic pathways in the domain of systems biology.