|
|
All Technical Committee Conferences (Searched in: All Years)
|
|
Search Results: Conference Papers |
Conference Papers (Available on Advance Programs) (Sort by: Date Descending) |
|
Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
WBS, IT, ISEC |
2009-03-10 14:50 |
Hokkaido |
Hakodate Mirai Univ. |
Composition of functionalities in UC framework Tadashi Araragi (NTT), Chunhua Su, Kouichi Sakurai (Kyushu Univ.) IT2008-89 ISEC2008-147 WBS2008-102 |
This paper initiates a comprehensive approach for design method for functionality in UC framework. By combining some fun... [more] |
IT2008-89 ISEC2008-147 WBS2008-102 pp.295-299 |
COMP |
2007-09-20 11:10 |
Aichi |
|
Techniques to Accelerate Request Processing for Byzantine Fault Tolerance Junya Nakamura (Toyohashi Univ. of Tech.), Tadashi Araragi (NTT), Shigeru Masuyama (Toyohashi Univ. of Tech.) COMP2007-34 |
[more] |
COMP2007-34 pp.13-20 |
AI |
2006-11-10 11:30 |
Kyoto |
|
Automatic Mapping Mechanism for OWL Ontologies and Its Evaluation Takamichi Sakai, Tadashi Araragi (NTT) |
To ensure semantic interoperability, utilizing ontologies has been suggested. However, in an open and global environment... [more] |
AI2006-15 pp.19-24 |
AI |
2006-11-10 13:50 |
Kyoto |
|
[Tutorial Lecture]
Verification Methods for Security Protocols (2)
-- Around Abadi-Rogaway logic -- Tadashi Araragi (NTT CS labs) |
[more] |
|
AI |
2006-11-10 14:45 |
Kyoto |
|
On the combination of functionalities for key exchange protocol Kenji Imamoto (Kyushu Univ.), Tadashi Araragi (NTT), Kouichi Sakurai (Kyushu Univ.) |
[more] |
AI2006-17 pp.29-33 |
AI |
2006-11-10 15:15 |
Kyoto |
|
Mechanization of Task-PIOA based Proving Procedure for Realization of Ideal Functionality Tadashi Araragi (NTT) |
[more] |
AI2006-18 pp.35-39 |
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 |
AI |
2005-10-21 13:00 |
Kyoto |
|
[Tutorial Lecture]
The Basics of Formal Verification (model check algorithm)
-- SMV、SPIN、Athena -- Tadashi Araragi (NTT) |
[more] |
|
AI |
2005-10-21 14:35 |
Kyoto |
|
Formal Verification of Crash Failure Tolerance Algorithm(口頭発表)
-- Formal Verification of Distributed Systems in Unbounded Number of Processes -- Pierre Metrailler (EPFL), Tadashi Araragi (NTT) |
[more] |
|
AI |
2005-10-21 15:10 |
Kyoto |
|
Checking Liveness Properties of Concurrent Systems by Using Reinforcement Learning Tadashi Araragi (NTT), Seung Mo Cho (Samsung) |
[more] |
AI2005-19 pp.25-30 |
COMP |
2005-01-28 10:55 |
Aichi |
Nagoya University |
An Asynchronous Distributed Branch and Bound for Load Balancing Atsushi Sasaki, Tadashi Araragi (NTT), Shigeru Masuyama (Toyohashi Univ. of Tech.) |
We propose a new asynchronous distributed branch and bound algorithm for a load balancing problem in which each variable... [more] |
COMP2004-63 pp.23-32 |
|
|
|
Copyright and reproduction :
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
|
[Return to Top Page]
[Return to IEICE Web Page]
|