Updated on 2022/09/26

写真a

 
HONIDEN, Shinichi
 
Affiliation
Faculty of Science and Engineering, Global Center for Science and Engineering
Job title
Professor(without tenure)
Profile

Professor,
Faculty of Science and Engineering,
Waseda University

Director,
Center for Global Research in Advanced Software Science and Engineering (GRACE Center)
National Institute of Informatics (NII)

Visiting Professor,
UCL (University College London) in the UK

Concurrent Post

  • Faculty of Science and Engineering   Graduate School of Fundamental Science and Engineering

Research Institute

  • 2020
    -
    2022

    理工学術院総合研究所   兼任研究員

Degree

  • Ph.D

Research Experience

  • 2008.04
    -
    Now

    National Institute of Informatics

  • 2007
    -
    Now

    英国UCL(University College London)   客員教授

  • 2012
    -
    2018

    National Institute of Informatics   Deputy Director General

  • 2001
    -
    2018

    The University of Tokyo   The Graduate School of Information Science and Technology

  • 2000
    -
    2018

    National Institute of Informatics

  • 2004
    -
    2013

    National Institute of Informatics   National Institute of Informatics

  • 1978
    -
    2000

    Toshiba Corporation

▼display all

Professional Memberships

  •  
     
     

    IEEE

  •  
     
     

    ACM

  •  
     
     

    人工知能学会

  •  
     
     

    情報処理学会

  •  
     
     

    ソフトウェア科学会

 

Research Areas

  • Computer system

  • Software

  • Information network

Research Interests

  • ソフトウェア工学

  • 分散システム

  • エージェント

Papers

  • Self-adaptive Hydroponics Care System for Human-hydroponics Coexistence

    Jialong Li, Zhenyu Mao, Zhen Cao, Kenji Tei, Shinichi Honiden

    2021 IEEE 3rd Global Conference on Life Sciences and Technologies (LifeTech)    2021.03

    DOI

  • Self-adaptive Hydroponics Care System for Human-hydroponics Coexistence.

    Jialong Li, Zhenyu Mao, Zhen Cao, Kenji Tei, Shinichi Honiden

        204 - 206  2021

    DOI

  • Smart SE: Smart Systems and Services Innovative Professional Education Program

    Hironori Washizaki, Kenji Tei, Kazunori Ueda, Hayato Yamana, Yoshiaki Fukazawa, Shinichi Honiden, Shoichi Okazaki, Nobukazu Yoshioka, Naoshi Uchihira

    2020 IEEE 44th Annual Computers, Software, and Applications Conference (COMPSAC)    2020.07

    DOI

  • Error-oriented Mutant Reduction and Mutant Weighting for Reliable Mutation Testing

      61 ( 4 ) 945 - 956  2020.04  [Refereed]

     View Summary

    A lot of researchers proposed various techniques to accelerate mutation testing by mutant reduction. Analyzing the limits of mutant reduction is one of the important research topics. However, existing methods still have problems in terms of excessive mutant reduction and errors in mutation scores after the reduction. In this paper, we propose a technique for highly reliable mutation score measurement to prevent excessive reduction of mutants by selecting mutants covering kinds of errors caused during mutation analysis and by weighting selected mutants. As a result of evaluation using OSS, we achieved about 40% reduction in execution time by the mutant selection method based on greedy algorithm, though the reduction was inferior to the existing method. Furthermore, an experiment that measured a mutation score of the test which artificially lowered the bug detectability in order to evaluate the effect of the excessive mutant reduction showed the proposed technique enable less error of the mutation score than the existing technique.

    CiNii

  • 違反状態抽象化による保証可能な安全性特定のための分析空間削減

    相澤和也, 鄭 顕志, 本位田 真一

    電子情報通信学会論文誌 D   J103-D ( 4 ) 238 - 246  2020.04  [Refereed]

  • A game analysis algorithm for identifying safety properties guaranteeable while satisfying a liveness property

    Kazuya Aizawa, Kenji Tei, Shinichi Honiden

       2020  [Refereed]

  • Updating Environment Model at Runtime for Self-adaptive System

    Moeka Tanabe, Kenji Tei, Shinichi Honiden

    IPSJ Journal   60 ( 10 ) 1617 - 1630  2019.10  [Refereed]

  • ミュータント削減手法の高信頼化に向けて

    徳本 晋, 本位田 真一

    ソフトウェアエンジニアリングシンポジウム2019論文集   ( 2019 ) 106 - 115  2019.08

    CiNii

  • Analysis space reduction with state merging for ensuring safety properties of self-adaptive systems

    Kazuya Aizawa, Kenji Tei, Shinichi Honiden

    The 16th IEEE International Conference on Advanced and Trusted Computing (ATC 2019)    2019.08  [Refereed]

     View Summary

    to appear

  • Modelling and Analysing Resilient Cyber-Physical Systems

    Amel Bennaceur, Carlo Ghezzi, Kenji Tei, Timo Kehrer, Danny Weyns, Radu Calinescu, Schahram Dustdar, Zhenjiang Hu, Shinichi Honiden, Fuyuki Ishikawa, Zhi Jin, Jeffrey Kramer, Marin Litoiu, Michele Loreti, Gabriel Moreno, Hausi Muller, Laura Nenzi, Bashar Nuseibeh, Liliana Pasquale, Wolfgang Reisig, Heinz Schmidt, Christos Tsigkanos, Haiyan Zhao

    The 14th Symposium on Software Engineering for Adaptive and Self-Managing Systems 2019 (SEAMS 2019, NIER Paper)     70 - 76  2019.05  [Refereed]

  • 環境変化時に保証可能な安全性を特定するためのゲーム分析アルゴリズム

    相澤和也, 鄭顕志, 本位田真一

    情報処理学会論文誌   60 ( 4 ) 1025 - 1039  2019.04  [Refereed]

  • Change Impact Analysis for Refinement-based Formal Specification

    Shinnosuke Saruwatari, Fuyuki Ishikawa, Tsutomu Kobayashi, Shinichi Honiden

    IEICE Transactions on Information and Systems, Special Issue on Formal Approach   Accepted  2019.03  [Refereed]

  • Engineering Adaptive Software Systems

    Yijun Yu, Arosha K. Bandara, Shinichi Honiden, Zhenjiang Hu, Tetsuo Tamai, Hausi A. Muller, John Mylopoulos, Bashar Nuseibeh

    Communications of NII Shonan Meetings    2019.02  [Refereed]

  • Consistency-preserving refactoring of refinement structures in Event-B models

    Tsutomu Kobayashi, Fuyuki Ishikawa, Shinichi Honiden

    Formal Aspects of Computing   31 ( 3 ) 287 - 320  2019.02  [Refereed]

  • Dynamic Update of Discrete Event Controllers

    L. Nahabedian, V. Braberman, N. DIppolito, S. Honiden, J. Kramer, K. Tei, S. Uchitel

    IEEE Transactions on Software Engineering (TSE)    2018.10  [Refereed]

     View Summary

    Accepted/In press

    DOI

  • Identifying safety properties guaranteed in changed environment at runtime

    Kazuya Aizawa, Kenji Tei, Shinichi Honiden

    the 3rd IEEE International Conference on Agents (ICA 2018)     75 - 80  2018.09  [Refereed]

    DOI

  • Applicability of Earned Value Management for Deadline Energy Constrained Applications

    Shunichiro Suenaga, Kenji Tei, Shinichi Honiden

    IEEM 2017    2017.12  [Refereed]

  • Extracting Traceability between Predicates in Event-B Refinement

    Shinnosuke Saruwatari, Fuyuki Ishikawa, Tsutomu Kobayashi, Shinichi Honiden

    The 24th Asia-Pacific Software Engineering Conference (APSEC 2017)     61 - 70  2017.12  [Refereed]

    DOI

  • Construction of Abstract State Graphs for Understanding Event-B Models

    Daichi Morita, Fuyuki Ishikawa, Shinichi Honiden

    Symposium on Dependable Software Engineering (SETTA 2017)     250 - 265  2017.10  [Refereed]

  • Test Suite Reduction in Idempotence Testing of Infrastructure as Code

    Katsuhiro Ikeshita, Fuyuki Ishikawa, Shinichi Honiden

    The 11th International Conference on Tests and Proofs (TAP 2017)     98 - 115  2017.07  [Refereed]

  • Formal Verification of Dynamic Evolution Processes of UML Models Using Aspects

    Yasuyuki Tahara, Akihiko Ohsuga, Shinichi Honiden

    Proceedings of the 12th International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS2017)     152 - 162  2017.06  [Refereed]

    DOI

  • Learning environment model at runtime for self-adaptive systems

    Moeka Tanabe, Kenji Tei, Yoshiaki Fukazawa, Shinichi Honiden

    Proceedings of the ACM Symposium on Applied Computing   128005   1198 - 1204  2017.04  [Refereed]

     View Summary

    Self-adaptive systems alter their behavior in response to environmental changes to continually satisfy their requirements. Self-adaptive systems employ an environment model, which should be updated during runtime to maintain consistency with the real environment. Although some techniques have been proposed to learn environment model based on execution traces at the design time, these techniques are time consuming and consequently inappropriate for runtime learning. Herein, a technique using a stochastic gradient descent and the difference in the data acquired during the run-time is proposed as an efficient learning environment model. The computational time and accuracy of our technique are verified through a case study.

    DOI

  • Fast Live Migration for IO-Intensive VMs with Parallel and Adaptive Transfer of Page Cache via SAN

    Soramichi Akiyama, Takahiro Hirofuchi, Ryousei Takano, Shinichi Honiden

    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS   E99D ( 12 ) 3024 - 3034  2016.12  [Refereed]

     View Summary

    Live migration plays an important role on improving efficiency of cloud data centers by enabling dynamically replacing virtual machines (VMs) without disrupting services running on them. Although many studies have proposed acceleration mechanisms of live migration, IO-intensive VMs still suffer from long total migration time due to a large amount of page cache. Existing studies for this problem either force the guest OS to delete the page cache before a migration, or they do not consider dynamic characteristics of cloud data centers. We propose a parallel and adaptive transfer of page cache for migrating IO-intensive VMs which (1) does not delete the page cache and is still fast by utilizing the storage area network of a data center, and (2) achieves the shortest total migration time without tuning hand-crafted parameters. Experiments showed that our method reduces total migration time of IO-intensive VMs up to 33.9%.

    DOI

  • Generating Specification for Automated Warehouse System by Hieratical Discrete Controller Synthesis

    Masaki Katae, Kenji Tei, Yoshiaki Fukazawa, Shinichi Honiden

    合同エージェントワークショップ&シンポジウム2016 (JAWS2016)     1 - 8  2016.09  [Refereed]

  • Relaxing Requirements with Environment Changes for Graceful Degradation

    Kazuya Aizawa, Kenji Tei, Yoshiaki Fukazawa, Shinichi Honiden

    5th Asian Workshop of Advanced Software Engineering    2016.03  [Refereed]

  • Robust Service Compositions with Functional and Location Diversity

    Florian Wagner, Fuyuki Ishikawa, Shinichi Honiden

    IEEE TRANSACTIONS ON SERVICES COMPUTING   9 ( 2 ) 277 - 290  2016.03  [Refereed]

     View Summary

    Service composition provides a means of customized and flexible integration of service functionalities. Quality-of-service (QoS) optimization algorithms select services to adapt workflows to the non-functional requirements of the user. With increasing number of services in a workflow, previous approaches fail to achieve a sufficient reliability. Moreover, expensive ad-hoc replanning is required to deal with service failures. The major problem with such sequential application of planning and replanning is that it ignores the potential costs during the initial planning and they consequently are hidden from the decision maker. Our idea to overcome this problem is to compute a QoS optimized selection of service clusters that includes a sufficient number of backup services for each service employed. These backup services should be sufficiently distributed to prevent a task failure in case of, e.g., a network failure. To support the decision maker in the selection task, our multi-objective approach considers the possible repair costs directly in the initial composition. Our graphical user interface visualizes the resulting QoS of the workflow and the location of the services to enable the decision maker to select compositions in line with risk preferences. We prove the benefits of our approach in our detailed evaluation.

    DOI

  • Reachability Analysis for Electric Cars: Project Management Inspired Approach

    Shunichiro Suenaga, Shinichi Honiden

    23rd ITS World Congress    2016  [Refereed]

  • MuVM: Higher Order Mutation Analysis Virtual Machine for C

    Susumu Tokumoto, Kazunori Sakamoto, Hiroaki Yoshida, Shinichi Honiden

    2016 9TH IEEE INTERNATIONAL CONFERENCE ON SOFTWARE TESTING, VERIFICATION AND VALIDATION (ICST)     320 - 329  2016  [Refereed]

     View Summary

    Mutation analysis is a method for evaluating the effectiveness of a test suite by seeding faults artificially and measuring the fraction of seeded faults detected by the test suite. The major limitation of mutation analysis is its lengthy execution time because it involves generating, compiling and running large numbers of mutated programs, called mutants. Our tool MuVM achieves a significant runtime improvement by performing higher order mutation analysis using four techniques, metamutation, mutation on virtual machine, higher order split-stream execution, and online adaptation technique. In order to obtain the same behavior as mutating the source code directly, metamutation preserves the mutation location information which may potentially be lost during bitcode compilation and optimization. Mutation on a virtual machine reduces the compilation and testing cost by compiling a program once and invoking a process once. Higher order split-stream execution also reduces the testing cost by executing common parts of the mutants together and splitting the execution at a seeded fault. Online adaptation technique reduces the number of generated mutants by omitting infeasible mutants. Our comparative experiments indicate that our tool is significantly superior to an existing tool, an existing technique (mutation schema generation), and no-split-stream execution in higher order mutation.

    DOI

  • Refactoring Refinement Structure of Event-B Machines

    Tsutomu Kobayashi, Fuyuki Ishikawa, Shinichi Honiden

    FM 2016: FORMAL METHODS   9995   444 - 459  2016  [Refereed]

     View Summary

    Refinement in formal specifications has received significant attention as a method to gradually construct a rigorous model. Although refactoring methods for formal specifications have been proposed, there are no methods for refactoring of refinement structures in formal specifications. In this paper, we describe a method to restructure refinements in specifications of Event-B, a formal specification method with supports for refinement. The core of our method is decomposition of refinements. Namely, when an abstract Event-B machine A, a concrete machine C refining A, and a slicing strategy are provided, our method constructs a consistent intermediate machine B, which refines A and is refined by C. We show effectiveness of our methods through two case studies on representative usages of our method: decomposition of large-scale refinements and extraction of reusable parts of specifications.

    DOI

  • Automatic Generation of Potentially Pathological Instances for Validating Alloy Models

    Takaya Saeki, Fuyuki Ishikawa, Shinichi Honiden

    FORMAL METHODS AND SOFTWARE ENGINEERING, ICFEM 2016   10009   41 - 56  2016  [Refereed]

     View Summary

    Alloy is a formal specification language that is widely used to verify software systems. However, while users can verify the properties of a specification with Alloy, it is not so easy for them to validate the specification, that is, to check that the specification is written just as the users intended. Alloy Analyzer, a tool supporting Alloy, has a feature to show concrete instances satisfying specifications that can be help in validation, but it does not control the order in which the instances are shown. Many studies have been conducted on ordering to help users explore instances in structured ways. However, not much prior research has focused on proper ways to explore instances for validating specifications. In this paper, we propose a method to assist users in validating specifications by displaying a set of instances that tend to include problems when their specifications have defects. In particular, the method applies pairwise testing to relations of Alloy specifications. We show effectiveness of the method in experiments using mutation analysis.

    DOI

  • Stepwise Refinement of Software Development Problem Analysis

    Tsutomu Kobayashi, Fuyuki Ishikawa, Shinichi Honiden

    CONCEPTUAL MODELING, ER 2016   9974   488 - 495  2016  [Refereed]

     View Summary

    The Problem Frames approach has attracted attention because it enables developers to carefully analyze problems in a reasonable manner. Despite that this approach decomposes a problem into subproblems before the analysis is conducted, developers are still faced with a complex analysis when they consider interactions between the various subproblems. Moreover, progressive evolution of requirements is important for flexible development. In this paper, we propose methods to analyze multiple abstraction layers of a problem. Our methods help developers to construct abstract versions of a problem and find relationships between abstract problems and concrete problems. Moreover, our methods support refinement of arguments such that the properties of the abstract problem are preserved in the concrete problem. Therefore, our methods enable developers to divide up arguments into multiple abstraction layers and thus mitigate the complexity of argumentation. We carried out preliminary experiments on abstracting problems and constructing reasonable arguments. Our methods are expected to enable developers to analyze problems in a reasonable manner with less complexity and thus make problem analysis easier.

    DOI

  • Assured and Correct Dynamic Update of Controllers

    L. Nahabedian, V. Braberman, N. D'Ippolito, S. Honiden, J. Kramer, K. Tei, S. Uchitel

    PROCEEDINGS OF 2016 IEEE/ACM 11TH INTERNATIONAL SYMPOSIUM ON SOFTWARE ENGINEERING FOR ADAPTIVE AND SELF-MANAGING SYSTEMS (SEAMS)     96 - 107  2016  [Refereed]

     View Summary

    In many application domains, continuous operation is a desirable attribute for software-intensive systems. As the environment or system requirements change, so the system should change and adapt without stopping or unduly disturbing its operation. There is, therefore, a need for sound engineering techniques that can cope with dynamic change. In this paper we address the problem of dynamic update of controllers in reactive systems when the specification (environment assumptions, requirements and interface) of the current system changes. We present a general approach to specifying correctness criteria for dynamic update and a technique for automatically computing a controller that handles the transition from the old to the new specification, assuring that the system will reach a state in which such a transition can correctly occur. Indeed, using controller synthesis we show how to automatically build a controller that guarantees both progress towards update and safe update. Seven case studies have been implemented to validate the approach.

    DOI

  • Abstract rewriting approach to solve datalog programs

    Fernando Tarin Morales, Fuyuki Isihikawa, Shinichi Honiden

    DBPL 2015 - Proceedings of the 15th Symposium on Database Programming Languages     29 - 36  2015.10  [Refereed]

     View Summary

    Over the past decade, we have seen a resurgence in the Datalog language in different computing areas for solving a number of nontrivial problems. In this paper we introduce a novel resolution approach to solve Datalog programs. We present a version of the technique that works on plain Datalog programs. We have developed an abstract rewriting formalism to create a functional resolution process for Datalog. The resolution approach translates the Datalog resolution strategy into a fix-point abstract rewriting equation system. Being an abstract rewriting formalism, every equation of the system can be viewed as a function. Based on this fact, we also developed an optimization process that improves the initial rewriting equation system. The optimization process generates an equation system that computes the solutions much more efficiently. Well known optimizations such as strength reduction or memoization have been used. We also developed a prototype compiler that encodes the optimized equation system into a solver. Experimental results obtained with the solver suggest execution times several orders of magnitude better than modern Prolog solvers like YAP or XSB and usually one order of magnitude faster than state-of-the-art Datalog solvers such as BDDBDDB and DLV.

    DOI

  • Feedback-controlled random test generation

    Kohsuke Yatoh, Kazunori Sakamoto, Fuyuki Ishikawa, Shinichi Honiden

    2015 International Symposium on Software Testing and Analysis, ISSTA 2015 - Proceedings     316 - 326  2015.07  [Refereed]

     View Summary

    Feedback-directed random test generation is a widely used technique to generate random method sequences. It leverages feedback to guide generation. However, the validity of feedback guidance has not been challenged yet. In this paper, we investigate the characteristics of feedback-directed random test generation and propose a method that exploits the obtained knowledge that excessive feedback limits the diversity of tests. First, we show that the feedback loop of feedback-directed generation algorithm is a positive feedback loop and amplifies the bias that emerges in the candidate value pool. This over-directs the generation and limits the diversity of generated tests. Thus, limiting the amount of feedback can improve diversity and effectiveness of generated tests. Second, we propose a method named feedbackcontrolled random test generation, which aggressively controls the feedback in order to promote diversity of generated tests. Experiments on eight different, real-world application libraries indicate that our method increases branch coverage by 78% to 204% over the original feedback-directed algorithm on large-scale utility libraries. Copyright is held by the owner/author(s).

    DOI

  • Mobile Augmented Reality Gaming for Daily Activity Learning and Satisfaction

    Natsumi Asahara, Keita Higuchi, Soramichi Akiyama, Shinichi Honiden

    ACM CHI 2015 Symposium on Emerging Japanese HCI Research Collection    2015.04  [Refereed]

  • Model-Driven-Development-Based Stepwise Software Development Process for Wireless Sensor Networks

    Kenji Tei, Ryo Shimizu, Yoshiaki Fukazawa, Shinichi Honiden

    IEEE Transactions on Systems, Man, and Cybernetics: Systems   45 ( 4 ) 675 - 687  2015  [Refereed]

  • An Application Conflict Detection and Resolution System for Smart Homes

    Miki Yagita, Fuyuki Ishikawa, Shinichi Honiden

    2015 IEEE/ACM 1st International Workshop on Software Engineering for Smart Cyber-Physical Systems (SEsCPS)     33 - 39  2015  [Refereed]

     View Summary

    One of the applications of Cyber-Physical Systems (CPSs) is the Smart Homes. In Smart Homes, multiple apps operate the sensors and actuators to provide rich user experience in a living environment. Because actuators are entities that affect the surrounding environment, conflicts may occur if two or more apps are running simultaneously, especially when they try to use a single actuator or when they use different actuators causing different effects. There have been attempts to resolve these conflicts at app installation time. However the state-of-the-art solutions can detect conflicts only if the apps actuate on devices with conditions based on time, and resolute conflicts by creating a total order between all apps, regardless of the situations of the conflicts. In this paper, we create a Kripke structure to detect conflicts by model-checking the assertion "no two apps use actuators to create different effects at the same location". Our proposed system, which provides install-time conflict detection, enables detection of application conflicts triggered by conditions based on events. In addition, it supports users in prioritising apps by reducing the number of conflicts by dividing them into groups of the same situation which are meaningful to the users. By prioritising apps for each situation, rather than creating a total order, our system allows the apps to run in a more flexible way.

    DOI

  • Investigating Country Differences in Mobile App User Behavior and Challenges for Software Engineering

    Soo Ling Lim, Peter J. Bentley, Natalie Kanakam, Fuyuki Ishikawa, Shinichi Honiden

    IEEE TRANSACTIONS ON SOFTWARE ENGINEERING   41 ( 1 ) 40 - 64  2015.01  [Refereed]

     View Summary

    Mobile applications (apps) are software developed for use on mobile devices and made available through app stores. App stores are highly competitive markets where developers need to cater to a large number of users spanning multiple countries. This work hypothesizes that there exist country differences in mobile app user behavior and conducts one of the largest surveys to date of app users across the world, in order to identify the precise nature of those differences. The survey investigated user adoption of the app store concept, app needs, and rationale for selecting or abandoning an app. We collected data from more than 15 countries, including USA, China, Japan, Germany, France, Brazil, United Kingdom, Italy, Russia, India, Canada, Spain, Australia, Mexico, and South Korea. Analysis of data provided by 4,824 participants showed significant differences in app user behaviors across countries, for example users from USA are more likely to download medical apps, users from the United Kingdom and Canada are more likely to be influenced by price, users from Japan and Australia are less likely to rate apps. Analysis of the results revealed new challenges to market-driven software engineering related to packaging requirements, feature space, quality expectations, app store dependency, price sensitivity, and ecosystem effect.

    DOI

  • Supporting Model Transformation Developments with Multi-Level Models: A Wireless Sesnor Network Case

    Ryo Shimizu, Kenji Tei, Yoshiaki Fukazawa, Shinichi Honiden

    The 11th International Conference Applied Computing 2014 (AC 2014)     25 - 27  2014.10  [Refereed]

  • SanGA: A Self-Adaptive Network-Aware Approach to Service Composition

    Adrian Klein, Fuyuki Ishikawa, Shinichi Honiden

    IEEE TRANSACTIONS ON SERVICES COMPUTING   7 ( 3 ) 452 - 464  2014.07  [Refereed]

     View Summary

    Service-Oriented Computing enables the composition of loosely coupled services provided with varying Quality of Service (QoS) levels. Selecting a near-optimal set of services for a composition in terms of QoS is crucial when many functionally equivalent services are available. As the number of distributed services, particularly in the cloud, is rising rapidly, the impact of the network on the QoS keeps increasing. Despite this, current approaches do not differentiate between the QoS of services themselves and the network. Therefore, the computed latency differs from the actual latency, resulting in suboptimal QoS. Thus, we propose a network-aware approach that handles the QoS of services and the QoS of the network independently. First, we build a network model in order to estimate the network latency between arbitrary services and potential users. Our selection algorithm then leverages this model to find compositions with a low latency for a given execution policy. We employ a self-adaptive genetic algorithm which balances the optimization of latency and other QoS as needed and improves the convergence speed. In our evaluation, we show that our approach works under realistic network conditions, efficiently computing compositions with much lower latency and otherwise equivalent QoS compared to current approaches.

    DOI

  • An approach for evaluating and suggesting method names using N-gram models

    Takayuki Suzuki, Kazunori Sakamoto, Fuyuki Ishikawa, Shinichi Honiden

    22nd International Conference on Program Comprehension, ICPC 2014 - Proceedings     271 - 274  2014.06  [Refereed]

     View Summary

    Method names are important for the software development process. It has been shown by some studies that the quality of method names affects software comprehension. In response, some approaches that evaluate comprehensibility of method names have been proposed. However, the effectiveness of existing approaches is limited because they focus on part of names. To deal with the limitation, we propose a novel approach for evaluating comprehensibility of method names and suggesting comprehensible method names using n-gram models. We implemented a prototype tool and conducted two experiments as a case study. Our experiments show that our approach can correctly evaluate 75% method names and successfully suggest 92% actual third words of method names.

    DOI

  • Sample Efficiency Improvement on Neuroevolution via Estimation-Based Elimination Strategy

    Shengbo Xu, Yuki Inoue, Tetsunari Inamura, Hirotaka Moriguchi, Shinichi Honiden

    The 13th International Conference on Autonomous Agents and Multiagent Systems (AAMAS2014)     1537 - 1538  2014.05  [Refereed]

  • Evaluating Impact of Live Migration on Data Center Energy Saving

    Soramichi Akiyama, Takahiro Hirofuchi, Shinichi Honiden

    2014 IEEE 6TH INTERNATIONAL CONFERENCE ON CLOUD COMPUTING TECHNOLOGY AND SCIENCE (CLOUDCOM)     759 - 762  2014  [Refereed]

     View Summary

    Energy efficiency of cloud data centers is of great concern today and has been tackled by many researchers. Dynamic VM placement is a well-known strategy to improve energy efficiency of a data center. Virtual machines (VMs) under light load are consolidated into a small number of physical machines (PMs) to turn idle PMs into low-power states. Although live migration is essential for dynamic VM placement, former studies have not yet revealed how energy overhead of live migration has impact on energy efficiency of dynamic VM placement. To tackle this problem, we conducted integrated simulation of energy overhead of live migration and dynamic VM placement using SimGrid. We used three dynamic VM placement policies and two live migration mechanisms (existing pre-copy and an accelerated mechanism invented by us) to thoroughly evaluate the energy overhead. The results showed that in the worst case energy overhead of live migration occupies 5.8% of total energy consumption of a data center.

    DOI

  • Toward A Portability Framework with Multi-Level Models for Wireless Sensor Network Software

    Ryo Shimizu, Kenji Tei, Yoshiaki Fukazawa, Shinichi Honiden

    2014 INTERNATIONAL CONFERENCE ON SMART COMPUTING (SMARTCOMP)     3 - 5  2014  [Refereed]

     View Summary

    Wireless sensor networks (WSNs) play important roles in systems that interact with the real world (e.g., cyber-physical systems and internet of things). To mitigate the complex nature of WSNs, many platforms at different abstraction levels (e.g., abstraction of hardware, communications, and individual nodes) have been proposed in the last decade. WSNs in different environments might employ different platforms to satisfy nonfunctional requirements (NFRs) because the diversity of platforms results in trade-offs of NFRs and the quality of WSN heavily depends on the environment it runs. Although WSN software should be highly portable, existing approaches only support porting between operating systems and not more abstract middleware. Herein we propose a methodology with a framework to capture various platforms in the WSN domain with platform-independent multi-level models. A case study demonstrates that our framework can port WSN software to platforms at different abstraction levels and adapt the software to the new platform to improve performance.

    DOI

  • Validating Ajax applications using a delay-based mutation technique

    Yuta Maezawa, Kazuki Nishiura, Shinichi Honiden, Hironori Washizaki

    ASE 2014 - Proceedings of the 29th ACM/IEEE International Conference on Automated Software Engineering     491 - 501  2014  [Refereed]

     View Summary

    The challenge of validating Asynchronous JavaScript and XML (Ajax) applications lies in actual errors exposed in a user environment. Several studies have proposed effective and efficient testing techniques to identify executable faults. However, the applications might have faults that are not executed during testing, but might cause actual errors in a user environment. Although we have investigated static methods for finding "potential faults" that seem to cause actual errors if executed, developers need to confirm whether or not the potential faults are actually executable. Herein, we propose a mutation-based testing method implemented in a tool called JSPreventer. Even if the potential faults are not easily executable in a given environment, our method mutates the applications until they are executable using two delay-based mutation operators to manipulate the timing of the applications handling interactions. Thus, JSPreventer provides executable evidences of the not-easily-executable faults for developers, if it reveals actual errors by testing the mutated applications. We applied our method to real-world applications and found actual errors that developers could debug to improve their reliability. Therefore, JSPreventer can help developers validate reliable real-world Ajax applications.

    DOI

  • Fast Live Migration with Small IO Performance Penalty by Exploiting SAN in Parallel

    Soramichi Akiyama, Takahiro Hirofuchi, Ryousei Takano, Shinichi Honiden

    2014 IEEE 7TH INTERNATIONAL CONFERENCE ON CLOUD COMPUTING (CLOUD)     40 - 47  2014  [Refereed]

     View Summary

    Virtualization techniques greatly benefit cloud computing. Live migration enables a datacenter to dynamically replace virtual machines (VMs) without disrupting services running on them. Efficient live migration is the key to improve the energy efficiency and resource utilization of a datacenter through dynamic placement of VMs. Recent studies have achieved efficient live migration by deleting the page cache of the guest OS to shrink the memory size of it before a migration. However, these studies do not solve the problem of IO performance penalty after a migration due to the loss of page cache. We propose an advanced memory transfer mechanism for live migration, which skips transferring the page cache to shorten total migration time while restoring it transparently from the guest OS via the SAN to prevent IO performance penalty. To start a migration, our mechanism collects the mapping information between page cache and disk blocks. During a migration, the source host skips transferring the page cache but transfers other memory content, while the destination host transfers the same data as the page cache from the disk blocks via the SAN. Experiments with web server and database workloads showed that our mechanism reduced total migration time with significantly small IO performance penalty.

    DOI

  • Understanding and Planning Event-B Refinement through Primitive Rationales

    Tsutomu Kobayashi, Fuyuki Ishikawa, Shinichi Honiden

    ABSTRACT STATE MACHINES, ALLOY, B, TLA, VDM, AND Z, ABZ 2014   8477   277 - 283  2014  [Refereed]

     View Summary

    Event-B provides a promising feature of refinement to gradually construct a comprehensive specification of a complex system including various aspects. It has unique difficulties to design complexity mitigation, while obeying Event-B consistency rules, among the potentially large possibilities of refinement plans. However, despite of the difficulties, existing studies on specific examples or high-level and intuitive guidelines are missing clear rationales, as well as principles, guidelines or methods supported by the rationales. In response to this problem, this paper presents a method for refinement planning from an informal/semiformal specification. By defining primitive rationales, the method can eliminate undesirable plans such as the ones failing to mitigate the complexity. In a case study on a popular example from a book, we derived an enough small number of valid plans only by using the general and essential rationales while explaining the one presented in the book.

    DOI

  • ArbitCheck: A Highly Automated Property-based Testing Tool for Java

    Kohsuke Yatoh, Kazunori Sakamoto, Fuyuki Ishikawa, Shinichi Honiden

    2014 SEVENTH IEEE INTERNATIONAL CONFERENCE ON SOFTWARE TESTING, VERIFICATION AND VALIDATION WORKSHOPS (ICSTW 2014)     405 - 412  2014  [Refereed]

     View Summary

    Lightweight property-based testing tools are becoming popular these days. With property-based testing, developers can test properties of the system under test against large varieties of randomly generated inputs without writing test cases. Despite the advantages of property-based testing, current property-based testing tools have a major drawback: they require developers to write generator functions for user-defined types. This is because it is difficult for a tool to infer the possible values for the type. However, user-defined generators sometimes fail to find faults by only producing overly limited varieties of values. In this paper, we present a new property-based testing tool, called ArbitCheck, which automates object generation by adapting the feedback-directed random test generation technique. With the help of feedback-directed random test generation, ArbitCheck exhaustively generates possible values of user-defined types and tests properties with them, so that it can reveal faults that are hard to find with either manually written tests or existing property-based testing tools.

    DOI

  • 動的ソフトウェア進化へのエージェント技術の活用

    中川博之, 大須賀昭彦, 本位田真一

       2013.09

  • A Goal Model Elaboration for Localizing Changes in Software Evolution

    Hiroyuki Nakagawa, Akihiko Ohsuga, Shinichi Honiden

    Proc. of the 21st IEEE International Requirements Engineering Conference (RE 2013)    2013.07  [Refereed]

    DOI

  • Mutation Analysis for JavaScript Web Applications Testing

    Kazuki Nishiura, Yuta Maezawa, Hironori Washizaki, Shinichi Honiden

    The 25th International Conference on Software Engineering and Knowledge Engineering (SEKE'13)     159 - 165  2013.06  [Refereed]

  • 照合操作の識別のためのOCL記述の解析方法

    井上 拓, 本位田 真一

    情報処理学会論文誌   54 ( 3 )  2013.03  [Refereed]

  • 参照整合性の検証のためのUML Activity解析方法

    井上 拓, 本位田 真一

    情報処理学会論文誌 特集「ソフトウェア工学」   54 ( 2 )  2013.02  [Refereed]

  • 無線センサネットワークにおけるデータ品質改善の為の開発プロセス

    本位田真一

    電子情報通信学会論文誌 学生論文特集 D    2013  [Refereed]

  • Coq を使用したMapReduce アプリケーションの検証とScala コード

    本位田真一

    電子情報通信学会論文誌 D    2013  [Refereed]

  • Fault Classification and Model Learning from Sensory Readings - Framework for Fault Tolerance in Wireless Sensor Networks

    Valentina Baljak, Kenji Tei, Shinichi Honiden

    2013 IEEE EIGHTH INTERNATIONAL CONFERENCE ON INTELLIGENT SENSORS, SENSOR NETWORKS AND INFORMATION PROCESSING     408 - 413  2013  [Refereed]

     View Summary

    Primary task of wireless sensor networks is to deliver reliable and accurate information about the phenomena of interest. However, faults are a frequent occurrence and their accumulation affects the quality of service significantly. This leads to a shorter effective lifetime of the network. In this work, we propose a framework for the fault tolerance in sensory readings. The main concept is based on the observation of the pattern that faults leave in data behavior. Based on the duration, continuity and the impact, we propose a complete and consistent classification of faults as they can be observed in sensory readings independently of the underlying cause. Further, we propose that network learns a model of a fault for each faulty node from the past behavior. Each phase of the framework can be implemented with the use of different algorithms appropriate for the task. In this paper we present an instance that relies on neighborhood vote, time series analysis and statistical pattern recognition. Results so far confirm that the scheme works well for dense data-centric wireless sensor networks.

    DOI

  • Fast Wide Area Live Migration with a Low Overhead through Page Cache Teleportation

    Soramichi Akiyama, Takahiro Hirofuchi, Ryousei Takano, Shinichi Honiden

    PROCEEDINGS OF THE 2013 13TH IEEE/ACM INTERNATIONAL SYMPOSIUM ON CLUSTER, CLOUD AND GRID COMPUTING (CCGRID 2013)     78 - 82  2013  [Refereed]

     View Summary

    Live migration of virtual machines over a wide area network has many use cases such as cross-datacenter load balancing, low carbon virtual private clouds, and disaster recovery of IT systems. An efficient wide area live migration method is required because cross-datacenter connections have a narrow bandwidth. Page cache occupies a large portion of the memory of a Virtual Machine (VM) when it executes data-intensive workloads. We propose a new live migration technique, page cache teleportation, which reduces the total migration time of wide area live migration and has a low overhead. It detects the restorable page cache in the guest memory that has the same contents as the corresponding disk blocks. The restorable page cache is not transferred via the WAN but is restored from the disk image before the VM resumes. In this way, the IO performance degradation reduces after the migration. Evaluations show that page cache teleportation reduces the total migration time of wide area live migration and has a lower performance overhead than existing approaches.

    DOI

  • Sample Efficiency Analysis of Neuroevolution Algorithms on a Quadruped Robot

    Shengbo Xu, Hirotaka Moriguch, Shinichi Honiden

    2013 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC)     2170 - 2177  2013  [Refereed]

     View Summary

    In reinforcement learning tasks with continuous state-action, parameterized policy search has been known to be a powerful method. Applying NeuroEvolution (NE) to optimizing the policy represented by artificial neural network (ANN) is a particularly active research field. In most cases, NE algorithms cost a large amount of trial-and-error (episode) to optimize policies. However, due to time and cost constraints, researchers and practitioners cannot repeat a number of episodes on physical robots. Thus, choosing an efficient NE algorithm is a key to optimize policies with limited time and cost. In this work, our goal is to help users to choose an efficient NE algorithm. We compare and analyze sample efficiency of two successful state-of-the-art NE algorithms: CMA-NeuroES and NEAT in a gait generation task of a quadruped robot. Moreover, we run both algorithms with various initial topologies in order to analyze the performance difference between each topology. From experimental results, we show CMA-NeuroES outperforms NEAT regardless of initial topologies when the limited number of episodes can be executed. Additional experiments conclude that the optimization method for connection weights in NEAT results in its inferior performance to CMA-NeuroES, while a probability weighted averaging characteristic and self-adaptive factors make CMA-NeuroES to be advantageous.

    DOI

  • Automatic image description by using word-level features

    Shingo Horiuchi, Hirotaka Moriguchi, Shinichi Honiden, Shengbo Xu

    ACM International Conference Proceeding Series     309 - 314  2013  [Refereed]

     View Summary

    Automatic image description is one of the challenging tasks of image recognitions. However, there are image descriptions that contain some too specific phrases that cannot be judged only from appearance of images. In this paper, we propose a novel approach to collect general phrases for generating image descriptions. On the assumption that there are high frequency phrases related to an query image in the image descriptions of similar images, we select nouns and their attribute phrases from the image descriptions of similar images based on their frequency. In order to evaluate the relevance of our image description, we conduct comparative experiments with existing approaches. Our experimental results show that our image descriptions are short, concise and visually relevant to query images. © 2013 ACM.

    DOI

  • Automated Verification of Pattern-Based Interaction Invariants in Ajax Applications

    Yuta Maezawa, Hironori Washizaki, Yoshinori Tanabe, Shinichi Honiden

    2013 28TH IEEE/ACM INTERNATIONAL CONFERENCE ON AUTOMATED SOFTWARE ENGINEERING (ASE)     158 - 168  2013  [Refereed]

     View Summary

    When developing asynchronous JavaScript and XML (Ajax) applications, developers implement Ajax design patterns for increasing the usability of the applications. However, unpredictable contexts of running applications might conceal faults that will break the design patterns, which decreases usability. We propose a support tool called JSVerifier that automatically verifies interaction invariants; the applications handle their interactions in invariant occurrence and order. We also present a selective set of interaction invariants derived from Ajax design patterns, as input. If the application behavior breaks the design patterns, JSVerifier automatically outputs faulty execution paths for debugging. The results of our case studies show that JSVerifier can verify the interaction invariants in a feasible amount of time, and we conclude that it can help developers increase the usability of Ajax applications.

    DOI

  • Faults in Sensory Readings: Classification and Model Learning

    Valentina Baljak, Tei Kenji, Shinichi Honiden

    Sensors & Transducers   18   177 - 187  2013.01  [Refereed]

  • Towards Refinement Strategy Planning for Event-B

    Workshop on the experience of and advances in developing dependable systems in Event-B (DS-Event-B'12) in conjunction with ICFEM    2012.11  [Refereed]

  • Modeling and Analyzing Legal Interpretations for/by Requirements Engineering Approaches

    Fuyuki Ishikawa, Rihoko Kawai, Inoue, Shinichi Honiden

    The 6th International Workshop on Juris-informatics (JURISIN 2012)     143 - 156  2012.11  [Refereed]

  • クラウドを動的に利用するWebサービス連携のための動作記述

    鶴見 直樹, 石川 冬樹, 本位田 真一, 深澤 良彰

    電子情報通信学会技術研究報告(サービスコンピューティング第3回研究会)   112 ( 299 ) 25 - 30  2012.11

  • ゴール指向要求記述の整形に基づいたソフトウェアシステム進化手法

    中川 博之, 大須賀 昭彦, 本位田 真一

    情報処理学会論文誌   53 ( 10 )  2012.10  [Refereed]

  • A Scalable Distributed Architecture for Network- and QoS-aware Service Composition

    Adrian Klein, Fuyuki Ishikawa, Shinichi Honiden

    International Joint Agent Workshop and Symposium (iJAWS 2012)    2012.10  [Refereed]

  • Classification of Faults in Sensor Readings with Statistical Pattern Recognition

    Valentina Baljak, Kenji Tei, Shinichi Honiden

    The Sixth International Conference on Sensor Technologies and Applications (SENSORCOMM 2012)    2012.08  [Refereed]

  • CMA-TWEANN: Efficient Neuroevolution via Synthetic Evolution

    Hirotaka Moriguchi, Shinichi Honiden

    Genetic and Evolutionary Computation Conference (GECCO2012)    2012.07  [Refereed]

  • 都鳥: メモリ再利用による連続するライブマイグレーションの最適化

    穐山 空道, 広渕 崇宏, 高野 了成, 本位田 真一

    情報処理学会論文誌:コンピューティングシステム   5 ( 2 ) 74 - 85  2012.03  [Refereed]

  • A multi-objective evolutionary approach to scheduling for evolving manufacturing systems

    Benjamin Klöpper, Jan Patrick Pater, Shinichi Honiden, Wilhelm Dangelmaier

    Evolving Systems   3 ( 1 ) 31 - 44  2012.03  [Refereed]

     View Summary

    Persistent trends like quickly changing production programs, increasing customer individual manufacturing and Sustainable Manufacturing create complex systems of objectives in manufacturing control. Service-oriented manufacturing systems and self-optimizing manufacturing resources offer the required flexibility to consider these objectives in accordance with the current organizational and economical situation. On the downside, this increase in flexibility make the control of manufacturing systems more difficult and presents new challenges regarding the scheduling. To meet these challenges, we developed scheduling framework that supports alternative process plans and considers the internal states trajectories of resources. In order to support the user in a complex decision-making environment, evolutionary multi-objective optimization is used to generate a set of relevant schedules and an interface to select the most appropriate schedule is provided. © 2011 Springer-Verlag.

    DOI

  • Component Trust for Web Service Compositions

    Mohammad-Reza Motallebi, Fuyuki Ishikawa, Shinichi Honiden

    AAAI Spring Symposium 2012: Intelligent Web Services Meet Social Computing    2012.03  [Refereed]

  • メタデータ制約を用いた協調プロトコルの自動合成手法

    高橋 竜一, 石川 冬樹, 本位田 真一, 深澤 良彰

    情報処理学会論文誌 特集「分散処理とネットワークサービス」   53 ( 2 ) 683 - 697  2012.02  [Refereed]

  • Meta-Models for Wireless Sensor Network Applications: Data, Group, and Node Views

    Ryo Shimizu, Kenji Tei, Yoshiaki Fukazawa, Shinichi Honiden

    GRACE Technical Report   GRACE-TR-2012-01   1 - 9  2012.02

  • A Framework for Validating Task Assignment in Multiagent Systems Using Requirements Importance

    Hiroyuki Nakagawa, Nobukazu Yoshioka, Akihiko Ohsuga, Shinichi Honiden

    PRINCIPLES AND PRACTICE OF MULTI-AGENT SYSTEMS   7057   443 - +  2012  [Refereed]

     View Summary

    Multi-agent systems (MASs) are one of the effective approaches for dealing with the recent increase in software complexity and their autonomy. In the MAS research community, there has recently been increasing interest in the adoption of requirements engineering techniques to bridge the gap between the system requirements and the system design. One of the most important tasks based on the requirements description in the MAS design activity is the extraction of roles, which are the fundamental components of multi-agent systems, from it. It is also important to comprehend the relative degree of responsibility of the individual roles. The comprehension helps the developer decide the system architecture and discuss the performance and stability of the system. We introduce the concept of importance as a quantitative metric and an evaluation framework for the extraction of a suitable role set for the system and the task assignment to these roles. The importance is propagated from the requirements to the roles through their assigned tasks. We demonstrate the effectiveness of our framework through a case study and show that our metric and evaluation framework help not only to identify the importance of each role, but also to determine the system architecture.

    DOI

  • S-CLAIM: An Agent-based Programming Language for AmI, A Smart-Room Case Study

    Valentina Baljak, Marius Tudor Benea, Amal El Fallah Seghrouchni, Cedric Herpson, Shinichi Honiden, Thi Thuy Nga Nguyen, Andrei Olaru, Ryo Shimizu, Kenji Tei, Susumu Toriumi

    ANT 2012 AND MOBIWIS 2012   10   30 - 37  2012  [Refereed]

     View Summary

    This paper introduces a declarative agent-oriented language for Ambient Intelligence - S-CLAIM - that allows programming reactive or cognitive mobile agents in a simple, easy-to-use manner while meeting AmI requirements. Based on a hierarchical representation of the agents, the language offers a natural solution to achieve context-sensitivity. S-CLAIM is light-weight and, being transparently underpinned by the JADE framework, allows deployment on mobile devices and easy interoperation with other components by means of web services. The usefulness of the proposed language for AmI is illustrated through a scenario and a demo featuring an AmI application in a Smart Room. (C) 2011 Published by Elsevier Ltd.

    DOI

  • S-CLAIM: An Agent-based Programming Language for AmI, A Smart-Room Case Study

    Valentina Baljak, Marius Tudor Benea, Amal El Fallah Seghrouchni, Cedric Herpson, Shinichi Honiden, Thi Thuy Nga Nguyen, Andrei Olaru, Ryo Shimizu, Kenji Tei, Susumu Toriumi

    ANT 2012 AND MOBIWIS 2012   10   30 - 37  2012  [Refereed]

     View Summary

    This paper introduces a declarative agent-oriented language for Ambient Intelligence - S-CLAIM - that allows programming reactive or cognitive mobile agents in a simple, easy-to-use manner while meeting AmI requirements. Based on a hierarchical representation of the agents, the language offers a natural solution to achieve context-sensitivity. S-CLAIM is light-weight and, being transparently underpinned by the JADE framework, allows deployment on mobile devices and easy interoperation with other components by means of web services. The usefulness of the proposed language for AmI is illustrated through a scenario and a demo featuring an AmI application in a Smart Room. (C) 2011 Published by Elsevier Ltd.

    DOI

  • Efficient neuroevolution for a quadruped robot

    Shengbo Xu, Hirotaka Moriguchi, Shinichi Honiden

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   7673   361 - 370  2012  [Refereed]

     View Summary

    In this research, we investigate whether CoSyNE and CMA-NeuroES algorithms can efficiently optimize neural policy of a quadruped robot. Both of these algorithms are proven to optimize connection weights efficiently on Pole Balancing benchmark. Due to their good results on that benchmark, they are expected to be efficient on other control problems like gait generation. In this research we experimentally show that CMA-NeuroES have higher scalability to optimize Artificial Neural Networks for generating gaits of quadruped robots in comparison with CoSyNE. The results can be helpful for researchers and practitioners to choose the optimal Neuroevolution algorithm for generating gaits. © 2012 Springer-Verlag.

    DOI

  • Towards dynamic evolution of self-Adaptive systems based on dynamic updating of control loops

    Hiroyuki Nakagawa, Akihiko Ohsuga, Shinichi Honiden

    International Conference on Self-Adaptive and Self-Organizing Systems, SASO     59 - 68  2012  [Refereed]

     View Summary

    Self-Adaptive systems, which enable runtime adaptation, are promising ways of dealing with environmental changes, including system intrusions or faults. Such software systems must modify themselves to better fit their environment. One of the main approaches to constructing such systems is to introduce multiple control loops. Software evolution is an essential activity for expanding this adaptation capability, and dynamic evolution has been envisaged as a way of systems adapting themselves at runtime. In this paper, we establish a development process to deal with dynamic evolution. We devise a goal model compiler to generate models for designing dynamic evolutions and a programming framework that supports dynamic deployment of control loops. We experimentally applied our approach to a system and discuss how our compiler and framework support dynamic evolution of self-Adaptive systems. © 2012 IEEE.

    DOI

  • MiyakoDori: A memory reusing mechanism for dynamic VM consolidation

    Soramichi Akiyama, Takahiro Hirofuchi, Ryousei Takano, Shinichi Honiden

    Proceedings - 2012 IEEE 5th International Conference on Cloud Computing, CLOUD 2012     606 - 613  2012  [Refereed]

     View Summary

    In Infrastructure-as-a-Service datacenters, the placement of Virtual Machines (VMs) on physical hosts are dynamically optimized in response to resource utilization of the hosts. However, existing live migration techniques, used to move VMs between hosts, need to involve large data transfer and prevents dynamic consolidation systems from optimizing VM placements efficiently. In this paper, we propose a technique called "memory reusing" that reduces the amount of transferred memory of live migration. When a VM migrates to another host, the memory image of the VM is kept in the source host. When the VM migrates back to the original host later, the kept memory image will be "reused", i.e. memory pages which are identical to the kept pages will not be transferred. We implemented a system named MiyakoDori that uses memory reusing in live migrations. Evaluations show that MiyakoDori significantly reduced the amount of transferred memory of live migrations and reduced 87% of unnecessary energy consumption when integrated with our dynamic VM consolidation system. © 2012 IEEE.

    DOI

  • Multi-objective service composition with time- and input-dependent QoS

    Florian Wagner, Adrian Klein, Benjamin Klöpper, Fuyuki Ishikawa, Shinichi Honiden

    Proceedings - 2012 IEEE 19th International Conference on Web Services, ICWS 2012     234 - 241  2012  [Refereed]

     View Summary

    Optimizing the Quality-of-Service (QoS) levels of a service workflow is essential for the user satisfaction in Service-oriented Computing. For that purpose, QoS computation models are applied to reflect the actual QoS experienced by the user during service execution. Current QoS models ignore the possible dependencies of QoS attributes, such as the dependency on the time of the execution or on the input data supplied to the service. Apart from that, composition approaches consider only single workflows during service selection, narrowing the number of possible compositions. Thus, we introduce a novel QoS model that covers QoS dependencies and discuss how this model can be used to consider multiple workflows at the same time. Moreover, we adopt a multi-objective optimization approach to offer solutions varying in QoS such as finishing time and price, allowing the user to make fine-grained decisions. © 2012 IEEE.

    DOI

  • A probabilistic approach for long-term B2B service compositions

    Adrian Klein, Florian Wagner, Fuyuki Ishikawa, Shinichi Honiden

    Proceedings - 2012 IEEE 19th International Conference on Web Services, ICWS 2012     259 - 266  2012  [Refereed]

     View Summary

    Service composition algorithms are used for realizing loosely coupled interactions in Service-Oriented Computing. Starting from an abstract workflow, concrete services are matched, based on their QoS, with the preferences and constraints of users. Current approaches usually only consider static QoS values and find a single solution consisting of one concrete service for each workflow task. In a business-to-business (B2B) environment, though, there are additional requirements for service compositions: 1) a high number of invocations, and 2) a high reliability. Thus, we introduce a probabilistic approach on the basis of a new QoS model to solve the composition problem for such long-term B2B service compositions. For each task and for every point in time, we determine the most appropriate services and backup services for a specific user. Thus, the selection depends on the actual response time and reliability, or recent invocation failures or timeouts. For that purpose, we propose an adaptive genetic algorithm that employs our QoS model and determines backup services dynamically based on the required reliability. Our evaluations show that our approach significantly increases the utility of long-term compositions compared with standard approaches in the envisioned B2B environments. © 2012 IEEE.

    DOI

  • Web service selection algorithm using Vickrey auction

    Atsushi Watanabe, Fuyuki Ishikawa, Yoshiaki Fukazawa, Shinichi Honiden

    Proceedings - 2012 IEEE 19th International Conference on Web Services, ICWS 2012     336 - 342  2012  [Refereed]

     View Summary

    The technology for web services has facilitated composition of a new service by combining existing services. The resulting composite service is required to guarantee Quality of Service (QoS), such as price, in addition to the demanded function. Each composite service faces computationally-expensive service selection by exploring enormous service combinations for optimization of a utility function and satisfaction of global constraints. In addition, each concrete service has difficulties in determining QoS that is profitable while attractive for customers, or composite services. Specifically, information on rival services is generally secret and changeable, which is required for the optimal decision. In response to these problems, this paper proposes an algorithm for service selection using Vickrey auction. In the first phase of the proposed algorithm, the composite service selects some best concrete services through the reverse Vickrey auction, only considering the utility function. In the second phase, the global constraints are satisfied through adjustments based on the Vickrey auction. The proposed algorithm avoids full exploration of services combinations for efficient computation, while encouraging providers to declare their best QoS without caring about extra profit. © 2012 IEEE.

    DOI

  • Trust computation in web service compositions using Bayesian networks

    Mohammad-Reza Motallebi, Fuyuki Ishikawa, Shinichi Honiden

    Proceedings - 2012 IEEE 19th International Conference on Web Services, ICWS 2012     623 - 625  2012  [Refereed]

     View Summary

    The concept of trust in web services mainly deals with the degree of belief that a client or a group of clients have over services functioning satisfactorily and providing the expected results. With services being invoked in composition with each other, computing the trust of the composition and selecting services that deliver the highest trust for it becomes a desired goal. In this paper we demonstrate how using Bayesian networks and its supporting queries, we can select the set of services among all candidates that would provide highest global trust. © 2012 IEEE.

    DOI

  • Supporting view transition design of smartphone applications using web templates

    Kazuki Nishiura, Yuta Maezawa, Fuyuki Ishikawa, Shinichi Honiden

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   7387   323 - 331  2012  [Refereed]

     View Summary

    Many developers have implemented native smartphone applications (NSAs) that have the same functionalities as those of existing web applications (WAs). They need to redesign web pages as views of NSAs owing to their constraints, such as compact displays. However, it can produce a NSA with low global navigability. We propose a framework that can support developers in designing view transitions of NSAs on the basis of WAs. We focus on web templates to leverage well-designed web page transitions. Our framework 1) extracts a page transition model from a WA to create candidate view transitions of a NSA, 2) provides an interface where developers design these views to solve the constraints, and 3) suggests design modifications to increase global navigability calculated by proposed criteria of navigation costs for users. After examining case studies, we concluded that our framework could support developers to design easy-to-navigate NSAs. © 2012 Springer-Verlag.

    DOI

  • Case studies on the development of wireless sensor network applications using multiple abstraction levels

    Ryo Shimizu, Kenji Tei, Yoshiaki Fukazawa, Shinichi Honiden

    2012 3rd International Workshop on Software Engineering for Sensor Network Applications, SESENA 2012 - Proceedings     22 - 28  2012  [Refereed]

     View Summary

    Model-driven development (MDD) facilitates the development of wireless sensor network (WSN) applications because MDD can deal with models at the abstraction level to the concrete level. In the MDD for WSN applications, the developers model the dataflow at the abstract level and model the designs of a communication and task assignment at the concrete level. In our previous work we proposed a MDD process for WSN applications with three domain specific languages (DSLs). However, we did not sufficiently evaluate the description capabilities of our DSLs. For that reason, we report case studies on real-world applications to prove the feasibility of our approach. Our DSL can be used to describe both the application logic and design decisions concerning the quality of data, which are adopted in target applications. Additionally, we demonstrate the effectiveness of the DSLs at multiple abstraction levels. © 2012 IEEE.

    DOI

  • Towards robust service compositions in the context of functionally diverse services

    Florian Wagner, Benjamin Klöpper, Fuyuki Ishikawa, Shinichi Honiden

    WWW'12 - Proceedings of the 21st Annual Conference on World Wide Web     969 - 978  2012  [Refereed]

     View Summary

    Web service composition provides a means of customized and flexible integration of service functionalities. Qualityof- Service (QoS) optimization algorithms select services in order to adapt workflows to the non-functional requirements of the user. With increasing number of services in a workflow, previous approaches fail to achieve a sufficient reliability. Moreover, expensive ad-hoc replanning is required to deal with service failures. The major problem with such sequential application of planning and replanning is that it ignores the potential costs during the initial planning and they consequently are hidden from the decision maker. Our basic idea to overcome this substantial problem is to compute a QoS optimized selection of service clusters that includes a sufficient number of backup services for each service employed. To support the human decision maker in the service selection task, our approach considers the possible repair costs directly in the initial composition. On the basis of a multi-objective approach and using a suitable service selection interface, the decision maker can select compositions in line with his/her personal risk preferences.

    DOI

  • Towards network-aware service composition in the cloud

    Adrian Klein, Fuyuki Ishikawa, Shinichi Honiden

    WWW'12 - Proceedings of the 21st Annual Conference on World Wide Web     959 - 968  2012  [Refereed]

     View Summary

    Service-Oriented Computing (SOC) enables the composition of loosely coupled services provided with varying Quality of Service (QoS) levels. Selecting a (near-)optimal set of services for a composition in terms of QoS is crucial when many functionally equivalent services are available. With the advent of Cloud Computing, both the number of such services and their distribution across the network are rising rapidly, increasing the impact of the network on the QoS of such compositions. Despite this, current approaches do not differentiate between the QoS of services themselves and the QoS of the network. Therefore, the computed latency differs substantially from the actual latency, resulting in suboptimal QoS for service compositions in the cloud. Thus, we propose a network-aware approach that handles the QoS of services and the QoS of the network independently. First, we build a network model in order to estimate the network latency between arbitrary services and potential users. Our selection algorithm then leverages this model to find compositions that will result in a low latency given an employed execution policy. In our evaluation, we show that our approach eficiently computes compositions with much lower latency than current approaches.

    DOI

  • Extracting interaction-based stateful behavior in Rich Internet Applications

    Yuta Maezawa, Hironori Washizaki, Shinichi Honiden

    Proceedings of the European Conference on Software Maintenance and Reengineering, CSMR     423 - 428  2012  [Refereed]

     View Summary

    Although asynchronous technologies such as Ajax make Rich Internet Applications (RIAs) responsive, they can result in unexpected behavior due to nondeterministic client-side processing and asynchronous communication. One difficulty in understanding such erroneous behavior lies in the unpredictable contexts of the running system. Dynamic behavior analysis techniques do not help to verify the correctness of certain "blind spots" in the execution path. In this work, we present a static approach for extracting all possible state transitions described in source code from the RIAs. Our approach is based on the assumption that user, server and self interactions with the RIAs can change the states of the application. Our method consists of four steps: 1) using given specifications of Ajax relevant to interactions as rules, 2) creating a call graph, annotating interactions on it and extracting interaction controls, 3) abstracting the call graph to extract relationships among the interactions, and 4) refining the relationships with the interaction controls. By extracting the state machines of test scenarios of the correct and wrong behavior, it can help developers to pinpoint the statements in the source code that lead to the erroneous behavior. Our approach has been evaluated against a few experimental cases and we conclude that it can extract comprehensible state machines in a reasonable time. © 2012 IEEE.

    DOI

  • CMA-TWEANN: Efficient Optimization of Neural Networks via Self-Adaptation and Seamless Augmentation

    Hirotaka Moriguchi, Shinichi Honiden

    PROCEEDINGS OF THE FOURTEENTH INTERNATIONAL CONFERENCE ON GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE     903 - 910  2012  [Refereed]

     View Summary

    Neuroevolutionary algorithms are successful methods for optimizing neural networks, especially for learning a neural policy (controller) in reinforcement learning tasks. Their significant advantage over gradient-based algorithms is the capability to search network topology as well as connection weights. However, state-of-the-art topology evolving methods are known to be inefficient compared to weight evolving methods with an appropriately hand-tuned topology. This paper introduces a novel efficient algorithm called CMA-TWEANN for evolving both topology and weights. Its high efficiency is achieved by introducing efficient topological mutation operators and integrating a state-of-the-art function optimization algorithm for weight optimization. Experiments on benchmark reinforcement learning tasks demonstrate that CMA-TWEANN solves tasks significantly faster than existing topology evolving methods. Furthermore, it outperforms weight evolving techniques even when they are equipped with a hand-tuned topology. Additional experiments reveal how and why CMA-TWEANN is the best performing weight evolving method.

    DOI

  • Extracting locations related to tags on folksonomy

    Yukino Baba, Fuyuki Ishikawa, Shinichi Honiden

    Transactions of the Japanese Society for Artificial Intelligence   27 ( 1 ) 1 - 9  2012  [Refereed]

     View Summary

    Geographic information systems use databases to map keywords to locations. Currently, these databases are mostly created by a top-down approach based on geographic definitions. Problems are that (1) these databases only have information about addresses, location names, landmarks, and stores, and (2) if there are multiple candidate locations for a keyword, these databases do not have the information about which location is popular. A bottom-up approach which targets actual usage of keywords can address these problems. We propose a method to aggregate tagging data and extract locations related to a tag by using pairs of a tag and a geotagged resource. We use cooccurrence of a tag and a location and represent the locations related to a tag as a probability distribution over longitudes and latitudes. We apply our method to data on the photo sharing service Flickr. We experimentally confirm that our method can extract locations related to tags with high accuracy. Our bottom-up approach enables the extraction of location information that is unavailable using traditional top-down approaches.

    DOI

  • Extracting Interaction-Based Stateful Behavior in Rich Internet Applications

    Yuta Maezawa, Hironori Washizaki, Shinichi Honiden

    2012 16TH EUROPEAN CONFERENCE ON SOFTWARE MAINTENANCE AND REENGINEERING (CSMR)     423 - 428  2012  [Refereed]

     View Summary

    Although asynchronous technologies such as Ajax make Rich Internet Applications (RIAs) responsive, they can result in unexpected behavior due to nondeterministic client-side processing and asynchronous communication. One difficulty in understanding such erroneous behavior lies in the unpredictable contexts of the running system. Dynamic behavior analysis techniques do not help to verify the correctness of certain "blind spots" in the execution path. In this work, we present a static approach for extracting all possible state transitions described in source code from the RIAs. Our approach is based on the assumption that user, server and self interactions with the RIAs can change the states of the application. Our method consists of four steps: 1) using given specifications of Ajax relevant to interactions as rules, 2) creating a call graph, annotating interactions on it and extracting interaction controls, 3) abstracting the call graph to extract relationships among the interactions, and 4) refining the relationships with the interaction controls. By extracting the state machines of test scenarios of the correct and wrong behavior, it can help developers to pinpoint the statements in the source code that lead to the erroneous behavior. Our approach has been evaluated against a few experimental cases and we conclude that it can extract comprehensible state machines in a reasonable time.

    DOI

  • Trust computation in web service compositions using Bayesian networks

    Mohammad-Reza Motallebi, Fuyuki Ishikawa, Shinichi Honiden

    Proceedings - 2012 IEEE 19th International Conference on Web Services, ICWS 2012     623 - 625  2012  [Refereed]

     View Summary

    The concept of trust in web services mainly deals with the degree of belief that a client or a group of clients have over services functioning satisfactorily and providing the expected results. With services being invoked in composition with each other, computing the trust of the composition and selecting services that deliver the highest trust for it becomes a desired goal. In this paper we demonstrate how using Bayesian networks and its supporting queries, we can select the set of services among all candidates that would provide highest global trust. © 2012 IEEE.

    DOI

  • Florian Wagner, Fuyuki Ishikawa and Shinichi Honiden

    Shinichi Honiden

       2011.12  [Refereed]

  • 無線センサネットワークにおける対象追跡の分解能を調整可能なセンサモデル

    鄭 顕志, 中里 彦俊, 深澤 良彰, 本位田 真一

    電子情報通信学会論文誌   J94-B ( 10 ) 1351 - 1362  2011.10  [Refereed]

  • 同種サービスの併用を考慮した効率的なサービス選択

    平塚 信明, 石川 冬樹, 本位田 真一

    情報処理学会論文誌   52 ( 10 ) 2920 - 2933  2011.10  [Refereed]

  • Achieving constraint compliance in QoS-aware service planning

    Florian Wagner, Fuyuki Ishikawa, Shinichi Honiden

    The 2nd International Joint Agent Workshop & Symposium (iJAWS 2011)    2011.10  [Refereed]

  • ヴィックレイオークションを利用したWebサービス選択アルゴリズム

    渡辺 敦, 石川 冬樹, 深澤 良彰, 本位田 真一

    合同エージェントワークショップ&シンポジウム2011 (JAWS2011)    2011.10  [Refereed]

  • Chordネットワークに配置された配列に対する並列範囲アクセス

    福地 大輔, 本位田 真一

    情報処理学会論文誌   52 ( 8 ) 2441 - 2454  2011.08  [Refereed]

  • ソフトウェアの問題記述のための実行可能な形式化自然語の提案

    日野 克重, 本位田 真一

    情報処理学会論文誌   Vol.52 ( No.3 ) 1365 - 1394  2011.03  [Refereed]

  • 経路情報を用いた複数タスクへのセンサ割当

    鳥海 晋, 本位田 真一

    情報処理学会論文誌 特集「マルチメディア、分散、協調とモバイルシステム」   Vol.52 ( No.3 ) 1091 - 1101  2011.03  [Refereed]

  • IMPULSE: A design framework for multi-agent systems based on model transformation

    Hiroyuki Nakagawa, Nobukazu Yoshioka, Akihiko Ohsuga, Shinichi Honiden

    Proceedings of the ACM Symposium on Applied Computing     1411 - 1418  2011  [Refereed]

     View Summary

    The purpose of this study is to reduce the difficulties encountered when designing multi-agent systems (MAS). Although MAS are one of the more effective approaches for dealing with the recent increase in software complexity, they are themselves difficult to develop. We believe the difficulties in determining agent responsibilities and the organizational structure as the most significant obstacles to MAS development. In this paper, we propose a design framework for MAS, which includes restriction rules in the goal-oriented requirements description and a generator that transforms the restricted requirements description into a general MAS design model. We demonstrate the effectiveness of our framework through a case study and show how the framework can be used to construct MAS design models more precisely than conventional methods permit. © 2011 ACM.

    DOI

  • 物理的相互作用に着目した,スマート空間の形式仕様記述と検証

    石川 冬樹, 山本 佳代子, 本位田 真一

    情報処理学会論文誌   Vol.52 ( No.1 ) 220 - 232  2011.01  [Refereed]

  • An Implementation Framework for Self-adaptive Systems Based on Agent Behaviors Description

    NAKAGAWA Hiroyuki, OHSUGA Akihiko, HONIDEN Shinichi

    Transactions of the Japanese Society for Artificial Intelligence   26 ( 1 ) 1 - 12  2011.01  [Refereed]

     View Summary

    The complexity of current software systems requires the ability to adapt at run-time, and the development of self-adaptive systems is one of the recent challenges for realizing dynamic adaptation. In this paper, we focus on the adaptation based on the components connection as a fundamental adaptation, and present our implementation framework for constructing self-adaptive systems on the basis of an agent platform. We reinforce the agent platform by adding some application program interface for behavior cooperation and its autonomic activation, and connect the behaviors with components in self-adaptive systems. We also introduce an implementation guideline: a way to identify the responsibilities for control loops and implementation patterns for these responsibilities. We also demonstrate the effectiveness of our framework and guideline through the results from our implementation experiments and show how they can be used to construct self-adaptive systems by using agent platforms.

    DOI CiNii

  • Poplar: Java composition with labels and AI planning

    Johan T. Nyström Persson, Shinichi Honiden

    FREECO-Onward! 2011 - Proceedings of the 2nd Workshop on Free Composition @ Onward! 2011     7 - 11  2011  [Refereed]

     View Summary

    Class evolution in object-oriented programming often causes so-called breaking changes, largely because of the rigidity of component interconnections in the form of explicit method calls and field accesses. We present a Java extension, Poplar, which we are currently developing. In Poplar, inter-component dependencies are expressed using declarative queries
    concrete linking code, generated using a planning algorithm, replaces these at compile time. We show how Poplar can enable fully automatic integration of Java components through evolvable and statically checkable integration links, pointing the way to a new general composition method for object-oriented languages. © 2011 ACM.

    DOI

  • Communication patterns of agile requirements engineering

    Nik Nailah Binti Abdullah, Shinichi Honiden, Helen Sharp, Bashar Nuseibeh, David Notkin

    Proceedings of the 1st Agile Requirements Engineering Workshop, AREW'11 - In Conjunction with ECOOP'11    2011  [Refereed]

     View Summary

    An agile software development team relies on communication and collaboration to perform requirements engineering activities, rather than on dedicated analysis tools or documentation. Evidence from practice indicates that two simple physical artefacts (story cards and the wall), used in a particular and disciplined manner, and supported by appropriate social activity, are key to the success of co-located agile teams. However, little is known about this social activity or how communication and collaboration supports requirements activities in this setting. This paper reports an empirical study of a commercial agile team to investigate this issue. Using a combination of qualitative data collection and cognitive analysis techniques, we found evidence of gathering, evolving and clarifying requirements that are managed through patterns of communication. These patterns suggest that a form of situated conceptualization, which we have termed 'shared conceptualization', underpins the team's requirements engineering activities. © 2011 ACM.

    DOI

  • Autonomic management of heterogeneous sensing devices with ECA rules

    Levent Gürgen, Amin Cherbal, Remi Sharrok, Shinichi Honiden

    IEEE International Conference on Communications    2011  [Refereed]

     View Summary

    Facing to the great number of wireless sensor/actuator devices, smart applications have an increasingly important requirement: autonomy. Besides autonomy in terms of energy, these devices have also to be functionally autonomous: they have to be self-discovered, self-(re-)configured and selfhealed. This paper presents a self-manageable autonomic platform for heterogeneous sensing systems. Based on a service oriented architecture and an Event-Condition-Action model, management services collect information from managed elements (e.g., sensors, proxies, gateways) and perform management actions according to user defined ECA rules. We define a generic event model that allows us covering a large set of events. Events are captured and processed by rule evaluators which then perform corresponding management actions on the sensors. We show with experimental results that the mechanism brings little overhead in terms of energy consumption and execution time. © 2011 IEEE.

    DOI

  • Decision making in adaptive manufacturing systems: Multi-objective scheduling and user interface

    Benjamin Klöpper, Shinichi Honiden, Jan-Patrick Pater, Wilhelm Dangelmaier

    IEEE SSCI 2011 - Symposium Series on Computational Intelligence - CICA 2011 - 2011 IEEE Symposium on Computational Intelligence in Control and Automation     123 - 130  2011  [Refereed]

     View Summary

    Adaptive and service-oriented manufacturing proposes manufacturing systems which can be rapidly changed in accordance to changing production programs and customer individual production. Increasing customer specific manufacturing and new trends such as Sustainable Manufacturing create a complex system of objectives. Human dispatcher controlling these manufacturing systems must be properly supported to consider all required objectives. Due to the reduced insight into the adapting manufacturing systems, classical single optimization approaches with a rigid definition of a single objective function and hard optimization constraints are not appropriate any more. This paper introduces a decision making framework based on multi-objective scheduling. The decision making process consists of a multi-objective scheduling process and an interface for schedule selection. The interface combines the decision making approaches outranking and preference elicitation. © 2011 IEEE.

    DOI

  • Divide & conquer in planning for self-optimizing mechatronic systems - A first application example

    Benjamin Klöpper, Shinichi Honiden, Wilhelm Dangelmaier

    IEEE SSCI 2011 - Symposium Series on Computational Intelligence - CICA 2011 - 2011 IEEE Symposium on Computational Intelligence in Control and Automation     108 - 115  2011  [Refereed]

     View Summary

    Self-optimizing mechatronic systems are a new class of technical system promising new levels of flexibility and utility in electro-mechanical systems. Planning is an important method to realize self-optimization, although today hardly used in mechatronics. In this context, planning is understood as search for a feasible sequence of operations which implements the execution of specific job assigned to a system. This search is a complex and time-consuming task. Hence, it is desirable to decompose the planning task into smaller sub problems according to paradigm of divide &amp
    conquer and use problem specific solution methods. Unfortunately, possible planning sub problems in mechatronic systems cannot be considered isolated since sub modules influence each other. This paper introduces the application of a multi-agent-planning model based on cooperative objective functions that enable the coordinated solution of sub problems. © 2011 IEEE.

    DOI

  • Model driven development for rapid prototyping and optimization of wireless sensor network applications

    Ryo Shimizu, Kenji Tei, Yoshiaki Fukazawa, Shinichi Shinichi

    Proceedings - International Conference on Software Engineering     31 - 36  2011  [Refereed]

     View Summary

    In order to develop Wireless Sensor Network (WSN) applications, it is necessary to develop prototypes in a low-cost way and to optimize application performance. Existing development approaches enable to develop a low-cost prototype by concealing the detail of WSN from the developers. However, there is a trade-off between the development cost of prototype and the description capability needed to optimize the application performance. We propose a Model-Driven Development (MDD) process to enable a low-cost prototyping and detailed optimization. To enable such a development process, we define modeling languages, which describe an application at three abstraction levels, and transformation rules, which transform models described by our modeling language to concrete one. Using our process, in prototyping, the developer describes a model by using the modeling language at the highest abstraction level and automatically obtains an executable model by using transformation rules. In addition, in optimizing, the developer can automatically obtain the models at more concrete abstraction level than the prototype by using transformation rules and modifies them in greater detail by using each modeling language. © 2011 ACM.

    DOI

  • Edubase cloud: An open-source cloud platform for cloud engineers

    Nobukazu Yoshioka, Shigetoshi Yokoyama, Yoshionori Tanabe, Shinichi Honiden

    Proceedings - International Conference on Software Engineering     73 - 73  2011  [Refereed]

     View Summary

    Education for cloud engineers is crucial in terms of innovation in the development of cloud technologies. We propose a new cloud platform based on open-source software that uses multi-clouds for the education. © 2011 Authors.

    DOI

  • Gocc: A configuration compiler for self-adaptive systems using goal-oriented requirements description

    Hiroyuki Nakagawa, Akihiko Ohsuga, Shinichi Honiden

    Proceedings - International Conference on Software Engineering     40 - 49  2011  [Refereed]

     View Summary

    Self-adaptive systems have recently attracted attention because of their ability to cope with changing environments, including system intrusions or faults. Such software must modify itself to better fit its environment, and one of the approaches by which we expect this capability to be achieved is the introduction of multiple control loops to assess the situation and to determine whether a change in behaviors or configurations is necessary and how to implement the change. Development of such systems with multiple control loops complicates the task of identifying components, and could be greatly aided by appropriate tool support. In this paper, we propose an architectural compiler for self-adaptive systems, which generates architectural configurations from the goal-oriented requirements descriptions. We also present a framework for generating such configurations with this compiler and a pattern in the requirements description. We evaluate the framework experimentally and show that it helps to generate suitable configurations that have high performance, and that the compiler scales well to large input models. © 2011 ACM.

    DOI

  • A method for data-flow analysis of business components

    Taku Inoue, Shinichi Honiden

    CompArch'11 - Proceedings of the 2011 Federated Events on Component-Based Software Engineering and Software Architecture - CBSE'11     51 - 60  2011  [Refereed]

     View Summary

    Separation of concerns is an important aspect of component-based development (CBD), and managing data is a primary concern in enterprise systems. In CBD methods, such as Catalysis and UML components, this concern is addressed by business components. Although a business component is self-contained, having no direct dependency on any of the other components, the data propagation between components may lead to indirect data dependencies across the business components, and grasping such dependencies at design-time is crucial to maintaining data consistency. In this paper we propose a method for data-flow analysis (DFA) of the business component model, in which the operational behavior is described using the Object Constraint Language (OCL) pre-postconditions. Traditional DFA techniques are aimed at procedural descriptions, while OCL is a declarative language whose essential properties include nondeterminism and incompleteness. In order to extract a data-flow from the OCL descriptions taking account of their semantics, our proposed method applies the idea of abstract interpretation. We also analyze the safety of our abstract interpretation technique, and discuss the usefulness and scalability of the method from a practical viewpoint. The proposed method, when used in conjunction with the inter-procedural DFA techniques, would allow us to extract the propagation and dependency of data across the business components automatically. © 2011 ACM.

    DOI

  • Service selection with combinational use of functionally-equivalent services

    Nobuaki Hiratsuka, Fuyuki Ishikawa, Shinichi Honiden

    Proceedings - 2011 IEEE 9th International Conference on Web Services, ICWS 2011     97 - 104  2011  [Refereed]

     View Summary

    Due to the increase in Web services, many recent studies have been addressing the service selection problem based on non-functional or quality aspects. Our study incorporates combinational use of functionally-equivalent services into the problem to compose an application of higher quality or with additional value. However, when such combinational use is introduced, computational cost for the service selection becomes much higher. In this work, we propose a set of methods that reduce the additional cost for the QoS (Quality of Service)-based service selection considering combinational use. This approach achieves low cost by considering only effective combinations. The experimental results show that it can reduce computational cost regardless of the number of services and whatever their QoS values are while keeping the effectiveness of combinational use. © 2011 IEEE.

    DOI

  • QoS-aware automatic service composition by applying functional clustering

    Florian Wagner, Fuyuki Ishikawa, Shinichi Honiden

    Proceedings - 2011 IEEE 9th International Conference on Web Services, ICWS 2011     89 - 96  2011  [Refereed]

     View Summary

    With the steadily growing number of service providers the competition becomes more and more intense. In order to find a distinctive edge over other competitors, automatic service composition can be applied to further adapt to the requirements of the users. Most of the current composition approaches can be categorized as either planning or selection algorithms. The former automatically create workflows and tend to neglect Quality-of-Service (QoS) concerns, drawing compositions useless if user constraints are violated. Selection algorithms on the other hand optimize the QoS but provide no functional flexibility. In this paper we show how the strengths of both approaches can be combined by leveraging common characteristics of service registries. Therefore we utilize a data structure which arranges functionally similar services in clusters and computes the QoS of each cluster. Our planning tool composes workflows consisting of these clusters, taking the QoS of the clusters into account. This way, the utility in general and the reliability of the composed workflows are significantly increased. We prove the feasibility and the benefits of our functional clustering in our detailed evaluation. © 2011 IEEE.

    DOI

  • Efficient heuristic approach with improved time complexity for QoS-aware service composition

    Adrian Klein, Fuyuki Ishikawa, Shinichi Honiden

    Proceedings - 2011 IEEE 9th International Conference on Web Services, ICWS 2011     436 - 443  2011  [Refereed]

     View Summary

    Service-Oriented Architecture enables the composition of loosely coupled services provided with varying Quality of Service (QoS) levels. Given a composition, finding the set of services that optimizes some QoS attributes under given QoS constraints has been shown to be NP-hard. Therefore, heuristic algorithms are widely used, finding acceptable solutions in polynomial time. Still the time complexity of such algorithms can be prohibitive for real-time use, especially if the algorithms are required to run until they find near-optimal solutions. Thus, we propose a heuristic approach based on Hill-Climbing that makes effective use of an initial bias computed with Linear Programming, and works on a reduced search space. In our evaluation, we show that our approach finds near-optimal solutions and achieves a low time complexity. © 2011 IEEE.

    DOI

  • Bridging the gap between semantic web service composition and common implementation architectures

    Fuyuki Ishikawa, Satoshi Katafuchi, Florian Wagner, Yoshiaki Fukazawa, Shinichi Honiden

    Proceedings - 2011 IEEE International Conference on Services Computing, SCC 2011     152 - 159  2011  [Refereed]

     View Summary

    Semantic web techniques have been leveraged in planning methods for automated service composition. Typically, inputs and outputs of services are described in abstract concepts for efficient and meaningful matching between output of one service and input of another. However, existing methods have not examined concrete data structures, which are essential for successful service interaction in common implementation architectures. To address the problem, this paper proposes a matching method that can be incorporated into existing planning methods to ensure consistency in concrete data structures. The proposed method applies a two-phase matching process to efficiently filter out services that do not match at the abstract level. It also applies a data structure to organize similar services according to their relationships for efficient matching during the planning process. © 2011 IEEE.

    DOI

  • Autonomic role and mission allocation framework for wireless sensor networks

    Themistoklis Bourdenas, Kenji Tei, Shinichi Honiden, Morris Sloman

    Proceedings - 2011 5th IEEE International Conference on Self-Adaptive and Self-Organizing Systems, SASO 2011     61 - 70  2011  [Refereed]

     View Summary

    Pervasive applications incorporate physical components that are exposed to everyday use and a large number of conditions and external factors that can lead to faults and failures. It is also possible that application requirements change during deployment and the network needs to adapt to a new context. Consequently, pervasive systems must be capable to autonomically adapt to changing conditions without involving users becoming a transparent asset in the environment. In this paper, we present an autonomic mechanism for initial task assignment in sensor networks, an NP-hard problem. We also study on-line adaptation of the original deployment which considers real-time metrics for maximising utility and lifetime of applications and smooth service degradation in the face of component failures. © 2011 IEEE.

    DOI

  • Utility-Based Self-adaption with Environment Specific Quality Models

    Camilo Fitzgerald, Benjamin Kloepper, Shinichi Honiden

    ADAPTIVE AND INTELLIGENT SYSTEMS   6943   107 - 118  2011  [Refereed]

     View Summary

    In order to adjust to changing environments and internal states, self-adaptive systems are enabled to autonomously adjust their behaviour. The motive is to achieve better performance while minimising human effort in setting up and maintaining these systems. Ensuring correct functionality across a system's lifetime has been largely addressed. Optimisation of their performance, however, has received little attention. This paper presents an approach that applies goal modelling and decision making theory to calculate the quality of a system's performance in terms of a given configuration's utility with respect to its current environment. Thereby functionally valid configurations can be evaluated within the self-adaptive loop. The approach increased human players' performances in experiments based on a computer game. These results suggests that utility modelling is a promising approach for optimising the quality of behaviour in self-adaptive system.

    DOI

  • Assignment of sensors for multiple tasks using path information

    Susumu Toriumi, Shinichi Honiden

    Proceedings - 2011 IFIP 9th International Conference on Embedded and Ubiquitous Computing, EUC 2011     120 - 127  2011  [Refereed]

     View Summary

    A "shared" wireless sensor network (WSN) where multiple users deploy multiple tasks requires a mechanism for resource arbitration. This arbitration can be viewed as a problem with determining how best to assign sensors to tasks. The previous approaches only dealt with energy used for sensing
    however, experiments have shown that the energy used for communication must be dealt with within the context of a WSN. In this paper, we propose a novel formulation of this problem and a distributed assignment algorithm based on heuristics that takes into account path information between the assigned node and the base station. We take advantage of the "reactive" nature of the system and piggyback path information on task queries. We can expect higher utilization of the network in comparison with previous approaches by preserving routes through which sensing data run. The results of software simulations revealed that our assignment algorithm is more energy-efficient than the previous one that does not exploit information about the path. © 2011 IEEE.

    DOI

  • A Framework for Validating Task Assignment in Multi-agent Systems using Requirements Importance (Early Innovation)

    Hiroyuki Nakagawa, Nobukazu Yoshioka, Akihiko Ohsuga, Shinichi Honiden

    The 13th International Conference on Principles and Practice of Multi-Agent Systems     207 - 214  2010.11  [Refereed]

  • 同種サービスの複数利用を考慮した効率的なサービス選択候補の構築

    平塚 信明, 石川 冬樹, 本位田 真一

    合同エージェントワークショップ&シンポジウム(JAWS 2010)    2010.10  [Refereed]

  • Towards Effective Use of Requirements Description in Self-adaptive System Development

    Hiroyuki Nakagawa, Akihiko Ohsuga, Shinichi Honiden

    In Proceedings of the International Workshop on Modern Science and Technology 2010 (IWMST2010)    2010.09  [Refereed]

  • プロセス間競合を考慮した自己適応システムの形式仕様構築

    中川 博之, 大須賀 昭彦, 本位田 真一

    情報処理学会論文誌   Vol.51 ( No.9 ) 1751 - 1764  2010.09  [Refereed]

  • Service-oriented middleware for dynamic management of heterogeneous sensing devices

    Levent Gürgen, Johan Nyström-Persson, Amin Cherbal, Cyril Labbé, Claudia Roncancio, Shinichi Honiden

    In proceedings of the 7th ACM International Conference on Pervasive Services (ICPS 2010    2010.07  [Refereed]

  • 無線センサネットワークの為のモデル駆動開発に向けたDSL非依存モデルの提案

    清水 遼, 鄭 顕志, 深澤 良彰, 本位田 真一

    マルチメディア,分散,協調とモバイル(DICOMO2010)シンポジウム    2010.07  [Refereed]

  • 組合せによる条件付き品質を考慮したWebサービス選択の高速化手法

    渡辺 敦, 片渕 聡, 高橋 竜一, 鄭 顕志, 石川 冬樹, 深澤 良彰, 本位田 真一

    マルチメディア,分散,協調とモバイルシンポジウム(DICOMO 2010)    2010.07  [Refereed]

  • A Method of Analysis to Uncover Physical Artefact-Communication Relationship

    Nik Nailah Binti Abdullah, Helen Sharp, Shinichi Honiden

    In Proceedings of the 23rd FLAIRS conference. Special track: Cognition and AI: Capturing Cognitive Plausibility and Informing Psychological Processes.    2010.05

  • N-ary Sensor Model for Target Tracking in Wireless Sensor Networks

    Kenji Tei, Hikotoshi Nakazato, Yoshiaki Fukazawa, Shinichi Honiden

    In Proceedings of the First International Workshop on Energy Aware Design and Analysis of Cyber Physical Systems (WEA-CPS’10), in conjunction with CPSWEEK in Stockholm, Sweden.    2010.04

  • Rewriting Logic Model of Compositional Abstraction of Aspect-Oriented Software

    Yasuyuki Tahara, Akihiko Ohsuga, Shinichi Honiden

    Proc. of Foundations of Aspect-Oriented Languages Workshop 2010 (FOAL 2010)     53 - 62  2010.03  [Refereed]

  • 組み合わせQoSを考慮した自動サービス合成に関する研究

    渡辺敦, 片渕聡, 高橋竜一, 鄭顕志, 石川冬樹, 深澤良彰, 本位田真一

    ウィンターワークショップ2010・イン・倉敷    2010.01

  • Notification型Webサービス特有のQoSによるサービス選択に向けてのアプローチ

    片渕 聡, 鄭 顕志, 高橋 竜一, 石川 冬樹, 深澤 良彰, 本位田 真一

    ウィンターワークショップ2010・イン・倉敷    2010.01

  • Efficient, Failure-Resilient Semantic Web Service Planning\

    Florian Wagner, Fuyuki Ishikawa, Shinichi Honiden

    SERVICE-ORIENTED COMPUTING - ICSOC 2010, PROCEEDINGS   6470   686 - +  2010  [Refereed]

     View Summary

    Over the past years service-oriented architectures have been widely adopted by stakeholders from research and industry. Since the number of services increases rapidly, effective methods are required to automatically discover and compose services according to user requirements. For this purpose, machine-understandable semantic annotations have to be applied in order to enable logical reasoning on the functional aspects of services. However, current approaches are not capable of composing workflows in reasonable time, except for planning tools that require domain-dependent heuristics or constrain the expressiveness of the description language. In addition to that, these tools neglect alternative plans, concealing the danger of creating a workflow having insufficient reliability. Therefore, we propose an approach to efficiently pre-cluster similar services according to their parameters. This way the search space is limited and vulnerable intermediate steps in the workflow can be effectively avoided.

  • Service Composition with Pareto-Optimality of Time-Dependent QoS Attributes

    Benjamin Kloepper, Fuyuki Ishikawa, Shinichi Honiden

    SERVICE-ORIENTED COMPUTING - ICSOC 2010, PROCEEDINGS   6470   635 - 640  2010  [Refereed]

     View Summary

    Quality of Services (QoS) plays an essential role in realizing user tasks by service composition. Most QoS-aware service composition approaches have ignored the fact that QoS values can depend on the time of execution. Common QoS attributes such as response time may depend for instance on daytime, due to access tendency or conditional Service of Level Agreements. Application-specific QoS attributes often have tight relationships with the current state of resources, such as availability of hotel rooms. In response to these problems, this paper proposes an integrated multi-objective approach to QoS-aware service composition and selection.

    DOI

  • Efficient QoS-Aware Service Composition with a Probabilistic Service Selection Policy

    Adrian Klein, Fuyuki Ishikawa, Shinichi Honiden

    SERVICE-ORIENTED COMPUTING - ICSOC 2010, PROCEEDINGS   6470   182 - +  2010  [Refereed]

     View Summary

    Service-Oriented Architecture enables the composition of loosely coupled services provided with varying Quality of Service (QoS) levels. Given a composition, finding the set of services that optimizes some QoS attributes under given QoS constraints has been shown to be NP-hard. Until now the problem has been considered only for a single execution, choosing a single service for each workflow element. This contrasts with reality where services often are executed hundreds and thousands of times. Therefore, we modify the problem to consider repeated executions of services in the long-term. We also allow to choose multiple services for the same workflow element according to a probabilistic selection policy. We model this modified problem with Linear Programming, allowing us to solve it optimally in polynomial time. We discuss and evaluate the different applications of our approach, show in which cases it yields the biggest utility gains, and compare it to the original problem.

    DOI

  • Adaptive Geographic Routing in Wireless Sensor Networks

    Rey Abe, Shinichi Honiden

    MSWIM 2010: PROCEEDINGS OF THE 13TH ACM INTERNATIONAL CONFERENCE ON MODELING, ANALYSIS, AND SIMULATION OF WIRELESS AND MOBILE SYSTEMS     91 - 100  2010  [Refereed]

     View Summary

    Geographic routing protocols exploit node positions on the Euclidean plane to route packets in multi-hop networks. Their potential lies in forgoing the overhead of building routing structures for instance in the form of link-state tables. At the same time their performance suffers from local dead ends and missing or inaccurate node coordinates. These issues have been addressed by various means, most notably by falling back to face routing on a planarized network graph or to a backup routing infrastructure such as a minimum spanning tree. Existing solutions however are not geared towards finding efficient paths or result in a considerable often upfront and global - communication overhead.
    We propose assisting geographic routing adaptively by resorting to an on-demand route discovery only when and where it becomes necessary to sustain its greedy forwarding functionality. Simulating practically relevant qualities of dead ends and location inaccuracies, we show how the overhead of our method to deal with such cases remains localized and limited. We claim that our results make geographic routing more practicable particularly in wireless sensor networks that are deployed in immobile large-scale meshes and characterized by locally varying network conditions.

    DOI

  • Planning with utility and state trajectory constraints in self-healing automotive systems

    Benjamin Klöpper, Shinichi Honiden, Jan Meyer, Matthias Tichy

    Proceedings - 2010 4th IEEE International Conference on Self-Adaptive and Self-Organizing Systems, SASO 2010     74 - 83  2010  [Refereed]

     View Summary

    Planning is an important method in self-adaptive systems. Existing approaches emphasize the functional properties of the systems but do not consider possible alternative adaptations resulting in system functionality with different grades of quality. In compositional adaptation, the adaptation process should identify not only a feasible system configuration, but a good one. In safety-critical systems such as cars, the adaptation process has to fulfill special requirements. The sequence of reconfiguration activities has to maintain constraints over the entire state trajectory defined by the adaptation process, e.g., that certain processes are always running or even a minimal number of redundant instances. At the same time, in modern cars, many optional processes, such as learning of the engine model or optimization of control processes, improve the performance of the car. Possible optimization objectives are fuel consumption, driving comfort, and wear. Thus, this paper introduces a model of a self-adaptation process by reconfiguration, which considers the quality of alternative configurations. Furthermore, a planning process is introduced that generates a sequence of reconfiguration activities, which result in good configuration. The introduced process can be used to maintain the basic system functionality and also to select the currently most appropriate task implementations and optional tasks to run in a recovered system, e.g. after hardware failures. © 2010 IEEE.

    DOI

  • Agile Software Development Process: A Case Of Collaborative Cognition In Flux

    Nik Nailah Binti Abdullah, Robert G. M. Hausmann, Shinichi Honiden, Helen Sharp

    COGNITION IN FLUX     2401 - 2401  2010  [Refereed]

  • Business semantics centric reliability testing for Web services in BPEL

    Yongbo Wang, Fuyuki Ishikawa, Shinichi Honiden

    Proceedings - 2010 6th World Congress on Services, Services-1 2010     237 - 244  2010  [Refereed]

     View Summary

    The Business Process Execution Language (BPEL) has become the standard in web service composition, so that been adopted by industries to create mission critical services. The business process reliability especially business process consistency when some services failed is critical to composite services especially involving various organizations. However, it is difficult to conduct business process reliability testing for composite services due to complex business process in service composition, remote deployed services and long time testing duration. Little research is done to test fault tolerance capabilities of composite services only from low level. This paper proposes a technique on how to test the reliability of composite service defined in BPEL from the view of business semantics with little cost using fault injection. We present an approach for reliability testing of web services by using service stubs with semantic faults instead of real services which can be placed at service provider side or service consumer side. Dislike existing studies, we focus on how to find the reliability problems associating with business process - called semantics as the problems are not pure coding error but faults related to business process. In addition, the behavior of composite services in BPEL is analyzed when there are faults in orchestrated services invoked. Finally, a case study is given to show the whole process of reliability testing for composite web service. © 2010 IEEE.

    DOI

  • Extraction of Places Related to Flickr Tags

    Yukino Baba, Fuyuki Ishikawa, Shinichi Honiden

    ECAI 2010 - 19TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE   215   523 - 528  2010  [Refereed]

     View Summary

    Geographic information systems use databases to map keywords to places. These databases are currently most often created by using a top-down approach based on the geographic definitions. However, there is a problem with this approach in that these databases only contain location definitions such as addresses and place names, which does not allow for searches using keywords other than these words. Additionally, they do not give any information on the popularity, e. g., which is more popular among the places indexed by the same keyword. A bottom-up approach, based on the actual usage of words, can address these problems. We propose a method to aggregate tagging data and extract places related to a tag using the pair of a tag and a geo-tagged photo. We target the co-occurrence of a tag and the geolocation and represent the places related to a tag as a probability distribution over the longitudes and latitudes. We applied our method to data on the photo sharing service Flickr and experimentally confirmed that our method made it possible to highly-accurately extract places related to tags. Our direct bottom-up approach enables the extraction of place information that is not obtained by using traditional top-down approaches.

    DOI

  • Approximate Shortest Path Queries Using Voronoi Duals

    Shinichi Honiden, Michael E. Houle, Christian Sommer, Martin Wolff

    TRANSACTIONS ON COMPUTATIONAL SCIENCE IX   6290 ( 9 ) 28 - 53  2010  [Refereed]

     View Summary

    We propose an approximation method to answer point-to-point shortest path queries in undirected edge-weighted graphs, based on random sampling and Voronoi duals. We compute a simplification of the graph by selecting nodes independently at random with probability p. Edges are generated as the Voronoi dual of the original graph, using the selected nodes as Voronoi sites. This overlay graph allows for fast computation of approximate shortest paths for general, undirected graphs. The time-quality tradeoff decision can be made at query time. We provide bounds on the approximation ratio of the path lengths as well as experimental results. The theoretical worst-case approximation ratio is bounded by a logarithmic factor. Experiments show that our approximation method based on Voronoi duals has extremely fast preprocessing time and efficiently computes reasonably short paths.

    DOI

  • Flexible Bloom Filters for Searching Textual Objects

    Yuichi Sei, Kazutaka Matsuzaki, Shinichi Honiden

    AGENTS AND PEER-TO-PEER COMPUTING   5319   110 - 121  2010

     View Summary

    Efficient object searching mechanisms are essential in large-scale networks. Many studies have been done on distributed hash tables (DHTs), which are a kind of peer-to-peer system. In DHT networks, we can certainly get the desired objects if they exist. However, multi-word searches generate much communication traffic. Many studies have tried to reduce this traffic by using bloom filters, which are space-efficient probabilistic data structures. In using such filters, all nodes in a DHT must share their false positive rate parameter. However, the best false positive rate differs from one node to another. In this paper, we provide a method of determining the best false positive rate, and we use a new filter called a flexible bloom filter, to which each node can set the approximately best false positive rate. Experiments showed that the flexible bloom filter was able to greatly reduce the traffic.

    DOI

  • Thinking autonomic for sensing devices

    Remi Sharrock, Amin Cherbal, Levent Guergen, Thierry Monteil, Shinichi Honiden

    SIXTH INTERNATIONAL CONFERENCE ON AUTONOMIC AND AUTONOMOUS SYSTEMS: ICAS 2010, PROCEEDINGS     20 - 23  2010

     View Summary

    This paper presents a middleware that aims to respond to the increasing management needs of networked sensing devices, such as remote software deployment, dynamic configuration and real-time performance monitoring and tuning. These are essential functions for building adaptable systems providing high quality of service. Furthermore, autonomic management bears particular importance for large scale systems having timely response requirements. Our middleware allows creating high-level policies that describe the actions to be autonomously performed when interesting events occur in the system. The policies are formulated as Event-Condition-Action (ECA) rules. They are created by using UML-like diagrams and can be deployed at any level of the distributed architecture of the system.

    DOI

  • Suppressing Redundancy in Wireless Sensor Network Traffic

    Rey Abe, Shinichi Honiden

    DISTRIBUTED COMPUTING IN SENSOR SYSTEMS, PROCEEDINGS   6131   187 - 200  2010

     View Summary

    Redundancy suppression is a network traffic compression technique that, by caching recurring transmission contents at receiving nodes, avoids repeatedly sending duplicate data. Existing implementations require abundant; memory both to analyze recent traffic for redundancy and to maintain the cache. Wireless sensor nodes at the same time cannot provide such resources due to hardware constraints. The diversity of protocols and traffic patterns in sensor networks furthermore makes the frequencies and proportions of redundancy in traffic unpredictable. The common practice of narrowing down search parameters based on characteristics of representative packet traces when dissecting data for redundancy thus becomes inappropriate. Such difficulties made us devise a novel protocol that conducts a probabilistic traffic analysis to identify and cache only the subset of redundant transfers that yields most traffic savings. We verified this approach to perform close enough to a solution built on exhaustive analysis and unconstrained caching to be practicable.

    DOI

  • Cooperative Behaviors Description for Self-* Systems Implementation

    Hiroyuki Nakagawa, Akihiko Ohsuga, Shinichi Honiden

    ADVANCES IN PRACTICAL APPLICATIONS OF AGENTS AND MULTIAGENT SYSTEMS   70   69 - +  2010

     View Summary

    Agent platforms have recently attracted attention for use as a basis for self-* systems development because it provides a mechanism for autonomous functionalities. From among these platforms, JADE allows developers to describe concurrent behaviors on it, and this can be a foundation of constructing the multi-processes on self-* systems. This paper shows an overview of our approach for implementing highly collaborative behaviors by introducing a component style behavior model and its life cycle on the basis of the agent platform.

  • Communication in Context: A Stimulus-Response Account of Agile Team Interactions

    Nik Nailah Binti Abdullah, Helen Sharp, Shinichi Honiden

    AGILE PROCESSES IN SOFTWARE ENGINEERING AND EXTREME PROGRAMMING   48   166 - +  2010

     View Summary

    Previous research has indicated that work artefacts commonly used by agile teams capture progress information, while functional aspects such as requirements are developed and sustained through the team's social interactions and communication channels. This paper reports an initial empirical study to investigate the relationship between agile work artefacts and communication during stand-up meetings and pair programming sessions, specifically focusing on gathering and clarifying requirements. Using Bateson's communication theory, we found that the work artefacts, and other individuals form an external event system which supports Agile teams during the gathering and clarifying of requirements. Using this communication theory together with Clancey's situated cognition, we predict that if the two do not exist together throughout the interactions, then teams members will form discoordinated actions together.

    DOI

  • Sustaining behavioral diversity in NEAT

    Hirotaka Moriguchi, Shinichi Honiden

    Proceedings of the 12th Annual Genetic and Evolutionary Computation Conference, GECCO '10     611 - 618  2010

     View Summary

    Niching schemes, which sustains population diversity and let an evolutionary population avoid premature convergence, have been extensively studied in the research field of evolutionary algorithms. Neuroevolutionary (NE) algorithms, such as NEAT, have also benefitted from niching. However, the latest research indicates that the use of genotypeor phenotype-similarity-based niching schemes in NE algorithms is not highly effective because these schemes have difficulty sustaining the behavioral diversity in the environment. In this paper, we propose a novel niching scheme that takes into consideration both the phenotypic and behavioral diversity, and then integrate it with NEAT. An experimental analysis revealed that the proposed algorithm outperforms the original NEAT for various problem settings. More interestingly, it performs especially well for problems with a high noise level and large state space. Since these features are common in problems to which NEAT is applied, the proposed algorithm should be effective in practice. Copyright 2010 ACM.

    DOI

  • ビヘイビア記述に基づく自己適応システム実装フレームワークの提案

    中川 博之, 大須賀 昭彦, 本位田 真一

    人工知能学会論文誌 特集「エージェント」   26 ( 1 )  2010

    DOI

  • Data management solutions in networked sensing systems

    Levent Gürgen, Claudia Roncancio, Cyril Labbé, Shinichi Honiden

    Studies in Computational Intelligence   278   111 - 137  2010  [Refereed]

     View Summary

    Since the emergence of sensor oriented applications, sensor data management has become a very active research domain. We can distinguish three classes of solutions in this area, which we will explore in this chapter. The first is sensor networks which provide distributed processing of sensor data. The second is data stream management systems which are centralized systems that deal with stream data flowing from sensors. And finally, some hybrid approaches have also recently appeared which aim to integrate these two different types of solutions. This chapter provides an overviewof these three groups of proposals and discusses their approach to deal with issues such as scalability of sensing systems, heterogeneity of sensors and processing complex operations on sensor data stream. © 2010 Springer-Verlag Berlin Heidelberg.

    DOI

  • Efficient, Failure-Resilient Semantic Web Service Planning\

    Florian Wagner, Fuyuki Ishikawa, Shinichi Honiden

    SERVICE-ORIENTED COMPUTING - ICSOC 2010, PROCEEDINGS   6470   686 - +  2010  [Refereed]

     View Summary

    Over the past years service-oriented architectures have been widely adopted by stakeholders from research and industry. Since the number of services increases rapidly, effective methods are required to automatically discover and compose services according to user requirements. For this purpose, machine-understandable semantic annotations have to be applied in order to enable logical reasoning on the functional aspects of services. However, current approaches are not capable of composing workflows in reasonable time, except for planning tools that require domain-dependent heuristics or constrain the expressiveness of the description language. In addition to that, these tools neglect alternative plans, concealing the danger of creating a workflow having insufficient reliability. Therefore, we propose an approach to efficiently pre-cluster similar services according to their parameters. This way the search space is limited and vulnerable intermediate steps in the workflow can be effectively avoided.

  • 進化的神経回路網における個体の機能に基づく類似度尺度の提案

    森口 博貴, 本位田 真一

    第三回進化計算シンポジウム    2009.12

  • Group Migration by Mobile Agents in Wireless Sensor Networks

    Shunichiro Suenaga, Nobukazu Yoshioka, Shinichi Honiden

    The Computer Journal, Oxford University Press    2009.12

  • How Top-Level Engineers Learn and Investigate VDM: Experiences in the Top SE Project

    Fuyuki Ishikawa, Kenji Taguchi, Shinichi Honiden

    The 7th VDM-Overture Workshop at FM 2009, Eindhoven, the Netherlands    2009.11

  • マルチエージェントシステムにおけるメタデータを用いた協調プロトコル合成手法

    高橋 竜一, 鄭 顕志, 石川 冬樹, 本位田 真一, 深澤 良彰

    電子情報通信学会論文誌   J92-D ( 11 ) 1827 - 1839  2009.11

  • スマート空間内でのサービス利用時に発生する物理的影響の考慮の支援

    山本 佳代子, 石川 冬樹, 本位田 真一

    合同エージェントワークショップ&シンポジウム(JAWS2009)    2009.10

  • 振る舞いに基づく多様性維持とイノベーション保護"

    森口 博貴, 本位田 真一

    第2回進化計算フロンティア研究会(SIG-ECF),    2009.10

  • ゴール指向要求分析を用いたself-adaptiveシステムの構築

    中川 博之, 大須賀 昭彦, 本位田 真一

    情報処理学会論文誌   50 ( 10 ) 2500 - 2513  2009.10

  • 無線センサネットワークにおけるアプリケーション配置を考慮した生存時間延長

    鳥海 晋, 清 雄一, 末永 俊一郎, 鄭 顕志, 本位田 真一

    マルチメディア,分散,協調とモバイルシンポジウム (DICOMO2009)    2009.07

  • サービス合成におけるメタデータを用いた協調プロトコル合成手法

    高橋 竜一, 鄭 顕志, 石川 冬樹, 本位田 真一, 深澤 良彰

       2009.07

  • Webサービス検索のための操作カテゴリ分類手法の提案

    片渕 聡, 鄭 顕志, 高橋 竜一, 石川 冬樹, 深澤 良彰, 本位田 真一

    電子情報通信学会情報・システムソサエティサービスコンピューティング時限専門委員会第1回研究会    2009.07

  • Op´erations d’administration pour SStreaMWare

    Levent Gürgen, Cyril Labb?, Shinichi Honiden

    In Proceedings of the 5th French speaking conference on Ubiquity and Mobility (UBIMOB'09),    2009.07

  • 66. Opérations d'administration pour SStreaMWare

    Levent Gürgen, Cyril Labbé, Shinichi Honiden

       2009.07  [Refereed]

    DOI

  • Folksonomy からの潜在的知識抽出

    馬場 雪乃, 石川 冬樹, 本位田 真一

    第10回AI若手の集い (MYCOM2009)    2009.06

  • An integrated management middleware for networked sensing systems

    Levent Gürgen, Shinichi Honiden

    The Seventh International Conference on Pervasive Computing, Late Breaking Results    2009.05

  • 多数のノード取得攻撃に対応した無線センサーネットワークにおける不正イベントの検知

    清 雄一, 本位田 真一

    電子情報通信学会論文誌   92-B ( 4 ) 678 - 688  2009.04

  • 多数のノード取得攻撃に対応した無線センサーネットワークにおける複製ノードの分散検知

    清 雄一, 本位田 真一

    電子情報通信学会論文誌   92-B ( 4 ) 689 - 699  2009.04

  • 分散配列: 効率的な論理配列を実現するP2Pデータ構造

    福地 大輔, Christian Sommer, 清 雄一, 本位田 真一

    情報処理学会論文誌   50 ( 2 ) 721 - 736  2009.02  [Refereed]

  • 無線センサネットワークにおける複数プログラムの動的配備

    末永 俊一郎, 吉岡 信和, 本位田 真一

    情報処理学会論文誌   50 ( 1 ) 14 - 30  2009.02  [Refereed]

  • 無線センサーネットワークにおける不正メッセージ作成元ノードの検知

    清 雄一, 本位田 真一

    情報処理学会論文誌   50 ( 2 ) 787 - 797  2009.02  [Refereed]

  • Generative Dynamic Deployment of Multiple Components in Wireless Sensor Networks

    Shunichiro Suenaga, Nobukazu Yoshioka, Shinichi Honiden

    WONS 2009: SIXTH INTERNATIONAL CONFERENCE ON WIRELESS ON-DEMAND NETWORK SYSTEMS AND SERVICES     183 - +  2009  [Refereed]

     View Summary

    Wireless sensor networks (WSN) consist of spatially distributed nodes that monitor physical conditions. In the past, most WSNs have been designed with a single specific application in mind. Recent developments however are expanding the applicability of WSNs and are increasing the demand for deploying multiple applications simultaneously. To host multiple applications in a single WSN, current solutions provide mechanisms for components to be dynamically deployed to nodes. However, two issues make the present form of dynamic deployment impractical for applications involving distributed collaboration and the redeployment of multiple distributed components. For one, existing works lack a suitable architecture for cooperation and interaction between components in WSNs. Another problematic aspect is the insufficiency of current methods in efficiently deploying multiple components throughout the network. To address these issues, we propose an architecture based on multiple components that have specific responsibilities in regard to deployment and a generative approach for dynamic deployment of such components.

    DOI

  • Reporter node determination of replicated node detection in wireless sensor networks

    Yuichi Sei, Shinichi Honiden

    Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication, ICUIMC'09     566 - 573  2009  [Refereed]

     View Summary

    In large-scale sensor networks, sensor nodes are at high risk of being captured and compromised. Once a sensor node is compromised, all the secret keys, data, and code stored on it are exposed to the attacker. The attacker can insert arbitrary malicious code in the compromised node. Moreover, he can easily replicate such code in a large number of clones and deploy them on the network. This node replication attack can form the basis of a variety of attacks such as DoS attacks and Sybil attacks. In the related studies, as a means of detecting compromised nodes, each node reports its neighbor's ID and location to a witness node with some probability p. The value of p is determined beforehand or from only the number of neighbor nodes. In this paper, we change p according to the locations of nodes. We aim to increase the detection rate of replicated node attacks and decrease the amount of messages. Our analysis and simulations demonstrate that using our protocol in combination with the methods of other studies is more effective than using the methods of the related studies by themselves. Copyright 2009 ACM.

    DOI

  • Efficient & Flexible Routing in Wireless Sensor Networks with Self Organizing Transaction Cluster Heads

    Neeraj Rajgure, Eric Platon, Cristian Borcea, Shinichi Honiden

    In the Proceedings of the 2009 ACM symposium on Applied Computing     1214 - 1218  2009

    DOI

  • On Applicability of Formal Methods and Tools to Dependable Services

    Fuyuki Ishikawa, Shinichi Honiden

    IEICE TRANSACTIONS ON COMMUNICATIONS   E92B ( 1 ) 9 - 16  2009.01

     View Summary

    As a variety of digital services are provided through networks, more and more efforts are made to ensure dependability of software behavior implementing set-vices. Formal methods and tools have been considered as promising means to support dependability in complex software systems during the development. On the other hand, there have been serious doubts on practical applicability of formal methods. This paper overviews the present state of formal methods and discusses their applicability, especially focusing on two representative methods (SPIN and B Method) and their recent industrial applications. This paper also discusses applications of formal methods to dependable networked software.

    DOI CiNii

  • Plug & manage heterogeneous sensing devices

    Levent Gürgen, Johan Nyström-Persson, Amin Cherbal, Cyril Labbé, Claudia Roncancio, Shinichi Honiden

    ACM International Conference Proceeding Series     3 - 4  2009

     View Summary

    With the emergence of sensors in applications in which the quality of service requirements are high (e.g., industrial, medical, domotic), management of these sensing devices gains an increasing importance. However, management issues are still little explored in this context. This demonstration presents our solution for dynamically managing networked heterogeneous sensing devices. The solution is based on a service oriented middleware that provides generic management operations for configuration, software management and performance monitoring of sensing devices. Copyright © 2009 ACM.

    DOI

  • Modeling, analyzing and weaving legal interpretations in goal-oriented requirements engineering

    Fuyuki Ishikawa, Rihoko Inoue, Shinichi Honiden

    2009 2nd International Workshop on Requirements Engineering and Law, RELAW 2009     39 - 44  2009

     View Summary

    As many laws are concerned with information systems, each organization needs to carefully examine a law and determine technical requirements as well as its operational policies with sufficient concreteness. Legal interpretations essentially affect decisions made in refining goals, or making goals more concrete, that are directly or indirectly established by the law. As common and conventional interpretations are gradually identified and become widespread through appearances of cases and guidelines, goal refinement relationships need to be constantly managed and adjusted to the latest legal interpretations. This paper discusses an initial approach to management of legal interpretations together with goal-oriented requirements engineering, through a motivating example of a Japanese law on trade secrets. Specifically, this study proposes a metamodel for legal interpretation. In the metamodel, legal interpretations are modeled as refinement relationships between defi-nitions of concepts or terms and then analyzed by matching with instances. Legal interpretations can then be woven into goal trees as criteria of goal refinement.

    DOI

  • What Top-Level Software Engineers Tackle after Learning Formal Methods: Experiences from the Top SE Project

    Fuyuki Ishikawa, Kenji Taguchi, Nobukazu Yoshioka, Shinichi Honiden

    TEACHING FORMAL METHODS, PROCEEDINGS   5846   57 - 71  2009

     View Summary

    In order to make practical use of formal methods, it is not sufficient for engineers to obtain general, fundamental knowledge of the methods and tools. Actually, it is also necessary for them to carefully consider their own contexts and determine adequate approaches to their own problems. Specifically, engineers need to choose adequate methods and tools, determine their usage strategies, and even customize or extend them for their effective and efficient use. Regarding the point, this paper reports and discusses experiences on education of formal methods in the Top SE program targeting software engineers in the industry. The program involves education of a variety of scientific methods and tools with group exercises on practical problems, allowing students to compare different approaches while understanding common principles. In addition, the program involves graduation studies where each student identifies and tackles their own problems. Statistics on problem settings in the graduation studies provide interesting insights into what top-level engineers tackles after learning formal methods.

  • Specifying and Checking Refinement Relationships in VDM plus

    Yojiro Kawamata, Christian Sommer, Fuyuki Ishikawa, Shinichi Honiden

    SEFM 2009: SEVENTH INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING AND FORMAL METHODS     220 - +  2009

     View Summary

    Formal methods allow to verify several properties of specifications and implementations. Intra-specification consistency means that a specification does not contradict itself. When specifications evolve over time, one also wants to check inter-specification consistencies, which mean that specifications defined earlier in the development cycle also hold at a later point in time.
    VDM++ is a popular and easy-to-use formal specification language. It uses testing instead of formal proofs to validate the consistency of specifications. The strictness of validations thus depends on the completeness of the corresponding test suites. Unfortunately, VDM++ does not support the verification of inter-specification consistencies. We define VDM-R, an extension of VDM++, which allows to annotate relationships between specifications. We also provide the tool VR2EvtB to translate from VDM-R to Event-B. Using an Event-B verifier, we can then formally validate intra- and inter-specification consistencies in an almost fully-automated process.

    DOI

  • Balancing Graph Voronoi Diagrams

    Shinichi Honiden, Michael E. Houle, Christian Sommer

    2009 6TH INTERNATIONAL SYMPOSIUM ON VORONOI DIAGRAMS (ISVD 2009)     183 - +  2009

     View Summary

    Many facility location problems are concerned with minimizing operation and transportation costs by partitioning territory into regions of similar size, each of which is served by a facility. For many optimization problems, the overall cost can be reduced by means of a partitioning into balanced subsets, especially in those cases where the cost associated with a subset is superlinear in its size. In this paper, we consider the problem of generating a Voronoi partition of a discrete graph so as to achieve balance conditions on the region sizes. Through experimentation, we first establish that the region sizes of randomly-generated graph Voronoi diagrams vary greatly in practice. We then show how to achieve a balanced partition of a graph via Voronoi site resampling. For bounded-degree graphs, where each of the n nodes has degree at most d, and for an initial randomly-chosen set of s Voronoi nodes, we prove that, by extending the set of Voronoi nodes using an algorithm by Thorup and Zwick, each Voronoi region has size at most 4dn/s+1 nodes, and that the expected size of the extended set of Voronoi nodes is at most 2s log n.

    DOI

  • Approximate Shortest Path Queries in Graphs Using Voronoi Duals

    Shinichi Honiden, Michael E. Houle, Christian Sommer, Martin Wolff

    2009 6TH INTERNATIONAL SYMPOSIUM ON VORONOI DIAGRAMS (ISVD 2009)     53 - +  2009

     View Summary

    We propose an approximation method to answer point-to-point shortest path queries in undirected graphs, based on random sampling and Voronoi duals. We compute a simplification of the graph by selecting nodes independently at random with probability p. Edges are generated as the Voronoi dual of the original graph, using the selected nodes as Voronoi sites. This overlay graph allows for fast computation of approximate shortest paths for general, undirected graphs. The time-quality tradeoff decision can be made at query time. We provide bounds on the approximation ratio of the path lengths as well as experimental results. The theoretical worst-case approximation ratio is bounded by a logarithmic factor. Experiments show that our approximation method based on Voronoi duals has extremely fast preprocessing time and efficiently computes reasonably short paths.

    DOI

  • Physical Interaction in Pervasive Computing: Formal Modeling, Analysis and Verification

    Fuyuki Ishikawa, Basem Suleiman, Kayoko Yamamoto, Shinichi Honiden

    INTERNATIONAL CONFERENCE ON PERVASIVE SERVICES (ICPS 2009)     133 - 140  2009

     View Summary

    Application software in pervasive computing is required to control devices embedded in the environment by being aware of the contexts on which effectiveness of the devices depend. Developers face difficulties to enumerate involved physical prerequisites for effective use of devices and undesirable situations to be avoided, as well as define consistent behaviors of the application software. This study provides a theoretical framework for formal modeling of requirements, assumptions and behaviors for application software in pervasive computing. This study specifically focuses on prerequisites for physical (visual, audio, etc.) interactions, which are defined and examined in terms of scopes and their relationships not limited to tree structures. This study also explores analysis and verification based on the formal modeling, using of an existing reasoner.

    DOI

  • Management of Networked Sensing Devices

    Levent Gurgen, Shinichi Honiden

    MDM: 2009 10TH INTERNATIONAL CONFERENCE ON MOBILE DATA MANAGEMENT     502 - 507  2009

     View Summary

    Considerable research has been done on different aspects of sensor networks. However management issues for these devices are still little explored. Nonetheless, with the increasing number of heterogeneous distributed sensors in various application domains, their management gains more and more importance, in particular for domains where requirements in terms of quality service, reliability, security and integrity are high, e.g., industrial, medical and domotics. This paper promotes an integrated management solution that covers domains such as network, system, application and device management. It first gives a brief state of the art of management solutions for traditional computer systems and sensor networks, then from a device management point of view, it presents challenges and possible solutions for generic networked sensing device management.

    DOI

  • Distributed Arrays: A P2P Data Structure for Efficient Logical Arrays

    Daisuke Fukuchi, Christian Sommer, Yuichi Sei, Shinichi Honiden

    IEEE INFOCOM 2009 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-5     1458 - 1466  2009

     View Summary

    Distributed hash tables (DHT) are used for data management in P2P environments. However, since most hash functions ignore relations between items, DHTs are not efficient for operations on related items. In this paper, we modify a DHT into a distributed array (DA) that enables efficient operations on logical arrays. The array elements of a DA are placed in a P2P overlay network according to a simple rule such that the load is balanced and the number of messages required to access elements sequentially is reduced. The number of messages required for array operations is much smaller than that for operations on DHTs. We demonstrate this theoretically and experimentally.

    DOI

  • Geographical data collection in sensor networks with self-organizing transaction cluster-heads

    Neeraj Rajgure, Eric Platon, Cristian Borcea, Shinichi Honiden

    Proceedings of the ACM Symposium on Applied Computing     1214 - 1218  2009  [Refereed]

     View Summary

    This paper proposes 2G, a flexible and energy-efficient data collection protocol for sensor networks for increasing network lifetime. To this end, it integrates self-organizing data aggregation mechanisms based on geographical and cluster-based routing, and transaction cluster-head (TCH). A TCH is a location-based role, dynamically assigned to a node for the duration of handling a request-response transaction that targets its region of the network. TCH nodes collect raw sensor readings from their local regions and forward the answers containing aggregated data using geographical routing. A prototype of 2G was implemented on MICAz motes, and experimental results in realistic conditions proved that data collection reaches significantly higher delivery rates than with GEAR, the geographical routing protocol leveraged by 2G. Additionally, simulation results for larger scale networks demonstrate that 2G outperforms GEAR in terms of network lifetime. Copyright 2009 ACM.

    DOI

  • Evolution of a course on model checking for practical applications

    Yasuyuki Tahara, Nobukazu Yoshioka, Kenji Taguchi, Toshiaki Aoki, Shinichi Honiden

    ACM SIGCSE Bulletin   Volume41 ( Issue 2 ) 38 - 44  2009  [Refereed]

    DOI

  • Distributed Detection of Node Replication Attacks Resilient to Many Compromised Nodes in Wireless Sensor Networks

    Yuichi Sei, Shinichi Honiden

    Fourth International Wireless Internet Conference (WICON 2008)    2008.11  [Refereed]

  • An Efficient Node Selection Metric for In-network Process Deployment

    Kenji Tei, Yoshiaki Fukazawa, Shinichi Honiden

    Fourth International Wireless Internet Conference (WICON 2008)    2008.11  [Refereed]

  • KAOSモデルを利用したself-adaptive システムの構築

    中川博之, 大須賀昭彦, 本位田真一

       2008.11  [Refereed]

  • 無線センサネットワークにおける計測記述言語のための規範モデル導出手法の構築

    鄭顕志, 深澤良彰, 本位田真一

    第15回ソフトウェア工学の基礎ワークショップ(FOSE2008)     69 - 75  2008.11  [Refereed]

  • トップエスイー:ソフトウェア開発におけるトップレベル技術者の育成

    鷲崎弘宜, 田口研治, 吉岡信和, 粂野文洋, 田原康之, 本位田 真一

    Quality One   4   5 - 11  2008.11  [Refereed]

  • Education Course of Practical Model Checking

    Yasuyuki Tahara, Nobukazu Yoshioka, Kenji Taguchi, Toshiaki Aoki, Shinichi Honiden

    First International Workshop on Formal Methods Education and Training, Technical Report GRACE-TR-2008-03   3   33 - 48  2008.10  [Refereed]

  • Extracting Time and Location Concepts Related to Tags

    Yukino Baba, Fuyuki Ishikawa, Shinichi Honiden

    Workshop on 1st Workshop on Incentives for the Semantic Web (INSEMTIVE 2008)     15 - 26  2008.10  [Refereed]

  • 適応エージェントのためのユビキタスコンピューティングミドルウェア

    鄭 顕志, 石川 冬樹, 吉岡 信和, 深澤 良彰, 本位田 真一

    コンピュータソフトウェア   25 ( 4 ) 11 - 19  2008.10

    DOI

  • ユビキタスコンピューティングにおけるアプリケーション開発手法に関する研究動向

    鄭顕志, 中川博之, 川俣洋次郎, 吉岡信和, 深澤良彰, 本位田真一

    コンピュータソフトウェア   25 ( 4 ) 121 - 132  2008.10  [Refereed]

  • ユビキタスコンピューティングにおける分散協調・連携技術の研究動向

    石川 冬樹, 阿部 玲, 高橋 竜一, 吉岡 信和, 深澤 良彰, 本位田 真一

    コンピュータソフトウェア   25 ( 4 ) 133 - 144  2008.10

  • コンポーネントモデルを用いたJADE ビヘイビア実装手法の提案

    中川博之, 大須賀昭彦, 本位田真一

       2008.10  [Refereed]

  • Constructing Self-adaptive Systems Using KAOS Model

    Hiroyuki Nakagawa, Akihiko Ohsuga, Shinichi Honiden

    Proc. of the Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems Workshops (SASOW 2008)    2008.10  [Refereed]

    DOI

  • 協調プロトコル合成における制御構造付与のためのハイレベルオペレーション

    高橋竜一, 鄭顕志, 石川冬樹, 深澤良彰, 本位田真一

    合同エージェントワークショップ&シンポジウム2008 (JAWS-2008)    2008.10  [Refereed]

  • Transparent Application Lifetime Management in Wireless Sensor Networks

    Eric Platon, Shunichiro Suenaga, Nobukazu Yoshioka, Shinichi Honiden

    the 10th International Conference on Ubiquitous Computing (UbiComp 2008)    2008.09  [Refereed]

  • Characterizing different communication characteristics arising in different phases of meetings

    Nik Nailah Binti Abdullah, Shinichi Honiden

    Conference on Language, Communication and Cognition. Brighton, London    2008.08

  • Bayesian Iteration: Online Learning in Timed Zero-Sum Games with Unknown Enemy

    Hirotaka Moriguchi, Fuyuki Ishikawa, Shinichi Honiden

    Workshop on Artificial Intelligence in Games (AIG'08)    2008.07  [Refereed]

  • What Goes on in a Meeting? Empirical Work

    Nik Nailah Binti Abdullah, Tomadaki, E, Scott, P.J, Shinichi Honiden

    30th Annual Conference of the Cognitive Science Society     2512 - 2512  2008.07  [Refereed]

  • The challenges in analyzing online videoconferencing meetings

    Nik Nailah Binti Abdullah, Shinichi Honiden

    Third international conference on Interdisciplinary social science. Monash University Center, Prato, Tuscany, Italy    2008.07

  • モデル変換に基づく要求記述を利用した形式仕様の構築

    中川 博之, 田口 研治, 本位田 真一

    情報処理学会論文誌   49 ( 7 ) 2304 - 2318  2008.07  [Refereed]

  • 通信コストと計測精度を考慮したトラッキングのためのセンサモデルの提案

    中里彦俊, 中村善行, 鄭顕志, 深澤良彰, 本位田真一

    マルチメディア, 分散, 協調とモバイルシンポジウム(DICOMO2008)    2008.07  [Refereed]

  • 無線センサネットワークにおける省資源性を考慮したセンサセレクション手法

    中村善行, 鄭顕志, 深澤良彰, 本位田真一

    マルチメディア, 分散, 協調とモバイルシンポジウム(DICOMO2008)    2008.07  [Refereed]

  • ユビキタスコンピューティングにおけるイベントに基づいたアクセス制御

    石川 冬樹, 清 雄一, 吉岡 信和, 本位田 真一

    マルチメディア,分散,協調とモバイル(DICOMO2008)シンポジウム 論文集     435 - 438  2008.07  [Refereed]

  • 効率の良いネットワーク内処理のためのノード選択指標の提案

    鄭 顕志, 深澤 良彰, 本位田 真一

    情報処理学会論文誌   49 ( 6 ) 1872 - 1884  2008.06  [Refereed]

  • タグに関連づけられた時間・場所の概念抽出(「Webインテリジェンス」及び一般)

    馬場雪乃, 石川冬樹, 本位田真一

    電子情報通信学会技術研究報告. AI, 人工知能と知識処理   108 ( 119 ) 51 - 56  2008.06

    CiNii

  • On agent-friendly aggregation in networks

    Christian Sommer, Shinichi Honiden

    Second International Workshop on Agent-Technology for Sensor Networks (ATSN-08)     75 - 78  2008.05  [Refereed]

  • Constructing Locally Centralized Applications by Mobile Agents in Wireless Sensor Networks

    Shunichiro Suenaga, Shinichi Honiden

    Second International Workshop on Agent Technology for Sensor Networks (ATSN-08). Estoril, Portugal    2008.05

  • The what and how of IM functions in distributed scientific collaboration

    Nik Nailah Binti Abdullah, Shinichi Honiden

    3rd Int. Conference on IASTED-HCI, Innsbruck, Austria    2008.03

  • Name-based Location Service for Mobile Agents in Wireless Sensor Networks

    Shunichiro Suenaga, Shinichi Honiden

    First International Conference on MOBILe Wireless MiddleWARE, Operating Systems, and Applications (MOBILWARE 2008)    2008.02

  • 無線センサーネットワークにおけるFalse Eventの検知

    清雄一, 本位田真一

    情報処理学会論文誌   49 ( 2 ) 628 - 638  2008.02  [Refereed]  [Invited]

  • Discovery of Configurations for Indoor Wireless Sensor Networks Through Use of Simulation in Virtual Worlds

    Valentina Baljak, Shinichi Honiden

    2010 FOURTH INTERNATIONAL CONFERENCE ON SENSOR TECHNOLOGIES AND APPLICATIONS (SENSORCOMM)     323 - 328  2008  [Refereed]

     View Summary

    The development of wireless sensor networks deals with several difficulties, including time, cost and complexity of testing. In particular, indoor environment poses several specific constraints on radio wave propagation due to density of obstacles. This must be taken into account if we want to discover and validate network configurations and communication paths. We suggest the use of virtual worlds, exploiting their inherent features for modeling of 3D environment, to simulate wireless sensor networks in order to deal with this problem. We have created an initial version of one such tool, which supports discovery and testing of configurations and communication paths within indoor wireless sensor networks. The validity of our approach was confirmed through experiments performed in this tool, in parallel with real-world experiments in a similar setting.

    DOI

  • A Flexible Protocol Composition for Multi-party Coordination Protocols in Multi-agent Systems

    Ryuichi Takahashi, Kenji Tei, Yoshiaki Fukazawa, Fuyuki Ishikawa, Shinichi Honiden

    2008 IEEE INTERNATIONAL CONFERENCE ON PERVASIVE COMPUTING AND COMMUNICATIONS     609 - +  2008

     View Summary

    Multi-agent systems need protocols to coordinate among agents implemented by different owners. However specifying coordination protocols for many participating agents is a complex task. A protocol composition approach, which can reduce the complexity of specifying such a coordination protocol, must specify how to compose coordination protocols in a composition configuration. Current protocol compositions cannot sufficiently reduce the complexity because composing a protocol several times requires the specification of too many configurations. We propose a protocol composition approach that can specify composition configurations in an abstract way. We assign metadata to the messages in a coordination protocol and use the metadata to specify the configuration. An abstract configuration using metadata can be applied to various protocol compositions and can reduce the number of specifications required for configuration composition.

    DOI

  • Energy-Efficient Event Detection in 3D Wireless Sensor Networks

    Susumu Toriumi, Yuichi Sei, Shinichi Honiden

    2008 1ST IFIP WIRELESS DAYS (WD)     370 - +  2008  [Refereed]

     View Summary

    Event detection techniques are crucial for environmental monitoring and object tracking applications in wireless sensor networks. Event detection requires sensor readings to he collected from multiple sensors, and as sensors have limited resources, their readings should he retrieved efficiently. Existing aggregation-based event detection methods, however, require all sensors in the network to transmit their readings, which results in high energy consumption for the network. We propose an energy-efficient event detection technique for estimating the state of the whole environment based on only some of the sensor readings and use a contour map to represent the outline of the environment. To detect events in 3D environments, we modify an existing 2D contour mapping algorithm, extending it for 3D environments. By simulation, we show how our event detection technique is more energy-efficient than existing solutions that take readings from all sensors. We evaluated our method from the point of energy efficiency and found that it improves the energy efficiency of event detection in 3D wireless sensor networks.

    DOI

  • Model Checking Process with Goal Oriented Requirements Analysis

    Hideto Ogawa, Fumihiro Kumeno, Shinichi Honiden

    APSEC 2008:15TH ASIA-PACIFIC SOFTWARE ENGINEERING CONFERENCE, PROCEEDINGS     377 - 384  2008  [Refereed]

     View Summary

    Model checking is a powerful technique for verifying the correctness of a system's specification. But even when the specification has beet? verified to he correct, there is still the question of whether the specification covers all the expected behaviors. One of the most important issues for verification is the sufficiency Of verification items. In model checking, specification-level properties such as reachability are well-studied, but the sufficiency of a specification against the preceding requirements still remains a challenge. In this paper, we propose a model-checking process with goal oriented requirements analysis, in which goal descriptions in a natural language are systematically refined into linear temporal logic formulae. Furthermore, the covet-age of the verification result can be evaluated against the goal model. We developed a tool that supports the process, and applied it to an example. This process lowers the technical barriers to model checking and improves the sufficiency of system verification.

    DOI

  • Coordination Protocol Composition Approach Using Metadata in Multi-agent Systems

    Ryuichi Takahashi, Kenji Tei, Yoshiaki Fukazawa, Fuyuki Ishikawa, Shinichi Honiden

    EDOC 2008: 12TH IEEE INTERNATIONAL ENTERPRISE DISTRIBUTED OBJECT COMPUTING, PROCEEDINGS     372 - +  2008  [Refereed]

     View Summary

    In e-Business, agents need to coordinate with each other Coordination protocols that specify the defining orders of message passing are very important. The scale of e-Business grows with the advancement of technology, and the number of agents involved continues to increase. Specifying the coordination protocols for so many participating agents is a complex task. A coordination protocol composition approach reduces the complexity of specifying such a coordination protocol. It treats coordination protocols as individual parts and composes them to construct the intended protocols. However existing approaches do not sufficiently reduce the complexity when a coordination protocol is composed several times, because too many configurations are required to specify a composition. A new approach is proposed that uses metadata to specify the compositions by specifying only one configuration. It can reduce the number of configurations when a coordination protocol is composed several times.

    DOI

  • Region-based sensor selection for wireless sensor networks

    Yoshiyuki Nakamura, Kenji Tei, Yoshiaki Fukazawa, Shinichi Honiden

    Proceedings - IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing     326 - 331  2008  [Refereed]

     View Summary

    In a sensor network, the technique that limits the number of sensors used for observation is effective to reduce the energy consumption of each sensor. To limit the number of sensors without sacrificing observation accuracy, an appropriate sensor combination must be selected by evaluating the observation effectiveness of various combinations. However, the computational workload for evaluating all the sensor combinations is quite large. We can define a parameter related to the optimal size of a region around an observation target by making a trade-off between accuracy and the computational workload. In region-based sensor selection, a combination of sensors is selected from that is near the observation target. Accuracy is better in a larger region with a lot of sensors, but the computational workload is heavier. In contrast, a smaller region with fewer sensors has poorer accuracy, but a lighter workload. The size of the region controls the trade-off between accuracy and the computational workload. We define a parameter related to the optimal size of a region, and use it to dynamically adjust the region's size. Our simulations confirmed that region-based sensor selection reduces the computational workload and improves accuracy in comparison to existing techniques. © 2008 IEEE.

    DOI

  • Model checking process with goal oriented requirements analysis

    Hideto Ogawa, Fumihiro Kumeno, Shinichi Honiden

    Neonatal, Paediatric and Child Health Nursing     377 - 384  2008  [Refereed]

     View Summary

    Model checking is a powerful technique for verifying the correctness of a system's specification. But even when the specification has been verified to be correct, there is still the question of whether the specification covers all the expected behaviors. One of the most important issues for verification is the sufficiency of verification items. In model checking, specification-level properties such as reachability are well-studied, but the sufficiency of a specification against the preceding requirements still remains a challenge. In this paper, we propose a model-checking process with goal oriented requirements analysis, in which goal descriptions in a natural language are systematically refined into linear temporal logic formulae. Furthermore, the coverage of the verification result can be evaluated against the goal model. We developed a tool that supports the process, and applied it to an example. This process lowers the technical barriers to model checking and improves the sufficiency of system verification. © 2008 IEEE.

    DOI

  • An architecture for exception management in multiagent systems

    Eric Platon, Nicolas Sabouret, Shinichi Honiden

    International Journal of Agent-Oriented Software Engineering   2 ( 3 ) 267 - 289  2008  [Refereed]

     View Summary

    Multiagent Systems (MAS) are open, heterogeneous and distributed software systems of autonomous agents. The management of exception differs in MAS from what is known in usual engineering approaches, owing to specific situations to handle, such as the agent death, knowledge inconsistencies or collaborative handling. Existing work does not fully address the properties of MAS, notably agent autonomy, and the mechanisms related to exceptions are often ad hoc. In this article, we define the concept of agent exception so as to satisfy the characteristics of the agent paradigm, and we propose a MAS architecture to support design and development of agent systems with exception management facilities. This architecture provides designers with an exception mechanism integrated into usual agent models, so that the work left to the designer is the definition of application-dependent handlers that are automatically invoked by the architecture when required. © 2008, Inderscience Publishers.

    DOI

  • Interoperability of mobile agents for ubiquitous applications

    Tetsuo Hasegawa, Kenta Cho, Akihiko Ohsuga, Fumihiro Kumeno, Shin Nakajima, Shinichi Honiden

    ELECTRICAL ENGINEERING IN JAPAN   161 ( 4 ) 49 - 59  2007.12  [Refereed]

     View Summary

    A mobile agent is an important platform for applications for the coining ubiquitous society. Many different kinds of mobile agent platforms have been developed. However, agents from one agent platform are generally not able to migrate into another agent platform. As a solution to this problem, we propose an interoperability concept using an incarnation agent. The concept realizes logical mobility within different kinds of agent platforms. The incarnation agent extracts an agent's procedures and status, compiling them into agent platform independent format and then re-compiling them to target agent platform format, thus enabling the process to continue. The incarnation agent also has autonomy for interoperability. It manages complex migration for interoperability, so agent's procedure can be described in simple mobile model. Moreover, the incarnation agent modifies agent's procedures as applicable to facilities of target agent platform. This paper also reports an interoperability middle-ware and its examination. The middle-ware is a foundation of realizing the Incarnation Agent, and the response time and network traffic overheads by the interoperability rniddle-ware has been measured.

  • Extracting and Utilizing Event-Context Relationships in Blogsphere

    Yukino Baba, Fuyuki Ishikawa, Shinichi Honiden

    Poster/Demo Track of the 6th International Semantic Web Conference(ISWC 2007)    2007.11

  • 保守性に着目したリファクタリング方針の評価メトリクス

    川俣洋次郎, 中川博之, 本位田真一

       2007.11  [Refereed]

  • Errors and Misconceptions in Learning i*

    Toshihiko Tsumaki, Yasuyuki Tahara, Nobukazu Yoshioka, Haruhiko Kaiya, Kenji Taguchi, Shinichi Honiden

    2nd International Workshop on Requirements Engineering Education and Training (REET'07)    2007.10

  • Real-time POI detection and rating using floating car data

    Osamu Masutani, Hirotoshi Iwasaki, Kenji Tei, Yoshiaki Fukazawa, Shinichi Honiden

    14th World Congress on Intelligent Transport Systems    2007.10

  • ユビキタスコンピューティングにおけるコンテキストのモデル化,管理に関する研究動向

    中村善行, 清家良太, 鄭顕志, 吉岡信和, 深澤良彰, 本位田真一

    合同エージェントワークショップ&シンポジウム2007 (JAWS2007)    2007.10  [Refereed]

  • マルチエージェントシステムにおける柔軟なプロトコル合成言語

    高橋竜一, 鄭顕志, 石川冬樹, 深澤良彰, 本位田真一

    合同エージェントワークショップ&シンポジウム2007 (JAWS2007)    2007.10  [Refereed]

  • サービス合成における契約ポリシーの決定・検証問題の形式化とその支援

    石川冬樹, 吉岡信和, 本位田真一

    合同エージェントワークショップ&シンポジウム2007 (JAWS2007)    2007.10  [Refereed]

  • Improving accuracy of recommender system by item clustering

    KhanhQuan Truong, Fuyuki Ishikawa, Shinichi Honiden

    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS   E90D ( 9 ) 1363 - 1373  2007.09  [Refereed]  [Invited]

     View Summary

    Recommender System (RS) predicts user's ratings towards items, and then recommends highly-predicted items to user. In recent years, RS has been playing more and more important role in the agent research field. There have been a great deal of researches trying to apply agent technology to RS. Collaborative Filtering, one of the most widely used approach to predict user's ratings in Recommender System, predicts a user's rating towards an item by aggregating ratings given by users who have similar preference to that user. In existing approaches, user similarity is often computed on the whole set of items. However, because the number of items is often very large and so is the diversity among items, users who have similar preference in one category may have totally different judgement on items of another kind. In order to deal with this problem, we propose a method to cluster items, so that inside a cluster, similarity between users does not change significantly from item to item. After the item clustering phase, when predicting rating of a user towards an item, we only aggregate ratings of users who have similarity preference to that user inside the cluster of that item. Experiments evaluating our approach are carried out on the real dataset taken from MovieLens, a movies recommendation web site. Experiment results suggest that our approach can improve prediction accuracy compared to existing approaches.

    DOI

  • Variable-size DBFによる分散ハッシュテーブルのトラフィック量削減

    清雄一, 松崎和賢, 本位田真一

    電子情報通信学会論文誌   J90-D ( 9 ) 2378 - 2387  2007.09  [Refereed]  [Invited]

  • 要求の重要度を用いたマルチエージェントシステムの分析モデル検証

    中川博之, 吉岡信和, 本位田真一

    電子情報通信学会論文誌   J90-D ( 9 ) 2281 - 2292  2007.09  [Refereed]  [Invited]

  • Cooperative Migration of Mobile Agents Using Agreements Based on Event Calculus

    ISHIKAWA Fuyuki, YOSHIOKA Nobukazu, HONIDEN Shinichi

    The IEICE transactions on information and systems   J90-D ( 9 ) 2349 - 2364  2007.09  [Refereed]  [Invited]

    CiNii

  • Predicting Breakdown Situations over the Instant Messaging through Analyzing Conversational Structure

    Nik Nailah Binti Abdullah, Shinichi Honiden

    29th Annual Meeting of the Cognitive Science Society     1711  2007.08

  • IMPULSE: KAOSを利用したマルチエージェントシステムの分析モデル構築

    中川博之, 吉岡信和, 本位田真一

    情報処理学会論文誌処理   48 ( 8 ) 2551 - 2565  2007.08  [Refereed]  [Invited]

  • Using Ringed Bloom Filters to Reduce the Communication Traffic on a Distributed Hash Table

    清雄一, 松崎和賢, 本位田真一

    情報処理学会論文誌   48 ( 7 ) 2267 - 2277  2007.07

    J-GLOBAL

  • Building Assistive Technology for Breakdown Situations in Collaborative Communications via IM

    Nik Nailah Binti Abdullah, Eric Tschetter, Shinichi Honiden

    Plan, Activity and Intent Recognition Workshop. AAAI 2007. Twenty-Second Conference on Artificial Intelligence, Vancouver, British Columbia, Canada    2007.07

  • Ringed Bloom Filterによる分散ハッシュテーブルのトラフィック量削減

    清雄一, 松崎和賢, 本位田真一

    情報処理学会論文誌   48 ( 7 ) 2349 - 2364  2007.07  [Refereed]  [Invited]

  • MANETにおけるコスト基準経路探索プロトコルへのコスト基準拡張リング探索の適用

    河村美嗣, 鄭顕志, 深澤良彰, 本位田真一

    マルチメディア,分散,協調とモバイルシンポジウム (DICOMO2007)     238 - 244  2007.07  [Refereed]

  • 無線センサーネットワークにおける計測処理記述のためのデザインパターンの抽出と適用

    鄭顕志, 深澤良彰, 本位田真一

    マルチメディア,分散,協調とモバイルシンポジウム (DICOMO2007)     506 - 515  2007.07  [Refereed]

  • KAOSによる無線センサーネットワークのための計測処理中間モデルの導出

    鄭顕志, 深澤良彰, 本位田真一

    マルチメディア,分散,協調とモバイルシンポジウム (DICOMO2007)     1168 - 1179  2007.07  [Refereed]

  • トップエスイー教育プログラム

    Shinichi Honiden, Yasuyuki Tahara, Nobukazu Yoshioka, Kenji Taguchi

    In Proc. of 29th International Conferene of Sotware Engineering (ICSE 2007), IEEE CS,     708 - 717  2007.05  [Refereed]  [Invited]

  • プロセス記述によるサービス合成のパーベイシブコンピューティングへの適用

    石川 冬樹, 吉岡 信和, 本位田 真一

    情報処理学会論文誌   48 ( 4 ) 1785 - 1798  2007.04  [Refereed]  [Invited]

  • セキュリティパターンに基づく安全で効率的な企業間連携システムの設計法

    Nobukazu Yoshioka, Shinichi Honiden, Anthony Finkelstein

    Proc. of The 8th International IEEE Enterprise Distributed Object Computing Conference (EDOC 2004),     84 - 97  2007.04  [Refereed]  [Invited]

  • ゴール指向要求工学方法論の共通用語モデルと共通パターン

    田原康之, 長野伸一, 吉岡信和, 本位田真一

    情報処理学会論文誌   48 ( 3 )  2007.03  [Refereed]

  • ユビキタス環境で活躍するエージェント

    吉岡信和, 本位田真一

    情報処理   ( Vol.48,No.3 ) 29 - 35  2007.03  [Refereed]  [Invited]

  • Organizing Folksonomy Tags: Analysis of Folksonomy Tripartite Graph Structur (to appear)

    Satoshi Niwa, Takuo Doi, Shinichi Honiden

    Eighth International Conference on Intelligent Text Processing and Computational Linguistics (CICLing 2007), February 18-24, 2007, Mexico City, Mexicoa    2007.02  [Refereed]

  • Mechanisms for environments in multi-agent systems: Survey and opportunities

    Eric Platon, Marco Mamei, Nicolas Sabouret, Shinichi Honiden, H. Van Dyke Parunak

    AUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMS   14 ( 1 ) 31 - 47  2007.02

     View Summary

    The environment has been recognized as an explicit and exploitable element to design multi-agent systems (MAS). It can be assigned a number of responsibilities that would be more difficult to design with the sole notion of agents. To support the engineering of these responsibilities, we identify a set of mechanisms that offer solutions to software designers. We describe the mechanisms, their usage in representative projects, and potential opportunities for further research and applications. The purpose of this article is to clarify the notion of environment in terms of mechanisms, from their abstract description to their practical exploitation. Mechanisms are expected to provide agent-based software designers with a set of design elements to build MAS that take advantage of the environment.

    DOI

  • Top SE: education program for super architects

    Honiden Shinichi, Taguchi Kenji, Yoshioka Nobukazu, Tahara Yasuyuki, Washizaki Hironori

    The Journal of the Institute of Television Engineers of Japan   61 ( 9 ) 1288 - 1293  2007

    DOI CiNii

  • Multi-agent participatory simulations between experimental economics and role-playing games

    Paul Guyot, Alexis Drogoul, Shinichi Honiden

    AGENT-BASED APPROACHES IN ECONOMIC AND SOCIAL COMPLEX SYSTEMS IV   3   11 - +  2007  [Refereed]

     View Summary

    In this paper, we present participatory experiments in economics and role-playing games from an agent-based simulations perspective. In particular, we try to compare these two traditions of participatory approaches to stress identities and differences. After having outlined the lessons of these traditions, we describe multi-agent participatory simulations as a new kind of participatory experiments combining agents and participation more closely, using as an example the methodology we developed to conduct experiments of this new kind.
    Multi-agent participatory simulations are described as simulations where agents and players have similar roles and we propose to use assistant agents within these simulations for the purpose of participatory design of protocols or multi-agent systems.

  • Increasing the ease of deployment in ubiquitous environments

    Kazutaka Matsuzaki, Shinichi Honiden

    FIFTH ANNUAL IEEE INTERNATIONAL CONFERENCE ON PERVASIVE COMPUTING AND COMMUNICATIONS WORKSHOPS, PROCEEDINGS     581 - +  2007  [Refereed]

     View Summary

    In the near future, applications with location-aware capabilities could be major development targets in the software industry. The current development frameworks rarely pay attention to developing applications for multiple ubiquitous environments. From the perspective of porting or updating applications, there are two dependencies: spatial and localized. These are dependencies on a single environment in which an application is deployed. We propose a new framework that uses a spatio-temporal scope (STS) model to ease deployment of location-aware applications by lessening these dependencies. We describe our model and explain the roles of the STS in the development stages of an application.

  • Folksonomy Tag Organization Method Based on the Tripartite Graph Analysis (to appear)

    Satoshi Niwa, Takuo Doi, Shinichi Honiden

    IJCAI Workshop on Semantic Web for Collaborative Knowledge Acquisition, January 6-12 Hyderabad, India    2007.01  [Refereed]

  • Introducing auction scheme to route allocation to prolong the lifetime of ad-hoc networks

    Kenji Tei, Hiromi Muto, Yoshiaki Fukazawa, Shinichi Honiden

    CIMCA 2006: International Conference on Computational Intelligence for Modelling, Control and Automation, Jointly with IAWTIC 2006: International Conference on Intelligent Agents Web Technologies ...    2007  [Refereed]

     View Summary

    Prolonging a network lifetime is one of crucial issues of message routing protocol in mobile ad-hoc networks (MANETs), because MANETs consist of mobile devices powered by batteries. Previous routing protocols focus on route selection by a message sender to balance message forwarding load. However, in this approach, message routes determined by different senders cannot be coordinated, because each sender selects its message route independently. In this paper, we propose an auction-based route allocation scheme where message routes are determined by auctions between message senders and forwarders, and apply the route allocation scheme to the Dynamic Source Routing protocol. Simulation results show the DSR protocol with our allocation scheme can prolong the network lifetime comparing with the routing protocol proposed in the previous works. © 2006 IEEE.

    DOI

  • A sensor middleware for lightweight relocatable sensing programs

    Makoto Ishiguro, Kenji Tei, Yoshiaki Fukazawa, Shinichi Honiden

    CIMCA 2006: International Conference on Computational Intelligence for Modelling, Control and Automation, Jointly with IAWTIC 2006: International Conference on Intelligent Agents Web Technologies ...    2007  [Refereed]

     View Summary

    Wireless sensor networks (WSNs) have attracted attention in recent years. Many sensors will be equipped in buildings and provide data about the context of buildings in the future. We can provide many kinds of services that use various context information acquired from wireless sensor networks. However, sensing programs may not be able to be executed concurrently on the same sensor node because of sensors' resource restrictions. So, sensing programs sometimes have to relocate to other sensors if necessary. In this paper, we suggest a middleware for the relocation of a sensing program. Considering severe resource restrictions in a wireless sensor network, we can make a sensing program with a small code footprint. © 2006 IEEE.

    DOI

  • Multi-robot positioning model: Multi-agent approach

    Satoshi Kataoka, Shinichi Honiden

    CIMCA 2006: International Conference on Computational Intelligence for Modelling, Control and Automation, Jointly with IAWTIC 2006: International Conference on Intelligent Agents Web Technologies ...    2007  [Refereed]

     View Summary

    Dynamic coverage is a problem of multi-robot systems based on wireless ad-hoc networks. The issue of dynamic coverage occurs notably in post-disaster survivor rescue, search operation, and planet exploration. In this paper, we introduce a novel algorithm of dynamic coverage in a realistically restricted environment for robots. This approach improves efficiency of moving around and amount of communication in a simulation environment. The paper presents comprehensive experimental results and discusses future research directions related to dynamic coverage. © 2006 IEEE.

    DOI

  • Smartive: Agreement-based mobile composite agents for multimedia services

    Fuyuki Ishikawa, Nobukazu Yoshioka, Shinichi Honiden

    CIMCA 2006: International Conference on Computational Intelligence for Modelling, Control and Automation, Jointly with IAWTIC 2006: International Conference on Intelligent Agents Web Technologies ...    2007  [Refereed]

     View Summary

    This work considers encapsulation of multimedia contents as services, and their autonomous provision and distribution by agents. This approach enables content providers to have their contents provided and distributed together with their own business logics regarding interaction with other services and contents, control logic for various options upon provision, and value-added services. This paper proposes a framework for development of agents that provide and distribute such content services. In the framework, the interaction logic of agents is first developed in the same way as in development of ordinary Web services. Control descriptions are then given for each aspect, such as selection of partner agents, negotiation on service options, and migration. The separated descriptions for each aspect facilitate incremental development and test, as well as later modification, of agents with complex behaviors. © 2006 IEEE.

    DOI

  • A definition of exceptions in agent-oriented computing

    Eric Platon, Nicolas Sabouret, Shinichi Honiden

    ENGINEERING SOCIETIES IN THE AGENTS WORLD VII   4457   161 - +  2007  [Refereed]

     View Summary

    The research on exception handling in Multi-Agent Systems has produced some advanced models to deal with 'exceptional situations'. The expression 'agent exception' is however unclear across the literature, as it sometimes refers to extensions of traditional exception models in programming languages, and sometimes to organizational management mechanisms with distinct semantics. In this paper, we propose a definition of 'agent exception' to clarify the notion and justify that specific research is necessary on this theme. We detail properties of this definition, revisit the traditional vocabulary related to exception in software design, propose an adequate agent architecture, and identify some research issues. This work is aimed at federating the endeavors on the question of exception management for Agent-Oriented Computing.

  • Developing consistent contractual policies in service composition

    Fuyuki Ishikawa, Nobukazu Yoshioka, Shinichi Honiden

    2ND IEEE ASIA-PACIFIC SERVICES COMPUTING CONFERENCE, PROCEEDINGS     527 - 534  2007

     View Summary

    The notion of contracts (or agreements) has been considered useful to promote mutual understanding and configuration in service provision between its consumer and provider However, it has not been discussed how consistency can be ensured in multiple contracts that a composite service establishes with its component service providers and its consumers. In response to the problem, this study provides a theoretical foundation, based on Event Calculus, for expressing and reasoning about various constraints on contracts as well as consistency properties. On the basis of the proposed foundation, this study also discusses how an existing reasoner on Event Calculus can be used to help development of consistent contractual policies, or constraints on contracts. A tool is developed that wraps the reasoner and facilitates consistency checking and testing.

    DOI

  • Managing difference-based objects with sub-networks in peer-to-peer environments

    Daisuke Fukuchi, Yuichi Sei, Shinichi Honiden

    ON THE MOVE TO MEANINGFUL INTERNET SYSTEMS 2007: OTM 2007 WORKSHOPS, PT 2, PROCEEDINGS   4806   1001 - 1010  2007

     View Summary

    P2P systems are currently being used all over the world. However, existing P2P technology is not able to modify shared objects efficiently. Naive approaches to support modification result in large amounts of traffic and load concentrations. In our study, this issue is being addressed by representing shared objects by their differences. These are stored in a sub-network that is generated for each object. The object is accessed by retrieving and adding the differences stored in the sub-network. A simple simulation demonstrates the effectiveness of this technique in regard to traffic amount and load balancing properties.

  • Agreements and policies in cooperative mobile agents: Formalization and implementation

    Fuyuki Ishikawa, Nobukazu. Yoshioka, Shinichi Honiden

    ON THE MOVE TO MEANINGFUL INTERNET SYSTEMS 2007: COOPLS, DOA, ODBASE, GADA, AND IS, PT 1, PROCEEDINGS   4803   683 - 700  2007

     View Summary

    Organization of mobile agents into a group has appeared as a new paradigm for dynamic deployment of composite services. However, it has not been discussed how multiple mobile agents cooperate with each other, handling conflicts in their requirements. In response to this problem, this study proposes a model for cooperative mobility based on the notion of agreements. Agent behavior defined in the proposed model involves agreement establishment and enforcement for cooperative mobility. Such behavior can be customized only by specifying requirements/ constraints of each agent, eliminating the necessity to write down the whole behavior to handle agreements. The model is described in a formal way, using Event Calculus, and it is proved the model leads to no occurrence of defined inconsistency. The model has been implemented on an existing agent framework, Freedia, combined with its dynamic partner management mechanism.

  • Resilient security for false event detection without loss of legitimate events in wireless sensor networks

    Yuichi Sei, Shinichi Honiden

    ON THE MOVE TO MEANINGFUL INTERNET SYSTEMS 2007: COOPLS, DOA, ODBASE, GADA, AND IS, PT 1, PROCEEDINGS   4803   454 - +  2007

     View Summary

    When large-scale wireless sensor networks are deployed in hostile environments, the adversary may compromise some sensor nodes and use them to generate false sensing reports or to modify the reports sent by other nodes. Such false events can cause the user to make bad decisions. They can also waste a significant amount of network resources. Unfortunately, most current security designs have drawbacks; they either require their own routing protocols to be used, or lose legitimate events stochastically and completely break down when more than a fixed threshold number of nodes are compromised. We propose a new method for detecting false events that does not suffer from these problems. When we set the probability of losing legitimate events to 1%, our proposal method can detect more false events than related method can. We demonstrate this by mathematical analysis and simulation.

  • Formal specification generator for KAOS - Model transformation approach to generate formal specifications from KAOS requirements models

    Hiroyuki Nakagawa, Kenji Taguchi, Shinichi Honiden

    ASE'07 - 2007 ACM/IEEE International Conference on Automated Software Engineering     531 - 532  2007

     View Summary

    Formal methods and requirements analysis are techniques for developing complex systems. However, there is little research on reconciling the requirements phase with the formal specification phase. To bridge this gap, we propose a formal specification generator based on model transformation techniques. This tool transforms KAOS models (requirements specifications) into VDM++ formal specifications. Our generator enables consistent and effective software development activities.

    DOI

  • Context in use for analyzing conversation structures on the web tied to the notion of situatedness

    Nik Nailah Binti Abdullah, Shinichi Honiden

    MODELING AND USING CONTEXT   4635   94 - +  2007

     View Summary

    Current trend in scientific collaboration focuses on developing effective communication Web media. One of its objectives is to provide informal communication opportunities for collaborating scientists. This paper focuses on analyzing conversation structures of actual collaboration scenarios on the Web. The conversations analyzed model context using hierarchy of learning and communication tied to situated cognition to help understand how users induce communication protocols on the Web. The paper focuses on the analysis of the conversation structures that uses context to identify what could possibly make up a context and to help understand how contexts are punctuated.

  • Applying design patterns to wireless sensor network programming

    Kenji Tei, Yoshiaki Fukazawa, Shinichi Honiden

    PROCEEDINGS - 16TH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS AND NETWORKS, VOLS 1-3     1099 - +  2007

     View Summary

    Middleware for wireless sensor network (WSN) abstracts a network as an entity and hides programming difficulties from programmers. Many middlewares have been proposed, but they use different programming languages to manipulate functions in WSNs. This inhibits usability when manipulating multiple WSNs managed by different middlewares, because the primitives of each language have different descriptive capabilities. In this paper, we propose and apply design patterns in WSN programming to complement the capabilities of language primitives, and discuss the effectiveness of these design patterns. First, we discuss major middleware languages and compare the capabilities of their primitives. Second, we extract design patterns from the representative middlewares to cover the missing capabilities identified in the comparison. Finally, we discuss the effectiveness of design patterns for WSN programming. The discussion indicates that design patterns improve the usability of manipulating multiple WSNs.

    DOI

  • Detecting intrusions in agent system by means of exception handling

    Eric Platon, Martin Rehak, Nicolas Sabouret, Michal Pechoucek, Shinichi Honiden

    HOLONIC AND MULTI-AGENT SYSTEMS FOR MANUFACTURING, PROCEEDINGS   4659   161 - +  2007

     View Summary

    We present a formal approach to conception of a dedicated security infrastructure based on the exception handling in the protected agents. Security-related exceptions are identified and handled by a dedicated reflective layer of the protected agent, or delegated to specialized intrusion management agents in the system if the local reflective layer fails to address the problem. Incidents are handled either directly, if a known remedy exists or indirectly, when an appropriate solution must be identified before response execution. The cooperation between the intrusion management agents and aggregation of their observations can make the system more resilient to misclassification than a solution based purely on signature matching.

  • A topic categorization approach for understanding IM activities on the Web

    Nik Nailah Binti Abdullah, Shinichi Honidentiple, Ubiquitous Interaction, book of, abstracts. Christina Brodersen, Susanne Bodker, Clemens N. Klokmose

      ( DAIMI PB ) 581  2007

  • Ringed filters for peer-to-peer keyword searching

    Yuichi Sei, Shinichi Honiden

    PROCEEDINGS - 16TH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS AND NETWORKS, VOLS 1-3     772 - 779  2007

     View Summary

    Distributed hash tables (DHTs) are a class of decentralized distributed systems that can efficiently search for objects desired by the user. However, a lot of communication traffic comes from multi-word searches. A lot of work has been done to reduce this traffic by using bloom filters, which are space-efficient probabilistic data structures. There are two kinds of bloom filters: fixed-size and variable-size bloom filters. We cannot use variable-size bloom filters because doing so would mean wasting time to calculating hash values. On the other hand, when using fixed-size bloom filters, all the nodes in a DHT are unable to adjust their false positive rate parameters. Therefore, the reduction of traffic is limited because the best false positive rate differs from one node to another. Moreover, in related works, the authors took only two-word searches into consideration. In this paper, we present a method for determining the best false positive rate for three- or more word searches. We also used a new filter called a ringed filter, in which each node can set the approximately best false positive rate. Experiments showed that the ringed filter was able to greatly reduce the traffic.

    DOI

  • Visualization of concurrent program executions

    Cyrille Artho, Klaus Havelund, Shinichi Honiden

    COMPSAC 2007: THE THIRTY-FIRST ANNUAL INTERNATIONAL COMPUTER SOFTWARE AND APPLICATIONS CONFERENCE, VOL II, PROCEEDINGS   ( 2 ) 541 - +  2007

     View Summary

    Various program analysis techniques are efficient at discovering failures and properties. However it is often difficult to evaluate results, such as program traces. This calls for abstraction and visualization tools. We propose an approach based on UML sequence diagrams, addressing shortcomings of such diagrams for concurrency. The resulting visualization is expressive and provides all the necessary information at a glance.

    DOI

  • AOP-based automated unit test classification of large benchmarks

    Cyrille Artho, Zhongwei Chen, Shinichi Honiden

    COMPSAC 2007: THE THIRTY-FIRST ANNUAL INTERNATIONAL COMPUTER SOFTWARE AND APPLICATIONS CONFERENCE, VOL II, PROCEEDINGS   ( 2 ) 17 - +  2007

     View Summary

    Despite the availability of a variety of program analysis tools, evaluation of these tools is difficult, as only few benchmark suites exist. Existing benchmark suites lack the uniformity needed for automation of experiments. We introduce the design of a uniform build/installation platform, which constitutes an important part of the solution.
    This platform is used to manage the build and test process, which is enhanced by a tool that analyzes the structure of unit tests. Benchmark applications lack detailed information about unit tests. Such knowledge is useful: For analysis algorithms that target specific program features, it is desirable to analyze only relevant tests. Using aspect-oriented programming, we wrap test execution and implement a tool providing coverage data of individual unit tests. Furthermore, the wrapper provides a front-end for the selection of subsets of a test suite. We successfully applied our tool to several large programs. This evaluation also gave us interesting insights about the quality of different test suites.

    DOI

  • Policy-based runtime partner management in process-based services

    Fuyuki Ishikawa, Nobukazu Yoshioka, Shinichi Honiden

    2007 IEEE INTERNATIONAL CONFERENCE ON WEB SERVICES, PROCEEDINGS     1191 - +  2007

     View Summary

    BPEL and similar languages have been provided a foundation for process-based implementation of composite Web services. These languages allow definition of orchestration processes without concrete binding information of involved partners. Although this approach facilitates customization of service discovery and selection before process execution, partner management during process execution has not been considered, such as rebinding of service providers upon events. In response to this problem, this study proposes a description model that facilitates runtime partner management in process-based services. The proposed model includes policy descriptions that allow insertion and customization of binding behavior according to surrounding environments and user preferences. The model also includes extensions in the standard process notation in order to allow process developers to give constraints to avoid adoption of inadequate policies as well as to define handlers to have common rebinding behavior reused. The proposed descriptions have been implemented and used in an agent framework for multimedia services.

    DOI

  • Protocol selection alongside service selection and composition

    Jose Ghislain Quenum, Fuyuki Ishikawa, Shinichi Honiden

    2007 IEEE INTERNATIONAL CONFERENCE ON WEB SERVICES, PROCEEDINGS     719 - +  2007

     View Summary

    This paper addresses the issue of coordination mechanism selection in agent based service oriented computing systems. We aim to strengthen the current research on service selection and composition with a dynamic choice of the underlying coordination mechanisms. Indeed, since the environment in such systems might dynamically change, and the agents can have several protocols at their disposal, they need to select the most adequate one for service provision/request upon the prevailing circumstances. In this paper, we present a joint protocol selection mechanism, which enables agents to decide together the protocols they will use to coordinate each other during a service provision.

    DOI

  • Position Evaluation in Go: Self-Coordinating Neural Agents

    Eric Tschetter, Eric Platon, Shinichi Honiden

    The Second International Workshop on Emergent Intelligence on Networked Agents (WEIN'07), Honolulu, Hawaii    2007

  • Model checking networked programs in the presence of transmission failures

    Cyrille Artho, Christian Sommer, Shinichi Honiden

    TASE 2007: FIRST JOINT IEEE/IFIP SYMPOSIUM ON THEORETICAL ASPECTS OF SOFTWARE ENGINEERING, PROCEEDINGS     219 - +  2007

     View Summary

    Software model checkers work directly on single-process programs, but not on multiple processes. Conversion of processes into threads, combined with a network model, allows for model checking distributed applications, but does not cover potential communication failures. This paper contributes a fault model for model checking networked programs. If a naive fault model is used, spurious deadlocks may appear because certain processes are terminated before they can complete a necessary action. Such spurious deadlocks have to be suppressed, as implemented in our model checker extension. Our approach found several faults in existing applications, and scales well because exceptions generated by our tool can be checked individually.

    DOI

  • Participatory Design of Agents for Hybrid Coalitions

    Guyot, Paul, Honiden, Shinichi

    Eighth International Workshop on Multi-Agent-Based Simulation (MABS '07), Honolulu, Hawaii.    2007

  • On agent-based aggregation schemes in networks with malicious nodes

    Christian Sommer, Shinichi Honiden

    First International Workshop on Agent Technology for Sensor Network (ATSN 2007), Honolulu, Hawaii    2007

  • Enabling direct communication protocol between mobile agents in Wireless Sensor Networks

    Shunichiro Suenaga, Shinichi Honiden

    First International Workshop on Agent Technology for Sensor Network (ATSN 2007), Honolulu, Hawaii    2007

  • Top SE: Educating superarchitects who can apply software engineering tools to practical development in Japana

    Shinichi Honiden, Yasuyuki Tahara, Nobukazu Yoshioka, Kenji Taguchi, Hironori Washizaki

    ICSE 2007: 29TH INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, PROCEEDINGS     708 - +  2007

     View Summary

    This paper discusses the Top SE program established to bridge the industry-academia gap. The program features extensive use of software engineering tools, not only to introduce students to the tools, but also as a conduit for learning the techniques and guidelines needed to apply the tools to practical software development situations. The curriculum is organized around practical problems mainly from the area of digital home appliances and focuses on upper stream software development processes.
    The Top SE program is developed and operated by a close collaboration between industry and academia. We illustrate our discussion with examples from one of the courses, Verification of Design Models, which takes up model checking technologies, including three specific tools: SPIN, SMV, and LTSA.

    DOI

  • Building coalitions involving agents and humans: Reports from agent-based participatory simulations

    Paul Guyot, Shinichi Honiden

    Proceedings of the International Conference on Autonomous Agents     1257 - 1259  2007

     View Summary

    Agent-based participatory simulations are laboratory experiments designed like agent-based simulations and where humans access the simulation as software agents. This paper describes the outcomes of six experiments lasting up to two hours each, where human players took part in an iterated game derived from the El Farol bar problem. Agents decide synchronously to go to the bar or to stay home and the benefit depends on the bar attendance, with a threshold effect: it is better to stay home if more than 60% of the agents go. Contrasting with the original version of this problem, we allowed agents, and therefore humans, to communicate before they took their decision. The first two experiments allowed us to train participants and to introduce the notion of teams. Teams represented coalitions within the game and positively affected scoring, but they were not part of an obvious solution to the problem and they did not enforce cooperative behavior in the game. Drawing from these experiments, we designed autonomous agents reproducing strategies of the participants. These agents took part in the last four participatory experiments and we observed the formation of coalitions between agents, between humans and between agents and humans. © 2007 IFAAMAS.

    DOI

  • IOM/T: Interaction Oriented Model by Textual Notation

    Takuo Doi, Shinichi Honiden

    Special Issue of International Journal of Agent-Oriented Software Engineering (IJAOSE) on Programming Multi-Agent Systems   1 ( 3 ) 266 - 294  2007.01  [Refereed]  [Invited]

  • A hierarchical mobile agent framework and its application to multimedia contents

    Fuyuki Ishikawa, Nobukaza Yoshioka, Yasuyuki Tahara, Shinichi Honiden

    Systems and Computers in Japan   38 ( 1 ) 1 - 17  2007.01  [Refereed]

     View Summary

    A hierarchical mobile agent is a model that extends the standard mobile agent. In this model it is possible for an agent to migrate inside another agent and parent-child relations can be constructed (the host agent being the parent). By means of such agent synthesis, it is possible to integrate different functionality and have agents interact with one another with no need for remote communications. Even when an agent migrates, it is possible to maintain the relations between parent and child stably over a long period of time. In this paper we focus on the task of controlling these parent-child relations and propose the MAFEH framework designed to simplify related tasks. This frame-work has two special characteristics. One consists of the parent-child agreement specification that expresses the agreement regarding the behavior between parent and child. The other consists of the interaction behavior description specification that facilitates the description of the processes by which individual interactive partners can be searched for, enter into combinations, and disassociate themselves from each other. In this paper we also present an application of the MAFEH framework demonstrating how an agent that encapsulates mobile contents can combine with other agents that provide different contents and services. © 2006 Wiley Periodicals, Inc.

    DOI

  • Environmental support for tag interactions

    Eric Platon, Nicolas Sabouret, Shinichi Honiden

    ENVIRONMENTS FOR MULTI-AGENT SYSTEMS III   4389   106 - +  2007  [Refereed]

     View Summary

    Tag interactions axe agent interactions that complement and differ from speech act communication models. Tags are public information that agents expose to others in the system to allow two types of interactions. Tag monitoring interactions let agents observe the tags of others actively. Tag fortuitous interactions make agents realize the tag of others with unrequested and application-dependent messages. In this paper we model tag interactions based on the agent environment and computational bodies to enact, maintain, and regulate their execution. We discuss the model and we identify further issues in the current state of the research. An example application is described in detail to show the potential of introducing tag interactions.

  • Challenges for exception handling in multi-agent systems

    Eric Platon, Nicolas Sabouret, Shinichi Honiden

    SOFTWARE ENGINEERING FOR MULTI-AGENT SYSTEMS V: RESEARCH ISSUES AND PRACTICAL APPLICATIONS   4408   41 - +  2007  [Refereed]

     View Summary

    Exception handling has a commonly agreed semantics in many programming languages. When an operation is called with inappropriate conditions, the control flow of the program is reversed back to the caller to trigger some handling mechanisms. In Multi-Agent Systems (MAS), this semantics applies to the code of agents, but it does not cover the kind of exceptions that occur at the agent level. For instance, the usual handling semantics does not address the cases where the plan of an agent fails and re-planning is required. In fact, the agent code does not necessarily encounter a programming fault or a 'catch' clause in such a case, but the agent has yet to deal with an exceptional situation. In this paper, we survey the literature on exception handling with the aim to demonstrate that research needs to be conducted in the case of MAS due to their openness, heterogeneity, and the encapsulation of agents. We identify research directions from the survey, and we present a simulation scenario to illustrate the occurrence of agent-level exceptions in a simple case. The current result of the survey analysis is that agent exceptions mechanisms should rely on the proactivity of agents, on exploiting the agent environment, on collaborative handling mechanisms, and on the potential links between code-level and agent-level exceptions.

  • Efficient model checking of applications with input/output

    Cyrille Artho, Boris Zweimueller, Armin Biere, Etsuya Shibayama, Shinichi Honiden

    COMPUTER AIDED SYSTEMS THEORY- EUROCAST 2007   4739   515 - +  2007  [Refereed]

     View Summary

    Most non-trivial applications use some form of input/output (I/O), such as network communication. When model checking such an application, a simple state space exploration scheme is not applicable, as the process being model checked would replay I/O operations when revisiting a given state. Thus software model checking needs to encapsulate such operations in a caching layer that is capable of hiding redundant executions of I/O operations from the environment.

  • オブジェクト指向ソフトウェア設計における原則とパターン

    鷲崎弘宜, 久保淳人, 深澤良彰, 山本里枝子, 本位田真一

    情報処理学会ウィンターワークショップ2007・イン・那覇論文集    2007  [Refereed]

  • 無線センサネットワークにおけるモバイルエージェント間のメッセージ配信

    末永俊一郎, 本位田真一

    JAWS: Joint Agent Workshops & Symposium 2007   - suenaga  2007  [Refereed]

  • Novel Applications in Ubiquitous Computing

    Christian Sommer, Shunichiro Suenaga, 吉岡信和, 本位田真一

    合同エージェントワークショップ&シンポジウム2007(JAWS2007) 2007年10月29日 合同エージェントワークショップ&シンポジウム2007(JAWS2007)   - suenaga  2007  [Refereed]

  • ユビキタス環境における動的なプロセス配備のためのプログラミング支援フレームワーク

    松崎 和賢, 本位田 真一

    情報処理学会論文誌   47 ( 12 ) 3188 - 3202  2006.12  [Refereed]

  • 知的移動エージェントによるマルチパーパスワイヤレスセンサネットワークアプリケーション

    長 健太, 大須賀 昭彦, 本位田 真一

    情報処理学会論文誌   47 ( 12 ) 3165 - 3178  2006.12  [Refereed]

  • Energy Efficient Location-Specific Data Retrieval in Mobile Ad-Hoc Networks

    TEI Kenji, FUKAZAWA Yoshiaki, HONIDEN Shinichi

    The IEICE transactions on information and systems   J89-D ( 12 ) 2625 - 2636  2006.12  [Refereed]

    CiNii

  • Improving Accuracy of Recommender System by Clustering Items Based on Stability of User Similarity

    Truong Khanh Quan, Fuyuki Ishikawa, Shinichi Honiden

    International Conference on Intelligent Agents, Web Technologies and Internet Commerce (IAWTIC 2006), 28 November - 1 December 2006, Sydney, Australia    2006.11  [Refereed]

  • Reduction of the communication traffic for multi-word searches in DHTs

    Yuichi Sei, Kazutaka Matsuzaki, Shinichi Honiden

    International Conference on Intelligent Agents, Web Technologies and Internet Commerce (IAWTIC 2006), 28 November - 1 December 2006, Sydney, Australia    2006.11  [Refereed]

  • Agent-Based Participatory Simulations: Merging Multi-Agent Systems and Role-Playing Games

    Paul Guyot, Shinichi Honiden

    JASSS-THE JOURNAL OF ARTIFICIAL SOCIETIES AND SOCIAL SIMULATION   9 ( 4 )  2006.10  [Refereed]

     View Summary

    In 2001, Olivier Barreteau proposed to jointly use multi-agent systems and role-playing games for purposes of research, training and negotiation support in the field of renewable resource management. This joint use was later labeled the "MAS/RPG methodology" and this approach is one of the foundation stones of the ComMod movement. In this article, we present an alternative method called "agent-based participatory simulations". These simulations are multi-agent systems where human participants control some of the agents. The experiments we conducted prove that it is possible to successfully merge multi-agent systems and role-playing games. We argue that agent-based participatory simulations are also a significant improvement over the MAS/RPG approach, opening new perspectives and solving some of the problems generated by the joint use of role-playing games and multi-agent systems. The advantages are at least threefold. Because all interactions are computer mediated, they can be recorded and this record can be processed and used to improve the understanding of participants and organizers alike. Because of the merge, agent-based participatory simulations decrease the distance between the agent-based model and the behavior of participants. Agent-based participatory simulations allow for computer-based improvements such as the introduction of eliciting assistant agents with learning capabilities.

  • 知的移動エージェントによる低消費電力なワイヤレスセンサネットワークアプリケーションの構築

    長健太, 大須賀昭彦, 本位田真一

    合同エージェントワークショップ&シンポジウム2006 (JAWS2006)    2006.10  [Refereed]

  • 要求の重要度を用いたロール・組織構造の同定

    中川博之, 本位田真一

       2006.10  [Refereed]

  • 無線センサーネットワークミドルウェアの研究動向とエージェント技術の適用可能性

    鄭顕志, 深澤良彰, 本位田真一

    合同エージェントワークショップ&シンポジウム2006 (JAWS2006)    2006.10  [Refereed]

  • センサーの資源制約を考慮したセンシングプログラムの退避行動手法の提案

    石黒真, 鄭顕志, 深澤良彰, 本位田真一

    合同エージェントワークショップ&シンポジウム2006 (JAWS2006)    2006.10  [Refereed]

  • Context-awareなコンテンツ流通のためのセキュリティアーキテクチャ

    清雄一, 粂野文洋, 吉岡信和, 本位田真一

    合同エージェントワークショップ&シンポジウム2006 (JAWS2006)    2006.10  [Refereed]  [Invited]

  • コンテンツ流通エージェントのための強化学習メカニズム

    片岡慧, 吉岡信和, 石川冬樹, 鄭顕志, 本位田真一

    合同エージェントワークショップ&シンポジウム2006 (JAWS2006)    2006.10

  • Recommender Systemの予測精度を上げる:ユーザ類似度の安定によるアイテムクラスターリング手法

    チュオンカンクアン, 石川冬樹, 本位田真一

    合同エージェントワークショップ&シンポジウム2006 (JAWS2006)    2006.10  [Refereed]

  • Agent-based Participatory Simulations: Merging Multi-Agent Systems and Role-PlayingGames

    Paul Guyot, Shinichi Honiden

    Journal of Artificial Societies and Social Simulations   9 ( 4 )  2006.10  [Refereed]

  • Cooperative Multi-Agent Approach to Dynamic Coverage in Multi-Robot Activities

    Satoshi Kataoka, Shinichi Honiden

    The Second International Workshop on Multi-Agent Robotic Systems (MARS 2006)    2006.08

  • Testing I/O Failures with Enforcer

    C. Artho, A. Biere, S. Honiden

    FM 2006 (tool demonstration track), Hamilton, Canada, August 2006    2006.08  [Refereed]

  • Ringed Bloom Filterによる分散ハッシュテーブルのトラフィック量削減

    清雄一, 松崎和賢, 本位田真一

    情報処理学会シンポジウム論文集   2006 ( 6-1 ) 457 - 460  2006.07

    J-GLOBAL

  • Interaction Design in Agent-based Service-oriented Computing Systems

    Jose Quenum, Fuyuki Ishikawa, Shinichi Honiden

    AAAI Workshop on AI-Driven Technologies for Services-Oriented Computing, July 16--20, 2006, Boston, USA, 2006    2006.07  [Refereed]

  • MANETにおける送信遅延と電力消費を考慮したルーティングプロトコルの提案

    河村美嗣, 鄭顕志, 深澤良彰, 本位田真一

    マルチメディア,分散,協調とモバイルシンポジウム (DICOMO2006)     265 - 268  2006.07  [Refereed]

  • センシングプログラムの軽量な退避行動を実現するセンサーミドルウェア開発

    石黒真, 鄭顕志, 深澤良彰, 本位田真一

    マルチメディア,分散,協調とモバイルシンポジウム (DICOMO2006)     797 - 800  2006.07  [Refereed]

  • MANETにおける情報収集プログラム再配備手法の提案と評価

    鄭顕志, 深澤良彰, 本位田真一

    マルチメディア,分散,協調とモバイルシンポジウム (DICOMO2006)     133 - 136  2006.07  [Refereed]

  • Smart Environment for Smarter Agents in E-markets

    Eric Platon, Nicolas Sabouret, Shinichi Honiden

    Poster at the Nineteenth Florida Artificial Intelligence Research Society Conference, AAAI, May 11th-13th, 2006    2006.05  [Refereed]

  • Analysis of Multi-Agent Systems based on KAOS Modeling

    Hiroyuki Nakagawa, Takuya Karube, Shinichi Honiden

    ICSE 2006 Emerging Results track     926 - 929  2006.05  [Refereed]

  • 分散ハッシュテーブルにおけるAND検索時のトラフィック量削減 (「マルチエージェントの理論と応用」特集号)

    清雄一, 松崎和賢, 本位田真一

    情報処理学会論文誌   47 ( 5 ) 1354 - 1362  2006.05  [Refereed]

  • 契約による設計を用いたインタラクションの実装 (「マルチエージェントの理論と応用」特集号)

    土肥 拓生, 本位田 真一

    情報処理学会論文誌   47 ( 5 ) 1371 - 1381  2006.05  [Refereed]

  • Folksonomyマイニングに基づくWebページ推薦システム (「マルチエージェントの理論と応用」特集号)

    丹羽智史, 土肥拓生, 本位田真一

    情報処理学会論文誌   47 ( 5 ) 1382 - 1392  2006.05  [Refereed]

  • モバイルエージェントの合意に基づいた協調とサービス管理

    石川 冬樹, 吉岡 信和, 本位田 真一

    合同エージェントワークショップ&シンポジウム2006 (JAWS2006)    2006.03  [Refereed]  [Invited]

  • マルチメディアサービスのためのモバイル合成エージェント:Smartive

    Fuyuki Ishikawa, Nobukazu Yoshioka, Shinichi Honiden

    International Conference on Intelligent Agents, Web Technologies and Internet Commerce (IAWTIC 2006)    2006.03  [Refereed]  [Invited]

  • サービス指向で自律的なマルチメディアコンテンツの流通と提供

    Fuyuki Ishikawa, Nobukazu Yoshioka, Shinichi Honiden

    Proc. of the Fifth International Joint Conference on Autonomous Agents and Multi Agent Systems (AAMAS 2006), ACM     949 - 951  2006.03  [Refereed]  [Invited]

  • ソフトウェア設計に対するモデル駆動型検証プロセス

    長野 伸一, 吉岡 信和, 田原 康之, 本位田 真一

    情報処理学会論文誌   ( vol.47, no.1 ) 193 - 208  2006.03  [Refereed]  [Invited]

  • エージェント間協調のためのプロトコルを利用したポリシー表現とその監視法の提案

    吉岡信和, 本位田真一

    合同エージェントワークショップ&シンポジウム2006 (JAWS2006)    2006.03  [Refereed]  [Invited]

  • Incorporating agreements on service options into BPEL-based services

    Fuyuki Ishikawa, Nobukazu Yoshioka, Shinichi Honiden

    INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE FOR MODELLING, CONTROL & AUTOMATION JOINTLY WITH INTERNATIONAL CONFERENCE ON INTELLIGENT AGENTS, WEB TECHNOLOGIES & INTERNET COMMERCE, VOL 1, PROCEEDINGS     796 - +  2006  [Refereed]

     View Summary

    To achieve flexibility in Service-Oriented Computing, applied values of service options, such as required payment and application-specific quality values, should be determined and agreed for every pair of a service provider and a consumer, by Matching both requirements or negotiating with each other This work proposes a framework for development of agents that provide Web services with service agreements determined for every unit Of service provision. The proposed framework supports lifecycle management of service agreements, namely, implementation of the preliminary process to build agreements. It also supports implementation of service processes that change its behavior according to the established agreements. The framework makes use of BPEL, a standard language to specify a process that implements Web services, and thus facilitate to incorporate additional mechanisms regarding service options into a common approach for development of Web services.

  • Overhearing and direct interactions: Point of view of an active environment

    E Platon, N Sabouret, S Honiden

    ENVIRONMENTS FOR MULTI-AGENT SYSTEMS II   3830   121 - 138  2006  [Refereed]

     View Summary

    Overhearing has been proposed recently as a model of indirect interactions in Multi-Agent Systems. Overhearer agents receive messages that were not primarily sent to them, as when someone hears a conversation among others. Overhearing has been modeled essentially as message broadcasting, but this approach raises several issues of scalability and appropriateness of the mental state of overheard agents.
    In this paper, we motivate and propose a model of overhearing that copes with these issues by introducing an explicit environment entity to handle overbearing. We define key notions with focus on the environment perspective, model them and their relations, and detail an algorithm that describes the environmental process for agent interactions. We finally illustrate our approach with an electronic market scenario.

    DOI

  • Formal model of mobile BPEL4WS process

    Fuyuki Ishikawa, Yasuyuki Tahara, Nobukazu Yoshioka, Shinichi Honiden

    International Journal of Business Process Integration and Management   1 ( 3 ) 192 - 209  2006  [Refereed]

     View Summary

    Web services technology provides the basis for interoperability, dynamic discovery and integration of distributed components. On the other hand, mobile agents have been utilised for achievement of local interactions with distributed components or selection of resources to use, with their ability to migrate from one host to another. This work presents a general framework for 'Mobile Web Services' (MWSs), which is a web service with migration ability. In our framework, a MWS is composed of a combination of (1) Business Process Execution Language for Web Services (BPEL4WS) process description as interaction flow, (2) service components to carry and (3) rules for migration behaviours. This paper focuses on a formal model of our framework, which helps us discuss whether our introduction of migration behaviours meets desirable properties. In this paper, we show that our framework preserves the original semantics of BPEL4WS. We also discuss extension of our framework for fault tolerance of hosts and its satisfaction of desirable properties. Copyright © 2006 Inderscience Enterprises Ltd.

    DOI

  • Dynamic protocol selection in open and heterogeneous systems

    Jose Ghislain Quenum, Samir Aknine, Onn Shehory, Shinichi Honiden

    2006 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, Proceedings     333 - 341  2006  [Refereed]

     View Summary

    This paper addresses the problem of dynamic protocol selection in open and heterogeneous multi-agent systems (MAS) for collaborative task Performance. Protocols are interaction patterns which help agents coordinate their activities. Usually, agent designers select the protocols to be used for collaborative task performance. In open and heterogeneous MAS, such selection may lead to protocol mismatch at run time. Protocol selection mismatch may in turn result in a collaborative task not being performed, although it could have been performed had the protocols been selected properly. Our solution to this problem is to enable agents to dynamically select protocols. We first study the characteristics of protocols and the descriptions of collaborative tasks. Using these characteristics and descriptions, we devise mechanisms that enable agents to dynamically select protocols when they have to perform a task in collaboration. In this work we relax some restrictive assumptions made in prior work on protocol selection, and which may hinder collaborative task performance. In particular we do not assume that agents trust one another Additionally, because there is no protocol specification standard, we allow several protocol specification formalisms to coexist. Our method allows agents to select their protocols locally and individually, yet coordinate their selection with other agents' selections based on message exchange flows. Since the selection is performed locally, some errors may occur in the process. Our mechanisms provide means for detecting such errors and overcoming them. As we show, the complexity of our solution is empirically sufficiently low for practical use, and the level of success in coordinated protocol selection is very high.

    DOI

  • Adaptive geographically bound mobile agents

    K. Tei, Ch. Sommer, Y. Fukazawa, S. Honiden, P. -L. Garoche

    MOBILE AD-HOC AND SENSOR NETWORKS, PROCEEDINGS   4325   353 - +  2006  [Refereed]

     View Summary

    With the spread of mobile phones, the use of Mobile Adhoc NETworks (MANETs) for disaster recovery finally becomes feasible. Information retrieval from the catastrophic place is attended in an energy-efficient manner using the Geographically Bound Mobile Agent (GBMA) model. The GBMA, which is a mobile agent on MANETs that retrieves geographically bound data, migrates to remain in a designated region to maintain low energy consumption for data retrieval, and provides location based migration scheme to eliminate needless migration to reduce energy consumption. In the data retrieval using the GBMA model, survivability of the agent is important. In a MANET, a GBMA with retrieved data may be lost due to its host's death. The lost of the agent causes re-execution of the retrieval process, which depraves energy efficiency. We propose migration strategies of the GBMA to improve its survivability. In the migration strategies, the selection of the next host node is parameterized by node location, speed, connectivity, and battery level. Moreover, in the strategies, multiple migration trigger policies are defined to escape from a dying node. We present the implementation of migration strategies and confirm the achievements with several simulations. This finally leads to the adaptive Geographically Bound Mobile Agent model, which consumes even less energy.

    DOI

  • PID-filtered negotiation for decision making in dynamic coverage problem

    Satoshi Kataoka, Fuyuki Ishikawa, Shinichi Honiden

    ICTAI-2006: EIGHTEENTH INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE, PROCEEDINGS     481 - +  2006

     View Summary

    Negotiation between robots is often needed in wireless ad-hoc robot network. In dynamic coverage problem, wireless ad-hoc robots move in the field negotiating with other robots frequently. Robots are tied with P2P network and determine their actions autonomously by negotiations with other robots. The topic of this paper is a negotiation for Multi-Agent-System (MAS) in the problem of robots activity in dynamic coverage, which is the problem of robots to cover all the areas of a tee space by their sensors in the shortest possible time. This paper introduce a novel algorithm for robots' negotiation for MAS in the dynamic coverage problem by using PID-filter. This algorithm reduced useless motion of robots and decreased the time concerning the convergence of a robot's action for dynamic coverage problem. The claim made in this paper for new negotiation algorithm for MAS are supported by comprehensive experimental results and discusses future research directions.

    DOI

  • Enforcer - Efficient failure injection

    Cyrille Artho, Armin Biere, Shinichi Honiden

    FM 2006: FORMAL METHODS, PROCEEDINGS   4085   412 - 427  2006  [Refereed]

     View Summary

    Non-determinism of the thread schedule is a well-known problem in concurrent programming. However, other sources of non-determinism exist which cannot be controlled by an application, such as network availability. Testing a program with its communication resources being unavailable is difficult, as it requires a change on the host system, which has to be coordinated with the test suite. Essentially, each interaction of the application with the environment can result in a failure. Only some of these failures can be tested. Our work identifies such potential failures and develops a strategy for testing all relevant outcomes of such actions. Our tool, Enforcer, combines the structure of unit tests, coverage information, and fault injection. By taking advantage of a unit test infrastructure, performance can be improved by orders of magnitude compared to previous approaches. Our tool has been tested on several real-world programs, where it found faults without requiring extra test code.

  • Challenges in exception handling in multi-agent systems

    Eric Platon, Shinichi Honiden, Nicolas Sabouret

    Proceedings - International Conference on Software Engineering     45 - 50  2006  [Refereed]

     View Summary

    Exception handling has received little interest in the agent community despite its challenges to build more reliable agent systems. In this paper, we survey existing work on exception handling for Multi-Agent Systems. We tried to identify in the present literature what research directions are required and likely to improve current techniques. In particular, we think that the agent proactivity and context in the systems are potential characteristics to exploit for agent-level exception handling. Copyright 2006 ACM.

    DOI

  • An algorithm to reduce the communication traffic for multi-word searches in a distributed hash table

    Yuichi Sei, Kazutaka Matsuzaki, Shinichi Honiden

    FOURTH IFIP INTERNATIONAL CONFERENCE ON THEORETICAL COMPUTER SCIENCE - TCS 2006   209   115 - +  2006  [Refereed]

     View Summary

    In distributed hash tables, much communication traffic comes from multi-word searches. The aim of this work is to reduce the amount of traffic by using a bloom filter, which is a space-efficient probabilistic data structure used to test whether or not an element is a member of a set. However, bloom filters have a limited role if several sets have different numbers of elements. In the proposed method, extra data storage is generated when contents' keys are registered in a distributed hash table system. Accordingly, we propose a "divided bloom filter" to Solve the problem of a normal bloom filter. Using the divided bloom filter, we aim to reduce both the amount of communication traffic and the amount of data storage.

    DOI

  • A modeling framework for generic agent interaction protocols

    Jose Ghislain Quenum, Samir Aknine, Jean-Pierre Briot, Shinichi Honiden

    DECLARATIVE AGENT LANGUAGES AND TECHNOLOGIES IV   4237   207 - +  2006  [Refereed]

     View Summary

    Agent-UML (AUML) extended UML in order to facilitate the modeling process for agent based systems. It offers several graphical notations, including protocol diagrams which represent agent interaction protocols. In this paper, we describe an AUML-based framework to specify generic protocols. We call generic protocols, agent interaction protocols where only a general behavior of the interacting entities can be described. From AUML protocol diagrams, we identified five fundamental concepts on top of which we defined formal specifications of generic protocols. Through our specifications, we addressed a lack in generic protocol representation by emphasizing the description of actions performed in the course of interactions based on such protocols. The framework we developed is formal, expressive and of practical use. It helps decouple interaction concerns from the rest of an agent's architecture. As an application, we used this framework to publish the specifications of generic protocols for agent interactions in several multi-agent system applications we developed. Additionally, the framework helped us address two issues faced in the design of agent interactions based on generic protocols, protocol configuration and their dynamic selection.

  • Service-oriented and autonomous distribution and provision of multimedia contents

    Fuyuki Ishikawa, Nobukazu Yoshioka, Shinichi Honiden

    Proceedings of the International Conference on Autonomous Agents   2006   949 - 951  2006  [Refereed]

     View Summary

    This work considers encapsulation of multimedia contents as services, and their autonomous provision and distribution by agents. This approach enables content providers to have their contents provided and distributed together with their own business logics regarding interaction with other services and contents, control logic for various options upon provision, and value-added services. This paper proposes a framework for development of agents that provide and distribute such content services. In the framework, the interaction logic of agents is first developed in the same way as in development of ordinary Web services. Control descriptions are then given for each aspect, such as selection of partner agents, negotiation on service options, and migration. The separated descriptions for each aspect facilitate incremental development and test, as well as later modification, of agents with complex behaviors. Copyright 2006 ACM.

    DOI

  • Power and negotiation: Lessons from agent-based participatory simulations

    Paul Guyot, Alexis Drogoul, Shinichi Honiden

    Proceedings of the International Conference on Autonomous Agents   2006   27 - 33  2006  [Refereed]

     View Summary

    Participatory simulations are conducted to improve our knowledge of human behaviors, to help in solving conflicts, to shape interaction protocols between humans and to teach some aspects of collective management. Agent-based participatory simulations differ from other kinds of participatory simulations including role playing games and experimental economics simulations. The control architecture of the agents, in these simulations, is more or less integrally replaced by a human player and the interactions between players are limited by the communication protocols designed for the agents, usually the exchange of electronic messages logged for further analysis. Such systems can be considered as ideal multi-agent systems featuring cognitive and intelligent agents. Previous work demonstrated that running this kind of simulations helps to design and improve multi-agent simulations. In this paper, we present a series of agent-based participatory experiments studying negotiation in an abstract case of common resource pool management. The roles were designed in such a way that conflicts should emerge during the negotiations. Observing the behavior of human players, we noticed the apparition of power relations between players. We observed that this power in negotiations was unrelated to any a priori dependence between agents or between roles but was instead drawn from strategies and, more surprisingly, this power was built on an emerging ontology. Copyright 2006 ACM.

    DOI

  • Performance of pheromone model for predicting traffic congestion

    Yasushi Ando, Yoshiaki Fukazawa, Osamu Masutani, Hirotoshi Iwasaki, Shinichi Honiden

    Proceedings of the International Conference on Autonomous Agents   2006   73 - 80  2006  [Refereed]

     View Summary

    Social insects perform complex tasks without top-down-style control, by sensing and depositing chemical markers called "pheromone". We have examined applications of this pheromone paradigm towards realizing intelligent transportation systems (ITS). Many of the current traffic management approaches require central processing with the usual risks of overload, bottlenecks and delay. Our work points towards a more decentralized approach that may overcome those risks. We use new category of the ITS infrastructure called the probe-car system. The probe-car system is an emerging data collection method, in which a number of vehicles are used as moving sensors to detect actual traffic situations. In this paper, a car is regarded as a social insect that deposits multi-semantics of (digital) pheromone on the basis of sensed traffic information. We have developed a basic model for predicting traffic congestion in the immediate future using pheromone. In the course of our experimentation, we have identified the need to properly tune the model to achieve acceptable performance. Therefore, we refined the model for practical use. We evaluate our method using real-world traffic data and results indicate applicability to prediction. Furthermore, we describe the practical implications of this method in the real world. Copyright 2006 ACM.

    DOI

  • Web page recommender system based on folksonomy mining for ITNG '06 submissions

    Satoshi Niwa, Takuo Doi, Shinichi Honiden

    THIRD INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY: NEW GENERATIONS, PROCEEDINGS     388 - +  2006  [Refereed]

     View Summary

    There have been many attempts to construct web page recommender systems using collaborative filtering. But the domains these systems can cover are very restricted because it is very difficult to assemble user preference data to web pages, and the number of web pages on the Internet is too large. In this paper we propose the way to construct a new type of web page recommender system covering all over the Internet, by using Folksonomy and Social Bookmark which are getting very popular in these days.

    DOI

  • An Architecture for Exception Management in Multu-Agent Systems

    Eric Platon, Nicolas Sabouret, Shinichi Honiden

    International Journal of Agent-Oriented Software Engineering   47 ( 1 ) 31 - 47  2006.01  [Refereed]

  • 無線センサネットワークにおけるプログラミングモデル - マクロプログラミングとトラディショナルアプローチ

    松崎和賢, 末永 俊一郎, 本位田真一

      - suenaga  2006  [Refereed]

  • 無線センサネットワークにおけるプログラミングモデル- プログラミングサポートとプログラミングアブストラクション

    末永俊一郎, 松崎 和賢, 本位田 真一

    合同エージェントワークショップ&シンポジウム2006 (JAWS2006)   - suenaga  2006  [Refereed]

  • Tag Interactions in Multi-Agent Systems: Environment Support

    Eric Platon, Nicolas Sabouret, Shinichi Honiden

    European Workshop on Multi-Agent Systems    2005.12

  • Location Scope:ロケーションアウェアソフトウェア開発支援手法の提案 (「ユビキタスITSとモバイルアプリケーション」特集号)

    松崎和賢, 吉岡信和, 本位田真一

    情報処理学会論文誌   ( 2005 )  2005.12  [Refereed]

  • Automatic Generation of Software Component Wizards based on the Wizard Pattern

    Hironori Washizaki, Shinichi Honiden, Rieko Yamamoto, Takao Adachi, Yoshiaki Fukazawa

    Proceedings of the International Conference on Systems, Computing Sciences and Software Engineering (SCS2 ‘05)     11 - 18  2005.12  [Refereed]

    DOI

  • Traffic Prediction using Pheromone Model

    Osamu Masutani, Hiroshi Sasaki, Hirotoshi Iwasaki, Yasushi Ando, Yoshiaki Fukazawa, Shinichi Honiden

    Proc. of 12th World Congress on Intelligent Transport Systems, November 6-10, 2005    2005.11  [Refereed]

  • Folksonomyマイニングに基づくWebページ推薦システム

    丹羽智史, 土肥拓生, 本位田真一

    合同エージェントワークショップ&シンポジウム2005 (JAWS2005)    2005.11  [Refereed]

  • KAOSを用いたマルチエージェントシステムの分析支援

    中川博之, 苅部卓哉, 本位田真一

       2005.11  [Refereed]

  • 位置に束縛されたモバイルエージェントによる位置依存情報の収集

    鄭 顕志, 深澤 良彰, 本位田 真一

    合同エージェントワークショップ&シンポジウム2005 (JAWS2005)     421 - 428  2005.11  [Refereed]

  • アドホックネットワークのルーティングへの市場原理の適用

    武藤 宏美, 鄭 顕志, 深澤 良彰, 本位田 真一

    合同エージェントワークショップ&シンポジウム2005 (JAWS2005)     227 - 233  2005.11  [Refereed]

  • A Flexible Wireless Sensor Network for Deploying Multiple Services

    ISHIGURO Makoto, TEI Kenji, FUKAZAWA Yoshiaki, HONIDEN Shinichi

    IPSJ SIG technical reports   2005 ( 113 ) 121 - 128  2005.11

     View Summary

    A sensor network attracts much attention in recent years. We expect that many services using sensors are to be provided in various places in the future. However, it is difficult to use a sensor simultaneously by many sensing programs because of the poorness of the computational performance of a sensor. So, in this research, we propose a sensor middleware named "SemiFloA" that supports evacuation of sensing programs. This middleware enables the sensing programs to continue its own work in the application specific manner.

    CiNii

  • サービス指向に基づいたマルチメディアコンテンツの自律的な流通と提供

    石川 冬樹, 吉岡 信和, 本位田 真一

    合同エージェントワークショップ&シンポジウム2005 (JAWS2005)    2005.11  [Refereed]

  • Location Scope : A Conceptual Event Modeling for Location-Aware Application Development

    Kazutaka Matsuzaki, Nobukazu Yoshioka, Shinichi Honiden

    2nd International Workshop on Mobility Aware Technologies and Applications, October 17-19, 2005, Montreal, Canada    2005.10  [Refereed]

  • Common Metamodel of Goal-Oriented Requirements Engineering Methodologies

    Yasuyuki Tahara, Shinichi Nagano, Nobukazu Yoshioka, Sshinichi Honiden

    The Third International Workshop on Comparative Evaluation in Requirements Engineering Paris, France August 29, 2005    2005.10  [Refereed]

  • Mobile agent system for Web service integration in pervasive network

    Fuyuki Ishikawa, Nobukazu Yoshioka, Shinichi Honiden

    Systems and Computers in Japan   36 ( 11 ) 34 - 48  2005.10

     View Summary

    Efforts to realize Web service technology for dynamic integration of distributed components have been started. There is also a proposal for a language that describes the integration flow in a platform-independent form. It is expected that Web service integration will be applied not only to the Internet, but also to various environments such as pervasive networks composed of mobile devices with wireless connections. In the latter case, it is necessary to deal with resource saving problems such as those that arise in a relatively low speed and unstable wireless channel. This study applies the mobile agent technique to the above problem and proposes a mobile agent system for Web service integration. In the proposed system, the physical actions of the mobile agents, that is, migration and cloning, are separated from the integration logic, and are represented as rules to be added to the integration flow description. By this separation, the physical behavior can be added or modified according to environmental conditions without modifying the integration flow. © 2005 Wiley Periodicals, Inc.

    DOI

  • 階層構造制御に注目したモバイルエージェントフレームワークとそのマルチメディア応用 (「ソフトウェアエージェントとその応用」特集号)

    石川 冬樹, 吉岡 信和, 田原 康之, 本位田 真一

    電子情報通信学会論文誌   J88-D ( 9 ) 1402 - 1417  2005.09  [Refereed]

  • モバイルエージェントによるバッテリ切れ避難システム : EASTER (「ソフトウェアエージェントとその応用」特集号)

    粂野文洋, 金子平祐, 吉岡信和, 深澤良彰, 本位田真一

    電子情報通信学会論文誌   ( 2005 )  2005.09  [Refereed]

  • フェロモンモデル: 交通渋滞予測への適用 (「ソフトウェアエージェントとその応用」特集号)

    安藤靖志, 深澤良彰, 増谷修, 佐々木宏, 岩崎弘利, 本位田真一

    電子情報通信学会論文誌   ( 2005 )  2005.09  [Refereed]

  • インタラクション記述言語IOM/T (「ソフトウェアエージェントとその応用」特集号)

    土肥 拓生, 吉岡 信和, 田原 康之, 本位田 真一

    電子情報通信学会論文誌   ( 2005 )  2005.09  [Refereed]

  • Oversensing with a softbody in the environment - Another dimension of observation

    Eric Platon, Nicolas Sabouret, Shinichi Honiden

    in Modeling Others from Observations at the International Joint Conference on Artificial Intelligence, Edinburgh, Scotland    2005.08

  • Developing Service-Oriented Compounds of Cooperative Mobile Agents

    Fuyuki Ishikawa, Nobukazu Yoshioka, Yasuyuki Tahara, Shinichi Honiden

    Workshop on Service-Oriented Computing and Agent-Based Engineering, Utrecht, The Netherlands    2005.07  [Refereed]

  • Agent Synthesis: Partnership and Agreement in Cooperative Mobile Agents

    Fuyuki Ishikawa, Nobukazu Yoshioka, Yasuyuki Tahara, Shinichi Honiden

    The Fourth International Joint Conference on Autonomous Agents and Multi Agent Systems (AAMAS 2005), July 25 to 29, 2005, The Netherlands     1267 - 1268  2005.07  [Refereed]

  • IOM/T : An Interaction Description Language for multi-agent systems

    Takuo DOI, Nobukazu Yoshioka, Yasuyuki Tahara, Shinichi Honiden

    The Fourth International Joint Conference on Autonomous Agents and Multi Agent Systems, July 25 to 29, 2005,The Netherlands     778 - 785  2005.07  [Refereed]

  • Framework for Hierarchical Agent Synthesis and Its Multimedia Application

    Fuyuki Ishikawa, Nobukazu Yoshioka, Yasuyuki Tahara, Shinichi Honiden

    SOCABE Workshop at AAMAS2005     1267 - 1268  2005.07  [Refereed]

  • FRAMEWORK FOR HIERARCHICAL MOBILE AGENTS: TOWARD SERVICE-ORIENTED AGENT COMPOUND

    Fuyuki Ishikawa, Nobukazu Yoshioka, Yasuyuki Tahara, Shinichi Honiden

    7th International Conference on Enterprise Information Systems(ICEIS-2005), May 25-28 2005 - Miami/USA     275 - 282  2005.05  [Refereed]

  • A MODEL FOR POLICY BASED SERVICE COMMUNITY

    Hironobu Kuruma, Shinichi Honiden

    7th International Conference on Enterprise Information Systems(ICEIS-2005), May 25-28 2005 - Miami/USA     360 - 366  2005.05  [Refereed]

  • Requirements analysis to cope with the concept of environment

    Eric Platon, Nicolas Sabouret, Shinichi Honiden

    Second AgentLink III Technical Forum (AL3-TF2) Environments for Multiagent Systems, 28 February to 2 March 2005, Ljubljana, Slovenia    2005.03  [Refereed]

  • BPELに基づくサービスへのサービスオプションに関する合意の組み込み

    Fuyuki Ishikawa, Nobukazu Yoshioka, Shinichi Honiden

    Web Technology and Internet Commerce (IAWTIC'2005)     796 - 803  2005.03  [Refereed]  [Invited]

  • ユビキタス環境下での柔軟で管理可能なコンテンツの活動

    Kazutaka Matsuzaki, Nobukazu Yoshioka, Shinichi Honiden

    OTM Workshops, LNCS 3762, Springer-Verlag (2005).    2005.03  [Refereed]  [Invited]

  • Webサービスとモバイルエージェントの統合のためのフレームワーク

    Fuyuki Ishikawa, Yasuyuki Tahara, Nobukazu Yoshioka, Shinichi Honiden

    International Journal of Pervasive Computing and Communications (JPCC)   ( Vol.1 Issue3 ) 227 - 245  2005.03  [Refereed]  [Invited]

  • 協調的なモバイルエージェントのサービス指向合成の開発

    Fuyuki Ishikawa, Nobukazu Yoshioka, Yasuyuki Tahara, Shinichi Honiden

    不明    2005.03  [Refereed]  [Invited]

  • MANET上の場所に束縛されたモバイルエージェント

    Kenji Tei, Nobukazu Yoshioka, Yoshiaki Fukazawa, Shinichi Honiden

    不明    2005.03  [Refereed]  [Invited]

  • 階層型エージェント合成のためのフレームワークとそのマルチメディアアプリケーション応用

    Fuyuki Ishikawa, Nobukazu Yoshioka, Yasuyuki Tahara, Shinichi Honiden

    不明    2005.03  [Refereed]  [Invited]

  • 階層型に拡張されたモバイルエージェントフレームワークとそのマルチメディアアプリケーション応用

    Fuyuki Ishikawa, Nobukazu Yoshioka, Yasuyuki Tahara, Shinichi Honiden

    7th International Conference on Enterprise Information Systems(ICEIS-2005)    2005.03  [Refereed]  [Invited]

  • 自己制御型コンテンツのポリシーに基づく開発支援手法の提案

    松崎和賢, 吉岡信和, 本位田真一

    合同エージェントワークショップ&シンポジウム2005 (JAWS2005) (2005).    2005.03  [Refereed]  [Invited]

  • 契約による設計を用いたインタラクションの実装

    土肥拓生, 吉岡信和, 田原康之, 本位田真一

    合同エージェントワークショップ&シンポジウム2005 (JAWS2005) (2005).    2005.03  [Refereed]  [Invited]

  • モバイルBPEL4WSプロセスのための形式モデル

    Fuyuki Ishikawa, Yasuyuki Tahara, Nobukazu Yoshioka, Shinichi Honiden

    International Journal of Business Process Integration and Management (IJBPIM).   Vol.1 ( Issue3 )  2005.03  [Refereed]  [Invited]

  • 分散システム開発におけるモデル検査への視覚的支援手法

    田原 康之, 吉岡 信和, 大須賀 昭彦, 本位田 真一

    情報処理学会論文誌   46 ( 2 ) 459 - 469  2005.02

  • T-compound interaction and overhearing agents

    E Platon, N Sabouret, S Honiden

    ENGINEERING SOCIETIES IN THE AGENTS WORLD V   3451   90 - 105  2005  [Refereed]

     View Summary

    Overhearing is an indirect interaction type that enacts agents to listen to direct interactions among other agents without taking explicit part in the exchanges. In this paper, we propose a formal model of overhearing named T-compound and a methodology to describe generalised interaction networks in Multi-Agent Systems. The compound is defined with the pi-calculus as an interaction composite. It is handled as an interaction primitive distinct from the traditional point-to-point one, so that our methodology can treat both cases homogeneously.

  • Introducing participative personal assistant teams in negotiation support systems

    E Platon, S Honiden

    INTELLIGENT AGENTS AND MULTI-AGENT SYSTEMS   3371   178 - 192  2005

     View Summary

    This paper introduces teams of personal agents that support users individually in electronic negotiations. These agents listen to the running negotiation and to each other to point out relevant information and compile advice for the user. In this frame, we first describe the architecture of this system and propose assistance interaction protocols to specify agent external behaviours in performing their tasks. Then, we discuss the semantic representation of agent communication and describe an abstraction layer to let agents understand user message issues. Our future work aims at improving these mechanisms and enriching them toward a full-fledged implementation.

  • Bridging the gap between AUM/T and implementation using IOM/T

    T Doi, N Yoshioka, Y Tahara, S Honiden

    PROGRAMMING MULTI-AGENT SYSTEMS   3346   147 - 162  2005  [Refereed]

     View Summary

    Multi-agent systems are attractive means for developing complex software systems. However, multi-agent systems themselves tend to be complex, and certain difficulties exist in developing them. One of the difficulties is the gap between design and implementation especially for interaction protocols. In this paper, we propose a new interaction protocol description language called IOM/T. Interaction protocols described using IOM/T have clear correspondence with AUML sequence diagrams and the description can be consolidated into a single unit of IOM/T code. Then, we show how the process of implementing Java-based agent-platform code from AUML design can be carried out, and how IOM/T effectively bridges the gap between design and implementation.

  • Flexible and maintainable contents activities in ubiquitous environment

    K Matsuzaki, N Yoshioka, S Honiden

    ON THE MOVE TO MEANINGFUL INTERNET SYSTEMS 2005: OTM 2005 WORKSHOPS, PROCEEDINGS   3762   14 - 15  2005  [Refereed]

     View Summary

    In future ubiquitous environments, contents (data, movie, text, graphics, etc.) will be more sophisticated and context-aware so that they can enrich user experience. We have proposed the Active Contents (AC) framework, which is based on contents encapsulation with program and aspect definition to allow contents to behave actively. AC can be seen as a software component with several viewpoints of contributors (planner, designer, programmer, etc.). The problem is about maintainability of AC which is modified by the contributors based on their own viewpoints.
    In this position paper, we propose a mechanism to allow such contributors to modify AC with context-aware aspect. In our mechanism, based on location binding analysis for AC, parallel executions to be performed at a sepaxate location axe detected and automatically executed using workflow-aware communication.

    DOI

  • Using mobile agent for location-specific data retrieval in MANET

    K Tei, N Yoshioka, Y Fukazawa, S Honiden

    INTELLIGENCE IN COMMUNICATION SYSTEMS   190   157 - 168  2005  [Refereed]

     View Summary

    Location-specific data retrieval is an attractive application in a Mobile Ad-hoc Network (MANET). Simple solution for it is that an observer retrieves the data by geocasting from an observer node, but its overhead highly depends on location of the observer and the designated region. We propose a mobile agent approach. A mobile agent migrates from the observer node to a node in the designated region, retrieves data from there, and summarizes, filters, and compresses the retrieved data, This data is sent back to the observer, when the observer request. Since the data is retrieved by the mobile agent located near the data Sources, the data retrieval in the mobile agent approach would involve low overhead, even if the observer is far from the target region or moves around. In the MANET, however, even after the first migration; to stay near data Sources, a mobile agent should migrate to another node in response to node movements.. In this paper, we propose the Geographically Bound Mobile Agent (GBMA) which is a mobile agent that migrates to always be located in a designated region. Moreover, to clarify where the GBMA should be located and when the GBMA starts to migrate, we introduce two geographic zones: required zone and expected zone, Compared with the conventional methods with geocast or with a conventional mobile agent, the GBMA with these zones for retrieving location-specific data can reduce the total number of messages.

  • Mobeet: A multi-agent framework for ubiquitous information systems

    N Yoshioka, A Ohsuga, S Honiden

    AGENT-ORIENTED INFORMATION SYSTEMS II   3508   19 - 35  2005

     View Summary

    In recent years, the rapid development of network infrastructure and the spread of terminals capable of network access have made it possible to access networks at any place and at any time. Ubiquitous information systems, in which necessary information can be accessed easily and safely at any place, are becoming an important issue. It is, however, hard to design such distributed systems when the user uses many kinds of terminals and migrates with these. That is, traditional approaches to development of distributed systems have problems when the systems are used in a ubiquitous environment. This paper proposes a new framework for ubiquitous information systems. The framework includes three kinds of agents: User Interface Agents, Programmable Agents and Service Mediation Agents. We can easily design ubiquitous information systems by ensuring that these agents collaborate. In addition, in cases where distributed systems must be implemented on various networks and terminals, it gives a high degree of flexibility to the systems. We also evaluate the framework's flexibility.

  • Knowledge based design method of agent protocols

    Kazunori Matsumoto, Tetsuhiro Miyahara, Yasuo Nagai, Shinichi Honiden

    WMSCI 2005: 9th World Multi-Conference on Systemics, Cybernetics and Informatics, Vol 1     381 - 386  2005  [Refereed]

     View Summary

    This paper proposes a design method for agent, interaction protocols (AIPs) in multi-agent systems. The method starts a design process with informal and ambiguous requirements in English, and according to the clearly defined development stages the method. gradually converts them into clear specifications expressed in augmented UML. Similar to the object-oriented development, the early stages include extractions of agents, roles of agents, actions, goals, and several types of logical constraints. Based on these information, the successive stages generate skeletons of scenarios, which specify the necessary conditions to achieve a goal. Completing the skeleton with added information from the designer, the skeletons become the final AIP designs. We also show a reuse of design knowledge is possible in each step of the method.

  • Pheromone model: Application to traffic congestion prediction

    Yasushi Ando, Osamu Masutani, Hiroshi Sasaki, Hirotoshi Iwasaki, Yoshiaki Fukazawa, Shinichi Honiden

    ENGINEERING SELF-ORGANISING SYSTEMS   3910   182 - 196  2005  [Refereed]

     View Summary

    Social insects perform complex tasks without top-down style control, by sensing and depositing chemical markers called "pheromone" We have examined applications of this pheromone paradigm towards intelligent transportation systems (ITS). Many of the current traffic management approaches require central processing with the usual risk for overload, bottlenecks and delays. Our work points towards a more decentralized approach that may overcome those risks. In this paper, a car is regarded as a social insect that deposits (electronic) pheromone on the road network. The pheromone represents density of traffic. We propose a method to predict traffic congestion of the immediate future through a pheromone mechanism without resorting to the use of a traffic control center. We evaluate our method using a simulation based on real-world traffic data and the results indicate applicability to prediction of immediate future traffic congestion. Furthermore, we describe the relationship between pheromone parameters and accuracy of prediction.

  • Geographically bound mobile agent in MANET

    K Tei, N Yoshioka, Y Fukazawa, S Honiden

    PROCEEDINGS OF MOBIQUITOUS 2005     516 - 518  2005  [Refereed]

     View Summary

    A location-specific data retrieval, which is data retrieval from nodes in a designated region at the time, is an attractive application in a Mobile Ad-hon Network (MANET). However, almost all nodes in a MANET are powered by batteries, the location-specific data retrieval should involve a small number of messages. In this paper, we use a mobile agent to retrieve the location-specific data. A mobile agent migrates to a node in a designated region, and retrieves data from nodes in this region. Since, after migration, the agent can communicate with nodes in the designated region through low overhead short length hops, the mobile agent can retrieve data at low message cost for long periods, even if the owner of this agent moves around. However, even after migrating to node in the designated region, in order to stay near this region, a mobile agent should migrate to other nodes in response to the movement of the node hosting this agent. In this paper, we propose the Geographically Bound Mobile Agent (GBMA) which is a mobile agent that periodically migrates in order to always be located in a designated region. In order to clarify where the GBMA should be located and when the GBMA starts to migrate, two geographic zones are set to the GBMA: required zone and expected zone. The required zone ease tracking of the GBMA, and the expected zone ease adjustment of the GBMA migration timing.

    DOI

  • Mobile and cooperative compounds of multimedia services

    F Ishikawa, N Yoshioka, Y Tahara, S Honiden

    2005 IEEE International Conference on Services Computing, Vol 1, Proceedings     129 - 136  2005  [Refereed]

     View Summary

    This work proposes a novel model where multimedia contents with their related services (business processes and functions) are packaged together as mobile agents. This is intended to enable content providers both to encapsulate their contents and to provide value-added services, for flexible content editing, delivery, and presentation. In addition, agents encapsulating contents/services can contain other agents in themselves (synthesis of agents). A mobile agent compound integrating multiple contents/services can be thus dynamically formed, in which multiple agents work cooperatively and migrate together as a unit. This paper also describes our proposed MAFEH/WS framework for the model. Agents in the model can be developed by incorporating simple parameter settings for synthesis control into business process descriptions in BPEL4WS.

    DOI

  • Pheromone model: Application to traffic congestion prediction

    Yasushi Ando, Osamu Masutani, Hiroshi Sasaki, Hirotoshi Iwasaki, Yoshiaki Fukazawa, Shinichi Honiden

    ENGINEERING SELF-ORGANISING SYSTEMS   3910   182 - 196  2005  [Refereed]

     View Summary

    Social insects perform complex tasks without top-down style control, by sensing and depositing chemical markers called "pheromone" We have examined applications of this pheromone paradigm towards intelligent transportation systems (ITS). Many of the current traffic management approaches require central processing with the usual risk for overload, bottlenecks and delays. Our work points towards a more decentralized approach that may overcome those risks. In this paper, a car is regarded as a social insect that deposits (electronic) pheromone on the road network. The pheromone represents density of traffic. We propose a method to predict traffic congestion of the immediate future through a pheromone mechanism without resorting to the use of a traffic control center. We evaluate our method using a simulation based on real-world traffic data and the results indicate applicability to prediction of immediate future traffic congestion. Furthermore, we describe the relationship between pheromone parameters and accuracy of prediction.

    DOI

  • Modelling interactions in assistant teams

    E Platon, S Honiden, N Sabouret

    Proceedings of the 2005 International Conference on Active Media Technology (AMT 2005)     383 - 388  2005  [Refereed]

     View Summary

    Assistant teams extend the present view on personal assistance software. Instead of a single assistant, a team devotes an ensemble of agents to the private use of each user It can provide a new variety of functionalities relying on the composition of individual services for the owner benefit.
    In this paper we present a model of assistant teams based on the exploitation of extended agent interactions. In addition to the usual direct interactions among individuals, we introduce the concept of 'overhearing' to let agent react to indirect events. We describe an architecture of such systems, address the concern of modeling their interaction infrastructures with a construction methodology, and detail an example scenario.

  • ゴール指向要求工学の体系化のための共通用語 (掲載予定)

    田原 康之, 長野 伸一, 吉岡 信和, 本位田 真一

    情報処理学会論文誌    2005.01  [Refereed]

  • オブジェクト指向によるセマンティックWeb開発方法論 - オントロジ構築を中心に -

    田原 康之, 本位田 真一

    コンピュータソフトウェア   22 ( 4 ) 40 - 45  2005.01  [Refereed]

    DOI

  • A framework for synthesis of web services and mobile agents

    Fuyuki Ishikawa, Yasuyuki Tahara, Nobukazu Yoshioka, Shinichi Honiden

    International Journal of Pervasive Computing and Communications   1 ( 3 ) 227 - 245  2005  [Refereed]

     View Summary

    A general framework for mobile Web services - which are Web services with the ability to migrate from one host to another - is proposed. In this framework, a mobile Web service is composed of a combination of a BPEL process description, service components to be carried, and migration behavior descriptions using simple but expressive rules. The semantics of the descriptions are defined using Mobile Ambients, namely, a formal model of concurrent mobile processes. With this framework, it is thus possible to add or change migration behaviors without having to modify the BPEL process. © Emerald Group Publishing Limited.

    DOI

  • Interoperability of Mobile Agents for Ubiquitous Applications

    Hasegawa Tetsuo, Cho Kenta, Ohsuga Akihiko, Kumeno Fumihiro, Nakajima Shin, Honiden Shinichi

    IEEJ Transactions on Electronics, Information and Systems   125 ( 8 ) 1296 - 1304  2005  [Refereed]

     View Summary

    A mobile agent is a one of important platform for applications for coming ubiquitous world. Many different kinds of mobile agent platforms have been developed. However, agents from one agent platform are generally not able to migrate into another agent platform. As a solution to this problem, we propose an interoperability concept using an Incarnation agent. The concept realizes logical mobility within different kinds of agent platforms. The Incarnation agent extracts an agent's procedures and status, compiling them into agent platform independent format and then re-compiling them to target agent platform format, thus enabling the process to continue. The Incarnation agent also has autonomy for interoperability. It manages complex migration for interoperability, so agent's procedure can be described in simple mobile model. Moreover, the Incarnation Agent modifies agent's procedures as applicable to facilities of target agent platform. This paper also reports an interoperability middle-wa e and its examination. The middle-ware is a foundation of realizing the Incarnation Agent, and the response time and network traffic overheads by the interoperability middle-ware has been measured. © 2005, The Institute of Electrical Engineers of Japan. All rights reserved.

    DOI CiNii

  • Object-oriented software development using constraint-based Modeling

    Yasuo Nagai, Kazunori Matsumoto, Tetsuhiro Miyahara, Shinichi Honiden

    WMSCI 2005: 9th World Multi-Conference on Systemics, Cybernetics and Informatics, Vol 1     396 - 402  2005  [Refereed]

     View Summary

    In this paper, we propose constraint-based modeling using constraint patterns, which can utilize information of constraint effectively, reuse the structure of efficient and executable software, and construct constraint representation and constraint solvers suitable to domains easily. In order to construct domain-specific constraint solvers, we define the new pattern realized by combining extended patterns and existing patterns as constraint pattern. We show that by sub-classing and refining components of constraint patterns, object-oriented software development using constraint solvers which maintain consistency of relationships among domain-specific objects and among attributes on an object leads to easy construction of applications. We select two problems: GUI system for information control system and design system for mechanical engineering as application, and apply constraint-based modeling to these problems. Furthermore, typical problems of constraint satisfaction problem are also selected and applied as applications. The result of these applications shows that our development method using constraint-based modeling leads to easy development of object-oriented systems that include constraint solver systems facilitating declarative description of relations among objects and flexible control of behavior of these objects, by regarding these relations as constraint.

  • Application of the μPlangent intelligent mobile agent architecture for embedded systems to the inspection of power systems

    Kenta Cho, Yutaka Irie, Akihiko Ohsuga, Katsuhiko Sekiguchi, Shinichi Honiden

    Systems and Computers in Japan   36 ( 4 ) 60 - 70  2005  [Refereed]

  • picoPlangent: An Intelligent Mobile Agent System for Ubiquitous Computing

    Kenta Cho, Hisashi Hayashi, Masanori Hattori, Akihiko Ohsuga, Shinichi Honiden

    Intelligent Agents and Multi-Agent Systems (post-proceedings of PRIMA2004), Lecture Notes in Computer Science   3371   43 - 56  2005  [Refereed]  [Invited]

  • A multiagent framework for pervasive computing: The Mobeet framework

    N Yoshioka, A Ohsuga, S Honiden

    ELECTRICAL ENGINEERING IN JAPAN   149 ( 3 ) 49 - 64  2004.11  [Refereed]

     View Summary

    Pervasive computing is becoming a more important issue for open distributed systems. It is, however, hard to design such distributed systems when the user uses many kinds of terminals and migrates with these. This paper has proposed a new framework for pervasive computing. The framework includes three kinds of agents: User Interface Agents, Programmable Agents, and Service Mediation Agents. We can easily design a flexible distributed system by collaborating these agents. We also evaluate the framework from the flexibility point of view. (C) 2004 Wiley Periodicals, Inc.

  • 階層型モバイルエージェントの自律的な合成のための記述とその基盤に関する検討

    石川 冬樹, 田原 康之, 吉岡 信和, 本位田 真一

    第11 回ソフトウェア工学の基礎ワークショップ (FOSE2004)     61 - 64  2004.11  [Refereed]

  • T-shaped Interaction Compounds and Listening Agents (to appear)

    E. Platon, N. Sabouret, S. Honiden

    Third International Workshop on Agent-Oriented Methodologies Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA2004) October 24, 2004 - Vancouver, Canada    2004.10  [Refereed]

  • Location-aware Application Development Methodology using Mobile Agent-based System

    K. Matsuzaki, N. Yoshioka, S. Honiden

    International Workshop on Mobility Aware Technologies and Applications (MATA2004), October 20-22, 2004 - Florian?polis, Brazil    2004.10  [Refereed]

  • ホットスポットにおけるリソースレンタルシステムの提案と評価

    武藤宏美, 鄭顕志, 田原康之, 深澤良彰, 本位田真一

    合同エージェントワークショップ&シンポジウム(JAWS2004)     27 - 34  2004.10  [Refereed]

  • 階層型モバイルエージェントの合成における合意記述

    石川 冬樹, 田原 康之, 吉岡 信和, 本位田 真一

    合同エージェントワークショップ&シンポジウム2004(JAWS2004)     50 - 58  2004.10  [Refereed]

  • コンテンツカプセル化エージェントの動作制御のためのポリシーモデル

    NGUYEN Khanh Ngoc, 石川冬樹, 田原康之, 本位田真一

    合同エージェントワークショップ&シンポジウム2004 (JAWS2004) 2004年10月27日-29日    2004.10  [Refereed]

  • A multi-agent framework for ubiquitous information system: mobeet framework

    N. Yoshioka, S. Honiden

    Sixth International Bi-Conference Workshop on AGENT-ORIENTED INFORMATION SYSTEMS (AOIS-2004), July 20, 2004    2004.07  [Refereed]

  • Toward Synthesis of Web Services and Mobile Agents

    F. Ishikawa, N. Yoshioka, Y. Tahara, S. Honiden

    AAMAS'2004 Workshop on Web Services and Agent-based Engineering (WSABE), July 19, 2004 - New York, USA    2004.07  [Refereed]

  • A Specification Language for Mobile Agent Applications

    Y. Tahara, A. Ohsuga, S. Honiden, Pigeon

    The Third International Joint Conference on Autonomous Agents & Multi Agent Systems(AAMAS-04), July 19-23, 2004     1356 - 1357  2004.07  [Refereed]

  • パーベイシブネットワークにおけるWebサービス連携のためのモバイルエージェントシステム

    石川冬樹, 吉岡信和, 本位田真一

    電子情報通信学会論文誌   J87-D ( 7 ) 782 - 795  2004.07  [Refereed]

  • Bridging the Gap between AUML and Implementation using FOPL

    Takuo Doi, Nobukazu Yoshioka, Yasuyuki Tahara, Shinichi Honiden

    Proc. of the Second International Workshop on Programming Multi-Agent Systems(ProMAS 2004)     69 - 78  2004.07  [Refereed]

  • Webサービス連携のためのモバイルエージェント動作記述 (「オブジェクト指向とWeb技術」特集号)

    石川冬樹, 田原康之, 吉岡信和, 本位田真一

    情報処理学会論文誌   45 ( 6 ) 1593 - 1602  2004.06  [Refereed]

  • ユビキタス環境のためのエージェント指向ソフトウェアの開発と応用

    吉岡信和, 大須賀昭彦, 本位田真一

    システム/制御/情報   48 ( 11 ) 22 - 27  2004.05  [Refereed]

    DOI

  • モバイルエージェントを用いたユビキタスアプリケーション開発法

    Kazutaka Matsuzaki, Nobukazu Yoshioka, Shinichi Honiden

    International Workshop on Ubiquitous Computing (IWUC 2004)    2004.04  [Refereed]  [Invited]

  • Ubiquitous Application Development using a Mobile Agent-based System

    K. Matsuzaki, N. Yoshioka, S. Honiden

    International Workshop on Ubiquitous Computing (IWUC 2004), April 13-14, 2004 - Porto, Portugal     204 - 212  2004.04  [Refereed]

  • Mobile Agent System for Web Services Integration in Pervasive Networks

    F. Ishikawa, N. Yoshioka, Y. Tahara, S. Honiden

    International Workshop on Ubiquitous Computing (IWUC 2004), April 13-14, 2004 - Porto, Portugal     38 - 47  2004.04  [Refereed]

  • パターンを用いたセキュアなモバイルエージェントシステム設計法

    吉岡信和, 田原康之, 大須賀昭彦, 本位田真一

    情報処理学会論文誌   45 ( 3 ) 842 - 857  2004.03

  • ロジック書き換えパターンの検証方法の提案

    吉岡信和, 本位田真一

    ソフトウェア工学の基礎XI,日本ソフトウェア科学会    2004.03  [Refereed]  [Invited]

  • マルチメディアコンテンツ流通のためのモバイルエージェントのモデル駆動開発

    苅部卓哉, 吉岡信和, 田原康之, 本位田真一

    ソフトウェア工学の基礎XI,日本ソフトウェア科学会    2004.03  [Refereed]  [Invited]

  • マルチエージェントシステムのためのインタラクション主導開発におけるシステム分析

    土肥拓生, 吉岡信和, 田原康之, 本位田真一

    ソフトウェア工学の基礎XI,日本ソフトウェア科学会    2004.03  [Refereed]  [Invited]

  • P2Pグリッドにおけるモバイルエージェントを用いた生存性の高いサービスの構築

    鄭顕志, 吉岡信和, 深澤良彰, 本位田真一

    ソフトウェア工学の基礎XI,日本ソフトウェア科学会    2004.03  [Refereed]  [Invited]

  • 位置指向設計プロセス:モバイル環境における状況依存アプリケーションのアスペクト指向設計

    松崎和賢, 吉岡信和, 本位田真一

    ソフトウェア工学の基礎XI,日本ソフトウェア科学会    2004.03  [Refereed]  [Invited]

  • 位置情報を利用するエージェントのロケーション指向設計

    松崎和賢, 吉岡信和, 本位田真一

    エージェント合同シンポジウム(JAWS 2004)論文集    2004.03  [Refereed]  [Invited]

  • マルチエージェントシステムのインタラクション主導要求分析

    土肥拓生, 吉岡信和, 田原康之, 本位田真一

    エージェント合同シンポジウム(JAWS 2004)論文集    2004.03  [Refereed]  [Invited]

  • P2P グリッドにおけるサービスの効率的障害退避

    鄭顕志, 吉岡信和, 深澤良彰, 本位田真一

    エージェント合同シンポジウム(JAWS 2004)論文集    2004.03  [Refereed]  [Invited]

  • アクティブコンテンツ:コンテンツ流通のためのモバイルエージェントフレームワーク

    苅部卓哉, 吉岡信和, 田原康之, 本位田真一

    エージェント合同シンポジウム(JAWS 2004)論文集    2004.03  [Refereed]  [Invited]

  • モバイルエージェントを使ったLocation-awareアプリケーションの開発法

    Kazutaka Matsuzaki, Nobukazu Yoshioka, Shinichi Honiden

    Proc. of International Workshop on Mobility Aware Technologies and Applications (MATA2004), LNCS 3284     13 - 26  2004.03  [Refereed]  [Invited]

  • Webサービスとモバイルエージェントの統合

    Fuyuki Ishikawa, Nobukazu Yoshioka, Yasuyuki Tahara, Shinichi Honiden

    AAMAS'2004 Workshop on Web Services and Agent-based Engineering (WSABE) (2004).    2004.03  [Refereed]  [Invited]

  • Webサービス連携のためのモバイルエージェントのビヘイビア記述

    Fuyuki Ishikawa, Yasuyuki Tahara, Nobukazu Yoshioka, Shinichi Honiden

    2004 IEEE International Conference on Web Services (ICWS 2004)     342 - 349  2004.03  [Refereed]  [Invited]

  • パーベイシブコンピューティングのためのマルチエージェントフレームワーク: Mobeetフレームワーク

    N. Yoshioka, A. Ohsuga, S. Honiden

    Electrical Engineering in Japan,John Wiley & Sons, Inc   ( Vol.149, Issue 3 ) 49 - 64  2004.03  [Refereed]  [Invited]

  • パターンに基づくモバイル環境のためのモバイルエージェントフレームワーク

    Nobukazu Yoshioka, Shinichi Honiden

    Proc. of International Workshop on Mobility Aware Technologies and Applications (MATA2004), LNCS 3284, Springer-Verlag,     369 - 380  2004.03  [Refereed]  [Invited]

  • Software design method for agent-systems from scenarios

    K Matsumoto, S Honiden

    COMPUTERS AND THEIR APPLICATIONS     136 - 141  2004  [Refereed]

     View Summary

    This paper proposes a design method for agent interaction protocols (AIP) in multi-agent systems. The method starts a design process with informal and ambiguous requirements in English, and according to the clearly defined development stages the method gradually converts them into consolidate specifications described in UML. Similar to the object-oriented development, the early stages include extractions of agents, roles of agents, actions, goals, and several types of logical constraints. Based on these information, the successive stages generate skeletons of scenarios, which specify the necessary conditions to achieve a goal. Completing the skeleton with added information from the designer, the skeletons become the final AIP designs in UML.

  • ユビキタスネットワークに対応した動的パターン適用に基づくモバイルエージェントシステム構築法

    吉岡信和, 本位田真一

    情報処理学会論文誌   45 ( 1 ) 12 - 23  2004.01  [Refereed]

  • A Highly Secure Mobile Agent System Architecture

    Yasukuni Okataku, Hidetoshi Okutomi, Nobuyuki Ohgishi, Nobukazu Yoshioka, Shinichi Honiden

    IEEJ Transactions on Electronics, Information and Systems   124 ( 1 ) 56 - 63  2004  [Refereed]

     View Summary

    We propose a system architecture for mobile agents to improve their security in the environments of insecure networks and non-sophisticated terminals such as PDAs. As mobile agents freely migrate onto their favorite terminals through insecure networks or terminals, it is not appropriate for them to store some secret information for authentication and encryption/decryption. We introduce one and more secure nodes(OASIS NODE) for securely generating and verifying authentication codes. The each agent's data are encrypted by a pseudo-chaos cipher mechanism which doesn't need any floating processing co-processor. We've constructed a prototype system on a Java mobile agent framework, “Bee-gent” which implements the proposed authentication and cipher mechanisms, and evaluated their performances and their applicability to business fields such as an auction system by mobile agents. © 2004, The Institute of Electrical Engineers of Japan. All rights reserved.

    DOI CiNii

  • A pattern oriented mobile agent framework for mobile computing

    N Yoshioka, S Honiden

    MOBILITY AWARE TECHNOLOGIES AND APPLICATIONS, PROCEEDINGS   3284   369 - 380  2004  [Refereed]

     View Summary

    As a consequence of the increasing role of computers throughout society, computers, especially mobile devices, are used in diverse situations. Additionally, the computing environment is becoming more changeable. A network application coordinating mobile devices needs to be able to adapt to changes in the environments. In this paper, we propose a new architecture for mobile computing, which uses a mobile agent technology and adapts to changes flexibly. The framework splits the specification of an application into network environments, coordination logic and patterns. Patterns are applied to the coordination logic in order to derive appropriate behaviors automatically.

  • Security patterns: A method for constructing secure and efficient inter-company coordination systems

    N Yoshioka, S Honiden, A Finkelstein

    EIGHTH IEEE INTERNATIONAL ENTERPRISE DISTRIBUTED OBJECT COMPUTING CONFERENCE, PROCEEDINGS     84 - 97  2004  [Refereed]

     View Summary

    As the Internet, intranets and other wide-area open networks grow, novel techniques for building distributed systems, notably mobile agents, are attracting increasing attention. This is particularly the case for inter-company system coordination applications. A key difficulty in constructing such systems is to meet the security requirements while at the same time respecting the requirements for efficient implementation. In this paper we propose a method that addresses this problem and show an application of the method to a real implemented system, the Environmentally Conscious Product (ECP) design support system. Our approach enables developers to specify several candidate system behaviors that satisfy the security requirements. We use patterns for this purpose. Patterns are abstract templates of system behavior fragments. The patterns include agent migrations, communications between applications and security procedures. We model the performance data associated with each pattern. Developers can then select an efficient implementation using this model to compare the performance data of the candidates. We evaluate our approach with a significant real-world example, the ECP design support system that essentially requires inter-company system coordination.

    DOI

  • Dynamic invocation model of web services using subsumption relations

    S Nagano, T Hasegawa, A Ohsuga, S Honiden

    IEEE INTERNATIONAL CONFERENCE ON WEB SERVICES, PROCEEDINGS     150 - 156  2004  [Refereed]

     View Summary

    Enterprise information systems are currently developed as Web-based applications in the service-oriented architecture style, which is implied by the stack of Web services standards. One of the most critical aspects in enterprise information systems is to maintain their continuous operation as long as possible. Conventional service invocation mechanism identifies Web services with similar signatures found by a service discovery as distinctively different ones, resulting in the suspension of a service requester and the modification of its invocation procedures. In this paper we propose a reasonable solution to realize runtime invocation of Web services, regarding structural similarities in service signatures as subsumption relations of XML scheme. Given Web services with subsumed signatures, this solution enables a service requester to invoke the Web services by translating the scheme types of the invocation parameters.

    DOI

  • Behavior descriptions of mobile agents for web services integration

    F Ishikawa, Y Tahara, N Yoshioka, S Honiden

    IEEE INTERNATIONAL CONFERENCE ON WEB SERVICES, PROCEEDINGS     342 - 349  2004  [Refereed]

     View Summary

    Web Services technology for interoperability, dynamic discovery and integration of distributed components is to be applied in various environments, such as networks of relatively narrow and unstable wireless connections. However, in such environments it is necessary to deal with resource limitation. Our work adopts mobile agent technology in response to this problem and presents a mobile agent frame work for Web Services integration. This framework utilizes BPEL (Business Process Execution Language for Web Services) for description of the integration logic, and provides declarative descriptions for physical behaviors (migration and cloning). This facilitates addition or change of physical behaviors according to the environmental conditions while preserving the integration logic. This paper especially focuses on formal definition and discussion of our framework.

    DOI

  • An authentication architecture for collaboration among agents in ad hoc networks

    Y Okataku, N Yoshioka, S Honiden

    ELECTRONICS AND COMMUNICATIONS IN JAPAN PART I-COMMUNICATIONS   87 ( 5 ) 11 - 19  2004  [Refereed]

     View Summary

    This paper proposes an authentication architecture for collaboration among agents in a network environment without security assurance. The architecture requires that there should exist at least one secure node (oasis node). The oasis node generates the same number of authentication codes as the number of objects of authentication, using random numbers and agent information, and distributes the codes among the agents. The agents gather at the specified oasis node and obtain verification by the oasis node, based on the distributed random value and the authentication code. In the authentication architecture proposed in this paper, the random number and the authentication code are publicized information which can be compromised by eavesdropping. But the algorithm for generation and verification of the authentication code is not publicized. The architecture is suited for handling authentication processing in ad hoc collaboration among an unspecified number of agents. (C) 2004 Wiley Periodicals, Inc. Electron Comm Jpn Pt 1, 87(5): 11-19, 2004; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ ecja.10165.

    DOI

  • The methodology for developing mobile agent application for ubiquitous environment

    Kazutaka Matsuzaki, Nobukazu Yoshioka, Shinichi Honiden

    Transactions of the Japanese Society for Artificial Intelligence   19 ( 4 ) 311 - 321  2004  [Refereed]

     View Summary

    A methodology which enables a flexible and reusable development of mobile agent application to a mobility aware indoor environment is provided in this study. The methodology is named Workflow-awareness model based on a concept of a pair of mobile agents cooperating to perform a given task. A monolithic mobile agent application with numerous concerns in a mobility aware setting is divided into a master agent (MA) and a shadow agent (SA) according to a type of tasks. The MA executes a main application logic which includes monitoring a user's physical movement and coordinating various services. The SA performs additional tasks depending on environments to aid the MA in achieving efficient execution without losing application logic. "Workflow-awareness (WFA) " means that the SA knows the MA's execution state transition so that the SA can provide a proper task at a proper timing. A prototype implementation of the methodology is done with a practical use of AspectJ. AspectJ is used to automate WFA by weaving communication modules to both MA and SA. Usefulness of this methodology concerning its efficiency and software engineering aspects are analyzed. As for the effectiveness, the overhead of WFA is relatively small to the whole expenditure time. And from the view of the software engineering, WFA is possible to provide a mechanism to deploy one application in various situations.

    DOI

  • A Model for Federation of Service Communities on the Web

    Hironobu Kuruma, Shinichi Honiden

    IPSJ Journal   45 ( 6 ) 1593 - 1602  2004  [Refereed]

    CiNii

  • モバイルエージェントによる柔軟なコンテンツ流通を実現するアクティブコンテンツ

    吉岡信和, 田原康之, 本位田真一

    情報処理学会論文誌:データベース   44 ( SIG18 ) 45 - 57  2003.12  [Refereed]

  • エージェントフレームワークを用いた車載端末向け情報提供システムの構築と評価

    服部 正典, 長 健太, 大須賀 昭彦, 本位田 真一, 深澤 良彰

    情報処理学会論文誌   44 ( 12 ) 3024 - 3037  2003.12

  • Webサービス連携のためのモバイルエージェント動作記述

    石川 冬樹, 田原 康之, 吉岡 信和, 本位田 真一

    第10回ソフトウェア工学の基礎ワークショップ (FOSE'03)     197 - 200  2003.11  [Refereed]

  • A Security Architecture or Collaboration Among Many and Unspecifiled Agents

    Y. Okataku, H. Okutomi, N. Yoshioka, S. Honiden

    8th International Workshop on Mobile Multimedia Communications (MoMuC2003), Oct. 6-8 2003, Munich, Germany    2003.10  [Refereed]

  • モバイルエージェントによるWebサービス連携モデル

    石川 冬樹, 吉岡 信和, 田原 康之, 本位田 真一

    合同エージェントシンポジウム&ワークショップ (JAWS2003)     168 - 175  2003.10  [Refereed]

  • A Security Architecture for Collaboration Among Many and Unspecified Agents

    Y. Ohtsuka, H. Okutomi, N. Yoshioka, S. Honiden

    8th International Workshop on Mobile Multimedia Communications (MoMuC2003), Oct.6-8, 2003, Munich, Germany    2003.10  [Refereed]

  • Integrating Multiple Internet Directories by Instance-based Learning Subtitle

    Shinichi Honiden

    Eighteenth International Joint Conference in Artificial Intelligence (IJCAI-03)     132 - 141  2003.08  [Refereed]

  • ユビキタス環境におけるContext-Awareなパーソナルエージェントの構築とその実証実験

    服部正典, 大須賀昭彦, 本位田真一

    電子情報通信学会論文誌   J86-D1 ( 8 ) 543 - 552  2003.08  [Refereed]

  • モバイルエージェントアプリケーションのための仕様記述言語Pigeon

    田原康之, 大須賀昭彦, 本位田真一

    電子情報通信学会論文誌   J86-D1 ( 8 ) 532 - 542  2003.08  [Refereed]

  • Integrating Multiple Internet Directories by Instance-based Learning

    R. Ichise, H. Takeda, S. Honiden

    Eighteenth International Joint Conference in Artificial Intelligence (IJCAI-03)    2003.08  [Refereed]

  • A Goal Model Elaboration for Localizing Changes in Software Evolution

    Hiroyuki Nakagawa, Akihiko Ohsuga, Shinichi Honiden

    21st IEEE International Requirements Engineering Conference (RE'13)    2003.07  [Refereed]

  • パターンを利用したセキュアかつ効率的なモバイルエージェントアプリケーション開発

    田原康之, 大須賀昭彦, 本位田真一

    情報処理学会論文誌   44 ( 6 ) 1483 - 1497  2003.06  [Refereed]

  • モバイルアプリケーションのためのエージェントプラットフォームMolFie

    粂野文洋, 本位田真一

    電子情報通信学会論文誌   J86-B ( 3 ) 362 - 375  2003.03  [Refereed]

  • アドホックネットワークにおけるエージェント間共同作業のための認証機構

    岡宅靖邦, 吉岡信和, 本位田真一

    電子情報通信学会論文誌   J86-B ( 3 ) 419 - 427  2003.03  [Refereed]

  • エージェントのペアリングによる再利用性と動的環境適応性を考慮に入れた記述分離

    松崎和賢, 吉岡信和, 本位田真一

    ソフトウェア工学の基礎X,日本ソフトウェア科学会    2003.03  [Refereed]  [Invited]

  • UMLを用いたセキュアなアプリケーション開発のための支援手法

    苅部卓哉, 吉岡信和, 本位田真一

    ソフトウェア工学の基礎X,日本ソフトウェア科学会    2003.03  [Refereed]  [Invited]

  • エージェント間プロトコル記述言語FOPLの提案

    土肥拓生, 吉岡信和, 本位田真一

    ソフトウェア工学の基礎X,日本ソフトウェア科学会    2003.03  [Refereed]  [Invited]

  • モバイルエージェントによるデジタルコンテンツ流通

    苅部卓哉, 吉岡信和, 田原康之, 本位田真一

    エージェント合同シンポジウム(JAWS 2003)論文集    2003.03  [Refereed]  [Invited]

  • インタラクションプロトコル記述言語FOPL

    土肥拓生, 吉岡信和, 田原康之, 本位田真一

    エージェント合同シンポジウム(JAWS 2003)論文集    2003.03  [Refereed]  [Invited]

  • アドホックなサービス利用を援するエージェントプラットフォーム拡張の提案

    松崎和賢, 吉岡信和, 田原康之, 本位田真一

    エージェント合同シンポジウム (JAWS 2003) 論文集    2003.03  [Refereed]  [Invited]

  • モバイルエージェントを用いた小規模Grid 構築

    鄭顕志, 吉岡信和, 本位田真一, 深澤良彰

    エージェント合同シンポジウム(JAWS 2003)論文集    2003.03  [Refereed]  [Invited]

  • バッテリー切れを考慮したモバイルエージェントを使ったシステム退避システム: Easter

    H. Kaneko, Y. Fukazawa, F. Kumeno, N. Yoshioka, S. Honiden

    不明    2003.03  [Refereed]  [Invited]

  • 不特定多数のエージェントの協調のためのセキュリティアーキテクチャ

    Y. Okataku, H. Okutomi, N. Ohgishi, N. Yoshioka, S. Honiden

    8th International Workshop on Mobile Multimedia Communications, (2003).    2003.03  [Refereed]  [Invited]

  • Context-aware agent platform in ubiquitous environments and its verification

    M. Hattori, K. Cho, A. Ohsuga, M. Ishiki, S. Honiden

    IEEE International Conference on Pervasive Computing and Communications    2003.03  [Refereed]

  • Context-aware agent platform in ubiquitous environments and its verification tests

    M Hattori, K Cho, A Ohsuga, M Isshiki, S Honiden

    PROCEEDINGS OF THE FIRST IEEE INTERNATIONAL CONFERENCE ON PERVASIVE COMPUTING AND COMMUNICATIONS (PERCOM 2003)     547 - 552  2003  [Refereed]

     View Summary

    This paper deals with "Ubiquitous personal agent" that distinctively provides information services to the individual user depending on his/her personal contexts. In this paper, details about this agent technology as well as its effectiveness are discussed. The latter has been confirmed by verification tests using home information appliances already available in the domestic market.

  • Mobile agent based evacuation system when the battery runs out: EASTER

    H Kaneko, Y Fukazawa, F Kumeno, N Yoshioka, S Honiden

    PROCEEDINGS OF THE FIRST IEEE INTERNATIONAL CONFERENCE ON PERVASIVE COMPUTING AND COMMUNICATIONS (PERCOM 2003)     460 - 469  2003  [Refereed]

     View Summary

    As mobile computing becomes common, the battery issue of mobile computing devices has become increasingly notable. To this end, research and development of various power-conservation devices and methods are actively taking place. However, the conventional method of extending the battery life through power-conservation can never prevent the unintentional shutdowns of applications due to the dead battery. This research aims to realize the evacuation of applications on a mobile computing device to another device before the battery runs out by creating the application as a mobile agent Particularly, by introducing the concept of the Crisis Management Center dynamic and smooth evacuation of multiple application agents will become possible. This paper explains and verifies the effectiveness of the EASTER (Escape Agent System from dying batTERy), a system developed for the purpose of recovering the applications when a battery is running out through the use of mobile agent system.

  • Context-aware agent platform in ubiquitous environments and its verification tests

    M Hattori, K Cho, A Ohsuga, M Isshiki, S Honiden

    PROCEEDINGS OF THE FIRST IEEE INTERNATIONAL CONFERENCE ON PERVASIVE COMPUTING AND COMMUNICATIONS (PERCOM 2003)     547 - 552  2003  [Refereed]

     View Summary

    This paper deals with "Ubiquitous personal agent" that distinctively provides information services to the individual user depending on his/her personal contexts. In this paper, details about this agent technology as well as its effectiveness are discussed. The latter has been confirmed by verification tests using home information appliances already available in the domestic market.

  • A formal model of active contents based on the ambient calculus

    Y Tahara, N Yoshioka, S Honiden

    MOBILE AGENTS FOR TELECOMMUNICATION APPLICATIONS, PROCEEDINGS   2881   132 - 141  2003  [Refereed]

     View Summary

    The recent innovation of telecommunication and networking technology is enabling easy and flexible distribution of digital multimedia contents. However, such rapid progress has brought about various problems on intellectual properties and security. We are investigating a technique to solve the problem called active contents based on hierarchical structures of mobile agents. The agents work as wrappers of contents and can easily manage the policies for contents distribution. In this paper, we give a formal model of active contents in order to establish rigorous foundations for the active contents technique, especially the system of the policy control mechanisms. Using the model, we can verify if the behaviors of the active contents satisfy the given policies or not. An example of the redistribution prohibition policy illustrates how the verification works.

  • Planning mobile agent architecture for realizing mobile intelligence

    M Hattori, A Ohsuga, S Honiden

    PDPTA'03: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS 1-4     1026 - 1032  2003  [Refereed]

     View Summary

    This paper describes a planning mobile agent architecture proposed for mobile and ubiquitous network environments. Mobile agents in this architecture have mobile, planning, and meta-level control functionality, which can make mobile agents intelligent. The architecture addresses the problems of open network environments and adapts to unreliable networks. Stationary agents maintain distributed knowledge that is provided to the mobile agents.

  • Interoperability for Mobile Agents by incarnation Agents

    T. Hasegawa, K. Cho, F. Kumeno, S. Nakajima, A.Ohsuga, S. Honiden

    Scecond International Conference on Autonomous agents and Multiagent Systems (AAMAS-03)    2003.01  [Refereed]

  • An Experimental Trial of Shopping Assistance Service Based on Ubiquitous Personalize Agent

    Hattori Masanori, Akihiko Ohsuga, Seki Toshibumi, Masao Isshiki, Shinichi Honiden

    IEEJ Transactions on Electronics, Information and Systems   123 ( 11 ) 2010 - 2019  2003  [Refereed]

     View Summary

    This paper describes a “Ubiquitous Personalize Agent” and it's application: “Shopping assistance service” for ubiquitous environments. Ubiquitous personalize agent is realized based on context reasoning technology. It can determine contexts of users by referring a lot of data which can be retrieved from devices in ubiquitous environments. We also have had an experimental trial of this service. In this paper, we state the technology, service, and evaluation on the experimental trial. © 2003, The Institute of Electrical Engineers of Japan. All rights reserved.

    DOI

  • A Multi Agent Framework for Pervasive Computing: Mobeet Framework

    Nobukazu Yoshioka, Akihiko Ohsuga, Shinichi Honiden

    IEEJ Transactions on Electronics, Information and Systems   123 ( 8 ) 1473 - 1485  2003  [Refereed]

     View Summary

    Pervasive computing is becoming a more important issue for open distributed systems. It is, however, hard to design such distributed systems when the user uses many kinds of terminals and migrates with these. This paper has proposed a new framework for pervasive computing. The framework includes three kinds of agents: User Interface Agents, Programmable Agents and Service Mediation Agents. We can easily design a flexible distributed system by collaborating these agents. We also evaluate the framework from flexibility point of view. © 2003, The Institute of Electrical Engineers of Japan. All rights reserved.

    DOI CiNii

  • A Proposal of Replica Management Based on MIC Method Suitable for Mobile Computation Environments

    Yasukuni Okataku, Nobukazu Yoshioka, Shinichi Honiden

    IEEJ Transactions on Electronics, Information and Systems   123 ( 4 ) 670 - 676  2003  [Refereed]

     View Summary

    We propose a fault-tolerant mechanism based on message integrity code (MIC) method for mobile agent authentication under non-secured network environment. We introduce one or more secured nodes (OASIS NODE) and a mobile agent (FT_Agent) having a replica management mechanism. We assume that the candidate agents for authentication are safely stored in an OASIS NODE and a shared secret key is safely distributed to user terminals from the OASIS NODE at the beginning. When the replica agents on user terminals need their authentication, they calculate MIC by using the shared secret key and move themselves having the MIC to the OASIS NODE, which verifies the MIC. The FT_Agents which are also verified by an OASIS NODE are distributed to the each agent and dynamically manage active replicas and passive replicas. By introducing the MIC method and the replica management mechanism, a secured fault-tolerant system suitable for mobile agents under non-secured network environment can be constructed. © 2003, The Institute of Electrical Engineers of Japan. All rights reserved.

    DOI CiNii

  • A formal model of active contents based on the ambient calculus

    Y Tahara, N Yoshioka, S Honiden

    MOBILE AGENTS FOR TELECOMMUNICATION APPLICATIONS, PROCEEDINGS   2881   132 - 141  2003  [Refereed]

     View Summary

    The recent innovation of telecommunication and networking technology is enabling easy and flexible distribution of digital multimedia contents. However, such rapid progress has brought about various problems on intellectual properties and security. We are investigating a technique to solve the problem called active contents based on hierarchical structures of mobile agents. The agents work as wrappers of contents and can easily manage the policies for contents distribution. In this paper, we give a formal model of active contents in order to establish rigorous foundations for the active contents technique, especially the system of the policy control mechanisms. Using the model, we can verify if the behaviors of the active contents satisfy the given policies or not. An example of the redistribution prohibition policy illustrates how the verification works.

  • Planning mobile agent architecture for realizing mobile intelligence

    M Hattori, A Ohsuga, S Honiden

    PDPTA'03: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS 1-4     1026 - 1032  2003  [Refereed]

     View Summary

    This paper describes a planning mobile agent architecture proposed for mobile and ubiquitous network environments. Mobile agents in this architecture have mobile, planning, and meta-level control functionality, which can make mobile agents intelligent. The architecture addresses the problems of open network environments and adapts to unreliable networks. Stationary agents maintain distributed knowledge that is provided to the mobile agents.

  • An Experimental Trial of Shopping Assistance Service Based on Ubiquitous Personalize Agent

    Hattori Masanori, Akihiko Ohsuga, Seki Toshibumi, Masao Isshiki, Shinichi Honiden

    IEEJ Transactions on Electronics, Information and Systems   123 ( 11 ) 2010 - 2019  2003  [Refereed]

     View Summary

    This paper describes a “Ubiquitous Personalize Agent” and it's application: “Shopping assistance service” for ubiquitous environments. Ubiquitous personalize agent is realized based on context reasoning technology. It can determine contexts of users by referring a lot of data which can be retrieved from devices in ubiquitous environments. We also have had an experimental trial of this service. In this paper, we state the technology, service, and evaluation on the experimental trial. © 2003, The Institute of Electrical Engineers of Japan. All rights reserved.

    DOI

  • Evaluation of a multi agent framework for open distributed systems

    N Yoshioka, T Kawamura, A Ohsuga, S Honiden

    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   E85A ( 11 ) 2396 - 2406  2002.11  [Refereed]

     View Summary

    Interoperability between different systems is becoming a more important issue for open distributed systems. In this paper, we investigate what kind of framework we need for constructing open distributed systems. Firstly, we enumerate the features and functions which the framework should have. We then evaluate a proposed multi-agent framework, Bee-gent, by using a typical example of open distributed systems. Lastly, we show clearly what is required for such a framework.

  • PCクラスタ対応マルチエージェントフレームワーク

    吉岡信和, 鄭顕志, 深澤良彰, 本位田真一

    合同エージェントワークショップ&シンポジウム(JAWS2002)     119 - 130  2002.11  [Refereed]

  • オープン分散システムのためのマルチエージェントフレームワークの評価

    Nobukazu Yoshioka, Takahiro Kawamura, Akihiko Ohsuga, Shinichi Honiden

    IEICE TRANS. FUNDAMETALS   VOL.E85-A ( NO.11 ) 2396 - 2406  2002.11  [Refereed]  [Invited]

  • Webサービス連携エージェントのためのビヘイビアルール記述言語

    石川 冬樹, 吉岡 信和, 本位田 真一

    エージェント合同シンポジウム (JAWS 2002)     353 - 363  2002.11  [Refereed]

  • Pattern based Design for Secure and Safe Mobile Agent Systems

    N. Yoshioka, Y. Tahara, S. Honiden, A. Ohsuga

    Artificial and Computational Intelligence (ACI 2002)     365 - 117  2002.09

  • Planning Mobile Agent Architecture for Realizing Mobile Intteligence

    Shinichi Honiden

    The 2003 International Conference on Parallel and Distributed Processing Techniques and Applications     1026 - 1032  2002.06  [Refereed]

  • 共生/寄生エージェントモデルによる発展的P2Pアプリケーション構築法

    飯島正, 本位田真一, 土居範久

    情報処理学会論文誌   43 ( 6 ) 1563 - 1581  2002.06  [Refereed]

  • IPEditor開発ツールとMobile UNITY言語の適用によるモバイルエージェントセキュリティの実現

    田原康之, 大須賀昭彦, 本位田真一

    情報処理学会論文誌   43 ( 6 ) 1582 - 1597  2002.06  [Refereed]

  • 知識共生 - 新しい知識流通の基盤を目指して -

    武田英明, 市瀬龍太郎, 村田剛志, 本位田真一

    人工知能学会全国大会(第16回)論文集 (CDROM)    2002.06

  • 組み込み機器向け知的移動エージェントμPlangentを用いた電力系統巡視システム

    長健太, 入江豊, 大須賀昭彦, 関口勝彦, 本位田真一

    電子情報通信学会論文誌   J85-D1 ( 5 ) 465 - 475  2002.05  [Refereed]

  • 携帯電話アプリケーション開発のためのスクリプトシステムの提案

    直原正樹, 吉岡信和, 深澤良彰, 本位田真一

    エージェント合同シンポジウム (JAWS 2002)論文集     461 - 462  2002.03  [Refereed]  [Invited]

  • モバイル端末連携支援Bee-gent 拡張フレームワーク

    松崎和賢, 吉岡信和, 本位田真一

    エージェント合同シンポジウム(JAWS 2002)論文集     321 - 322  2002.03  [Refereed]  [Invited]

  • モバイルエージェントによるバッテリ切れ避難システム : Easter

    金子平祐, 深澤良彰, 粂野文洋, 吉岡信和, 本位田真一

    エージェント合同シンポジウム(JAWS 2002)論文集     314 - 320  2002.03  [Refereed]  [Invited]

  • パターンを利用したセキュアかつ効率的なモバイルエージェントアプリケーション開発

    田原康之, 吉岡信和, 大須賀昭彦, 本位田真一

    情報処理学会     43 - 50  2002.03  [Refereed]  [Invited]

  • PCクラスタに対応したマルチエージェントシステムの提案

    吉岡信和, 鄭顕志, 深澤良彰, 本位田真一

    エージェント合同シンポジウム (JAWS 2002)論文集     353 - 363  2002.03  [Refereed]  [Invited]

  • コンポーネントベース・フレームワーク開発手法におけるコンポーネントの形式的仕様記述

    吉田和樹, 本位田真一

    電子情報通信学会論文誌   J85-D1 ( 2 ) 210 - 227  2002.02  [Refereed]

  • コンポーネントベース・フレームワーク開発手法におけるコンポーネントの抽出・設計方法論

    吉田和樹, 本位田真一

    情報処理学会論文誌   43 ( 1 ) 156 - 175  2002.01  [Refereed]

  • An Examination of the Relationships between Internet Directories

    R. Ichise, H. Takeda, S. Honiden

    Proceedings of the EKAW-02 Workshop on Knowledge Management through Corporate Semantic Web    2002.01  [Refereed]

  • Learning of alignment rules between concept hierarchies

    Ryutaro Ichise, Hideaki Takeda, Shinichi Honiden

    Transactions of the Japanese Society for Artificial Intelligence   17 ( 3 ) 230 - 238  2002  [Refereed]

     View Summary

    With the rapid advances of information technology, we are acquiring much information than ever before. As a result, we need tools for organizing this data. Concept hierarchies such as ontologies and information categorizations are powerful and convenient methods for accomplishing this goal, which have gained wide spread acceptance. Although each concept hierarchy is useful, it is difficult to employ multiple concept hierarchies at the same time because it is hard to align their conceptual structures. This paper proposes a rule learning method that inputs information from a source concept hierarchy and finds suitable location for them in a target hierarchy. The key idea is to find the most similar categories in each hierarchy, where similarity is measured by the K(kappa) statistic that counts instances belonging to both categories. In order to evaluate our method, we conducted experiments using two internet directories: Yahoo! and LYCOS. We map information instances from the source directory into the target directory, and show that our learned rules agree with a human-generated assignment 76% of the time.

    DOI CiNii

  • Development of Distributed Power Outage Scheduling System by Using Bee-gent

    T. Kawamura, T. Hasegawa, T. Seki, A. Ohsuga, S. Honiden

    Electrical Engineering in Japan, John Wiley & Sons, Inc.   139 ( 3 ) 62 - 72  2002  [Refereed]

     View Summary

    (和文論文の英訳版)

  • Learning of alignment rules between concept hierarchies

    Ryutaro Ichise, Hideaki Takeda, Shinichi Honiden

    Transactions of the Japanese Society for Artificial Intelligence   17 ( 3 ) 230 - 238  2002  [Refereed]

     View Summary

    With the rapid advances of information technology, we are acquiring much information than ever before. As a result, we need tools for organizing this data. Concept hierarchies such as ontologies and information categorizations are powerful and convenient methods for accomplishing this goal, which have gained wide spread acceptance. Although each concept hierarchy is useful, it is difficult to employ multiple concept hierarchies at the same time because it is hard to align their conceptual structures. This paper proposes a rule learning method that inputs information from a source concept hierarchy and finds suitable location for them in a target hierarchy. The key idea is to find the most similar categories in each hierarchy, where similarity is measured by the K(kappa) statistic that counts instances belonging to both categories. In order to evaluate our method, we conducted experiments using two internet directories: Yahoo! and LYCOS. We map information instances from the source directory into the target directory, and show that our learned rules agree with a human-generated assignment 76% of the time.

    DOI

  • 開放型分散環境におけるプランニングモバイルエージェントアーキテクチャの提案

    服部正典, 大須賀昭彦, 本位田真一

    電子情報通信学会論文誌   J84-D-1 ( 8 ) 1169 - 1180  2001.08  [Refereed]

  • Designing multi-agent systems based on pairwise agent interactions

    T Kawamura, S Joseph, A Ohsuga, S Honiden

    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS   E84D ( 8 ) 968 - 980  2001.08  [Refereed]

     View Summary

    Systems comprised of multiple interacting mobile agents provide an alternate network computing paradigm that integrates remote data access, message exchange and migration; which up until now have largely been considered independently. On the surface distributed systems design could be helped by a complete specification of the different interaction patterns, however the number of possible designs in any large scale system undergoes a combinatorial explosion. As a consequence this paper focuses on basic one-to-one agent interactions, or paradigms, which can be used as building blocks; allowing larger system characteristics and performance to be understood in terms of their combination. This paper defines three basic agent paradigms and presents associated performance models. The paradigms are evaluated quantitatively in terms of network traffic, overall processing time and size of memory used, in the context of a distributed DB system developed using the Bee-gent Agent Framework. Comparison of the results and models illustrates the performance trade-off for each paradigm, which axe not represented in the models, and some implementation issues of agent frameworks. The paper ends with a case study of how to select an appropriate paradigm.

  • 他者の持つ知識を利用した階層的分類知識の獲得

    市瀬龍太郎, 武田英明, 本位田真一

    人工知能学会全国大会(第15回)論文集 (CDROM)    2001.06

    DOI

  • An alignment algorithm between concept hierarchies

    Ryutaro ICHISE, Hideaki TAKEDA, Shinichi HONIDEN

    Technical Report   ( NII-20 )  2001.05

  • A Constraint-Based Approach to Information Visualization for XML

    Hiroshi Hosobe, Shinichi Honiden

    Proceedings of the Interaction 2001 Symposium, IPSJ Symposium Series   2001 ( 5 ) 83 - 90  2001.03  [Refereed]

  • Rule Induction for Concept Hierarchy Alignment

    Shinichi Honiden

    Proceedings of the IJCAI-01 Workshop on Ontology Learning (OL-2001)    2001  [Refereed]

  • Automated Alignment of Multiple Internet Directories

    Shinichi Honiden

    Poster Proceedings of the 10th International World Wide Web Conference     194 - 195  2001  [Refereed]

  • Mobile Agent Security with the IPEditor, Development Tool and the Mobile UNITY Language

    Shinichi Honiden

    Agents 2001     656 - 662  2001  [Refereed]

  • Secure and Efficient Mobile Agent Application Reuse Using Patterns

    Shinichi Honiden

    Symposium on Software Reusability (SSR2001) (2001)     78 - 85  2001  [Refereed]

    CiNii

  • Behavior patterns for mobile agent systems from the development process viewpoint

    Y Tahara, A Ohsuga, S Honiden

    5TH INTERNATIONAL SYMPOSIUM ON AUTONOMOUS DECENTRALIZED SYSTEMS, PROCEEDINGS     239 - 242  2001  [Refereed]

     View Summary

    As wide-area open networks like the Internet and intranets grow larger mobile agent technology is attracting more attention. Agents are units of software that can deal with environmental changes and the various requirements of open networks through features such as autonomy: mobility: intelligence, cooperation, and reactivity? However; since the usual development methods of the agent systems are not sufficiently investigated, the technology is not yet widespread. In the previous papers, we introduced behavior patterns for mobile agent systems and the development method The behavior patterns represent typical and recurring structures and behaviors of agents. The patterns are classified according to their appropriate architectural levels and the degree to which they depend on specific agent platforms. In this paper we evaluate the advantages of our method from the development process viewpoints. Our evaluation focuses on the development efficiency: the applicability, the extensibility and the understandability of our method.

    DOI

  • Planning mobile agent architecture for open network environment

    Shinichi Honiden

    Symposium on Software mobility and adaptive behavior, AISB’01 Convention (2001)    2001  [Refereed]

  • Security for mobile agents

    Nobukazu Yoshioka, Yasuyuki Tahara, Akihiko Ohsuga, Shinichi Honiden

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   1957   223 - 234  2001  [Refereed]

     View Summary

    In view of the proliferation and expansion of wide-area open networks such as the intranets and extra-nets, agent technology is attracting greater attention. However, as yet there is well-established and widely used method of developing safe and secure agent systems. In this paper, we propose a methodology that supports the step-by-step development of mobile agent systems while ensuring consideration of security issues. This approach results in a robust infrastructure for practical system development, and by supporting calculation of various costs allows efficiency and security tradeoffs to be objectively evaluated. © 2001 Springer Berlin Heidelberg.

    DOI

  • Wwwにおける情報源に関する知識の共生

    市瀬龍太郎, 武田英明, 本位田真一

    情報処理学会研究報告「知能と複雑系」   ( 124 ) 33 - 40  2001.01

  • インスタンスに基づく階層的知識源の統合

    市瀬龍太郎, 武田英明, 本位田真一

    人工知能学会研究会資料「AIチャレンジ研究会」   ( SIG-Ch ) 61 - 66  2001.01

  • 知識共生プロジェクト

    武田英明, 市瀬龍太郎, 村田剛志, 本位田真一

    情報処理学会研究報告「知能と複雑系」   ( 124 ) 25 - 32  2001.01  [Invited]

  • Behavior patterns for mobile agent systems from the development process viewpoint

    Y. Tahara, A. Ohsuga, S. Honiden

    Proceedings - 5th International Symposium on Autonomous Decentralized Systems, ISADS 2001     239 - 242  2001  [Refereed]

     View Summary

    As wide-area open networks like the Internet and intranets grow larger, mobile agent technology is attracting more attention. Agents are units of software that can deal with environmental changes and the various requirements of open networks through features such as autonomy, mobility, intelligence, cooperation, and reactivity. However, since the usual development methods of the agent systems are not sufficiently investigated, the technology is not yet widespread. In previous papers, we introduced behavior patterns for mobile agent systems and the development method. The behavior patterns represent typical and recurring structures and behaviors of agents. The patterns are classified according to their appropriate architectural levels and the degree to which they depend on specific agent platforms. We evaluate the advantages of our method from the development process viewpoints. Our evaluation focuses on the development efficiency, the applicability, the extensibility and the understandability of our method.

    DOI

  • マルチエージェントフレームワークBee-gentを用いた電力系統作業停止計画向け分散スケジューリングシステムの開発

    川村隆浩, 長谷川哲夫, 関俊文, 大須賀昭彦, 本位田真一

    電気学会論文誌   120-C ( 12 ) 2003 - 2011  2000.12  [Refereed]

  • Qualitative Evaluation of Pair wise Interaction between Agents

    Shinichi Honiden

    The Joint Symposium ASA/MA 2000     192 - 205  2000.09  [Refereed]

  • Intelligent Mobile Agent System on the Internet

    Shinichi Honiden

    SSGRR 2000, International Conference on Advances in Infrastructure for Electronic Business, Science, and Education on the Internet    2000.08  [Refereed]

  • Autonomous adaptation by mobile agent and thesaurus

    F Kumeno, A Ohsuga, S Honiden

    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS   E83D ( 4 ) 679 - 690  2000.04  [Refereed]

     View Summary

    This paper describes the architecture to implement an application in network environments, which adapts to unexpected change in the development phase. In this architecture, an application is expressed as an agent which consists of two layers: base level and meta level. The base level program is an application program and the meta level program is the program that controls the execution of the base level and changes the base level program. Virtual places are also provided in the network. They are used for the release of programs and information which agents retrieve to change their own base level program. An application (or an agent), when a change is required, moves from places to places far the retrieval of programs to adapt to the change. A program search strategy is introduced to adapt to changes by using distributed thesauri of released programs, which realizes an agent's program retrieval method in network environments.

  • セーフティ・セキュリティを考慮したモバイルエージェントの開発法,オブジェクト指向シンポジウム2000

    吉岡信和, 田原康之, 大須賀昭彦, 本位田真一

    情報処理学会     33 - 40  2000.03  [Refereed]  [Invited]

  • A Methodology For Safety Of Mobile Agents

    Shinichi Honiden

    International ICSC Symposium on Multi-Agents and Mobile Agents in Virtual Organizations and E-Commerce (MAMA'2000)    2000  [Refereed]

  • Agent communication language patterns and their tool support

    Shinichi Honiden

    International ICSC Symposium on Multi-Agents and Mobile Agents in Virtual Organizations and E-Commerce (MAMA'2000)    2000  [Refereed]

  • Rental application to rental service development of advanced ASP framework

    T Kawamura, T Hasegawa, A Ohsuga, S Honiden

    FOURTH INTERNATIONAL ENTERPRISE DISTRIBUTED OBJECT COMPUTING CONFERENCE - PROCEEDINGS     58 - 64  2000  [Refereed]

     View Summary

    We propose a new concept called Rental Service. Recently, Rental Application has been applied as ASP (Application Service Provider). For the next step in advancing ASP, we would prefer to provide Service which creates new functions, coordinating and facilitating already-existing functions, provided by many applications in the network. In this paper, we firstly made a list of problems for adding such Service into the current ASP systems. Then, we developed a framework as a solution to the problems, in which the Service itself is regarded as an agent. Moreover, we introduced a practical system developed by the framework and finally examined its effectiveness for the above problems through that practical case.

    DOI

  • Quantitative Evaluation of Pairwise Interactions between Agents (SAA ver.)

    T. Kawamura, S. Joseph, A. Ohsuga, S. Honiden

    Proceedings of Workshop on Software Agent and its Applications (SAA 2000)     257 - 268  2000  [Refereed]

  • Bee-gent: Bonding and Encapsulation Enhancement Agent Framework for Development of Distributed Systems

    T. Kawamura, T. Hasegawa, A. Ohsuga, S. Honiden

    Systems and Computers in Japan, John Wiley & Sons, Inc.   31 ( 13 ) 42 - 56  2000  [Refereed]

     View Summary

    (和文論文の英訳版)

    CiNii

  • 異なる知識体系間における知識交換規則の学習

    市瀬龍太郎, 武田英明, 本位田真一

    マルチ・エージェントと協調計算研究会(MACC-2000)   ( MACC-2 )  2000.01

  • ビヘイビアパターンに基づくモバイルエージェントシステム開発手法

    田原康之, 大須賀昭彦, 本位田真一

    情報処理学会論文誌   40 ( 12 ) 4319 - 4332  1999.12  [Refereed]

  • Bee-gent:移動型仲介エージェントによる既存システムの柔軟な活用を目的としたマルチエージェントフレームワーク

    川村隆浩, 田原康之, 長谷川哲夫, 大須賀昭彦, 本位田真一

    電子情報通信学会論文誌   J82-D-1 ( 9 ) 1165 - 1180  1999.09  [Refereed]

  • Agent System Development Method based on Agent Patterns

    Yasuyuki Tahara, Akihiko Ohsuga, Shinichi Honiden

    Proc. 4th International Symposium on Autonomous Decentralized Systems (ISADS'99)   ISADS1999   261 - 263  1999.03  [Refereed]

  • InfoMirror: Agent-based Information Assistance to Drivers

    Shinichi Honiden

    Proc. International Conference on Intelligent Transportation systems (ITSC99), IEEE/IEEJ/JSAI (1999)     734 - 739  1999  [Refereed]

  • Agent System Development Method based on Agent Patterns

    Shinichi Honiden

    The 21st International Conference on Software Engineering (ICSE 99)     356 - 367  1999  [Refereed]

  • Agent-based Drivers' Information Assistance System

    M Hattori, N Kase, A Ohsuga, S Honiden

    NEW GENERATION COMPUTING   17 ( 4 ) 359 - 367  1999  [Refereed]

     View Summary

    "Drivers' Information Assistance System (DIA system)" is an ITS (Intelligent Transport Systems) application framework that provides agent-based information assistance to drivers through car navigation systems or on-board PCs.
    DIA system enables flexible information retrieval over the Internet using intelligent mobile agent, and incorporates a high-speed event delivery facility that makes real-time information service possible. The goal of the system is to provide up to the minute information and services related to driver needs, such as parking lot vacancy information. Crucial to making this a practical operation is the agent-based ability to access the network while the vehicle is in motion.

  • Bee-gent: Bonding and Encapsulation Enhancement Agent Framework for Development of Distributed Systems(APSEC ver.)

    T. Kawamura, T. Hasegawa, A. Ohsuga, S. Honiden

    Proceedings of the 6th Asia-Pacific Software Engineering Conference (APSEC 99)     260 - 267  1999  [Refereed]

  • Flage: A programming language for adaptive software

    F Kumeno, A Ohsuga, S Honiden

    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS   E81D ( 12 ) 1394 - 1403  1998.12  [Refereed]

     View Summary

    We propose a programming language, Flage, for building software systems which dynamically adapt to changing local situations. In our language, we construct applications by agents; concurrent mobile objects with the metalevel architecture. Metalevel programming facilities realize a self-control of an agent's actions and an autonomous adaptation to changes. We also introduce another kind of program element called field. A field represents a local situation around agents. For example, one field represents a virtual place to get local information in a network environment and another represents a virtual place where agents do cooperative works. If an agent enters a field, it gets programs and shared information in the field. By moving field to field, an agent can change its program composition by itself and it adapts to changing local situations. In this paper, we describe the language specification of Flage, the implementation of the platform for Flage programming and show some program examples.

  • Application of algebraic specification to verify the design of safety logic in nuclear power plants

    A Fukumoto, T Hayashi, A Ohsuga, S Honiden, N Mori

    NUCLEAR TECHNOLOGY   124 ( 3 ) 255 - 264  1998.12  [Refereed]

     View Summary

    A formal verification method using an algebraic specification technique is proposed, and its effectiveness is studied. A computerized automatic verification system, which utilizes an algebraic specification to describe system requirements and to prove an inductive theorem based on a term-rewriting technique for verification, is built and evaluated through experimentally verifying the logic design of a digital reactor protection system in boiling water reactors. The results show that the proposed method can mathematically correctly verify the logic design in a limited time, thereby improving accuracy and reducing person-hours for the verification.

  • Plangent: An Intelligent Agent System for Network Computing

    Shinichi Honiden

    ICSE’98 International Workshop on Computing and Communications in the Presence of Mobility    1998  [Refereed]

  • 制約処理パターンを用いたオブジェクト指向ソフトウェア開発

    永井保夫, 大須賀昭彦, 本位田真一

    コンピュータソフトウェア   15 ( 1 ) 2 - 23  1998.01  [Refereed]

  • PLANGENT: An approach to making mobile agents intelligent

    Akihiko Ohsuga, Yasuo Nagai, Yutaka Irie, Masanori Hattori, Shinichi Honidin

    IEEE Internet Computing   1 ( 4 ) 50 - 57  1997.07  [Refereed]

     View Summary

    To be practical, mobile agents must be "intelligent." The Plangent system enables mobile agents to make a plan based on user input and adapt it according to information gathered from the network.

    DOI

  • Hypersequential programming: A new way to develop concurrent programs

    Naoshi Uchihira, Shinichi Honiden, Toshibumi Seki

    IEEE Concurrency   5 ( 3 ) 44 - 54  1997.07  [Refereed]

     View Summary

    Hypersequential programming can produce a highly reliable concurrent program, by precluding the injection of harmful nondeterminism. This method serializes, the program to remove all types of nondeterminism (intended, harmful, and persistent). The programmer debugs it as a serial program. Then it is parallelized by restoring only intended and persistent nondeterminism.

    DOI

  • Hypersequential programming - A new way to develop concurrent programs

    N Uchihira, S Honiden, T Seki

    IEEE CONCURRENCY   5 ( 3 ) 44 - &  1997.07  [Refereed]

     View Summary

    The authors present hypersequential programming, a new method that eases the difficulty of concurrent programming and makes the concurrent program highly reliable. The difficulty of concurrent programming is due mainly to its nondeterminism. The authors classify nondeterminism into three types: intended, harmful, and persistant. In traditional concurrent programming, a programmer first designs and implements programs so as to maximize concurrency, which may include all three types of nondeterminism. She then tries to detect harmful nondeterministic behavior by testing and debugging them. However, removing all harmful nondeterministic behavior is actually very difficult.
    Hypersequential programming, on the other hand, first serializes the concurrent program to remove all types of nondeterminism, and then the programmer tests and debugs it as a sequential program. Finally, it is parallelized by restoring only intended and persistent nondeterminism. Hypersequential programming can develop a highly reliable concurrent program, because the injection of harmful nondeterminism is precluded. In this article, the authors also present a simple embodiment of hypersequential programming using Petri nets.

  • EVA: A flexible programming method for evolving systems

    S Matsuura, H Kuruma, S Honiden

    IEEE TRANSACTIONS ON SOFTWARE ENGINEERING   23 ( 5 ) 296 - 313  1997.05  [Refereed]

     View Summary

    Our goal is to establish a flexible programming support for evolving systems that will enable us to modify programs using less labor, while maintaining good quality during service life. EVA (EVolution mechanism for flexible Agent) was developed to allow a flexible programming support system to be constructed based on our programming method for evolving systems. We consider that programming methods for evolving systems need to satisfy the following essential conditions. First, they need to make it easy to specify changes in a system in terms of new requirements. Second, they need to have a procedure for transmitting the new requirements to a program. Third, they need to be able to guarantee that the resultant program will meet the new requirements. Finally, because of the repetitive nature of much evolving systems work, they need to provide for the reuse of similar modifications during programming.
    In order to overcame limitations in program modification techniques which have only considered programming products, programming processes have been introduced into our method. To achieve our goal, we have formulated programming products and programming processes using such formal techniques as functional programming, type theory, modules, parameterized programming and natural deduction, and have constructed a mechanism of reusing these formal programming processes. This paper explains a case study which shows how to develop an evolving system using EVA and it discusses how we can use EVA's mechanism effectively.

    DOI

  • オブジェクト指向におけるリフレクションの代数的意味論

    田原康之, 粂野文洋, 大須賀昭彦, 本位田真一

    情報処理学会論文誌   38 ( 4 ) 826 - 834  1997.04  [Refereed]

  • A Framework for Adaptive Software by Agent and Thesaurus

    Shinichi Honiden

    The Ninth International Conference on Software Engineering & Knowledge Engineering, Madrid    1997  [Refereed]

  • Program Development with Reuse of Programming Processes The Ninth International Conference on Software Engineering & Knowledge Engineering

    Shinichi Honiden

    Madrid    1997  [Refereed]

  • データ中心アプローチとユースケースに基づくオブジェクト指向フレームワーク構築手法

    名取万里, 加賀谷聡, 本位田真一

    情報処理学会論文誌   38 ( 3 ) 634 - 656  1997  [Refereed]

    CiNii

  • Three Phase Net - oriented Software Design Method

    UCHIHIRA Naoshi, HONIDEN Shinichi

    Transactions of Information Processing Society of Japan   38 ( 1 ) 101 - 113  1997.01  [Refereed]

     View Summary

    Petri net is a formal, graphical, and executable language to describe concurrent Systems, which is used in many software design methods. However, most design methods use a Petri net as an extended state transition system and do not make the best use of diversity of meaning of Petri net, which can describe both a state transition model and a data flow model uniformly. This paper proposes the three phase net-oriented software design method which consists of three phases (structure analysis, structure design, and behavior design) and uses only a net model uniformly as a design chart throughout these phases, while other conventional design methods use 3 or 4 charts complementarily. In this method, a net is stepwise refined from an ambiguous specification to an executable design document. This paper explains the proposed method using a design process example for an elevator control system.

    CiNii

  • EVA:仕様変更プロセスを用いたプログラム開発支援システム

    松浦佐江子, 来間啓伸, 本位田真一

    情報処理学会論文誌   38 ( 1 ) 114 - 130  1997.01  [Refereed]

  • A high-level Petri net for accurate modeling of reactive and concurrent systems

    N Uchihira, S Honiden

    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   E79A ( 11 ) 1797 - 1808  1996.11  [Refereed]

     View Summary

    This paper concerns a Petri-net-based model for describing reactive and concurrent systems. Although many high-level Petri nets have been proposed, they are insufficiently practical to describe reactive and concurrent systems in the detail modeling, design and implementation phases. They are mainly intended to describe concurrent systems in the rough modeling phase and lack in several important features (e.g., concurrent tasks, task communication/synchronization, I/O interface, task scheduling) which the most actual implementations of reactive and concurrent systems have. Therefore it is impossible to simulate and analyze the systems accurately without explicitly modeling these features. On the other hand, programming languages based on Petri nets are deeply dependent on their execution environments and not sophisticated as modeling and specification languages. This paper proposes MENDEL net which is a high-level Petri net extended by incorporating concurrent tasks, task communication/synchronization, I/O interface, and task scheduling in a sophisticated manner. MENDEL nets are a wide-spectrum modeling language, that is, they are suitable for not only modeling but also designing and implementing reactive and concurrent systems.

  • 企業情報システムの要求分析のためのドメインモデル

    斉藤康彦, 本位田真一

    情報処理学会論文誌   37 ( 10 ) 1829 - 1838  1996.10  [Refereed]

  • Formal Semantics of Agent Evolution in the Language Flage Object-Based Parallel and Distributed Computation

    Shinichi Honiden

    Jean-Pierre Briot, Jean-Marc Geib and Akinori Yonezawa (Eds), LNCS 1107    1996.08  [Refereed]

  • 協調アーキテクチャに基づくソフトウェア・モジュールの仕様記述モデル

    来間啓伸, 大須賀昭彦, 本位田真一

    情報処理学会論文誌   37 ( 6 ) 1171 - 1186  1996.06  [Refereed]

  • Compositional adjustment of concurrent programs to satisfy temporal logic constraints in MENDELS ZONE

    N Uchihira, S Honiden

    JOURNAL OF SYSTEMS AND SOFTWARE   33 ( 3 ) 207 - 221  1996.06  [Refereed]

     View Summary

    In this paper, we examine ''program adjustment'', a formal and practical approach to developing correct concurrent programs, by automatically adjusting an imperfect program to satisfy given constraints. A concurrent program is modeled by a finite state process, and program adjustment to satisfy temporal logic constraints is formalized as the synthesis of an arbiter process which partially serializes target (i.e., imperfect) processes to remove harmful nondeterministic behaviors. Compositional adjustment is also proposed for large-scale compound target processes, using process equivalence theory. We have developed a computer-aided programming environment on the parallel computer Multi-PSI, called MENDELS ZONE, that adopts this compositional adjustment. Adjusted programs can be compiled into the kernel language (KL1) and executed on Multi-PSI.

    DOI

  • Metis-AS: A Term Rewriting Based System for Algebraic Specifications

    Akihiko Ohsuga, Shinichi Honiden

    Proc. 10th Japan-Germany Forum on Information Technology   ICMAS1996  1996.04  [Refereed]

  • Hyperseaquential Programming-a novel paradigm for concurrent programming

    Shinichi Honiden

    Software Engineering for Parallel and Distributed Systems 1996     62 - 73  1996.03  [Refereed]

  • MENDELS ZONE: A parallel program development system based on formal specifications

    S Honiden, A Ohsuga, N Uchihira

    INFORMATION AND SOFTWARE TECHNOLOGY   38 ( 3 ) 181 - 189  1996.03  [Refereed]

     View Summary

    MENDELS ZONE is a formal specification-based practical parallel program development system on an MIMD machine with 64 processors. It has been applied to the several practical applications: one such application is described in formal specifications totalling 3700 lines, and the corresponding parallel programs generated from these formal specifications totals 6200 lines. MENDELS ZONE has several key aspects. First, an algebraic specification is used for the functional part of parallel programs and a temporal logic specification is used for the synchronization part of the parallel programs. Second, Petri nets and data-flow diagrams are adopted for visualization. Third, MENDELS ZONE has the following unique features from a parallel programming viewpoint. (1) The confluence property of the complete term rewriting system ensures the quality of non-deterministic execution in parallel programs; (2) Serialization in parallel programming is specified using propositional temporal logic; (3) Parallel implementation of theorem provers contributes to practical use.

    DOI

  • ドメイン分析に基づく仕様再利用手法

    名取万里, 加賀谷聡, 本位田真一

    情報処理学会論文誌   37 ( 3 ) 393 - 408  1996.03  [Refereed]

  • Hypersequential Programming-A Novel Paradigm for Concurrent Programming 1st International Workshop on Software Engineering for Parallel and Distributed Systems

    Shinichi Honiden

    Berlin    1996  [Refereed]

  • Reuse of design processes based on domain analysis

    M Natori, A Kagaya, S Honiden

    FOURTH INTERNATIONAL CONFERENCE ON SOFTWARE REUSE, PROCEEDINGS     31 - 40  1996  [Refereed]

  • An algebraic semantics of reflective objects

    Yasuyuki Tahara, Fumihiro Kumeno, Akihiko Ohsuga, Shinichi Honiden

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)   1049   173 - 189  1996  [Refereed]

     View Summary

    Reflection or metalevel architecture has received attention in recent years, since this approach provides functional extension and dynamic adaptation of computer systems. In this paper, we propose a technique to introduce reflection into a kind of algebraic system called rewriting logic. Since rewriting logic can model concurrent object-oriented systems, our technique enables modeling of reflective object-oriented systems including metaobjects and metaobject protocols. A framework for developing denotational semantics is given based on a category-theoretic model. We present some problems for finishing our semantics which remain unsolved.

    DOI

  • Formal Semantics of Agent Evolution in the Language Flage

    Shinichi Honiden

    Proc. of 3rd ModelAge Workshop 'Formal Models of Agents'    1996.01  [Refereed]

  • Evolutional Agents: Field-Oriented Programming Language, Flage

    Shinichi Honiden

    Flage Proc. of Asia-Pacific Software Engineering Conference, APSEC'95     189 - 198  1995.12  [Refereed]

  • Knowledge Acquisition and Integration on Specification Change- A Method for Systematic Reuse

    Shinichi Honiden

    Proc. of Asia-Pacific Software Engineering Conference, APSEC'95     364 - 373  1995.12  [Refereed]

  • Automatic Verification of Consistency between State Transition Diagram and Logic Diagram for Process Control

    Shinichi Honiden

    Safety and Reliability in Emerging Control Technologies    1995.11  [Refereed]

  • AN ANALYSIS OF SIMULATION BETWEEN PETRI NETS THROUGH REWRITING LOGIC

    Y TAHARA, S HONIDEN

    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   E78A ( 11 ) 1498 - 1503  1995.11  [Refereed]

     View Summary

    Rewriting Logic has been proposed as a unified model of parallel and concurrent computation, especially concurrent object-oriented computation and agent oriented computation. In this paper, we present a category-theoretic technique in which simulation relation between concurrent processes described by rewriting Logic is analyzed. In this technique, simulation relation is represented by morphisms in the category of concurrent processes. Moreover, this technique is shown to be applicable to Petri nets by modeling them by rewriting logic. By this method, it is acknowledged that our technique is applicable to Petri nets including multi-loops whose treatment is limited in other techniques.

  • 仕様変更プロセスの効果的な再利用:まね方をまねる

    松浦佐江子, 本位田真一

    情報処理学会論文誌   36 ( 11 ) 2666 - 2680  1995.11  [Refereed]

  • Integration of Framework Components by Reusing Design Processes

    Shinichi Honiden

    The 10th Annual ACM Conference on Object-Oriented Programming, Systems, Languages and Applications(OOPSLA'95), Workshop #27,Framework-Centered Software Development    1995.10  [Refereed]

  • The Agent Oriented Language Plangent

    Shinichi Honiden

    The 10th Annual ACM Conference on Object-Oriented Programming, Systems, Languages and Applications(OOPSLA'95), Workshop #1,Objects, Scripts, and the Web    1995.10  [Refereed]

  • COOAD - A CASE TOOL FOR OBJECT-ORIENTED ANALYSIS AND DESIGN

    J YAMAMOTO, A OHSUGA, S HONIDEN

    INTERNATIONAL JOURNAL OF SOFTWARE ENGINEERING AND KNOWLEDGE ENGINEERING   5 ( 3 ) 367 - 389  1995.09  [Refereed]

     View Summary

    Although many CASE tools for object-oriented methods (OO CASE tools) have been proposed, few, if any, can verify that the constructed analysis and design models actually match the requirements of the system being developed. In order to realize this kind of verification, we propose a software development method amalgamating OO CASE tools and algebraic specification techniques. We are developing an experimental system named COOAD (CASE tool for Object-Oriented Analysis and Design) in order to examine the effectiveness of our proposition. COOAD supports object-oriented analysis and design, verification of the analysis and design, and generation of code. In this paper, we propose the software development method, introduce COOAD, and illustrate the facilities of COOAD with an example.

    DOI

  • ADAPTING OBJECT-COMMUNICATION METHODS DYNAMICALLY

    Y KISHIMOTO, N KOTAKA, S HONIDEN

    IEEE SOFTWARE   12 ( 3 ) 65 - 74  1995.05  [Refereed]

     View Summary

    When objects migrate or are reused, they must find suitable existing objects and establish communication with them. The authors describe the first stage of Omega, a model that will let developers dynamically adjust object-communication methods so that new and existing objects can exchange messages.

    DOI

  • 代数仕様技術によるオブジェクト指向分析設計の検証支援

    山本純一, 大須賀昭彦, 本位田真一

    情報処理学会論文誌   36 ( 5 ) 1070 - 1080  1995.05  [Refereed]

  • 代数的仕様を用いたソフトウェア開発環境:Metis-AS

    本位田真一

    情報処理学会論文誌   36 ( 5 ) 1192 - 1202  1995.05  [Refereed]

  • 仕様変更のプログラムへの写像:仕様変更プロセスを利用したプログラム合成

    松浦佐江子, 本位田真一

    情報処理学会論文誌   36 ( 5 ) 1211 - 1227  1995.05  [Refereed]

  • RELIABILITY AND SAFETY OF REAL-TIME SYSTEMS

    W EVERETT, S HONIDEN

    IEEE SOFTWARE   12 ( 3 ) 13 - 16  1995.05  [Refereed]

  • 代数的仕様を用いたソフトウェア開発支援環境Metis-AS

    大須賀昭彦, 坂井公, 本位田真一

    情報処理学会論文誌   36 ( 5 ) 1192 - 1202  1995.05  [Refereed]

  • 遺伝的アルゴリズムによる素子の整列配置

    半田恵一, 本位田真一

    電気学会論文誌C,電子・情報・システム部門誌   115-C ( 4 ) 580 - 588  1995.04  [Refereed]

    DOI

  • Compositional Adjustment of Concurrent Programs to Satisfy Temporal Logic Constraints in MENDELS ZONE

    Shinichi Honiden

    Proc. of HICSS-28     359 - 368  1995.01  [Refereed]

  • Object-Oriented Analysis and Design Support System Using Algebraic Specification Techniques

    Shinichi Honiden

    Proc. of First Asia-Pacific Software Engineering Conference   388 ( 397 )  1994.12  [Refereed]

  • Refutationally Complete Inference Rules for Inductive Theorem Proving based on Term Rewriting Techniques

    Akihiko Ohsuga, Ko Sakai, Shinichi Honiden

    Proc. Int. Sympo. on Fifth Generation Computer Systems 1994 (FGCS'94), Workshop on Automated Theorem Proving   FGCS1994 Workshop  1994.12  [Refereed]

  • オブジェクト指向モデルを用いた要求獲得の支援

    斉藤康彦, 本位田真一

    情報処理学会論文誌   35 ( 11 ) 2469 - 2479  1994.11  [Refereed]

  • AN APPLICATION OF ARTIFICIAL-INTELLIGENCE TO OBJECT-ORIENTED PERFORMANCE DESIGN FOR REAL-TIME SYSTEMS

    S HONIDEN, K NISHIMURA, N UCHIHIRA, K ITOH

    IEEE TRANSACTIONS ON SOFTWARE ENGINEERING   20 ( 11 ) 849 - 867  1994.11  [Refereed]

     View Summary

    This paper describes an application of artificial intelligence technology to the implementation of a rapid prototyping method in Object-Oriented Performance Design (OOPD) for real-time systems. OOPD consists of two prototyping phases for real-time systems. And each of these phases consists of three steps: prototype construction, prototype execution, and prototype evaluation. We present the following artificial intelligence based methods and tools to be applied to the individual steps. In the prototype construction step, a rapid construction mechanism using reusable software components is implemented based on planning. In the prototype execution step, a hybrid inference mechanism is used to execute the constructed prototype described in declarative knowledge representation. MENDEL, which is a Prolog based concurrent object-oriented language, can be used as a prototype construction tool and a prototype execution tool. In the prototype evaluation step, an expert system which is based on qualitative reasoning is implemented to detect and diagnose bottlenecks and generate an improvement plan for them.

    DOI

  • Flage: Field-oriented Language for AGEnt model

    Fumihiro Kumeno, Yasuyuki Tahara, Akihiko Ohsuga, Shinichi Honiden

    Proc. 3rd Int. Conf. on Software Reuse (ICSR'94)   ICSR1994  1994.11  [Refereed]

  • COMPOSITION-BASED MAPPING OF DESIGN PLANS INTO IMPLEMENTATION-LEVEL ARCHITECTURES

    Y NAGAI, S HONIDEN

    TENTH CONFERENCE ON ARTIFICIAL INTELLIGENCE FOR APPLICATIONS, PROCEEDINGS     484 - 485  1994  [Refereed]

  • Software Process Modeling using Functional Language Miranda

    Shinichi Honiden

    Proc. of JCSE'93    1993.11  [Refereed]

  • Metis-AS における代数的仕様の検証手続き

    本位田真一

    情報処理学会論文誌   34 ( 11 ) 2242 - 2250  1993.11  [Refereed]

  • Flage: An Agent-oriented Specification Language

    Akihiko Ohsuga, Yasuyuki Tahara, Fumihiro Kumeno, Shinichi Honiden

    Proc. Int. Workshop on New Models for Software Architecture (IMSA'93)   IMSA1993  1993.11  [Refereed]

  • Metis-ASにおける代数的仕様の検証手続き

    大須賀昭彦, 坂井公, 本位田真一

    情報処理学会論文誌   34 ( 11 ) 2242 - 2250  1993.11  [Refereed]

  • An Experimental Analysis for Classifying Specification Processes

    Shinichi Honiden

    IEEE, Proc. of SEKE'93     231 - 234  1993.06  [Refereed]

  • 複合ビューポイントに基づく仕様化プロセスの分析

    西村一彦, 本位田真一

    情報処理学会論文誌   34 ( 5 ) 1074 - 1086  1993.05  [Refereed]

  • 等式論理の帰納的定理を証明する手続き

    大須賀昭彦, 坂井公, 本位田真一

    電子情報通信学会論文誌   J76-D-I ( 3 ) 130 - 138  1993.03  [Refereed]

  • ソフトウェア・プロセスにおける協調とその抽象化について

    松浦佐江子, 本位田真一

    コンピュータソフトウェア   10 ( 2 ) 144 - 160  1993.03  [Refereed]

  • FORMALIZING SPECIFICATION MODELING IN OOA

    S HONIDEN, N KOTAKA, Y KISHIMOTO

    IEEE SOFTWARE   10 ( 1 ) 54 - 66  1993.01  [Refereed]

    DOI

  • △-extension of Algebraic Specification

    Shinichi Honiden

    Journal of Information Processing   15 ( 2 ) 177 - 186  1993.01  [Refereed]

  • NET-ORIENTED ANALYSIS AND DESIGN

    S HONIDEN, N UCHIHIRA

    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   E75A ( 10 ) 1317 - 1325  1992.10  [Refereed]

     View Summary

    Net-Oriented Analysis and Design (NOAD) is defined as three items: (1) Various nets are utilized as an effective modeling method. (2) Inter-relationships among various nets are determined. (3) Verification or analysis methods for nets are provided and they are implemented based on the mathematical theory, that is Net theory. Very few methods have been presented to satisfy these three items. For example, the Real-Time SA method covers item (1) only. The Object-Oriented Analysis and Design method (OOA/OOD) covers items (1) and (2). NOAD can be regarded as an extension to OOA/OOD. This paper discusses how effectively various nets have been used in actual software development support methods and tools and evaluates such several methods and tools from the NOAD viewpoint.

  • A PETRI-NET-BASED PROGRAMMING ENVIRONMENT AND ITS DESIGN METHODOLOGY FOR COOPERATING DISCRETE EVENT SYSTEMS

    N UCHIHIRA, M ARAMI, S HONIDEN

    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   E75A ( 10 ) 1335 - 1347  1992.10  [Refereed]

     View Summary

    This paper describes MENDELS ZONE, a Petri-net-based concurrent programming environment, which is especially suitable for cooperating discrete event systems. MENDELS ZONE adopts MENDEL net, which is a type of high level (hierarchical colored) Petri net. One of the characteristics of the MENDEL nets is a process-oriented hierarchy like CCS, which is different from the subnet-oriented hierarchy in the Jensen's hierarchical colored Petri net. In a process-oriented hierarchy, a hierarchical unit is a process, which is more natural for cooperating and decentralized discrete event control systems. This paper also proposes a design methodology for MENDEL nets. Although many Petri net tools have been proposed, most tools support only drawing, simulation, and analysis of Petri nets ; few tools support the design methodology for Petri nets. While Petri nets are good final design documents easy to understand, analyzable, and executable, it is often difficult to write Petri nets directly in an earlier design phase when the system structure is obscure. A proposed design methodology makes a designer to construct MENDEL nets systematically using causality matrices and temporal logic. Furthermore, constructed MENDEL nets can be automatically compiled into a concurrent programming language and executed on a parallel computer.

  • TRANSOBJ - SOFTWARE PROTOTYPING ENVIRONMENT FOR REAL-TIME TRANSACTION-BASED SOFTWARE SYSTEM APPLICATIONS

    K ITOH, Y TAMURA, S HONIDEN

    INTERNATIONAL JOURNAL OF SOFTWARE ENGINEERING AND KNOWLEDGE ENGINEERING   2 ( 1 ) 5 - 29  1992.03  [Refereed]

     View Summary

    A software prototyping environment called TransObj (TRANSaction and OBJect) is used for designing real-time Transaction-based Concurrent Software Systems (TCSS). In a TCSS design process, a software designer should perform both functional design and performance design. The designer should change his design view from a transaction-based paradigm to an object-based paradigm during the TCSS design process. Recognition of re-entrant functional objects and serially reusable functional objects in the TCSS should be required. TransObj includes the Stepwise Prototyping Method (SPM), and two SPM-based tools: Prolog-based TransObj (P-TransObj) and GPSS-based TransObj (G-TransObj). SPM enables the designer to advance both functional design and performance design for the TCSS prototype as controling the change of design view paradigms. P-TransObj mainly checks the prototype in a microscopic view on a personal computer. G-TransObj mainly checks the same prototype with a longer time span on a large-scale computer.

  • 代数的仕様と時制論理によるリアルタイムSAとオブジェクト指向設計の融合手法

    本位田真一, 大須賀昭彦, 内平直志

    情報処理学会論文誌   33 ( 2 ) 173 - 182  1992.02  [Refereed]

  • A Nonmontonic Temporal Logic and its Kripke Semantics

    Shinichi Honiden

    Journal of Information Processing   14 ( 1 ) 16 - 22  1992.02  [Refereed]

  • 同期型待ち行列ネットワークのボトルネックに対する定性的なパラメータチューニング法

    志田圭介, 伊藤潔, 本位田真一

    人工知能学会誌   6 ( 6 ) 891 - 903  1991.11  [Refereed]

  • An Integration Environment to Put Formal Specification to Practical Use in Real-time System

    Shinichi Honiden

    IEEE Proc. of 6th IWSSD    1991.10  [Refereed]

  • An Application of Structural Modeling and Automated Reasoning to Real-Time Systems Design

    Shinichi Honiden

    Journal of Real-Time Systems, Kluwer Academic Publishers   1 ( 3 ) 313 - 331  1991.04  [Refereed]

  • SPECIFICATION PROCESS MODELING IN OOA

    N KOTAKA, Y KISHIMOTO, S HONIDEN

    TECHNOLOGY OF OBJECT-ORIENTED LANGUAGES AND SYSTEMS - TOOLS 6   6   67 - 81  1991  [Refereed]

  • AN APPLICATION OF ARTIFICIAL-INTELLIGENCE TO PROTOTYPING PROCESS IN PERFORMANCE DESIGN FOR REAL-TIME SYSTEMS

    S HONIDEN, N UCHIHIRA, K ITOH

    ESEC 91 : 3RD EUROPEAN SOFTWARE ENGINEERING CONFERENCE   550   189 - 209  1991  [Refereed]

  • QUALITATIVE REASONING-BASED PARAMETER TUNING ON BOTTLENECK OF SYNCHRONIZED QUEUING NETWORK

    K ITOH, S HONIDEN, K SHIDA, T KONNO

    COMPSAC 91 - THE FIFTEENTH ANNUAL INTERNATIONAL COMPUTER SOFTWARE & APPLICATIONS CONFERENCE, PROCEEDINGS     307 - 314  1991  [Refereed]

  • ON LOGICAL-FOUNDATIONS OF THE ATMS

    Y FUJIWARA, S HONIDEN

    LECTURE NOTES IN ARTIFICIAL INTELLIGENCE   515   125 - 135  1991  [Refereed]

  • ON LOGICAL-FOUNDATIONS OF THE ATMS

    Y FUJIWARA, S HONIDEN

    TRUTH MAINTENANCE SYSTEMS   515   125 - 135  1991  [Refereed]

  • Application of Qualitative Reasoning to Parameter Tuning Process

    ITOH KIYOSHI, HONIDEN SHINICHI

    IPSJ Magazine   32 ( 2 ) 126 - 136  1991

    CiNii

  • Verification and Synthesis of Concurrent Programs Using Petri Nets and Temporal Logic

    Shinichi Honiden

    IEICE Transactions on Fundamentals of Electronics, Communications, and Computer Sciences   E-23 ( 12 ) 2001 - 2010  1990.12  [Refereed]

  • Role of Qualitative and Quantitative Reasoning in Diagnosis and Improvement for Queueing Network Bottleneck

    Shinichi Honiden

    Info Japan'90    1990.10  [Refereed]

  • A Complemental Role of Algebraic Specification and Graphical Specification

    FURUKAWA TADASHI, HONIDEN SHINICHI, OHSUGA AKIHIKO, TSUDA JUNICHIRO

    IPSJ Journal   31 ( 2 ) 182 - 193  1990.02  [Refereed]

    CiNii

  • An Application of Artificial Intelligence to Real-Time Systems

    Shinichi Honiden

    Info Japan'90    1990.01  [Refereed]

  • Synthesis of Concurrent Programs: Automated Reasoning Complements Software Reuse

    Shinichi Honiden

    IEEE Proc. of HICSS-23    1990.01  [Refereed]

  • 定性推論と定量推論を導入した待ち行列ネットワークのボトルネック診断と改善法

    伊藤潔, 本位田真一, 沢村淳, 志田圭介

    人工知能学会誌   5 ( 1 ) 92 - 105  1990.01  [Refereed]

  • Application of structural modeling and automated reasoning to concurrent program design

    S. Honiden, N. Uchihira, K. Matsumoto, K. Matsumura, M. Arai

    Proceedings of the Hawaii International Conference on System Science   2   134 - 141  1989.12

     View Summary

    An application of structual modeling and automated reasoning as an intelligent software development environment for concurrent programs is presented. This application, using an integration of software reuse and theorem-proving methods, synthesizes an absolutely correct program and increases software productivity. The concurrent programs are described by a Prolog-based concurrent object-oriented language called MENDEL/87. The functional part of the reusable component is generated by structural modeling, and the synchronization part is synthesized from temporal-logic specifications by the use of an automated-reasoning mechanism. A description is also given of the MENDELS ZONE, implemented on a Prolog machine, which is the working base of the method.

  • Knowledge-based parameter tuning for queuing network type system

    Shinichi Honiden

    Proc. of CAPE'89    1989.10  [Refereed]

  • シミュレーション手法に基づいた並行処理ソフトウェアのプロトタイピング手法

    伊藤潔, 本位田真一, 田村恭久, 志田圭介

    シミュレーション   8 ( 3 ) 181 - 190  1989.09  [Refereed]

  • 知識工学手法による待ち行列ネットワークのボトルネック診断

    沢村淳, 志田圭介, 本位田真一, 伊藤潔

    全国大会講演論文集     1172 - 1173  1989.09  [Refereed]

  • 知識工学的手法による待ち行列ネットワークのボトルネック診断

    沢村淳, 志田圭介, 本位田真一, 伊藤潔

    情報処理学会論文誌   30 ( 8 ) 990 - 1002  1989.08

     View Summary

    対象システムに悪影響を及ぼすものとその要因を解明し改善する作業は,一般的に手間がかかる.また,対象システムの規模が大きく複雑であれば,改善プランも数多く存在する.さらに,ある箇所を修正すると周辺への影響も大きい・このような作業は,通常,専門的な知識と経験を用いて行われている.これらの作業に対してエキスパートシステムを導入すると,評価や改善の効率を高めると期待できる.待ち行列ネットワークの形態にモデル化できるシステムを対象システムとする.また,この対象システムには過大な負荷がかかっている,すなわち,そのモデルである待ち行列ネットワークは,非定常(過負荷)状態にある,あるいはその可能性をもつシステムとする.このような待ち行列ネットワークに悪影響を及ぼすものとして,稼動率や待ち行列長が過大な窓口(ボトルネック窓口)に着目する.このような窓口の同定その要因の解明,および改善プランの提示を行う"ボトルネック診断エキスパートシステム(Bottleneck Diagnosis Expert System:BDES)"について考察する。そこで用いられるヒューリスティクな知識は,対象システム内の窓口の接続の形状やパラメータの大小関係により詳細に分類したものであるこれらは,Prolog言語の事実や規則を用いてインプリメントされた.

    CiNii

  • Relating the TMS to autoepismic Logic

    Shinichi Honiden

    Proc. of IJCAI-89     1199 - 1205  1989.08  [Refereed]

  • 3. プログラム設計環境のツール 3.3 プロトタイピング支援ツール (&lt大特集&gt新しいプログラミング環境)

    伊藤潔, 本位田真一

    情報処理   30 ( 4 ) 387 - 395  1989.04

    CiNii

  • An Application of Structural Modeling and Automated Reasoning to Concurrent Program Design

    Shinichi Honiden

    IEEE Proc. of HICSS-22     313 - 331  1989.01  [Refereed]

  • MENDELS - CONCURRENT PROGRAM SYNTHESIS SYSTEM USING TEMPORAL LOGIC

    N UCHIHIRA, K MATSUMOTO, S HONIDEN, H NAKAMURA

    LECTURE NOTES IN COMPUTER SCIENCE   315   50 - 68  1988  [Refereed]

  • 自動プログラミング

    本位田 真一, 中村 英夫

    電氣學會雜誌   108 ( 5 ) 413 - 416  1988

    DOI CiNii

  • CONCURRENT PROGRAM SYNTHESIS WITH REUSABLE COMPONENTS USING TEMPORAL LOGIC.

    Naoshi Uchihira, Toshiaki Kasuya, Kazunori Matsumotot, Shinichi Honiden

    Proceedings - IEEE Computer Society's International Computer Software & Applications Conference     455 - 464  1987.12

     View Summary

    A concurrent programming model is provided which is oriented to data stream, software reuse, and prototyping. Based on this model, a program synthesis method is described that consists of two parts: (1) retrieving and interconnecting components from I/O data specifications and (2) synthesizing a synchronization supervisor from a propositional temporal logic specification. MENDEL/87, which is a Prolog-based concurrent object-oriented language, is used as the programming language in this model. This synthesis method has been implemented using Prolog on a Prolog machine.

  • 並行処理ソフトウェアシステムの設計向きプロトタイピング手法とそのツール

    田村恭久, 伊藤潔, 本位田真一

    情報処理学会論文誌   28 ( 9 ) 923 - 932  1987.09  [Refereed]

  • マルチプロセッサスケジューリングアルゴリズムを用いた論理型オブジェクト指向言語MENDELの並列処理手法

    甲斐宗徳, 笠原博徳, 成田誠之助, 本位田真一, 田村信介

    電気学会論文誌C   107 ( 2 ) 149 - 156  1987.02  [Refereed]

    DOI

  • Software Prototyping with Reusable Components

    Journal of Information Processing   9 ( 3 ) 123 - 129  1986.09  [Refereed]

  • MENDEL:Prolog based Concurrent Object Oriented Language

    Shinichi Honiden

    IEEE Proc. of COMPCON'86     230 - 234  1986.03  [Refereed]

  • 推論型システム記述言語MENDEL

    本位田真一

    情報処理学会論文誌   27 ( 2 ) 219 - 227  1986.02  [Refereed]

  • SOFTWARE PROTOTYPING WITH MENDEL

    S HONIDEN, N UCHIHIRA, T KASUYA

    LECTURE NOTES IN COMPUTER SCIENCE   221   108 - 116  1986

     View Summary

    © 1986, Springer-Verlag. Software prototyping with MENDEL, which is Prolog based concurrent object oriented language, is described. MENDEL can deal with following characteristics such as: 1) meta inference, 2) object concurrency, 3) linkage to C language, 4) propositional temporal logic, 5) Prolog predicates for performance prediction simulator. The object generation in MENDEL, that is a program tranformation of concurrency and temporal dependence requirement specifications, is also described.

    DOI

  • リアルタイムシステムにおけるプロトタイピングの一手法

    本位田真一

    情報処理学会論文誌   26 ( 5 ) 946 - 953  1985.09  [Refereed]

  • Knowledge Engineering Application in Image Processing

    Shinichi Honiden

    Graphics Interface'85    1985.05  [Refereed]

  • Performance Evaluation by Qpit*i

    Shinichi Honiden, Isao Sugiyai

    Journal of Information Processing   7 ( 4 ) 262 - 268  1985.02  [Refereed]

     View Summary

    The system performance evaluation has three phases; evaluation -diagnosis- improvement, which form a feed-back cycle. Among the three phases, past studies have been focusing mainly on the evaluation phase and many computerized methods were already proposed. On the other hand, the other two phases have been performed based on a try-and-error method. There have been no standard methods for these two phases. A new method for these phases is introduced here. It provides supports to even non-experts to obtain nearly optimum performance. In this method, diagnosis is done by a simple rule-base system and improvement plans are generated in a heuristic way. An experimental tool called Qpit*i was developed based on this method and is presented in this paper. Qpit*i uses simulation data and produces several improvement plans against spotted bottle-necks in an interactive mode with users. As an example of Qpit*i application, it was applied to the simple task allocation problem and expected results were obtained.

    CiNii

  • An Application of Prolog to a Grammar Construction and Validation Process in Syntactic Pattern Recognition including Noisy Chromosome Analysis

    Shinichi Honiden

    IEEE Proc. of ISNCR-84    1984.10  [Refereed]

  • Prolog Application in Software Components Reuse, North-Holland

    Shinichi Honiden

    The Role of Language in Problem Solving    1984.10  [Refereed]

  • Interoperability for Mobile Agents by Incarnation Agents

    Shinichi Honiden

    Second International Conference on Autonomous agents and Multiagent Systems (AAMAS-03)    [Refereed]

  • An Examination of the Relationships between Internet Directories

    Shinichi Honiden

    Proceedings of the EKAW-02 Workshop on Knowledge Management through Corporate Semantic Webs, (to appear)    [Refereed]

  • セキュリティを考慮したモバイルエージェントシステム構築法

    吉岡信和, 大須賀昭彦, 田原康之, 本位田真一

    情報処理学会論文誌掲載予定    [Refereed]

  • Integrating Multiple Internet Directories by Instance-based Learning Subtitle Eighteenth

    Ryutaro Ichise, Hiedeaki Takeda, Shinichi Honiden

    IJCAI-03  

▼display all

Books and Other Publications

  • XAC Project: Towards a Middleware for Open Wireless Sensor Networks", chapter in book "Designing Solutions-Based Ubiquitous and Pervasive Computing: New Issues and Trends

    Kenji Tei, Shunichiro Suenaga, Yoshiyuki Nakamura, Yuichi Sei, Hikotoshi Nakazato, Yoichi Kaneki, Nobukazu Yoshioka, Yoshiaki Fukazawa, Shinichi Honiden

    Edited by Francisco Milton Mendes Neto and Pedro Fernandes Ribeiro Neto. published by Information Science Publishi  2010

  • Data management solutions in sensing systems

    Levent G?rgen, Claudia Roncancio, Cyril Labb?, Shinichi Honiden

    In the book volume "Wireless Sensor Network Technologies for Information Explosion Era" in Springer book series "Studies in Computational Intelligence".  2010

  • Multi-Agent Participatory Simulations Between Experimental Economics and Role-Playing Games

    Paul Guyot, Alexis Drogoul, 本位田真一

    in Deguchi, H. (Ed) Agent-Based Approaches in Economic and Social Complex Systems, Springer Series on Agent Based Social Systems  2007.01

  • 考えるコンテンツ 「スマーティブ」

    本位田真一, 吉岡信和, 由利伸子

    丸善  2006.03 ISBN: 4621053744

  • UMLによるビジネスモデリング

    鞍田友美, 本位田真一

    ソフトバンク  2002.05

  • 増補改訂 オブジェクト指向からエージェント指向へ

    本位田真一, 大須賀昭彦

    ソフトバンク  2001.12

  • エージェント技術

    本位田真一, 飯島正, 大須賀昭彦

    共立出版  1999.07

  • 動きはじめたモバイルエージェント

    本位田真一( Part: Other)

    情報処理, Vol.39, No.8  1998.08

  • オブジェクト指向からエージェント指向へ

    本位田真一, 大須賀昭彦

    ソフトバンク  1998.05

  • ビジネスオブジェクト

    本位田真一

    トッパン  1996.06

  • 協調プログラミング例題集

    中島秀之, 松原仁, 本位田真一( Part: Other)

    bit 「別冊」  1996.04

  • コンパクト版,図解 コンピュータ百科事典

    未入力

    オーム社  1996.01

  • ソフトウェア工学の基礎

    本位田真一( Part: Other)

    コンピュータソフトウェア,Vol. 13, No.1  1996.01

  • オブジェクト指向技術 - コンパクト版,図解 コンピュータ百科事典

    本位田真一( Part: Contributor)

    オーム社  1996

  • ソフトウェア工学の基礎 I

    Shinichi Honiden( Part: Other)

    近代科学社 レクチャーノート/ソフトウェア学 14  1996.01

  • 新版 情報処理ハンドブック

    情報処理学会編

    オーム社  1995.11

  • デザインパターン

    本位田真一, 吉田和樹

    ソフトバンク  1995.10

  • オブジェクト指向分析・設計

    本位田真一, 青山幹雄, 深澤良彰, 中谷多哉子

    共立出版  1995.06

  • Reliable Systems

    本位田真一( Part: Other)

    IEEE Software, Vol. 12, No.3  1995.05

  • オブジェクト指向システム分析

    本位田真一, 山口亨

    啓学出版,1990年 2月 (新装版:近代科学社,1995年4月)  1995.04

  • 続オブジェクト指向システム分析

    本位田真一, 伊藤潔

    啓学出版,1992年10月(新装版:近代科学社,1995年4月)  1995.04

  • オブジェクト指向モデリング

    本位田真一

    日経BP出版センター  1995.03

  • 図解 コンピュータ百科事典

    未入力

    オーム社  1995.01

  • オブジェクト指向技術 - 図解 コンピュータ百科事典

    Shinichi Honiden( Part: Contributor)

    1995

  • オブジェクト指向分析・設計の実際と評価

    青山幹雄, 本位田真一( Part: Other)

    情報処理, Vol. 35, No. 5  1994.05

  • プロジェクト管理の成功への秘訣

    古宮誠一, 本位田真一

    共立出版  1993.11

  • オブジェクト指向分析・設計 オブジェクト指向コンピューティング

    本位田真一( Part: Contributor)

    岩波書店  1993.11

  • オブジェクト指向、オブジェクト指向コンピューティング

    Shinichi Honiden( Part: Contributor)

    1993.11

  • Nets-Oriented Software Specification and Design

    本位田真一( Part: Other)

    IEICE Transactions, Vol. E76-A, No. 10  1993.10

  • オブジェクト指向システム開発 (韓国語への翻訳版,東逸出版社,1996年10月)

    本位田真一, 山城明宏

    日経BP社  1993.06

  • ネット指向パラダイムを目指して

    本位田真一( Part: Other)

    情報処理, Vol. 34, No. 6  1993.06

  • 産業界におけるソフトウェア・エンジニアリングの動向

    本位田真一( Part: Other)

    日本品質管理学会、品質, Vol. 23, No.2  1993.04

  • ペトリネットと時相論理、ペトリネットとその応用

    内平直志, 本位田真一( Part: Contributor)

    1992

  • 定性推論のパラメータチューニングへの応用

    伊藤潔, 本位田真一( Part: Other)

    情報処理, Vol. 32, No. 2  1991.04

  • シュレィア/メラー法によるオブジェクト指向分析 CASEのすべて

    本位田真一

    オーム社  1991.01

  • シュレィア/メラー法によるオブジェクト指向分析

    Shinichi Honiden( Part: Contributor)

    CASEのすべて、オーム社  1991

  • ソフトウェア事典

    未入力

    丸善  1990.01

  • 要求仕様技術

    Shinichi Honiden( Part: Contributor)

    ソフトウェア事典、丸善  1990

  • エキスパートシステム基礎技術 (KE養成講座(2))

    本位田真一, 市川照久

    オーム社  1989.12

  • KE養成講座(2)エキスパートシステム基礎技術

    本位田真一, 市川照久

    オーム社  1989.12

  • 時相論理とその応用

    松本一教, 内平直志, 本位田真一( Part: Other)

    情報処理, Vol. 30, No. 6  1989.06

  • プロトタイピング支援ツール

    伊藤潔, 本位田真一( Part: Other)

    情報処理, Vol. 30, No.4  1989.04

  • 自動プログラミング・ハンドブック

    未入力

    オーム社  1989.01

  • 制御分野における自動プログラミング

    Shinichi Honiden( Part: Contributor)

    自動プログラミング・ハンドブック、オーム社  1989

  • 自動プログラミング

    本位田真一( Part: Other)

    電気学会雑誌, Vol. 108, No. 5  1988.05

  • ソフトウェア開発のためのプロトタイピング・ツール

    伊藤潔, 本位田真一, 内平直志( Part: Other)

    啓学出版  1987.09

  • 時制論理とペトリネット

    本位田真一( Part: Other)

    オペレーションズ・リサーチ, Vol. 32, No. 9  1987.09

  • 診断型エキスパート・システム

    新井政彦, 本位田真一( Part: Other)

    情報処理, Vol. 28, No. 5  1987.02

  • マイクロコンピュータハンドブック

    未入力

    オーム社  1985.01

  • オペレーティングシステム

    Shinichi Honiden( Part: Contributor)

    マイクロコンピュータハンドブック、オーム社  1985

  • プロセス制御システムへのデータベース技術の応用

    松本吉弘, 本位田真一( Part: Other)

    情報処理, Vol. 23, No. 10  1982.10

▼display all

Misc

  • Evaluating Statement Deletion Mutation-based Fault Localization in Industrial Software

      61 ( 10 ) 1617 - 1628  2020.10

     View Summary

    Fault localization is a technique to reduce the work cost of debugging by ranking the candidates of the cause of the defect based on the test result and the test execution information. Among several fault localization techniques, mutation based fault localization (MBFL) can localize defects with high accuracy, while mutation analysis has a problem of high execution cost. In the context of mutation analysis, the statement deletion mutation operator has less deviation of the mutation position and the same effect as the use of all mutation operators. In this paper, we propose statement deletion mutation based fault localization, SDL-MBFL, and evaluate it on industrial software used in actual products and nine defects actually occurred. As a result of the evaluation, the SDL-MBFL can find more defects than the existing methods in high ranking.

    CiNii

  • Qualitative Analysis for Multiple Adaptation Loops

    Kenji Tei, Ryuichi Takahashi, Nicolas D’Ippolito Hiroyuki Nakagawa, Shinichi Honiden

    GRACE Technical Report     1 - 29  2015.06

    Internal/External technical report, pre-print, etc.  

  • MVC Webアプリケーションの機能縮退を考慮した振舞い検証

    澤野 宏貴, 前澤 悠太, 高橋 竜一, 本位田 真一

    ソフトウェアエンジニアリングシンポジウム2014論文集   2014   60 - 65  2014.08

    CiNii

  • ページキャッシュの復元とその他のメモリ転送の並列動作による遠隔地ライブマイグレーション高速化

    穐山 空道, 広渕 崇宏, 高野 了成, 本位田 真一

    研究報告システムソフトウェアとオペレーティング・システム(OS)   2013 ( 7 ) 1 - 8  2013.02

     View Summary

    遠隔地ライブマイグレーションによって,これまでデータセンタ内で行われてきたVMの配置最適化をデータセンタ間で行うことができる.一方でデータセンタ間の帯域はLANに比較して狭いため効率的な遠隔地ライブマイグレーション技術が求められる.我々はVMのメモリの多くをページキャッシュが占める場合に着目する.本論文ではマイグレーション時にページキャッシュを転送せずディスクイメージから復元し,さらにページキャッシュの復元をその他のメモリ内容のネットワーク越しの転送と並列動作させて遠隔地ライブマイグレーションを高速化する.評価の結果,ページキャッシュの更新が少ないワークロードでは並列化が有効に働き遠隔地ライブマイグレーションが高速化できた.また本論文では提案手法のLAN内でのマイグレーションへの適用可能性についても論じる.

    CiNii

  • A Preliminary Study on Boosting Wide Area Live Migration with Page Cache Regeneration

    穐山 空道, 広渕 崇宏, 高野 了成, 本位田 真一

    研究報告組込みシステム(EMB)   2012 ( 9 ) 1 - 8  2012.11

     View Summary

    遠隔地ライブマイグレーションによって,データセンタ間負荷分散や災害時の情報システム維持などが可能になる.しかし遠隔地ライブマイグレーションではネットワーク帯域が狭いことが課題である.ディスクイメージは比較的アクセスが遅いためリアルタイムでの同期が可能だが,メモリはマイグレーション時に転送する必要がある.我々はゲスト OS のメモリのうちページキャッシュが多くを占める場合に着目する.ページキャッシュをネットワーク越しに転送せず移動先でディスクイメージから復元することで,遠隔地ライブマイグレーションを高速化する手法を提案する.提案手法を QEMU/KVM 上に実装し,ネットワーク帯域の狭い環境下で total migration time を削減することを示した.Wide area live migration achieves cross-datacenter load balancing or disaster recovery of IT systems. The greatest issue of wide area live migration is the bandwidth bottleneck of wide area network (WAN). The memory of a virtual machine (VM) must be transferred via slow network while the disk image can be synchronized background as it is not updated frequently. We focus on a case that page cache occupies the large portion of the VM's memory usage. We proposes a fast wide area live migration mechanism, where the page cache is restored from the disk image at the destination and is not transferred via narrow network. Preliminary evaluations showed that our prototype reduced total migration time of live migration in a narrow bandwidth network. Future work includes considering the network delay and further analysis of the evaluation results.

    CiNii

  • 1A1-E06 Modeling Forward Dynamics using Neuroevolution Algorithms(Evolution and Learning for Robotics(1))

    MORIGUCHI Hirotaka, HONIDEN Shinichi

      2012   "1A1 - E06(1)"-"1A1-E06(3)"  2012.05

     View Summary

    Forward dynamics models are the important basis of motion planning of robots. While recent advancement in Robotics has allowed diverse morphologies of robots to take place, there has been little study on identifying the forward models for such robots. In this paper, we propose to use neuroevolution algorithms, which optimize the parameters of neural networks, to learn such models. We show that a neuroevolution algorithm called CMA-NeuroES can learn models of a simulated double pendulum system with higher accuracy and generalization ability compared to conventional regression algorithms, such as Gaussian Process Regression, Support Vector Regression and Linear Regression.

    CiNii

  • MIYAKODORI: Optimization for Sequence of Live Migrations by Reusing VM Memory

    穐山 空道, 広渕 崇宏, 高野 了成, 本位田 真一

    コンピュータシステム・シンポジウム論文集   2011   2 - 11  2011.11

    CiNii

  • 教育・研究のためのクラウド基盤:edubase Cloud

    吉岡信和, 長久勝, 横山重俊, 本位田真一

    全国共同利用情報基盤センター研究開発論文集   ( 33 ) 115 - 119  2011.11

    J-GLOBAL

  • イベント駆動型Webサービス検索のためのイベントマッチング

    片渕 聡, 鄭 顕志, 高橋 竜一, 深澤 良彰, 石川 冬樹, 本位田 真一

    人工知能学会全国大会(第24回)(JSAI 2010)    2010.06

    Research paper, summary (national, other academic conference)  

  • XAC Project: Towards a Middleware for Open Wireless Sensor Networks", chapter in book "Designing Solutions-Based Ubiquitous and Pervasive Computing: New Issues and Trends

    K.Tei,S, Suenaga, Y.Nakamura, Y.Sei, H.Nakazato, Y.Kaneki, N.Yoshioka, Y.Fukazawa, S.Honiden

    Information Science   - suenaga  2010  [Refereed]

    DOI

  • サービス設計における付随機能の考慮によるQoSの向上

    高橋 竜一, 鄭 顕志, 石川 冬樹, 本位田 真一, 深澤 良彰

    ウィンターワークショップ2010・イン・倉敷    2010.01

    Research paper, summary (national, other academic conference)  

  • A Summary of CST Solution Competition 2007 and 2008

    YAMAGUCHI Shingo, MIYAMOTO Toshiyuki, UCHIHIRA Naoshi, GE Qi-Wei, HONIDEN Shinichi

    IEICE technical report   109 ( 73 ) 59 - 64  2009.05

     View Summary

    CST Solution Competition is an industry-university cooperation activity for students, which is hosted by CST Technical Committee. In this paper, we look back on the competition 2007 and 2008, and present the results and the future directions.

    CiNii

  • Special Projects - Smart and Interactive e-Learning System Based on Smartive

    Nobukazu Yoshioka, Shinichi Honiden

    3rd Intentional Conference of Conputer AdedLanguage Leaning (WorldCALL 2008)     48 - 49  2008.08

    Article, review, commentary, editorial, etc. (scientific journal)  

  • CST Solution Competition 2007 : Detailed Results of Computational Evaluation

    MIYAMOTO Toshiyuki, YAMAGUCHI Shingo, UCHIHIRA Naoshi, GE Qi-Wei, HONIDEN Shinichi

    IEICE technical report   108 ( 79 ) 7 - 12  2008.06

     View Summary

    The CST Solution Competition 2007 gives student teams a problem of controlling a multi-car elevator (MCE). Each student team develops a program of controlling the MCE as a solution for the problem. This paper reports evaluation results of the developed group controllers.

    CiNii

  • The future of software engineering for security and privacy

    HONIDEN Shinichi, NUSEIBEH Bashar

    Progress in informatics : PI   5   5 - 6  2008.03

    CiNii

  • AI-1-5 CST Solution Competition 2007(Summary)

    Yamaguchi Shingo, Miyamoto Toshiyuki, Uchihira Naoshi, Ge Qi-Wei, Honiden Shinichi

    Proceedings of the IEICE General Conference   2008   SS.31 - SS.32  2008

    CiNii

  • AK-2-3 Research Trends on Multi-Car Elevator Group Control Algorithms : Through CST Solution Competition 2007

    Yamaguchi Shingo, Miyamoto Toshiyuki, Uchihira Naoshi, Ge Qi-Wei, Honiden Shinichi

    Proceedings of the Society Conference of IEICE   13   "SS - 13"-"SS-14"  2008

    CiNii

  • TopSE : An Education Program based on Computer Science

    HONIDEN Shinichi, KUMENO Fumihiro, TAHARA Yasuyuki, WASHIZAKI Hironori

    IPSJ Magazine   48 ( 11 ) 1264 - 1272  2007.11

    CiNii

  • Teaching How to Write Security Target of Common Criteria Using the i* Methodology

    TAHARA Yasuyuki, TAGUCHI Kenji, HONIDEN Shinichi

    IPSJ SIG Notes   2007 ( 107 ) 7 - 14  2007.11

     View Summary

    Security is one of the most widespread and common problem in everyday life. Security breach at companies is reported almost everyday and users of computer systems are busy updating security patches against vulnerabilities of their computer systems. These problems are caused by human errors and faults of physical devices but the majority of them are due to the defects of the software systems. The best way to reduce them is to find and fix them in earlier stage of the software development, especially in the requirements elicitation and analysis phases. Thus we incorporate a security requirements analysis course in our project, called TopSE, to teach advanced software engineers. In particular, we treat ISO/IEC15408 (Common Criteria for Information Technology Security Evaluation, CC) and teach a method to write Security Target (ST) that is a type of document used in the security evaluation process of CC. In this paper, we describe how our teach the method based on i^* that is a goal-oriented requirements analysis methodology.

    CiNii

  • Is it possible to teach the modeling technique?

    TSUMAKI Toshihiko, KAIYA Haruhiko, TAHARA Yasuyuki, YOSHIOKA Nobukazu, TAGUCHI Kenji, HONIDEN Shinichi

    IPSJ SIG Notes   2007 ( 107 ) 15 - 22  2007.11

     View Summary

    Modeling a target domain is one of most significant but difficult works in the requirements engineering. Because, main activity of the modeling is abstruction and the abstraction depend on cognition style of each engineer. It is a big issue whether incresing of modeling ability is possible or not. In NII, we are trying to teach the modeling ability by various methods. In this paper, we report the tipical problems of models presented by i^* method education and discuss about the modeling education.

    CiNii

  • Multi-Agent System Development in JADE(<Special Issue>A Software Toolbox for Research Activity (6))

    DOI Takuo, HONIDEN Shinichi, Takuo Doi, Shinichi Honiden, Graduate School of Information Science and Technology The University of Tokyo, Information Systems Architecture Science Research Division National Institute of Informatics:Graduate School of Information Science and Technology The University of Tokyo

    Journal of Japanese Society for Artificial Intelligence   22 ( 6 ) 799 - 807  2007.11

    CiNii

  • Improving Accuracy of Recommender System by Item Clustering

    TRUONG KhanhQuan, ISHIKAWA Fuyuki, HONIDEN Shinichi

    IEICE transactions on information and systems   90 ( 9 ) 1363 - 1373  2007.09

     View Summary

    Recommender System (RS) predicts user's ratings towards items, and then recommends highly-predicted items to user. In recent years, RS has been playing more and more important role in the agent research field. There have been a great deal of researches trying to apply agent technology to RS. Collaborative Filtering, one of the most widely used approach to predict user's ratings in Recommender System, predicts a user's rating towards an item by aggregating ratings given by users who have similar preference to that user. In existing approaches, user similarity is often computed on the whole set of items. However, because the number of items is often very large and so is the diversity among items, users who have similar preference in one category may have totally different judgement on items of another kind. In order to deal with this problem, we propose a method to cluster items, so that inside a cluster, similarity between users does not change significantly from item to item. After the item clustering phase, when predicting rating of a user towards an item, we only aggregate ratings of users who have similarity preference to that user inside the cluster of that item. Experiments evaluating our approach are carried out on the real dataset taken from MovieLens, a movies recommendation web site. Experiment results suggest that our approach can improve prediction accuracy compared to existing approaches.

    CiNii

  • Agent Systems Meet Human Society : Agents Meet Ubiquitous Environment

    YOSHIOKA Nobukazu, HONIDEN Shinichi

    IPSJ Magazine   48 ( 3 ) 264 - 270  2007.03

    CiNii

  • Agent Systems Meet Human Society : Panel : Social Impact of Agent Technology

    OSAWA Ei-Ichi, ISHIDA Toru, ISHIZUKA Mitsuru, TAKEDA Hideaki, TERANO Takao, HONIDEN Shinichi, YOKOO Makoto

    IPSJ Magazine   48 ( 3 ) 278 - 285  2007.03

     View Summary

    エージェントの研究が世界的な広がりを見せ始めてから,今年でほぼ15年が経過しようとしています.1990年代の半ばから,マルチエージェントや自律エージェントに関する国際会議が開催されるようになりました.それらが21世紀に入り統合され,現在はAAMASという,700人ほどの参加者をかかえる大きな国際会議に発展してきています.国際会議の規模は大きくなりましたが,同時に,研究が非常に多様化・細分化し,互いの関係が複雑で理解が困難になってきていると感じています.これだけ大きく育ってきた研究分野をさらに発展させてゆくためには,こういう技術がどのような未来を切り拓くのか,また,どういう社会的インパクトがあるのかということを議論し,説得力のある説明を社会に示してゆくことが必要ではないかということで,このパネル討論を企画しました.今回のパネル討論には,エージェント研究において,日本が世界に対して重要なメッセージを発信している6つの領域を選び,各領域の代表的な研究者の方々にお集まりいただきました.

    CiNii

  • A-12-8 CST Solution Competition 2007 : Problem and Evaluation Tool

    Yamaguchi Shingo, Miyamoto Toshiyuki, Uchihira Naoshi, Ge Qi-Wei, Honiden Shinichi

    Proceedings of the Society Conference of IEICE     191 - 191  2007

    CiNii

  • AP-2-5 CST Solution Competition 2007(Overview)

    Yamaguchi Shingo, Uchihira Naoshi, Ge Qi-Wei, Honiden Shinichi

    Proceedings of the IEICE General Conference     "SS - 11"  2007

    CiNii

  • A method for protecting a mobile agent by secret information derived from bio-metric information

    OKATAKU Yasukuni, AKASHI Masanori, YOSHIOKA Nobukazu, HONIDEN Sinichi

    The bulletin of Institute of National Colleges of Technology, Japan, Oshima College of Maritime Technology   39   58 - 60  2006.12

     View Summary

    This paper prescribes an approach for authenticating and protecting mobile agent in a client-server type authentication system. By combining biometric information and shared secret information, a robust one-time key can be created to protect mobile agents and guarantees that they are totally belong to the agent's owner. The created pseudo-biometric key doesn't contain FAR ( false accept rate) or FRR (false reject rate).

    CiNii

  • Report on the 21st IEEE / ACM International Conference on Automated Software Engineering (ASE2006)

    WASHIZAKI Hironori, KUBO Atsuto, SHIMOTAKI Asato, NAKAGAWA Hiroyuki, HAYASHI Shinpei, MARUYAMA Katsuhisa, HONIDEN Shinichi

    IPSJ SIG Notes   2006 ( 125 ) 81 - 88  2006.11

     View Summary

    This paper reports major topics of the 21st IEEE/ACM International Conference on Automated Software Engineering held at September 2006 in Tokyo. There were many presentations on program analysis/verification and pattern/aspect mining.

    CiNii

  • ユビキタスコンピューティングとエージェント:自発性と合意

    石川冬樹, 本位田真一

    合同エージェントワークショップ&シンポジウム2006 (JAWS2006)    2006.10

    Article, review, commentary, editorial, etc. (other)  

  • On the Testing Method in VDM

    TAGUCHI Kenji, TERAMOTO Hiroko, HONIDEN Shinichi

    IPSJ SIG Notes   2006 ( 35 ) 129 - 136  2006.03

     View Summary

    This paper outlines the logical foundations of testing in VDM-SL via definitions of its implicit/explicit functions in VDM-SL, and shows the survey result on currently available testing frameworks for VDM++, an object-oriented extension of VDM-SL.

    CiNii

  • エージェントで実現する自由で安全なコンテンツ流通

    吉岡信和, 本位田真一

    開隆堂, CHANNEL   ( vol.6-4 ) 1  2006.03

    Book review, literature introduction, etc.  

  • 考えるコンテンツ?スマーティブで実現する自由で安全なコンテンツ流通

    吉岡信和, 本位田真一

    電気通信振興会   Vol.24 ( No.7 ) 32 - 33  2006.03

    Book review, literature introduction, etc.  

  • Context-awareサービスのための開発法の提案

    吉岡信和, 本位田真一

    ソフトウェア工学の基礎XIII, 日本ソフトウェア科学会     125 - 130  2006.03

    Book review, literature introduction, etc.  

  • Report on Automated Software Engineering 2005

    TAGUCHI Kenji, SAEKI Motoshi, HONIDEN Shinichi

    IEICE technical report   105 ( 596 ) 19 - 22  2006.02

     View Summary

    This is to report the international conference on Automated Software Engineering 2005 held at Long Beach in the US. This report overviews the conference, its affiliated tutorials, workshops and doctoral symposium, and briefly introduces a couple of papers and the panel discussion as well as next year's ASE conference to be held in Tokyo.

    CiNii

  • IOM/T : An Interaction Description Language

    DOI Takuo, YOSHIOKA Nobukazu, TAHARA Yasuyuki, HONIDEN Shinichi

    The IEICE transactions on information systems Pt. 1   88 ( 9 ) 1299 - 1311  2005.09

    CiNii

  • Pheromone Model : Application to Traffic Congestion Prediction

    ANDO Yasushi, FUKAZAWA Yoshiaki, MASUTANI Osamu, SASAKI Hiroshi, IWASAKI Hirotoshi, HONIDEN Shinichi

    The IEICE transactions on information systems Pt. 1   88 ( 9 ) 1287 - 1298  2005.09

    CiNii

  • Report on the Automated Software Engineering 2004

    SAKATA Yuji, Matsuda Shigeyuki, YAMAMOTO Shuichiro, SAEKI Motoshi, Honiden Shinichi

    Technical report of IEICE. SS   104 ( 570 ) 37 - 42  2005.01

     View Summary

    The 19^&lt;th&gt; international conference on automated software engineering, which was one of the major conferences on software engineering, was held in Linz, Austria from September 20-24. This paper introduces some interesting papers and an atmosphere of the conference.

    CiNii

  • ソフトウェア工学におけるエージェントベースアプローチ

    大須賀昭彦, 本位田真一

    計測と制御(計測自動制御学会誌)   43 ( 12 ) 962 - 968  2004.12  [Refereed]

    Article, review, commentary, editorial, etc. (other)  

  • Design and Application of Agent Oriented Software for Ubiquitous Environment

    YOSHIOKA Nobukazu, OHSUGA Akihiko, HONIDEN Shinichi

    Systems, control and information   48 ( 11 ) 464 - 469  2004.11

    CiNii

  • A Model for Federation of Service Communities on the Web

    KURUMA HIRONOBU, HONIDEN SHINICHI

    IPSJ journal   45 ( 6 ) 1593 - 1602  2004.06

     View Summary

    The service mediation system on the Web could be constructed as a federation of service communities, in which each community provides and mediates limited number of services. In implementing the federation, (1) scalability of each community, (2) flexibility to the change of federation relation, and (3) verifiability of policy compliance should be considered. In this paper, we introduce a notion of policy of community based on access control among players and show a community model that is aimed at representing communications between players compliant with policy. The community model represents communications for the cooperation of communities separately from the communications for service request, mediation, and provision. As the result, it (1) represents communications between players in a modular way, (2) encapsulates the dependencies on partner communities, and (3) provides a basis for verification of policy compliance. The future work is to extend our notion of policy and to establish the implementation method based on the community model.

    CiNii

  • A Context-Aware Personal Agent in Ubiquitous Environments and Its Experimental Trial(<Special Issue> Software Agent and Its Applications)

    HATTORI Masanori, CHO Kenta, OHSUGA Akihiko, ISSHIKI Masao, HONIDEN Shinichi

    IEICE transactions on information and systems   86 ( 8 ) 1471 - 1471  2003.08

    CiNii

  • MolFie : A Mobile Agent Platform for Mobile Application, Vol.J86-B,No.3, pp.362-375

    KUMENO Fumihiro, HONIDEN Shinichi

    IEICE transactions on communications   86 ( 3 ) 1197 - 1197  2003.03

     View Summary

    This paper describes a mobile agent framework to develop application systems that provides location/situation aware services to mobile users. This framework introduces the personal agent on a personal mobile terminal. When a mobile user connects to a network in the current local area, the personal agent on the user's personal terminal moves to the application servers in the network. The agent provides the user various services suitable for the user's location or situations by interacting service agents on the application servers. We have designed a platform based on the framework and built its prototype.

    CiNii

  • An Authentication Architecture for Collaboration Among Agents in Ad Hoc Networks, Vol.J86-B,No.3, pp.419-427

    OKARAKU Yasukuni, YOSHIOKA Nobukazu, HONIDEN Shinichi

    IEICE transactions on communications   86 ( 3 ) 1198 - 1198  2003.03

     View Summary

    We propose an authentication architecture for collaboration among agents in ad hoc networks. It requires one or more secure nodes named as "Oasis node." The Oasis node generates random numbers and calculates authentication codes using them for the each agent. Then it delivers them to each agent. Each agent gathers at the appointed Oasis node and asks its verification by the Oasis node. The proposed authentication architecture has no shared secret key. The random numbers and authentication codes may be intercepted, but the authentication algorithm should be kept secret. The proposed architecture is suitable for many and unspecified mobile agents in the ad-hoc networks

    CiNii

  • モバイルエージェントのソフトウェアコンポーネントの動的配置

    長健太, 服部正典, 林久志, 大須賀昭彦, 本位田真一

       2003

    Research paper, summary (national, other academic conference)  

  • Effects of Agent Migration Control Methods for Mobile Environments

    KAWAKAMI Kenji, HIROSHIGE Kazuhito, YOSHIOKA Nobukazu, HONIDEN Shinichi

      2002 ( 94 ) 87 - 92  2002.10

     View Summary

    In recent years, mobile terminals such as cellular phones and PDAs have come into widespread use and various applications have been used anytime and anywhere. However, applications executed on the mobile terminals lack sufficient computational resources because of limited battery lifetime and terminal miniaturization. In order to overcome such a limitation, we have proposed the mobile agent-based middleware. In this paper, we describe our proposed agent migration control methods on the middleware and clarify the effects of these methods and the influences of overheads caused by the migration control through computer simulations.

    CiNii

  • M-68 Agent Migration Control Considering Resource Distribution

    Kawakami Kenji, Hiroshige Kazuhito, Yoshioka Nobukazu, Honiden Shinichi

      2002 ( 4 ) 169 - 170  2002.09

    CiNii

  • Agent Migration Control for Mobile Environment (2)

    KAWAKAMI Kenji, HIROSHIGE Kazuhito, YOSHIOKA Nobukazu, HONIDEN Shinichi

    IEICE technical report   102 ( 87 ) 89 - 94  2002.05

     View Summary

    In recent years, users of mobile terminals including cellular phones are growing rapidly, and the use range of mobile applications has greatly spread. In order to increase the processing efficiency of applications in the mobile terminals which have severe restriction on resources (memory, CPU, bandwidth, and so on), we proposed a mobile agent-based middleware in our previous work. However, when two or more mobile agents share terminal resources, the following subjects still exist such as migration control of mobile agents in consideration of resource distribution and state of other terminals. In this paper, we introduce the resource manager into our middleware which realizes resource distribution considering a mobile agent's characteristic and a node's policy, and propose a system architecture using the resource manager for solving the above-mentioned subjects.

    CiNii

  • Agent Migration Control for Mobile Environment

    KAWAKAMI Kenji, HIROSHIGE Kazuhito, SASAKI Hiroshi, OKATAKU Yasukuni, HONIDEN Shinichi

      2002 ( 24 ) 123 - 129  2002.03

     View Summary

    In recent years, users of mobile terminals including cellular phones are growing rapidly, and the use range of mobile applications has greatly spread. In proportion to the spreading, the demand that the users want to use the applications in mobile environments as in the fixed ones is increasing. In mobile environments, however, there are problems to be solved for adapting to limited resources (memory, CPU, bandwidth, and so on) on mobile terminals and changes of the environments in which applications are executed. In order to realize these demands as mentioned, a new mechanism is necessary for solving these problems. In order to realize the mechanism, we proposed a mobile agent-based middleware. In this paper, we consider a migration control mechanism of mobile agents for realization of the proposed middleware.

    CiNii

  • A Mobile Agent Migration Method Considering Mobile Environments

    Hiroshige Kazuhito, Kawakami Kenji, Honiden Shinichi

    Proceedings of the IEICE General Conference   2002 ( 1 ) 100 - 100  2002.03

    CiNii

  • Agent Migration Control for Mobile Environment

    KAWAKAMI Kenji, HIROSHIGE Kazuhito, SASAKI Hiroshi, OKATAKU Yasukuni, HONIDEN Shinichi

    Technical report of IEICE. RCS   101 ( 684 ) 123 - 129  2002.03

     View Summary

    In recent years, users of mobile terminals including cellular phones are growing rapidly, and the use range of mobile applications has greatly spread. In proportion to the spreading, the demand that the users want to use the applications in mobile environments as in the fixed ones is increasing. In mobile environments, however, there are problems to be solved for adapting to limited resources (memory, CPU, bandwidth, and so on) on mobile terminals and changes of the environments in which applications are executed. In order to realize these demands as mentioned, a new mechanism is necessary for solving these problems. In order to realize the mechanism, we proposed a mobile agent-based middleware. In this paper, we consider a migration control mechanism of mobile agents for realization of the proposed middleware.

    CiNii

  • Development of Network Script, Wrote and Run at once in Cellular Phones

    UENO Kouji, KAMAHORA Kentaro, KAWAMURA Takahiro, HASEGAWA Tetsuo, OHSUGA Akihiko, HON'IDEN Shin'ichi

    IPSJ Magazine   43 ( 2 ) 52 - 53  2002.02

    CiNii

  • Realization of autonomous survival function to battery residual quantity using the mobile agent

    KANEKO Heisuke, FUKAZAWA Yoshiaki, KUMENO Fumihiro, HONIDEN Shinichi

    IEICE technical report. Artificial intelligence and knowledge-based processing   101 ( 420 ) 41 - 48  2001.11

     View Summary

    While mobile computing becomes general, the battery problem of a portable information device has been focused increasingly, and developments of various power-saving devices and researches of a power management are done positively. However, conventional power-saving solution can never prevent application software from unwilled shutdown. In this research, sutonomous evacuation of the application from a portable information device is realized by creating application as a mobile agent. Moreover, in order to two or more application agents to perform smooth evacuation, dynamic evacuation is realized by introducing the concept of the Crisis Management Center. In this paper, the Easter (Escape Agent System from dying batTERy) system which realizes the above function is descrived, and the effect is evaluated.

    CiNii

  • Autonomous Survival of Application Software on Mobile Information Device

    KANEKO Heisuke, FUKAZAWA Yoshiaki, KUMENO Fumihiro, HONIDEN Shinichi

    IPSJ SIG Notes   2001 ( 99 ) 55 - 62  2001.10

     View Summary

    While mobile computing becomes general, the battery problem of a portable information device has been focused increasingaly, and developments of various power-saving devices and researches of a power management are done positively. However, conventional power-saving solution can never prevent application software from unwilled shutdow. In this research, autonomous evacuation of the application from a portable information device is realized by creating application as a mobile agent. Especially, in order to evacuate two or more application agents smoothly, the concept of the crisis management center is introduced so that dynamic evacuation can be realized, and the effect is verified.

    CiNii

  • Autonomous Survival of Application Software on Mobile Information Device

    KANEKO Heisuke, FUKAZAWA Yoshiaki, KUMENO Fumihiro, HONIDEN Shinichi

    Technical report of IEICE. SS   101 ( 359 ) 9 - 16  2001.10

     View Summary

    While mobile computing becomes general, the battery problem of a portable information device has been focused increasingly, and developments of various power-saving devices and researches of a power management are done positively. However, conventional power-saving solution can never prevent application software from unwilled shutdown. In this research, autonomous evacuation of the application from a portable information device is realized by creating application as a mobile agent. Especially, in order to evacuate two or more application agents smoothly, the concept of the crisis management center is introduced so that dynamic evacuation can be realized, and the effect is verified.

    CiNii

  • A formal specificaion of application programs using component - based framework technology

    YOSHIDA Kazuki, HONIDEN Shinichi

    IPSJ SIG Notes   2000 ( 104 ) 113 - 120  2000.11

     View Summary

    This paper proposes a component based framework technology based on formal specification and explains the formal specification and verification of the application programs using it, A transaction processing, especially a mapping program from object oriented model to relational model which provides a general framework for making objects persistent in RDBMS, is taken up as an application example for this purpose.

    CiNii

  • A formal specification of application programs using component-based framework technology

    YOSHIDA Kazuki, HONIDEN Shinichi

    Technical report of IEICE. KBSE   100 ( 441 ) 41 - 48  2000.11

     View Summary

    This paper proposes a component based framework technology based on formal specification and explains the formal specification and verification of the application programs using it.A transaction processing, especially a mapping program from object oriented model to relational model which provides a general framework for making objects persistent in RDBMS, is taken up as an application example for this purpose.

    CiNii

  • A component extraction/design methodology in a component - based framework technology

    YOSHIDA Kazuki, HONIDEN Shinichi

    IPSJ SIG Notes   2000 ( 70 ) 25 - 35  2000.07

     View Summary

    A method for building an application framework from a set of components is proposed, and especially a methodology to extract and design such components from application domain is explained as a main subject in this paper. Then this methodology is applied to the business transaction processing domain and from these results, i.e.extracted components and application frameworks based on them, the effectiveness of this method is evaluated.

    CiNii

  • Autonomous Adaptation by Mobile Agent and Thesaurus

    KUMENO Fumihiro, OHSUGA Akihiko, HONIDEN Shinichi

    IEICE TANS. INF. & SYST.   83 ( 4 ) 679 - 690  2000.04

     View Summary

    This paper describes the architecture to implement an application in network environments, which adapts to unexpected change in the development phase. In this architecture, an application is expressed as an agent which consists of two layers: base level and meta level. The base level program is an application program and the meta level program is the program that controls the execution of the base level and changes the base level program. Virtual places are also provided in the network. They are used for the release of programs and information which agents retrieve to change their own base level program. An application(or an agent), when a change is required, moves from places to places for the retrieval of programs to adapt to the change. A program search strategy is introduced to adapt to changes by using distributed thesauri of released programs, which realizes an agent's program retrieval method in network environments.

    CiNii

  • 知的モバイルエージェントPlangentプログラミング-上級編-

    長 健太, 本位田 真一

    Bit   31 ( 10 ) 35 - 43  1999.10

    CiNii

  • Performance Evaluation for Distributed System Paradigms by using Bee-gent

    KAWAMURA Takahiro, YOSHIOKA Nobukazu, HASEGAWA Tetsuo, OHSUGA Akihiko, HONIDEN Shinichi

    IEICE technical report. Artificial intelligence and knowledge-based processing   99 ( 290 ) 71 - 78  1999.09

    CiNii

  • Mobile Agent Platforms

    HONIDEN Shinichi, The development group of the middleware for mobile agent interoperability

      13   171 - 172  1999.06

    CiNii

  • Be-gent : Bonding Enhancement Agent Framework for Development of Distributed Systems

    KAWAMURA Takahiro, TAHARA Yasuyuki, HASEGAWA Tetsuo, OHSUGA Akihiko, HONIDEN Shinichi

    IEICE technical report. Artificial intelligence and knowledge-based processing   98 ( 436 ) 55 - 62  1998.11

     View Summary

    Interoperability between different kinds of systems is becoming a more important issue as computer networks expand. In this paper, we propose Be-gent (Bonding Enhancement Agent), a Distributed System Development Framework which aims to provide coordination and communication between RDBMS, legacy system, package software, and so on. Be-gent has Interaction Protocols which describe mutual relationship of elements of Distributed System. Our approach is to divide Interaction Protocols into two parts. One is the global flow for total problem solving. Another is the local flow depending on the system. Moreover mediation agents, which have Mobility, coordinate the behaviors of each system according to the former flow. We show a case to develop by using Be-gent, and examine the improvement of maintenancibility when modifying how to coordinate and/or restructuring the component of Distributed Systems.

    CiNii

  • Mobile Agents are Now Entering Practical Phase

    HONIDEN Shinichi

    IPSJ Magazine   39 ( 8 ) 812 - 815  1998.08

    CiNii

  • An Approach to Distributed Constraint Satisfaction Problems by Using Mobile Agents : Development of Distributed Cooperative Power Outage Scheduling System

    KAWAMURA Takahiro, KASE Naoki, HASEGAWA Tetsuo, OHSUGA Akihiko, HONIDEN Shinichi

    IEICE technical report. Artificial intelligence and knowledge-based processing   98 ( 58 ) 15 - 22  1998.05

     View Summary

    Recently several kinds of practical problems have been solved by considering them as Constraint Satisfaction Problems(CSP). Therefore a distributed approach to solving the CSP is becoming more important to model large-scale problems and solve these problems efficiently. A Solution may involve heuristics, policy and priority ordering concerning the assignment of values. Although these issues are important for rapid problem solution and more desirable solution, they have not yet been integrated into the distributed approach. Also there are some problems concerning the development of distributed systems which realize the distributed approach. Responding to this situation, in this paper we propose methods of integrating the heuristics into the distributed approach to solving the CSP and a mobile agents system to realize the above methods. We applied this system to Power Outage Scheduling Problem and found that the integrated heuristics help to solve the problems more efficiently. Finally we consider why the mobile agent model is appropriate to help integrate the heuristics into a distributed CSP.

    CiNii

  • Hypersequential Programming : A Novel Paradigm for Concurrent Programming

    Uchihira Naoshi, Kawata Hideji, Seki Toshibumi, Honiden Shinichi

    IPSJ SIG Notes   96 ( 58 ) 1 - 6  1996.05

     View Summary

    This paper proposes hypersequential programming which is a novel paradigm for concurrent programming to ease the difficulty of concurrent programming and make the concurrent program highly reliable. The difficulty of concurrent programming is due mainly to its nondeterminism; nondeterminism being the purpose of the concurrent program. We classify nondeterminism into 3 types: intended, harmful, and persistent nondeterminism. In traditional concurrent programming, a programmer first designs and implements programs so as to maximize concurrency, which may include the 3 types of nondeterminism. He then tries to detect harmful nondeterministic behaviors by testing and debugs them. However, it is actually very hard to remove all harmful nondeterministic behavior. On the contrary, in hypersequential programming the concurrent program is first serialized to remove all types of nondeterminism, and then the programmer tests and debugs it as a sequential program. Finally, it is parallelized by restoring only intended and persistent nondeterminism. With hypersequential programming, a highly-reliable concurrent program can be developed because the injection of harmful nondeterminism is precluded. This paper shows the generic concept and embodiments of hypersequential programming.

    CiNii

  • Flage Kernel Language

      51   217 - 218  1995.09

    CiNii

  • Flage Architecture-Conception

      51   215 - 216  1995.09

    CiNii

  • An Algebraic Model in Flage Architecture

      51   219 - 220  1995.09

    CiNii

  • Field Based Modeling for Flage Architecture

      51   221 - 222  1995.09

    CiNii

  • A Domain Model for Analysis of Management Information Systems

    SAITO Yasuhiko, HONIDEN Shinichi

    IPSJ SIG Notes   1995 ( 25 ) 17 - 24  1995.03

     View Summary

    It is difficult for analysts of management information systems to identify items to be stored in large-scale metadatabases, which should be adapted to changes in environments. We presents an analysis method based on a domain model for dividing the metadatabase according to views of the users and for capturing interactions among the parts. The domain model includes : 1) models for phenomena in the real world ; 2) models for functions of an information system ; 3) a data dictionary, which is a set of vocabularies shared by the real world and an information system. The analysis method supports organization and reorganization of the data dictionary.

    CiNii

  • An Agent - Oriented Specification Model for Open Systems

    KURUMA Hironobu, HONIDEN Shinichi

    IPSJ SIG Notes   1995 ( 11 ) 135 - 140  1995.01

     View Summary

    As the communications between software components by networks become wide, it is difficult to understand the behaviour of the whole system at any time. In this paper, we propose a specification model for such a system, on which we intend to represent the behaviors of subsystems that consist of closely connected software components. This model based on the concepts of agent and field ; an agent is an autonomous object and a field is a finite set of agents. We adopt a meta-level architecture to separate the descriptions of the communications between subsystems from the descriptions of the functions of components using the communications.

    CiNii

  • TA-2-2 Software Design Methodology using High-Level Petri Nets

    Uchihira Naoshi, Honiden Shinichi

      1994   356 - 357  1994.09

    CiNii

  • Making Object-Oriented Development Work

    AOYAMA Mikio, HONIDEN Shinichi

    IPSJ Magazine   35 ( 5 ) 451 - 460  1994.05

    CiNii

  • 特集「オブジェクト指向分析・設計」の編集にあたって

    深澤 良彰, 本位田 真一

    情報処理   35 ( 5 ) 391 - 391  1994.05

    CiNii

  • Are "Object-Oriented Approaches" really Useful? : From the Viewpoints of both Engineering and Scientific Sides

    Hon-iden Shin-ichi, Saeki Motoshi, Kuse Kazushi, Kato Kazuhiko, Ohmaki Kazuhito

    IPSJ SIG Notes   94 ( 6 ) 49 - 49  1994.01

     View Summary

    The purpose of the panel session is to discuss usefulness of object-oriented (OO) approaches on software from the viewpoints of both engineering and scientific research areas. Many researchers or practitioners seem to believe that OO approaches are promising ones. During the panel discussion, we would like to re-discuss on the usefulness of OO. The four panelists are very active researchers from two special research interest groups of engineering and scientific research fields. We can expect that they will give us their positions and perspectives.

    CiNii

  • A genetic approach to cell placement in analog LSI chip designs

    Handa Keiichi, Honiden Shinichi

    IEICE technical report. Circuits and systems     CS93 - 197  1994

     View Summary

    Cell layout in analog LSI chip designs entails a lot of strict constraints,and its complete automation is known to be a very difficult problem to solve.The layout in analog LSI designs usually has the same relative position of elements as in the circuit schematic.Given this fact,in this paper,we consider the placement problem to minimize the overall net length and the used region area with the constraints of neighbourhood-relation of elements.We propose two ideas based on genetic algorithms;(1)a method to scan the placement tasks of small blocks in overlapping stages,(2)a method to line up several elements along the x- direction gradually by stocastic adjustment of y-coodinates. Computational experiments show the efficiency of these methods.

    CiNii

  • A Tentative Framework for Requirements Acquisition Using Object - Oriented Business Models

    Saito Yasuhiko, Honiden Shinichi

    IPSJ SIG Notes   1993 ( 107 ) 55 - 62  1993.11

     View Summary

    A framework for requirements acquisition as a step of object-oriented analysis is considered. A tool which facilitates communication between requestors and analysts is proposed. Through such communication, patterns implying requirements on the software system to be developed emerge from interactions among a large number of components of the chaotic problem domain. In the framework, the problem is represented using object-oriented models. Given the models, the tool generates clusters of the components and then structures inside of each cluster, so that the analyst understands the problem appropriately. The tool is applied to analysis of a library system. The results of the experiment show that the framework is useful.

    CiNii

  • SPECIAL SECTION ON NETS-ORIENTED SOFTWARE SPECIFICATION AND DESIGN - FOREWORD

    S HONIDEN

    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   E76A ( 10 ) 1565 - 1566  1993.10

    Other  

  • Δ-extension of Algebraic Specification

    YOSHIDA Kazuki, OHSUGA Akihiko, NAGATA Morio, HONIDEN Shinichi

      33 ( 12 ) 1643 - 1643  1992.12

    CiNii

  • Programming by Communication

      45   241 - 242  1992.09

    CiNii

  • Mechanism of Multiple Analogical Reasoning

      1991 ( 103 ) 1 - 10  1991.11

    CiNii

  • Automatic Programming in Cooperative Architecture (<Round-table Discussions> Toward Intellingent Development of Software)

    Shin-ichi Hon-iden, Systems & Software Engineering Laboratory Toshiba Corp.

      6 ( 2 ) 184 - 186  1991.03

    CiNii

  • 0n Parallel Theorem Prover for Temporal Logic

      1990 ( 60 ) 1 - 6  1990.07

    CiNii

  • 知的プログラミングシステム (AI技術<特集>)

    中村 英夫, 本位田 真一, 内平 直志

    東芝レビュー   44 ( 10 ) p810 - 813  1989.10

    CiNii

  • Bottleneck Diagnosis for Queueing Network Using Knowledge Engineering

    SAWAMURA JUN, SHIDA KEISUKE, HONIDEN SHINICHI, ITOH KIYOSHI

    IPSJ Journal   30 ( 8 ) 990 - 1002  1989.08

    CiNii

  • Temporal Logics and Their Applications

    MATSUMOTO KAZUNORI, UCHIHIRA NAOSHI, HONIDEN SHINICHI

    IPSJ Magazine   30 ( 6 ) p651 - 657  1989.06

    CiNii

  • Automatic Programming for Control Systems

    HONIDEN SHINICHI, UCHIHIRA NAOSHI, NAKAMURA HIDEO

    IPSJ Magazine   28 ( 10 ) p1398 - 1404  1987.10

    CiNii

  • Expert System for Diagnosis

    ARAI M., HONIDEN SHINICHI

    IPSJ Magazine   28 ( 2 ) p177 - 186  1987.02

    CiNii

  • MENDELにおける並列プログラムの部品結合

    内平直志, 関俊文, 粕谷利明, 本位田真一

    情報処理学会研究報告ソフトウェア工学(SE)   1986 ( 7 ) 57 - 64  1986.02

    CiNii

  • 推論型システム記述言語MENDEL

    本位田真一, 内平直志, 大須賀昭彦, 粕谷利明

    情報処理学会研究報告知能と複雑系(ICS)   1984 ( 74 ) 73 - 80  1985.03

    CiNii

  • 無線センサネットワークにおけるモバイルエージェントの直接通信

    末永俊一郎, 本位田真一

    分散,協調とモバイルシンポジウム 2007(DICOMO2007)   - suenaga  [Refereed]

▼display all

Works

  • エージェント指向言語Flage

    Software 

     View Summary

    http://www.ipa.go.jp/NEWSOFT/public/Flage/||http://www.ipa.go.jp/NEWSOFT/public/Flage/

  • 携帯向けスクリプト言語システムFlipcast

    Software 

     View Summary

    http://flipcast.ex.nii.ac.jp/||http://flipcast.ex.nii.ac.jp/

  • パーソナル検索エージェントMobeet

    Software 

     View Summary

    http://mobeet.ex.nii.ac.jp/||http://mobeet.ex.nii.ac.jp/

  • マルチエージェントフレームワークBee-gent

    Software 

     View Summary

    http://www2.toshiba.co.jp/beegent/||http://www2.toshiba.co.jp/beegent/

  • 知的ネットワークエージェントPlangent

    Software 

     View Summary

    http://www2.toshiba.co.jp/plangent/||http://www2.toshiba.co.jp/plangent/

Awards

  • 令和3年度文部科学大臣表彰(科学技術賞)

    2021.04   文部科学省   先端スマートシステム技術の普及啓発

    Winner: 鷲崎 弘宜, 本位田 真一, 鄭 顕志, 内平 直志, 深澤 良彰

  • ソフトウェア工学研究会功績賞

    2019.08   情報処理学会   トップエスイープロジェクトの推進

    Winner: 本位田真一、石川冬樹、鄭顕志

  • SEAMS' 2016 Best Paper Award

    2016.06  

    Winner: L. Nahabedian, V. Braberman, N. D'Ippolito, S. Honiden, J. Kramer, K. Tei, S. Uchitel

  • 2012年度進化計算研究会 最優秀発表賞(論文賞)

    2012.12   進化計算学会  

    Winner: 森口博貴, 本位田真一

  • 功労賞

    2012.08   日本ソフトウェア科学会  

    Winner: 本位田真一

  • Best Paper Award, SENSORCOMM 2012

    2012.08  

    Winner: Valentina Baljak, Kenji Tei, Shinichi Honiden

  • コンピュータサイエンス領域奨励賞

    2012.08   情報処理学会 コンピュータサイエンス領域委員会  

    Winner: 穐山空道, 広渕崇宏, 高野了成, 本位田真一

  • The Commendation for Science and Technology by the Minister of Education, Culture, Sports, Science and Technology

    2012.04   Ministry of Education, Culture, Sports, Science and Technology,  

    Winner: Shinichi Honiden

  • 第五回進化計算シンポジウム 最優秀発表賞

    2011.12   進化計算学会  

    Winner: 森口博貴, 本位田真一

  • ComSys2011 学生ポスター・デモンストレーション賞

    2011.11  

    Winner: 穐山空道, 広渕崇宏, 高野了成, 本位田真一

  • ComSys2011 優秀論文賞

    2011.11  

    Winner: 穐山空道, 広渕崇宏, 高野了成, 本位田真一

  • Best PhD Poster Award, ICSOC2010

    2010.12   Efficient, Failure-Resilient Semantic Web Service Planning  

    Winner: Florian Wagner, Fuyuki Ishikawa, Shinichi Honiden

  • JAWS2007 学生奨励賞

    2007.10   合同エージェントワークショップ&シンポジウム  

    Winner: 末永 俊一郎, 本位田 真一

  • DICOMO2007 最優秀論文賞

    2007.07   マルチメディア、分散、協調とモバイルシンポジウム  

    Winner: 清 雄一, 本位田 真一

  • ACM Recognition of Service Award受賞

    2007.01   ACM  

    Winner: 本位田真一

  • 情報処理学会フェロー称号授与

    2007.01   情報処理学会  

    Winner: 本位田真一

  • JAWS2006 優秀論文賞

    2006.10   合同エージェントワークショップ&シンポジウム  

    Winner: 丹羽 智史, 土肥 拓生, 本位田 真一

  • DICOMO2006 優秀論文賞

    2006.09  

    Winner: 清 雄一, 松崎 和賢, 本位田 真一

▼display all

Presentations

  • モバイルAR環境による日常技能練習のゲーミフィケーション

    22nd Workshop on Interactive Systems and Software (WISS 2014) 

    Presentation date: 2014.11

  • フィードバック指向ランダムテストを用いたQuickCheckの改良

    矢藤 康祐, 坂本 一憲, 石川 冬樹, 本位田 真一

    第16回プログラミングおよびプログラミング言語ワークショップ (PPL2014) ポスターセッション 

    Presentation date: 2014.03

  • ページキャッシュの復元による遠隔地ライブマイグレーション高速化システムの実演

    穐山 空道, 広渕 崇宏, 高野 了成, 本位田 真一

    第24回コンピュータシステム・シンポジウム(ComSys 2012) ポスターセッション 

    Presentation date: 2012.12

  • ページキャッシュの復元による遠隔地ライブマイグレーションの高速化

    穐山 空道, 広渕 崇宏, 高野 了成, 本位田 真一

    第123回システムソフトウェアとオペレーティング・システム研究会 

    Presentation date: 2012.12

  • 閾値ベースの確率的オンラインセンサ・タスク割当て手法

    鳥海 晋, 本位田 真一

    マルチメディア、分散、協調とモバイル(DICOMO2012)シンポジウム 

    Presentation date: 2012.07

  • 主双対法を用いたオンラインセンサ・タスク割当て

    鳥海 晋, 本位田 真一

    マルチメディア、分散、協調とモバイル(DICOMO2012)シンポジウム 

    Presentation date: 2012.07

  • Cooperative Synapse Neuroevolutionにおける大域最適解への収束と進化速度の向上

    徐 聖博, 森口 博貴, 本位田 真一

    第五回進化計算シンポジウム 

    Presentation date: 2011.12

  • 進化計算を用いたロボットの順動力学モデル学習と行動計画・制御への応用

    森口 博貴, 本位田 真一

    第五回進化計算シンポジウム 

    Presentation date: 2011.12

  • メモリ再利用によりライブマイグレーションを高速化するシステム「都鳥」の実演

    穐山 空道, 広渕 崇宏, 高野 了成, 本位田 真一

    コンピュータシステム・シンポジウム (ComSys 2011) デモセッション 

    Presentation date: 2011.11

  • 都鳥: メモリ再利用による連続するライブマイグレーションの最適化

    穐山 空道, 広渕 崇宏, 高野 了成, 本位田 真一

    コンピュータシステム・シンポジウム (ComSys 2011) 

    Presentation date: 2011.11

  • Achieving Constraint Compliance in QoS-aware Service Planning

    Florian Wagner, Fuyuki Ishikawa, Shinichi Honiden

    Second International Joint Agent Workshop & Symposium (iJAWS2011) 

    Presentation date: 2011.10

  • ヴィックレイオークションを利用したWebサービス選択アルゴリズム

    渡辺 敦, 石川 冬樹, 深澤 良彰, 本位田 真一

    合同エージェントワークショップ&シンポジウム(JAWS2011) 

    Presentation date: 2011.10

  • 電力資源制約下におけるセンサ・タスク割当て

    鳥海 晋, 本位田 真一

    マルチメディア,分散,協調とモバイル(DICOMO2011)シンポジウム 

    Presentation date: 2011.07

  • メモリの再利用により移動後の性能低下を抑えたライブマイグレーション

    穐山 空道, 広渕 崇宏, 高野 了成, 本位田 真一

    先進的計算基盤システムシンポジウム(SACSIS2011) ポスター発表セッション 

    Presentation date: 2011.05

  • 進化的計算におけるグラフ構造と最適化性能の関係性

    須山 敦志, 本位田 真一

    合同エージェントワークショップ&シンポジウム(JAWS2010) 

    Presentation date: 2010.10

  • 同種サービスの複数利用を考慮した効率的なサービス候補の構築

    平塚 信明, 石川 冬樹, 本位田 真一

    合同エージェントワークショップ&シンポジウム(JAWS2010) 

    Presentation date: 2010.10

  • 組合せによる条件付き品質を考慮したWebサービス選択の高速化手法

    渡辺 敦, 片渕 聡, 高橋 竜一, 鄭 顕志, 石川 冬樹, 深澤 良彰, 本位田 真一

    マルチメディア,分散,協調とモバイル(DICOMO2010)シンポジウム 

    Presentation date: 2010.07

  • 無線センサネットワークの為のモデル駆動開発に向けたDSL非依存モデルの提案

    清水 遼, 鄭 顕志, 深澤 良彰, 本位田 真一

    マルチメディア,分散,協調とモバイル(DICOMO2010)シンポジウム 

    Presentation date: 2010.07

  • 資源制約下における複数タスクへのセンサ割当問題

    鳥海 晋, 本位田 真一

    マルチメディア,分散,協調とモバイル(DICOMO2010)シンポジウム 

    Presentation date: 2010.07

  • Chordネットワークにおけるシーケンシャルアクセスに最適な配列の配置

    福地 大輔, 本位田 真一

    マルチメディア,分散,協調とモバイル(DICOMO2010)シンポジウム 

    Presentation date: 2010.07

  • イベント駆動型Webサービス検索のためのイベントマッチング" 人工知能学会全国大会(第24回)(JSAI2010)

    片渕 聡, 鄭 顕志, 高橋 竜一, 深澤 良彰, 石川 冬樹, 本位田 真一

    人工知能学会全国大会(第24回)(JSAI2010) 

    Presentation date: 2010.06

  • NEATにおける振る舞い多様性維持

    森口 博貴, 本位田 真一

    人工知能学会全国大会(第24回)(JSAI2010) 

    Presentation date: 2010.06

  • Flickr上の画像のWordNetへの自動マッピング

    馬場 雪乃, 本位田 真一

    人工知能学会全国大会(第24回)(JSAI2010) 

    Presentation date: 2010.06

  • 無線センサネットワークにおける計測記述言語のための規範モデル導出手法の構築

    鄭 顕志, 深澤 良彰, 本位田 真一

    ソフトウェア工学の基礎〈15〉日本ソフトウェア科学会FOSE 2008  日本ソフトウェア科学会

    Presentation date: 2008.11

  • Ruby処理系へのスナップショットGCの実装

    相川 光, 笹田 耕一, 本位田 真一

    第71回情報処理学会プログラミング研究発表会  (松江テルサ)  情報処理学会・プログラミング研究会

    Presentation date: 2008.10

  • コンポーネントモデルを用いたJADE実装手法の提案

    中川 博之, 大須賀 昭彦, 本位田 真一

    合同エージェントワークショップ&シンポジウム2008(JAWS-2008) 予稿集  (滋賀県、日本)  日本ソフトウェア科学会

    Presentation date: 2008.10

  • マルチエージェントシステムにおけるメタデータを用いた協調プロトコル合成手法

    高橋 竜一, 鄭 顕志, 石川 冬樹, 本位田 真一, 深澤 良彰

    合同エージェントワークショップ&シンポジウム2008(JAWS-2008) 予稿集  (滋賀県、日本)  日本ソフトウェア科学会

    Presentation date: 2008.10

  • センサーネットワークにおける耐故障性を考慮したデータ集約

    金木 陽一, 清 雄一, 本位田 真一

    合同エージェントワークショップ&シンポジウム2008(JAWS-2008) 予稿集  (滋賀県、日本)  日本ソフトウェア科学会

    Presentation date: 2008.10

  • 無線センサネットワークによるイベント領域予測のためのイベント境界の変化量抽出

    鳥海 晋, 本位田 真一

    合同エージェントワークショップ&シンポジウム2008(JAWS-2008) 予稿集  (滋賀県、日本)  日本ソフトウェア科学会

    Presentation date: 2008.10

  • 無線センサーネットワークの複製ノード検知における報告ノード決定手法の提案

    清 雄一, 本位田 真一

    合同エージェントワークショップ&シンポジウム2008(JAWS-2008)  (滋賀県、日本)  日本ソフトウェア科学会

    Presentation date: 2008.10

  • タグに関連づけられた時間・場所の概念抽出

    電子情報通信学会技術研究報告. AI, 人工知能と知識処理  (京都市、日本)  人工知能と知識処理研究会

    Presentation date: 2008.09

  • 三次元環境での無線センサネットワークにおける省電力性を考慮したイベント検出

    鳥海 晋, 清 雄一, 本位田 真一

    マルチメディア,分散,協調とモバイル(DICOMO2008)シンポジウム  (北海道、日本)  情報処理学会

    Presentation date: 2008.07

  • 無線センサネットワークにおける省資源性を考慮したセンサセレクション手法

    中村 善行, 鄭 顕志, 深澤 良彰, 本位田 真一

    マルチメディア,分散,協調とモバイル(DICOMO2008)シンポジウム  (北海道、日本)  情報処理学会

    Presentation date: 2008.07

  • ユビキタスコンピューティングにおけるイベントに基づいたアクセス制御

    石川 冬樹, 清 雄一, 吉岡 信和, 本位田 真一

    マルチメディア,分散,協調とモバイル(DICOMO2008)シンポジウム  (北海道、日本)  情報処理学会

    Presentation date: 2008.07

  • 分散配列: 連番アイテムに適したP2P分散データ構造

    福地 大輔, 清 雄一, 本位田 真一

    マルチメディア,分散,協調とモバイル(DICOMO2008)シンポジウム  (北海道、日本)  情報処理学会

    Presentation date: 2008.07

  • 通信コストと計測精度を考慮したトラッキングのためのセンサモデルの提案

    中里 彦俊, 中村 善行, 鄭 顕志, 深澤 良彰, 本位田 真一

    マルチメディア,分散,協調とモバイル(DICOMO2008)シンポジウム  (北海道、日本)  情報処理学会

    Presentation date: 2008.07

  • モデル変換に基づく要求記述を利用した形式仕様記述の構築

    中川博之, 吉岡信和, 本位田真一

    ソフトウェア工学の基礎ワークショップ (FOSE2007)  (東京都、日本)  日本ソフトウェア科学会

    Presentation date: 2007.11

  • 保守性に着目したリファクタリング方針の評価メトリクス

    川俣洋次郎, 中川博之, 本位田真一

    ソフトウェア工学の基礎ワークショップ (FOSE2007)  (東京都、日本)  日本ソフトウェア科学会

    Presentation date: 2007.11

  • ロボットを統一的に協調動作させるためのフレームワークの設計と実装

    片岡慧, 本位田真一

    合同エージェントワークショップ&シンポジウム2007(JAWS2007)  (沖縄県、日本)  合同エージェントワークショップ&シンポジウム2007(JAWS2007)

    Presentation date: 2007.10

  • Novel Applications in Ubiquitous Computing

    Christian Sommer, Shunichiro Suenaga, 吉岡信和, 本位田真一

    合同エージェントワークショップ&シンポジウム2007(JAWS2007)  (沖縄県、日本)  合同エージェントワークショップ&シンポジウム2007(JAWS2007)

    Presentation date: 2007.10

  • Peer-to-Peer環境での補助ネットワークを用いた差分ベースオブジェクトの共有

    福地大輔, 清雄一, 本位田真一

    合同エージェントワークショップ&シンポジウム2007(JAWS2007)  (沖縄県、日本)  合同エージェントワークショップ&シンポジウム2007(JAWS2007)

    Presentation date: 2007.10

  • ユビキタスコンピューティングにおけるコンテンツの形成・流通・利用・管理に関する研究動向

    馬場雪乃, 福地大輔, 清雄一, 吉岡信和, 本位田真一

    合同エージェントワークショップ&シンポジウム2007(JAWS2007)  (沖縄県、日本)  合同エージェントワークショップ&シンポジウム2007(JAWS2007)

    Presentation date: 2007.10

  • ユビキタスコンピューティングにおけるコンテキストのモデル化,管理に関する研究動向

    中村善行, 清家良太, 鄭顕志, 吉岡信和, 深澤良彰, 本位田真一

    合同エージェントワークショップ&シンポジウム2007(JAWS2007)  (沖縄県、日本)  合同エージェントワークショップ&シンポジウム2007(JAWS2007)

    Presentation date: 2007.10

  • ユビキタスコンピューティングにおけるアプリケーション開発手法に関する研究動向

    鄭顕志, 中川博之, 川俣洋次郎, 吉岡信和, 深澤良彰, 本位田真一

    合同エージェントワークショップ&シンポジウム2007(JAWS2007)  (沖縄県、日本)  合同エージェントワークショップ&シンポジウム2007(JAWS2007)

    Presentation date: 2007.10

  • ユビキタスコンピューティングにおける分散協調・連携技術の研究動向

    石川冬樹, 阿部玲, 高橋竜一, 吉岡信和, 深澤良彰, 本位田真一

    合同エージェントワークショップ&シンポジウム2007(JAWS2007)  (沖縄県、日本)  合同エージェントワークショップ&シンポジウム2007(JAWS2007)

    Presentation date: 2007.10

  • サービス合成における契約ポリシーの決定・検証問題の形式化とその支援

    石川冬樹, 吉岡信和, 本位田真一

    合同エージェントワークショップ&シンポジウム2007(JAWS2007)  (沖縄県、日本)  合同エージェントワークショップ&シンポジウム2007(JAWS2007)

    Presentation date: 2007.10

  • マルチエージェントシステムにおける柔軟なプロトコル合成言語

    高橋竜一, 鄭顕志, 石川冬樹, 深澤良彰, 本位田真一

    合同エージェントワークショップ&シンポジウム2007(JAWS2007)  (沖縄県、日本)  合同エージェントワークショップ&シンポジウム2007(JAWS2007)

    Presentation date: 2007.10

  • 無線センサネットワークにおけるデータ発見効率を考慮した分散ストレージバランシングの提案

    清家良太, 清雄一, 本位田真一

    合同エージェントワークショップ&シンポジウム2007(JAWS2007)  (沖縄県、日本)  合同エージェントワークショップ&シンポジウム2007(JAWS2007)

    Presentation date: 2007.10

  • 無線センサーネットワークにおける不正イベント発生ノードの検知

    清雄一, 本位田真一

    合同エージェントワークショップ&シンポジウム2007(JAWS2007)  (沖縄県、日本)  合同エージェントワークショップ&シンポジウム2007(JAWS2007)

    Presentation date: 2007.10

  • 非常に不安定なネットワークにおける送信方式の違いによる通信安定性の検証

    片岡慧, 山上智久, 本位田真一

    マルチメディア、分散、協調とモバイルシンポジウム(DICOMO2007)  (三重県、日本)  マルチメディア、分散、協調とモバイルシンポジウム(DICOMO2007)

    Presentation date: 2007.07

  • 無線センサネットワークにおけるモバイルエージェントの直接通信

    末永俊一郎, 本位田真一

    マルチメディア、分散、協調とモバイルシンポジウム(DICOMO2007)  (三重県、日本)  マルチメディア、分散、協調とモバイルシンポジウム(DICOMO2007)

    Presentation date: 2007.07

  • 経済市場モデルに基づいた無線センサーネットワークにおけるマルチアプリケーション間での資源共有

    清家良太, 清雄一, 本位田真一

    マルチメディア、分散、協調とモバイルシンポジウム(DICOMO2007)  (三重県、日本)  マルチメディア、分散、協調とモバイルシンポジウム(DICOMO2007)

    Presentation date: 2007.07

  • 無線センサーネットワークにおけるFalse Eventの検知

    清雄一, 本位田真一

    マルチメディア、分散、協調とモバイルシンポジウム(DICOMO2007)  (三重県、日本)  マルチメディア、分散、協調とモバイルシンポジウム(DICOMO2007)

    Presentation date: 2007.07

  • MANETにおけるコスト基準経路探索プロトコルへのコスト基準拡張リング探索の適用

    河村美嗣, 鄭顕志, 深澤良彰, 本位田真一

    マルチメディア、分散、協調とモバイルシンポジウム(DICOMO2007)  (三重県、日本)  マルチメディア、分散、協調とモバイルシンポジウム(DICOMO2007)

    Presentation date: 2007.07

  • 無線センサーネットワークにおける計測処理記述のためのデザインパターンの抽出と適用

    鄭顕志, 深澤良彰, 本位田真一

    マルチメディア、分散、協調とモバイルシンポジウム(DICOMO2007)  (三重県、日本)  マルチメディア、分散、協調とモバイルシンポジウム(DICOMO2007)

    Presentation date: 2007.07

  • KAOSによる無線センサーネットワークのための計測処理中間モデルの導出

    鄭顕志, 深澤良彰, 本位田真一

    マルチメディア、分散、協調とモバイルシンポジウム(DICOMO2007)  (三重県、日本)  マルチメディア、分散、協調とモバイルシンポジウム(DICOMO2007)

    Presentation date: 2007.07

  • variable-size DBF による分散ハッシュテーブルのトラフィック量削減

    清雄一, 松崎和賢, 本位田 真一

    合同エージェントワークショップ&シンポジウム2006 (JAWS2006)  (三重県、日本)  合同エージェントワークショップ&シンポジウム2006 (JAWS2006)

    Presentation date: 2006.10

  • モバイルエージェントの合意に基づいた協調とサービス管理

    石川 冬樹, 吉岡 信和, 本位田 真一

    合同エージェントワークショップ&シンポジウム2006 (JAWS2006)  (三重県、日本)  合同エージェントワークショップ&シンポジウム2006 (JAWS2006)

    Presentation date: 2006.10

  • 知的移動エージェントによる低消費電力なワイヤレスセンサネットワークアプリケーションの構築

    長健太, 大須賀昭彦, 本位田真一

    合同エージェントワークショップ&シンポジウム2006 (JAWS2006)  (三重県、日本)  合同エージェントワークショップ&シンポジウム2006 (JAWS2006)

    Presentation date: 2006.10

  • ユビキタスコンピューティングとエージェント:自発性と合意

    石川冬樹, 本位田真一

    合同エージェントワークショップ&シンポジウム2006 (JAWS2006)  (三重県、日本)  合同エージェントワークショップ&シンポジウム2006 (JAWS2006)

    Presentation date: 2006.10

  • 無線センサネットワークにおけるプログラミングモデル - マクロプログラミングとトラディショナルアプローチ

    松崎和賢, 末永 俊一郎, 本位田真一

    合同エージェントワークショップ&シンポジウム2006 (JAWS2006)  (三重県、日本)  合同エージェントワークショップ&シンポジウム2006 (JAWS2006)

    Presentation date: 2006.10

  • 無線センサネットワークにおけるプログラミングモデル - プログラミングサポートとプログラミングアブストラクション

    末永俊一郎, 松崎 和賢, 本位田 真一

    合同エージェントワークショップ&シンポジウム2006 (JAWS2006)  (三重県、日本)  合同エージェントワークショップ&シンポジウム2006 (JAWS2006)

    Presentation date: 2006.10

  • 無線センサーネットワークミドルウェアの研究動向とエージェント技術の適用可能性

    鄭顕志, 深澤良彰, 本位田真一

    合同エージェントワークショップ&シンポジウム2006 (JAWS2006)  (三重県、日本)  合同エージェントワークショップ&シンポジウム2006 (JAWS2006)

    Presentation date: 2006.10

  • Folksonomyの3部グラフ構造を利用したタグクラスタリング

    丹羽智史, 土肥拓生, 本位田真一

    合同エージェントワークショップ&シンポジウム2006 (JAWS2006)  (三重県、日本)  合同エージェントワークショップ&シンポジウム2006 (JAWS2006)

    Presentation date: 2006.10

  • PID制御法を用いたロボットの行動決定のための交渉フィルター

    片岡慧, 本位田真一

    合同エージェントワークショップ&シンポジウム2006 (JAWS2006)  (三重県、日本)  合同エージェントワークショップ&シンポジウム2006 (JAWS2006)

    Presentation date: 2006.10

  • シナリオに基づくインタラクションの開発

    土肥拓生, 本位田真一

    合同エージェントワークショップ&シンポジウム2006 (JAWS2006)  (三重県、日本)  合同エージェントワークショップ&シンポジウム2006 (JAWS2006)

    Presentation date: 2006.10

  • エージェント間協調のためのプロトコルを利用したポリシー表現とその監視法の提案

    吉岡信和, 本位田真一

    合同エージェントワークショップ&シンポジウム2006 (JAWS2006)  (三重県、日本)  合同エージェントワークショップ&シンポジウム2006 (JAWS2006)

    Presentation date: 2006.10

  • 要求の重要度を用いたロール・組織構造の同定

    中川博之, 本位田真一

    合同エージェントワークショップ&シンポジウム2006 (JAWS2006)  (三重県、日本)  合同エージェントワークショップ&シンポジウム2006 (JAWS2006)

    Presentation date: 2006.10

  • 碁盤分析のためのニューラルエージェントによる自動調整MASム

    Eric Tschetter, Eric Platon, 本位田真一

    合同エージェントワークショップ&シンポジウム2006 (JAWS2006)  (三重県、日本)  合同エージェントワークショップ&シンポジウム2006 (JAWS2006)

    Presentation date: 2006.10

  • コンテンツ流通エージェントのための強化学習メカニズム

    片岡慧, 吉岡信和, 石川冬樹, 鄭顕志, 本位田真一

    合同エージェントワークショップ&シンポジウム2006 (JAWS2006)  (三重県、日本)  合同エージェントワークショップ&シンポジウム2006 (JAWS2006)

    Presentation date: 2006.10

  • Context-awareなコンテンツ流通のためのセキュリティアーキテクチャ

    清雄一, 粂野文洋, 吉岡信和, 本位田真一

    合同エージェントワークショップ&シンポジウム2006 (JAWS2006)  (三重県、日本)  合同エージェントワークショップ&シンポジウム2006 (JAWS2006)

    Presentation date: 2006.10

  • Recommender Systemの予測精度を上げる:ユーザ類似度の安定によるアイテムクラスターリング手法

    チュオンカンクアン, 石川冬樹, 本位田真一

    合同エージェントワークショップ&シンポジウム2006 (JAWS2006)  (三重県、日本)  合同エージェントワークショップ&シンポジウム2006 (JAWS2006)

    Presentation date: 2006.10

  • センサーの資源制約を考慮したセンシングプログラムの退避行動手法の提案

    石黒真, 鄭顕志, 深澤良彰, 本位田真一

    合同エージェントワークショップ&シンポジウム2006 (JAWS2006)  (三重県、日本)  合同エージェントワークショップ&シンポジウム2006 (JAWS2006)

    Presentation date: 2006.10

  • 効率的なPeer-to-Peer 全文検索

    清雄一, 松崎和賢, 本位田真一

    合同エージェントワークショップ&シンポジウム2005 (JAWS2005)  (神奈川県、日本)  合同エージェントワークショップ&シンポジウム2006 (JAWS2006)

    Presentation date: 2005.11

  • 位置に束縛されたモバイルエージェントによる位置依存情報の収集

    鄭 顕志, 深澤 良彰, 本位田 真一

    合同エージェントワークショップ&シンポジウム2005 (JAWS2005)  (神奈川県、日本)  合同エージェントワークショップ&シンポジウム2006 (JAWS2006)

    Presentation date: 2005.11

  • Folksonomyマイニングに基づくWebページ推薦システム (「マルチエージェントの理論と応用」特集号)

    丹羽智史, 土肥拓生, 本位田真一

    合同エージェントワークショップ&シンポジウム2005 (JAWS2005)  (神奈川県、日本)  合同エージェントワークショップ&シンポジウム2006 (JAWS2006)

    Presentation date: 2005.11

  • 自己制御型コンテンツのポリシーに基づく開発支援手法の提案

    松崎 和賢, 吉岡 信和, 本位田 真一

    合同エージェントワークショップ&シンポジウム2005 (JAWS2005)  (神奈川県、日本)  合同エージェントワークショップ&シンポジウム2006 (JAWS2006)

    Presentation date: 2005.11

  • サービス指向に基づいたマルチメディアコンテンツの自律的な流通と提供

    石川 冬樹, 吉岡 信和, 本位田 真一

    合同エージェントワークショップ&シンポジウム2005 (JAWS2005)  (神奈川県、日本)  合同エージェントワークショップ&シンポジウム2006 (JAWS2006)

    Presentation date: 2005.11

  • KAOSを用いたマルチエージェントシステムの分析支援

    中川 博之, 苅部 卓哉, 本位田 真一

    合同エージェントワークショップ&シンポジウム2005 (JAWS2005)  (神奈川県、日本)  合同エージェントワークショップ&シンポジウム2006 (JAWS2006)

    Presentation date: 2005.11

  • 契約による設計を用いたインタラクションの実装

    土肥 拓生, 吉岡 信和, 田原 康之, 本位田 真一

    合同エージェントワークショップ&シンポジウム2005 (JAWS2005)  (神奈川県、日本)  合同エージェントワークショップ&シンポジウム2006 (JAWS2006)

    Presentation date: 2005.11

  • アドホックネットワークのルーティングへの市場原理の適用

    武藤 宏美, 鄭 顕志, 深澤 良彰, 本位田 真一

    合同エージェントワークショップ&シンポジウム2005 (JAWS2005)  (神奈川県、日本)  合同エージェントワークショップ&シンポジウム2006 (JAWS2006)

    Presentation date: 2005.11

  • ロジック書き換えパターンの検証方法の提案

    吉岡 信和, 本位田 真一

    第11回 ソフトウェア工学の基礎ワークショップ (FOSE2004)  (三重県、日本)  FOSE2004

    Presentation date: 2004.11

  • マルチメディアコンテンツ流通のためのモバイルエージェントのモデル駆動開発

    苅部 卓哉, 吉岡 信和, 田原 康之, 本位田 真一

    第11回 ソフトウェア工学の基礎ワークショップ (FOSE2004)  (三重県、日本)  FOSE2004

    Presentation date: 2004.11

  • マルチエージェントシステムのためのインタラクション主導開発におけるシステム分析

    土肥 拓生, 吉岡 信和, 田原 康之, 本位田 真一

    第11回 ソフトウェア工学の基礎ワークショップ (FOSE2004)  (三重県、日本)  FOSE2004

    Presentation date: 2004.11

  • 階層型モバイルエージェントの自律的な合成のための記述とその基板に関する検討

    石川 冬樹, 田原 康之, 吉岡 信和, 本位田 真一

    第11回 ソフトウェア工学の基礎ワークショップ (FOSE2004)  (三重県、日本)  FOSE2004

    Presentation date: 2004.11

  • P2Pグリッドにおけるモバイルエージェントを用いた生存性の高いサービスの構築

    鄭 顕志, 吉岡 信和, 深澤 良彰, 本位田 真一

    第11回 ソフトウェア工学の基礎ワークショップ (FOSE2004)  (三重県、日本)  FOSE2004

    Presentation date: 2004.11

  • 位置指向設計プロセス:モバイル環境における状況依存アプリケーションのアスペクト指向設計

    松崎 和賢, 吉岡 信和, 本位田 真一

    第11回 ソフトウェア工学の基礎ワークショップ (FOSE2004)  (三重県、日本)  FOSE2004

    Presentation date: 2004.11

  • 位置情報を利用するエージェントのロケーション指向設計

    松崎 和賢, 吉岡 信和, 本位田 真一

    合同エージェントワークショップ&シンポジウム2004 (JAWS2004)  (長野県、日本)  合同エージェントワークショップ&シンポジウム2004 (JAWS2004)

    Presentation date: 2004.10

  • マルチエージェントシステムのインタラクション主導要求分析

    土肥 拓生, 吉岡 信和, 田原 康之, 本位田 真一

    合同エージェントワークショップ&シンポジウム2004 (JAWS2004)  (長野県、日本)  合同エージェントワークショップ&シンポジウム2004 (JAWS2004)

    Presentation date: 2004.10

  • フェロモンモデル:交通渋滞予測への適用

    安藤靖志, 増谷修, 岩崎弘利, 本位田真一, 深澤義彰

    合同エージェントワークショップ&シンポジウム2004 (JAWS2004)  (長野県、日本)  合同エージェントワークショップ&シンポジウム2004 (JAWS2004)

    Presentation date: 2004.10

  • P2P グリッドにおけるサービスの効率的障害退避

    鄭 顕志, 吉岡 信和, 深澤 良彰, 本位田 真一

    合同エージェントワークショップ&シンポジウム2004 (JAWS2004)  (長野県、日本)  合同エージェントワークショップ&シンポジウム2004 (JAWS2004)

    Presentation date: 2004.10

  • 階層型モバイルエージェントの合成における合意記述

    石川 冬樹, 田原 康之, 吉岡 信和, 本位田 真一

    合同エージェントワークショップ&シンポジウム2004 (JAWS2004)  (長野県、日本)  合同エージェントワークショップ&シンポジウム2004 (JAWS2004)

    Presentation date: 2004.10

  • ホットスポットにおけるリソースレンタルシステムの提案と評価

    武藤宏美, 田原康之, 深澤良彰, 本位田真一

    合同エージェントワークショップ&シンポジウム2004 (JAWS2004)  (長野県、日本)  合同エージェントワークショップ&シンポジウム2004 (JAWS2004)

    Presentation date: 2004.10

  • アクティブコンテンツ:コンテンツ流通のためのモバイルエージェントフレームワーク

    苅部卓哉, 吉岡信和, 田原康之, 本位田真一

    合同エージェントワークショップ&シンポジウム2004 (JAWS2004)  (長野県、日本)  合同エージェントワークショップ&シンポジウム2004 (JAWS2004)

    Presentation date: 2004.10

  • コンテンツカプセル化エージェントの動作制御のためのポリシーモデル

    NGUYEN Khanh Ngoc, 石川冬樹, 田原康之, 本位田真一

    合同エージェントワークショップ&シンポジウム2004 (JAWS2004)  (長野県、日本)  合同エージェントワークショップ&シンポジウム2004 (JAWS2004)

    Presentation date: 2004.10

  • P2Pシステムにおける自律型コンテンツの流通

    清雄一, 松崎和賢, 本位田真一

    合同エージェントワークショップ&シンポジウム2004 (JAWS2004)  (長野県、日本)  合同エージェントワークショップ&シンポジウム2004 (JAWS2004)

    Presentation date: 2004.10

  • エージェントのペアリングによる再利用性と動的環境適応性を考慮に入れた記述分離

    松崎 和賢, 吉岡 信和, 本位田 真一

    第10回ソフトウェア工学の基礎ワークショップ(FOSE'03)  (和歌山県、日本)  FOSE'03

    Presentation date: 2003.11

  • Webサービス連携のためのモバイルエージェント動作記述

    石川 冬樹, 田原 康之, 吉岡 信和, 本位田 真一

    第10回ソフトウェア工学の基礎ワークショップ(FOSE'03)  (和歌山県、日本)  FOSE'03

    Presentation date: 2003.11

  • UMLを用いたセキュアなアプリケーション開発のための支援手法

    苅部 卓哉, 吉岡 信和, 本位田 真一

    第10回ソフトウェア工学の基礎ワークショップ(FOSE'03)  (和歌山県、日本)  FOSE'03

    Presentation date: 2003.11

  • エージェント間プロトコル記述言語FOPLの提案

    土肥 拓生, 吉岡 信和, 本位田 真一

    第10回ソフトウェア工学の基礎ワークショップ(FOSE'03)  (和歌山県、日本)  FOSE'03

    Presentation date: 2003.11

  • アドホックなサービス利用を支援するエージェントプラットフォーム拡張の提案

    松崎 和賢, 吉岡 信和, 田原康之, 本位田 真一

    合同エージェントシンポジウム&ワークショップ  (兵庫県、日本)  JAWS 2003

    Presentation date: 2003.10

  • モバイルエージェントによるWebサービス連携モデル

    石川 冬樹, 吉岡 信和, 田原 康之, 本位田 真一

    合同エージェントシンポジウム&ワークショップ  (兵庫県、日本)  JAWS 2003

    Presentation date: 2003.10

  • モバイルエージェントによるデジタルコンテンツ 流通

    苅部卓哉, 吉岡 信和, 田原康之, 本位田 真一

    合同エージェントシンポジウム&ワークショップ  (兵庫県、日本)  JAWS 2003

    Presentation date: 2003.10

  • インタラクションプロトコル記述言語FOPL

    土肥 拓生, 吉岡 信和, 田原 康之, 本位田 真一

    合同エージェントシンポジウム&ワークショップ  (兵庫県、日本)  JAWS 2003

    Presentation date: 2003.10

  • パーベイシブネットワークにおけるWebサービス連携のためのモバイルエージェントシステム

    石川 冬樹, 吉岡 信和, 本位田 真一

    オブジェクト指向シンポジウム2003(OO2003)  (東京、日本)  情報処理学会

    Presentation date: 2003.08

  • 携帯電話アプリケーション開発のためのスクリプトシステムの提案

    直原正樹, 吉岡信和, 深澤良彰, 本位田真一

    エージェント合同シンポジウム (JAWS 2002)  (北海道、日本)  JAWS 2002

    Presentation date: 2002.11

  • モバイル端末連携支援Bee-gent 拡張フレームワーク

    松崎和賢, 吉岡信和, 本位田真一

    エージェント合同シンポジウム (JAWS 2002)  (北海道、日本)  JAWS 2002

    Presentation date: 2002.11

  • Webサービス連携エージェントのためのビヘイビアルール記述言語

    石川冬樹, 吉岡信和, 本位田真一

    エージェント合同シンポジウム (JAWS 2002)  (北海道、日本)  JAWS 2002

    Presentation date: 2002.11

  • モバイルエージェントによるバッテリ切れ避難システム : Easter

    金子平祐, 深澤良彰, 粂野文洋, 吉岡信和, 本位田真一

    エージェント合同シンポジウム (JAWS 2002)  (北海道、日本)  JAWS 2002

    Presentation date: 2002.11

  • PCクラスタに対応したマルチエージェントシステムの提案

    吉岡信和, 鄭顕志, 深澤良彰, 本位田真一

    エージェント合同シンポジウム (JAWS 2002)  (北海道、日本)  JAWS 2002

    Presentation date: 2002.11

  • 携帯電話上で記述・即時実行可能なネットワークスクリプトFlipcast

    上野晃嗣, 釜洞健太郎, 川村隆浩, 長谷川哲夫, 大須賀昭彦, 本位田真一

    オブジェクト指向2002シンポジウム  (日本)  オブジェクト指向2002シンポジウム

    Presentation date: 2002.08

  • パターンを利用したセキュアかつ効率的なモバイルエージェントアプリケーション開発

    田原康之, 吉岡信和, 大須賀昭彦, 本位田真一

    オブジェクト指向2002シンポジウム  (日本)  オブジェクト指向2002シンポジウム

    Presentation date: 2002.08

  • モバイルミドルウェアにおけるエージェント移動制御

    広重 一仁, 川上 憲治, 本位田 真一

    マルチメディア,分散,協調とモバイルシンポジウム,DICOMO 2002  (日本)  情報処理学会

    Presentation date: 2002.01

  • モバイル環境向けエージェント移動制御 (その2)

    川上 憲治, 広重 一仁, 吉岡 信和, 本位田 真一

    モバイルコンピューティングとワイヤレス通信研究会  (東京、日本)  情報処理学会

    Presentation date: 2002.01

  • モバイル環境向けエージェント移動制御

    川上 憲治, 広重 一仁, 佐々木 宏, 岡宅 泰邦, 本位田 真一

    モバイルコンピューティングとワイヤレス通信研究会  (東京、日本)  情報処理学会

    Presentation date: 2002.01

  • エージェント指向技術

    本位田真一

    -ネットワークコンピューティングのソフトウェア技術- 情報処理学会「オブジェクト指向シンポジウム’98」 

    Presentation date: 1998.09

  • デザインパターン

    本位田真一

    情報処理学会「オブジェクト指向シンポジウム'96」 

    Presentation date: 1996.07

  • Object-Oriented Software Engineering

    本位田真一

    Tutorial in 2nd International Symposium on Object Technologies for Advanced Software, ISOTAS'96 

    Presentation date: 1996.03

  • オブジェクト指向開発の実践と課題

    本位田真一  [Invited]

    情報処理学会 関西支部,平成7年度第2回関西支部セミナー「オブジェクト指向分析・設計の最新動向および開発事例」 

    Presentation date: 1996.01

  • オブジェクト指向開発の実践と課題

    本位田真一  [Invited]

    情報処理学会「オブジェクト指向シンポジウム'95」 

    Presentation date: 1995.06

  • オブジェクト指向開発とは

    本位田真一

    情報処理学会「オブジェクト指向開発の実践と課題」連続セミナー'94 

    Presentation date: 1994.11

  • Formalizing Specification Modeling in OOA

    S. Honiden  [Invited]

    Object World Germany'94 

    Presentation date: 1994.09

  • オブジェクト指向分析・設計

    本位田真一

    日本ソフトウェア科学会チュートリアル「 オブジェクト指向選りすぐり」 

    Presentation date: 1993.12

  • オブジェクト指向分析・設計総論

    本位田真一

    情報処理学会「 オブジェクト指向分析・設計」チュートリアル 

    Presentation date: 1993.05

  • オブジェクト指向分析・設計-実践と評価

    本位田真一

    情報処理学会九州支部講習会 

    Presentation date: 1992.11

  • 協調型ソフトウェア・アーキテクチャ

    本位田真一

    情報処理学会第45回全国大会「 チュートリアル・セッション」 

    Presentation date: 1992.10

  • ソフトウェア工学とAI

    本位田真一

    1992年度人工知能学会全国大会(第6回)チュートリアル講演 

    Presentation date: 1992.06

  • 協調型ソフトウェア・アーキテクチャ

    本位田真一

    日本ソフトウェア科学会チュートリアル「 分散人工知能ー協調計算とマルチエージェント・システム」 

    Presentation date: 1992.05

  • OOA/OODの上流CASE

    本位田真一

    日本ソフトウェア科学会サマーチュートリアル「 90年代のCASE」 

    Presentation date: 1991.08

  • OOA/OOD

    本位田真一

    日本ソフトウェア科学会イブニングチュートリアル「 オブジェクト指向選りすぐり」 

    Presentation date: 1991.06

  • OOA/OOD

    本位田真一

    日本ソフトウェア科学会イブニングチュートリアル「 オブジェクト指向選りすぐり」 

    Presentation date: 1991.02

▼display all

Specific Research

  • 体感品質に基づいたユビキタスサービスの開発を支援するフレームワークの検討

    2018   鄭顕志

     View Summary

    大型の外部資金が獲得できた場合の最終的な目標は、視覚・聴覚によるユーザ体感への影響に基づく機器管理システムと、使用できる機器に応じて体感品質を最大化するようサービスフローを変更するサービスモデルフレームワークを提案し、それらを統合したユビキタスサービスフレームワークを開発することで、高品質なユビキタスサービスの開発コストを低減することである。それを見据えて、本特定課題研究助成費において、実施項目1では,視覚・聴覚効果に基づく機器管理システムの概要を検討し、実施項目2では体感品質を最大化するサービスフロー切替えに対応したサービスモデルフレームワークの構築手法を検討した。

  • 保証を伴うしなやかなシステムを実現する制御理論融合自己適応ソフトウェアシステ ム

    2018   鄭顕志

     View Summary

    制御理論とソフトウェア工学技術を融合した自己適応ソフトウェア開発方法論を構築し、さらに不確かなオープン環境下におけるソフトウェアシステムの品質保証を可能とするソフトウェアアーキテクチャの構築を目指している。その具体化への足がかりとして、代表的なマルチエージェントプラットフォームであるJADEを利用して、自己適応システムを実現するプラットフォームの設計、実装し、&nbsp;制御理論を扱うための機能拡張を行った。また、制御理論による自己適応システムを実現するプラットフォーム上で動作するサンプルアプリケーションを開発し、ソフトウェアアーキテクチャの有用性を確認した。

 

Syllabus

▼display all