Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
RCC |
2016-01-29 14:40 |
Osaka |
Kansai University Umekita Laboratory |
A Study on Power Saving for wireless communication in Consensus Problem Kenta Onishi, Koji Ishii (Kagawa Univ.) RCC2015-91 |
In the consensus problem based on wireless communications, several constraint conditions, i.e., communication coverage, ... [more] |
RCC2015-91 pp.25-30 |
RCC, ITS, WBS |
2015-12-17 13:30 |
Okinawa |
Okinawa Industry Support Center |
[Poster Presentation]
Proposal of Distributed Mutually Referenced Equalizer for Wireless Sensor Networks Wataru Yamamoto, Miyajima Teruyuki (Ibaraki Univ) WBS2015-58 ITS2015-30 RCC2015-60 |
In this article, we propose a blind equalization method for wireless sensor networks where each node performs time-domai... [more] |
WBS2015-58 ITS2015-30 RCC2015-60 pp.109-114 |
NLP, CCS |
2015-06-12 09:00 |
Tokyo |
Waseda Univerisity |
Proposal of a Truly Distributed Algorithm for Estimating Algebraic Connectivity of Multi-Agent Network Kazuma Yamane, Norikazu Takahashi (Okayama Univ.) NLP2015-54 CCS2015-16 |
The algebraic connectivity, which is defined by the second smallest eigenvalue of the Laplacian matrix, is an index repr... [more] |
NLP2015-54 CCS2015-16 pp.91-96 |
KBSE |
2015-01-26 16:20 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
A proposal of D-Case based development process in a software development company Nobuhide Kobayashi, Hiroyuki Utsunomiya, Yoshikazu Yamamoto (DENSO CREATE), Shuichiro Yamamoto (Nagoya Univ.) KBSE2014-44 |
Visualization of software development process is useful to provide high quality products. This paper describes the way o... [more] |
KBSE2014-44 pp.31-36 |
CAS, MSS, IPSJ-AL [detail] |
2014-11-20 16:30 |
Okinawa |
Nobumoto Ohama Memorial Hall (Ishigaki island) |
Analysis of Average Consensus Dynamics for Faster Convergence Kenji Nomura, Naoki Hayashi, Shigemasa Takai (Osaka Univ.) CAS2014-97 MSS2014-61 |
In this paper, we consider convergence speed of consensus problems in multi-agent systems.The convergence speed of conse... [more] |
CAS2014-97 MSS2014-61 pp.81-84 |
COMP |
2014-03-10 14:15 |
Tokyo |
|
Randomized consensus algorithm using MRSW registers under oblivious adversary Satoru Nakajima, Michiko Inoue (NAIST) COMP2013-68 |
In this paper, we propose an efficient randomized consensus algorithm in distributed shared register model under an obli... [more] |
COMP2013-68 pp.53-60 |
HCGSYMPO (2nd) |
2013-12-18 - 2013-12-20 |
Ehime |
Matsuyama Multi-Purpose Community Cente |
Supporting consensus-building and management of conversation using tablet terminals Hironobu Takagi, Kazutaka Shimada (Kyutech) |
Problem-based learning (PBL), which is a learning method in small collaborative groups to learn what they need to know i... [more] |
|
KBSE |
2013-09-12 15:10 |
Tokyo |
The University of Electro-Communications |
A study on consensus and decision-making in Goal-Oriented Requirements Analysis
-- Interdisciplinary approach -- Michitaro Okano, Takako Nakatani (Univ. of Tsukuba) KBSE2013-42 |
When we apply goal-oriented analysis, we can introduce two contribution structures between a super goal and its sub goal... [more] |
KBSE2013-42 pp.37-42 |
AI |
2013-07-04 15:45 |
Tokyo |
|
Development and Evaluation on Open Workshop Support System COLLAGREE Yuma Imi, Takayuki Ito, Takanori Ito, Eizou Hideshima (NIT) AI2013-11 |
A new generation of IT enabled web system –such as Twitter, Facebook, and electric social networks – enable ... [more] |
AI2013-11 pp.61-66 |
NLC, TL |
2012-10-27 11:00 |
Hokkaido |
Room R791, Research Bldg., Hakodate Future Univ. |
Discourse analysis of group discussion focusing on facilitator's influence Wataru Sugimoto, Hiroko Otsuka (FUN Hakodate) TL2012-27 NLC2012-26 |
In the social problem solving, there is a growing interest for information sharing, decision-making, and consensus build... [more] |
TL2012-27 NLC2012-26 pp.7-12 |
NS |
2012-01-26 11:10 |
Okinawa |
Ryukyu University |
An agreement protocol for p2p MMOG that is tolerant of entering and leaving Shintaro Enomoto, Naoshi Sakamoto (tdu) NS2011-152 |
For massively on line games such as MMORPG, it is difficult for
client/server models to guarantee scalability for the s... [more] |
NS2011-152 pp.41-46 |
CAS |
2011-01-26 10:30 |
Kumamoto |
Kumamoto University |
Undirected Graphs Maximizing the Second Smallest Eigenvalue of the Graph Laplacian
-- Case where the Average Degree is Less than or Equal to 2 -- Kohnosuke Ogiwara, Norikazu Takahashi (Kyushu Univ.) CAS2010-98 |
We consider the problem of finding undirected graphs maximizing the second
smallest eigenvalue of the graph Laplacian.... [more] |
CAS2010-98 pp.75-79 |
DC |
2008-06-20 13:25 |
Tokyo |
Kikai-Shinko-Kaikan Bldg |
Online Game Protocol for P2P Using Byzantine Agreement Daisuke Wada, Hiromi Kobayashi (Tokai Univ.) DC2008-12 |
This paper presents an online game protocol to prevent dishonest activity called time-cheat for peer to peer (P2P) netwo... [more] |
DC2008-12 pp.7-12 |
NC |
2008-05-23 10:00 |
Ishikawa |
Kanazawa Univ |
[Invited Talk]
Control Theoretical Approach to Multi-Agent Problems Toru Namerikawa (Kanazawa Univ.) NC2008-1 |
This paper deals with control theoretical approach to multi-agent problems and consensus problem for multi-agent systems... [more] |
NC2008-1 pp.1-6 |
ISEC |
2007-09-07 11:40 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
Sender Authenticated Key Agreements Without Random Oracles Chifumi Sato (C4 Technology), Takeshi Okamoto, Eiji Okamoto (Univ. of Tsukuba) ISEC2007-80 |
The purpose of this paper is to study sender authenticated key agreements by a third party, which uses the received para... [more] |
ISEC2007-80 pp.49-55 |
COMP |
2007-03-05 15:55 |
Tokyo |
The University of Electro-Communications |
A Consensus Algorithm Tolerating Adversarial Crash and Probabilistic Omission Taisuke Izumi, Koichi Wada (Nagoya Inst. of Tech.) |
The (uniform) consensus, which is one of fundamental and important
problems for designing fault-tolerant distributed sy... [more] |
COMP2006-58 pp.59-66 |
COMP |
2006-10-17 11:35 |
Miyagi |
Tohoku University |
Byzantine Agreement on the Order of Processing Received Requests is Solvable Deterministically in Asynchronous Systems Junya Nakamura (Toyohashi Univ. of Tech.), Tadashi Araragi (NTT), Shigeru Masuyama (Toyohashi Univ. of Tech.) |
In an asynchronous distributed system, a fault-tolerant method based on system replication has been introduced.
Replica... [more] |
COMP2006-35 pp.33-40 |
DE |
2006-07-14 10:45 |
Niigata |
HOTEL SENKEI |
A Mechanism for Highly-Available OLTP Systems based on Paxos Consensus Hiroshi Horii, Hideki Tai, Gaku Yamamoto (TRL/IBM) |
Demand for highly available (HA) on-line transaction processing system has been increasing these years. However, it is r... [more] |
DE2006-111 pp.115-120 |
COMP |
2005-09-15 16:00 |
Osaka |
Osaka Univ., Toyonaka Campus |
A Weakly-Adaptive Condition-Based Consensus Algorithm in Asynchronous Distributed Systems Taisuke Izumi, Toshimitsu Masuzawa (Osaka Univ.) |
While the (uniform) consensus problem is one of fundamental and
important problems for designing fault-tolerant distri... [more] |
COMP2005-34 pp.43-48 |
SS |
2005-03-14 15:15 |
Ishikawa |
JAIST (IS 5F collabo#7) |
Goal-oriented Requirements Analysis with AHP Yoharu Inoue, Atsushi Ohnishi (Ritsumeikan U.) |
Goal-oriented requirements engineering provides a requirements elicitation by decomposing and revising goals that the ta... [more] |
SS2004-60 pp.25-30 |