|
|
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 # |
SS, DC |
2023-10-11 15:20 |
Nagano |
(Primary: On-site, Secondary: Online) |
Efficient Automatic Classification of Non-Functional Requirements in Information Systems Using Deep Learning
-- A Comparative Accuracy Analysis between BERT and GPT-2 -- Kazuhiro Mukaida (Shinshu Univ.), Seiji Fukui, Takeshi Nagaoka, Takayuki Kitagawa (TOSHIBA), Shinpei Ogata, Kozo Okano (Shinshu Univ.) SS2023-23 DC2023-29 |
Recent Advancements in deep learning are increasingly enabling the automation of classifying non-functional requirements... [more] |
SS2023-23 DC2023-29 pp.13-18 |
SS |
2010-08-05 15:00 |
Hokkaido |
Asahikawa Shimin-Bunka-Kaikan (Civic Culture Hall) |
Reachability Analysis for Timed Systems using Parallel Processing Toshiaki Tanaka, Takeshi Nagaoka, Kozo Okano, Shinji Kusumoto (Osaka Univ.) SS2010-22 |
This report proposes efficient parallel processing of reachability analysis for timed automaton. Our research group has ... [more] |
SS2010-22 pp.35-40 |
SS |
2010-03-08 09:00 |
Kagoshima |
Kagoshima Univ. |
Reachability Analysis for Probabilistic Timed System based on Timed Abstraction Refinement Technique Akihiko Ito, Takeshi Nagaoka, Kozo Okano, Shinji Kusumoto (Osaka Univ.) SS2009-62 |
This paper gives a reachability analysis technique for Probabilistic Timed Automaton (PTA), based on CEGAR loop. The pro... [more] |
SS2009-62 pp.85-90 |
SS |
2009-08-06 14:45 |
Hokkaido |
Kitami Institute of Technology |
Verification for the Real-time Network Systems with the Probabilistic Model Checker and its Comparision with the Network Simulator NS-2 Akihiko Ito, Takeshi Nagaoka, Kozo Okano, Shinji Kusumoto (Osaka Univ.) SS2009-18 |
[more] |
SS2009-18 pp.37-42 |
SS |
2008-03-04 11:25 |
Nagasaki |
Nagasaki Univ. |
Abstraction of Timed Automata Based on Counterexample-Guided Abstraction Refinement Loop Takeshi Nagaoka, Kozo Okano, Shinji Kusumoto (Osaka Univ.) SS2007-74 |
We have proposed a method of model abstraction for timed automata.The proposed method is based on CEGAR (CounterExample... [more] |
SS2007-74 pp.103-108 |
SS |
2007-08-03 11:45 |
Hokkaido |
Hokkaido Univ. |
Abstraction of Extended Timed Automata for UPPAAL Based on Counterexample-Guided Abstraction Refinement Loop Takeshi Nagaoka, Kozo Okano, Shinji Kusumoto (Osaka Univ) SS2007-29 |
In the model checking of the realtime systems, the number of states of models increases exponentlly with the number of t... [more] |
SS2007-29 pp.77-82 |
|
|
|
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]
|