Authorship：Corresponding author   Language：Japanese   Publishing type：Research paper (scientific journal)  

DOI： 10.14923/transinfj.2023LIP0004

researchmap

Authorship：Lead author,　Corresponding author   Language：English   Publishing type：Research paper (international conference proceedings)  

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)  

researchmap

Authorship：Lead author,　Corresponding author   Language：English   Publishing type：Research paper (international conference proceedings)  

researchmap

Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

researchmap

Authorship：Corresponding author   Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

researchmap

Authorship：Corresponding author   Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)  

researchmap

Authorship：Corresponding author   Language：English   Publishing type：Research paper (international conference proceedings)  

researchmap

Authorship：Corresponding author   Language：English   Publishing type：Research paper (international conference proceedings)  

researchmap

Authorship：Corresponding author   Language：Japanese   Publishing type：Research paper (scientific journal)  

researchmap

Authorship：Corresponding author   Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

researchmap

Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

researchmap

Authorship：Corresponding author   Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

researchmap

Authorship：Last author   Language：English   Publishing type：Research paper (international conference proceedings)  

DOI： 10.5220/0012352200003636

researchmap

Other Link： https://dblp.uni-trier.de/db/conf/icaart/icaart2024-3.html#RenNT24

Authorship：Corresponding author   Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

researchmap

Authorship：Corresponding author   Language：Japanese   Publishing type：Research paper (scientific journal)  

researchmap

Authorship：Corresponding author   Language：English   Publishing type：Research paper (international conference proceedings)  

researchmap

Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

researchmap

Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

researchmap

Authorship：Corresponding author   Language：English   Publishing type：Research paper (conference, symposium, etc.)  

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)  

researchmap

Authorship：Lead author,　Corresponding author   Language：English   Publishing type：Research paper (international conference proceedings)  

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)  

researchmap

Authorship：Corresponding author   Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

researchmap

Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

researchmap

Authorship：Corresponding author   Language：English   Publishing type：Research paper (international conference proceedings)  

researchmap

Authorship：Corresponding author   Language：English   Publishing type：Research paper (scientific journal)  

researchmap

Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

researchmap

Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

researchmap

Authorship：Last author,　Corresponding author   Language：English   Publishing type：Research paper (international conference proceedings)  

researchmap

Authorship：Corresponding author   Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

researchmap

Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

researchmap

Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

researchmap

Authorship：Corresponding author   Language：English   Publishing type：Research paper (international conference proceedings)  

researchmap

Authorship：Corresponding author   Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

researchmap

Authorship：Corresponding author   Language：Japanese   Publishing type：Research paper (scientific journal)  

DOI： 10.11309/jssst.40.1_11

researchmap

Authorship：Corresponding author   Language：English   Publishing type：Research paper (scientific journal)   Publisher：IOS Press  

User review is a crucial component of open mobile app market, such as the Google Play Store. These markets allow users to submit reviews for downloaded apps. By analyzing these reviews, app developers can find new or missing features. However, owing to the huge number of reviews, this manual process is time-consuming and unscalable. An automatic method for user review clustering and goal-model identification has been proposed. However, this method limits the numbers of sub-goals in the goal model. To address this, we propose a comprehensive user review clustering method. This method comprises two components. One is a latent Dirichlet allocation (LDA) model, which clusters user reviews into several topics. The other is a distance-based clustering algorithm, which is an improved version of the existing clustering method.

DOI： 10.3233/idt-220269

researchmap

Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

researchmap

Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

researchmap

Authorship：Corresponding author   Language：English   Publishing type：Research paper (international conference proceedings)  

researchmap

Authorship：Corresponding author   Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

researchmap

Authorship：Corresponding author   Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

researchmap

Authorship：Corresponding author   Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

researchmap

Authorship：Corresponding author   Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

researchmap

Authorship：Corresponding author   Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

researchmap

Language：English   Publishing type：Research paper (conference, symposium, etc.)  

researchmap

Authorship：Corresponding author   Language：English   Publishing type：Research paper (international conference proceedings)  

DOI： 10.15439/2022F25

researchmap

Other Link： https://dblp.uni-trier.de/db/conf/fedcsis/fedcsis2022c.html#IkedaNT22

Language：English   Publishing type：Research paper (international conference proceedings)  

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)  

researchmap

Authorship：Corresponding author   Language：English   Publishing type：Research paper (international conference proceedings)  

researchmap

Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

researchmap

Authorship：Lead author,　Corresponding author   Language：English   Publishing type：Research paper (scientific journal)  

DOI： 10.48550/arXiv.2205.13375

researchmap

Authorship：Corresponding author   Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

researchmap

Authorship：Corresponding author   Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

researchmap

Authorship：Corresponding author   Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)  

researchmap

Authorship：Corresponding author   Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

researchmap

Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

researchmap

Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

researchmap

Authorship：Corresponding author   Language：English   Publishing type：Research paper (international conference proceedings)  

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：KSI Research Inc.  

DOI： 10.18293/seke2021-122

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：IEEE  

DOI： 10.1109/compsac51774.2021.00247

researchmap

Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

researchmap

Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

researchmap

Authorship：Corresponding author   Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

researchmap

Authorship：Last author   Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

researchmap

Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

researchmap

Publishing type：Research paper (scientific journal)   Publisher：Elsevier BV  

DOI： 10.1016/j.infsof.2020.106346

researchmap

Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

researchmap

Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

researchmap

Authorship：Corresponding author   Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：IEEE  

DOI： 10.1109/acsos-c51401.2020.00063

researchmap

Authorship：Corresponding author   Language：English   Publishing type：Research paper (international conference proceedings)  

researchmap

Authorship：Lead author   Language：English   Publishing type：Research paper (scientific journal)  

Copyright © 2020 The Institute of Electronics, Information and Communication Engineers Goal modeling is a method that describes requirements structurally. Goal modeling mainly consists of two tasks: extraction of goals and organization of the extracted goals. Generally, the process of the goal modeling requires intensive manual intervention and higher modeling skills than the process of the usual requirements description. In order to mitigate this problem, we propose a method that provides systematic supports for constructing goal models. In the method, the requirement analyst answers questions and a goal model is semi-automatically constructed based on the answers made. We develop a prototype tool that implements the proposed method and apply it to two systems. The results demonstrate the feasibility of the method.

DOI： 10.1587/transinf.2019KBP0015

Scopus

researchmap

Language：English   Publishing type：Research paper (scientific journal)   Publisher：IOS Press  

© 2020 - IOS Press and the authors. All rights reserved. Combinatorial interaction testing is an efficient software testing strategy. If all interactions among test parameters or factors needed to be covered, the size of a required test suite would be prohibitively large. In contrast, this strategy only requires covering t-wise interactions where t is typically very small. As a result, it becomes possible to significantly reduce test suite size. Locating arrays aim to enhance the ability of combinatorial interaction testing. In particular, ( 1 ,t ) -locating arrays can not only execute all t-way interactions but also identify, if any, which of the interactions causes a failure. In spite of this useful property, there is only limited research either on how to generate locating arrays or on their minimum sizes. In this paper, we propose an approach to generating minimum locating arrays. In the approach, the problem of finding a locating array consisting of N tests is represented as a Constraint Satisfaction Problem (CSP) instance, which is in turn solved by a modern CSP solver. The results of using the proposed approach reveal many ( 1 ,t ) -locating arrays that are smallest known so far. In addition, some of these arrays are proved to be minimum.

DOI： 10.3233/fi-2020-1929

Scopus

researchmap

Authorship：Corresponding author   Language：English   Publishing type：Research paper (international conference proceedings)  

Copyright © 2020 for this paper by its authors. User reviews play a vital role in mobile application development. New users can grasp the pros and cons of an app from user reviews, and de- velopers can improve the app by addressing the issues mentioned in the user reviews. However, scanning and analyzing massive user reviews is always a challenging and time-consuming task for both users and de- velopers. This paper proposes a solution to build a tool for analyzing and organizing user reviews. To analyze user reviews, we classify the sentences in the reviews into predefined categories by using a machine learning algorithm; then, we apply text classification techniques to de- termine the review sentence's polarity and finally to mine key phrases from the sentences. We conducted an experiment using user reviews for two messaging apps. The experimental results demonstrate that we can organize the core information of each review and present the information to users and developers in respectively different ways.

Scopus

researchmap

Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

researchmap

Authorship：Corresponding author   Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

researchmap

Authorship：Last author,　Corresponding author   Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)  

DOI： 10.1145/3341105.3374033

researchmap

Other Link： https://dblp.uni-trier.de/db/conf/sac/sac2020.html#NakagawaOAK20

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Authorship：Corresponding author   Language：Japanese   Publishing type：Research paper (scientific journal)  

researchmap

Language：English   Publishing type：Research paper (scientific journal)  

researchmap

Language：English   Publishing type：Research paper (scientific journal)  

researchmap

Language：English   Publishing type：Research paper (scientific journal)  

© 2020 - IOS Press and the authors. All rights reserved. Combinatorial interaction testing is an efficient software testing strategy. If all interactions among test parameters or factors needed to be covered, the size of a required test suite would be prohibitively large. In contrast, this strategy only requires covering t-wise interactions where t is typically very small. As a result, it becomes possible to significantly reduce test suite size. Locating arrays aim to enhance the ability of combinatorial interaction testing. In particular, ( 1 ,t ) -locating arrays can not only execute all t-way interactions but also identify, if any, which of the interactions causes a failure. In spite of this useful property, there is only limited research either on how to generate locating arrays or on their minimum sizes. In this paper, we propose an approach to generating minimum locating arrays. In the approach, the problem of finding a locating array consisting of N tests is represented as a Constraint Satisfaction Problem (CSP) instance, which is in turn solved by a modern CSP solver. The results of using the proposed approach reveal many ( 1 ,t ) -locating arrays that are smallest known so far. In addition, some of these arrays are proved to be minimum.

DOI： 10.3233/FI-2020-1929

Scopus

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Authorship：Lead author,　Corresponding author   Language：English   Publishing type：Research paper (international conference proceedings)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：Springer  

Outstanding paper

DOI： 10.1007/978-3-030-25213-7_5

researchmap

Other Link： https://dblp.uni-trier.de/db/conf/ACISicis/ACISicis2019b.html#YamagataNSTO19

Language：English   Publishing type：Research paper (international conference proceedings)  

researchmap

Authorship：Corresponding author   Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publisher：Japan Society for Software Science and Technology  

<p></p>

DOI： 10.11309/jssst.36.2_2

CiNii Article

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：IEEE  

DOI： 10.1109/APSEC.2018.00089

researchmap

Other Link： https://dblp.uni-trier.de/db/conf/apsec/apsec2018.html#AokiOKN18

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)  

© Springer Nature Switzerland AG 2018. The spread of Cyber-Physical Systems (CPSs) leads developers to embed various agents in a large system. It is a complicated and difficult task to analyze and design such systems from comprehensive specifications such as an architecture document because many behaviors of many components including agents must be dealt with. In such a system, the appropriateness of interactions between components should be ensured. However, no method to efficiently define and verify behaviors in such interactions from such specifications taking into consideration the characteristics of CPSs has been proposed. To improve this situation, this paper preliminarily proposes a stepwise method to define and verify behaviors in interactions between CPS components. More specifically, a template system to stepwise define behaviors from an abstract level to a concrete level is presented based on an existing architecture modeling method. Furthermore, a model transformation tool for verifying such behavior definitions by using the model checking tool NuSMV is introduced.

DOI： 10.1007/978-3-030-03098-8_44

Scopus

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)  

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (scientific journal)  

DOI： 10.11309/jssst.35.1_67

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：Springer Verlag  

A goal model, which is one of the common requirements models, has advantages of formalizing and visualizing results of requirements analysis. The model regards a requirement as a goal, and the root goal that is achieved by system execution should be decomposed to precondition goals. Current systems are large and complexed, so that there are a lot of requirements to be implemented. Therefore it is difficult to extract all goals and construct an elaborated goal model manually. In this paper we propose a process to support constructing goal models from requirements descriptions written in a natural language. In the proposed process, extraction rules are used to extract goals from requirements descriptions and then to construct a goal model from the goals. To evaluate our process, we applied the process to two system descriptions to construct goal models. The results show that the proposed process extracted appropriate goals and successfully assembled these goals in a goal hierarchy. We also report preliminary results of automating the proposed process.

DOI： 10.1007/978-981-10-7796-8_14

Scopus

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)  

The spread of IoT (Internet of Things) categorized into a type of cyber-physical system makes future systems larger and more complex than ever. Various components such as cloud services, edges, devices and energy suppliers play important roles when constructing an IoT system. Moreover, components in such systems have various relationships to other components. Hence, a simple and extendable specification notation for grasping such relationships is sought for architectural design of IoT systems. When we design such IoT Systems, effective verification also should be provided so that we can identify critical system faults. We present a tool to edit and verify IoT system architecture models. The tool extends a UML editor to enable easy editing of architectural models, and verifies them using the logic programming language Prolog.

Scopus

researchmap

Authorship：Lead author,　Corresponding author   Language：Japanese  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：Institute of Electrical and Electronics Engineers Inc.  

Code coverage is a metric used to represent how much code is tested when particular test cases are executed. As is code coverage, specification coverage is expected to help us to comprehend how much specification to be implemented is tested. In this study, we propose a visualization process for specification coverage. This process finds traceability links between specifications and test cases using a similarity metric and constructs two views for visualization. We develop a prototype tool for automatically executing the process and evaluate the process in a preliminary experiment on a web application development in industry. This extended abstract explains the overview of our study and the preliminary results.

DOI： 10.1109/ICSE-C.2017.117

Scopus

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：Institute of Electrical and Electronics Engineers Inc.  

Code coverage is a metric used to represent how much code is tested when particular test cases are executed. As is code coverage, specification coverage is expected to help us to comprehend how much specification to be implemented is tested. In this study, we propose a visualization process for specification coverage. This process finds traceability links between specifications and test cases using a similarity metric and constructs two views for visualization. We develop a prototype tool for automatically executing the process and evaluate the process in a preliminary experiment on a web application development in industry. This extended abstract explains the overview of our study and the preliminary results.

DOI： 10.1109/ICSE-C.2017.117

Scopus

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：IEEE  

Locating arrays provide combinatorial test suites not only for detecting the presence of an interaction fault but also for locating the fault. Compared with test suites for ordinary combinatorial testing, however, the fault locating capability entails a substantial increase in the size of test suites. In this position paper, we consider the problem: how small can locating arrays be? To answer the question, we develop a method that finds a locating array of a given size using a SAT solver. We report the size of the smallest locating arrays discovered by using our method. This result provides the smallest known upper bound on the size of the minimum locating arrays.

DOI： 10.1109/ICSTW.2017.49

Web of Science

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：IEEE  

Specifications for a software system are usually verified using test cases in the testing phase. As is code coverage, specification coverage is expected to help comprehend how many specifications to be implemented are tested. In this study, we apply a visualization process for specification coverage to a web application development project in industry. This process provides two views for visualization from different viewpoints. The process also provides a classification of specifications according to the assurance degree of test execution. The results of the case study demonstrate that the process provides effective measures to comprehend how many specifications are covered and discovers trends related to the project.

DOI： 10.1109/ISSREW.2017.19

Web of Science

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)  

researchmap

Language：English   Publishing type：Research paper (scientific journal)  

DOI： 10.1587/transinf.2015KBP0010

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：English   Publishing type：Research paper (scientific journal)   Publisher：IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG  

Pair-wise testing is an effective test planning technique for finding interaction faults using a small set of test cases. Constraint elicitation is an important process in the pair-wise testing design since constraints determine the test space; however, the constraint elicitation process has not been well studied. It usually requires manual capturing and precise definition of constraints. In this paper, we propose a constraint elicitation process that helps combinatorial test design. Our elicitation process consists of two steps: parameter combination identification and value pair determination. We conduct experiments on some test models, and demonstrate that some extracted rules match constraints and others helps to define constraints.

DOI： 10.1587/transinf.2015KBP0010

Web of Science

researchmap

Other Link： http://dblp.uni-trier.de/db/journals/ieicet/ieicet99d.html#journals/ieicet/NakagawaT16

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (scientific journal)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：English   Publishing type：Research paper (scientific journal)   Publisher：IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG  

The objective of this paper is to recognize and classify the poses of idols in still images on the web. The poses found in Japanese idol photos are often complicated and their classification is highly challenging. Although advances in computer vision research have made huge contributions to image recognition, it is not enough to estimate human poses accurately. We thus propose a method that refines result of human pose estimation by Pose Guide Ontology (PGO) and a set of energy functions. PGO, which we introduce in this paper, contains useful background knowledge, such as semantic hierarchies and constraints related to the positional relationship between body parts. Energy functions compute the right positions of body parts based on knowledge of the human body. Through experiments, we also refine PGO iteratively for further improvement of classification accuracy. We demonstrate pose classification into 8 classes on a dataset containing 400 idol images on the web. Result of experiments shows the efficiency of PGO and the energy functions; the F-measure of classification is 15% higher than the non-refined results. In addition to this, we confirm the validity of the energy functions.

DOI： 10.1587/transinf.2015EDP7067

Web of Science

researchmap

Language：English   Publishing type：Research paper (scientific journal)   Publisher：IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG  

The objective of this paper is to recognize and classify the poses of idols in still images on the web. The poses found in Japanese idol photos are often complicated and their classification is highly challenging. Although advances in computer vision research have made huge contributions to image recognition, it is not enough to estimate human poses accurately. We thus propose a method that refines result of human pose estimation by Pose Guide Ontology (PGO) and a set of energy functions. PGO, which we introduce in this paper, contains useful background knowledge, such as semantic hierarchies and constraints related to the positional relationship between body parts. Energy functions compute the right positions of body parts based on knowledge of the human body. Through experiments, we also refine PGO iteratively for further improvement of classification accuracy. We demonstrate pose classification into 8 classes on a dataset containing 400 idol images on the web. Result of experiments shows the efficiency of PGO and the energy functions; the F-measure of classification is 15% higher than the non-refined results. In addition to this, we confirm the validity of the energy functions.

DOI： 10.1587/transinf.2015EDP7067

Web of Science

researchmap

Other Link： http://dblp.uni-trier.de/db/journals/ieicet/ieicet99d.html#journals/ieicet/TashiroKSNTO16

Publisher：CEUR-WS.org  

researchmap

Other Link： http://dblp.uni-trier.de/db/conf/models/runtime2016.html#conf/models/NakagawaOT16

Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：IEEE  

For systems that have time constraints, an increase of processing time causes a delay of behavior and may result in a system failure. Although it is desirable to implement these systems as self-adaptive systems, there is no programming framework for self-adaptive systems that can deal with time constraints dynamically. In this study, we propose a mechanism for verifying system behaviors against time constraints at runtime. This mechanism uses UPPAAL, a model checking tool, for dynamic verification. We develop a prototype of a programming framework that uses the proposed mechanism. The results of evaluating the framework on a simulation experiment demonstrate the feasibility of our approach.

DOI： 10.1109/FAS-W.2016.62

Web of Science

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：IEEE  

For systems that have time constraints, an increase of processing time causes a delay of behavior and may result in a system failure. Although it is desirable to implement these systems as self-adaptive systems, there is no programming framework for self-adaptive systems that can deal with time constraints dynamically. In this study, we propose a mechanism for verifying system behaviors against time constraints at runtime. This mechanism uses UPPAAL, a model checking tool, for dynamic verification. We develop a prototype of a programming framework that uses the proposed mechanism. The results of evaluating the framework on a simulation experiment demonstrate the feasibility of our approach.

DOI： 10.1109/FAS-W.2016.62

Web of Science

researchmap

Language：Japanese   Publishing type：Research paper (scientific journal)   Publisher：Japan Society for Software Science and Technology  

In the software development, modeling business process is important. In constructing business process model appropriately, stakeholder's requirements should be reflected in the model. Therefore, in this research, we propose transformation approach from goal models using refinement pattern to business process models. It is denoted that rules of transformation and algorithm. Using our approach supports constructing business process models by specifying stakeholder's requirements formally using refinement patterns. We evaluate the effectiveness of our approach through applying our approach for a number of cases and using model-checking techniques.

DOI： 10.11309/jssst.32.4_141

CiNii Article

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (scientific journal)  

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)  

DOI： 10.1109/RET.2015.14

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (scientific journal)  

researchmap

Language：Japanese   Publishing type：Research paper (scientific journal)   Publisher：Japanese Society for Artificial Intelligence  

Nowadays, anybody can easily express their opinion publicly through Consumer Generated Media. Because of this, a phenomenon of flooding criticism on the Internet, called flaming, frequently occurs. Although there are strong demands for flaming management, a service to reduce damage caused by a flaming after one occurs, it is very difficult to properly do so in practice. We are trying to keep the flaming from happening. It is necessary to identify the situation and the remark which are likely to cause flaming for our goal. Concretely, we propose methods to identify a potential tweet which will be a likely candidate of a flaming on Twitter, considering public opinion among Twitter users. Among three categories of flamings, our main focus is Struggles between Conflicting Values (SBCV), which is defined as a remark that forces one’s own opinion about a topic on others. Forecasting of this type of flamings is potentially desired since most of its victims are celebrities, who need to care one’s own social images. We proceed with a working hypothesis: a SBCV is caused by a gap between the polarity of the remark and that of public opinion. First, we have visualized the process how a remark gets flamed when its content is far from public opinion, by means of our original parameter daily polarity (dp). Second, we have built a highly accurate flaming prediction model with decision tree learning, using cumulative dp as an attribute along with parameters available from Twitter APIs. The experimental result suggests that the hypothesis is correct.

DOI： 10.1527/tjsai.30.152

Scopus

researchmap

Language：Japanese  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：IEEE  

Constraint elicitation is an important process in test design since constraints determine the test space; however, the constraint elicitation process, which is known as a daunting task, has not been well studied. It usually requires manual capturing and precise definition of constraints. In this paper, we try to automate a part of the constraint elicitation process in combinatorial test design. Pair-wise testing, a common combinatorial testing approach, is an effective test planning technique for finding interaction faults using a small set of test cases. We propose a collective intelligence approach to determining which value combinations are potential constraints. We conduct preliminary experiments on two examples, a traditional cross-browser testing example and an ATM system example, and evaluate the feasibility of our approach.

DOI： 10.1109/ASEW.2015.13

Web of Science

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：IEEE  

This paper focuses on the constraints elicitation in the combinatorial test design. Pair-wise testing, a common combinatorial testing approach, is an effective test planning technique to find interaction faults from the relatively small set of test cases. The test space is modeled by a set of parameters, their individual values, and constraints on the value combinations. Constraints reduce the test space; however, little consideration has been given to the process of finding them. The goal of our study is to establish an automatic constraints acquisition from the requirements document. We try to establish a constraints elicitation mechanism that helps to extract constraints from the requirements document based on a linguistic approach. In this paper, as the first step, we attempt to extract the coupling strength between parameters from the requirements document. We conducted a preliminary experiment on an ATM system example and evaluated the feasibility of our approach.

DOI： 10.1109/RET.2015.14

Web of Science

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：SPRINGER INT PUBLISHING AG  

Self-adaptive systems can deal with environmental changes by changing their own behaviors. Since self-adaptive systems modify their own behaviors dynamically, runtime verification is necessary to guarantee the correctness of the systems' behaviors. Discrete time Markov chain model checking is a promising approach for implementing runtime verification; however, the computational cost of the current model checking approach increases as the number of parameterized transition probabilities increases. In this study, we conduct experiments on various instances of Markov chain models and demonstrate that repeated application of Laplace expansion leads to the large computational cost. The results suggest that an approach to reducing the number of times of performing Laplace expansion should be developed.

DOI： 10.1007/978-3-662-49224-6_21

Web of Science

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：SPRINGER INT PUBLISHING AG  

Self-adaptive systems can deal with environmental changes by changing their own behaviors. Since self-adaptive systems modify their own behaviors dynamically, runtime verification is necessary to guarantee the correctness of the systems' behaviors. Discrete time Markov chain model checking is a promising approach for implementing runtime verification; however, the computational cost of the current model checking approach increases as the number of parameterized transition probabilities increases. In this study, we conduct experiments on various instances of Markov chain models and demonstrate that repeated application of Laplace expansion leads to the large computational cost. The results suggest that an approach to reducing the number of times of performing Laplace expansion should be developed.

DOI： 10.1007/978-3-662-49224-6_21

Web of Science

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：IEEE  

Self-adaptive systems can adapt to environmental changes. In spite of many studies of self-adaptive systems, there are few implementations of them on real-world hardware. One of the main reasons for this is that the existing programming frameworks do not pay enough attention to the constraints on real-world hardware. In this study, we focus on an adaptation mechanism for real-world embedded systems and present a preliminary programming framework to implement self-adaptive embedded systems. As a case study we build a self-adaptive system using our framework on LEGO Mindstorms EV3 to demonstrate the feasibility of our framework.

DOI： 10.1109/SASO.2015.33

Web of Science

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：Knowledge Systems Institute Graduate School  

Feedback comments, such as mailing lists and reviews, contain beneficial suggestion for software developers. Recently, developers have received more and more feedback comments
but it is still difficult to extract beneficial comments from a large amount of e-mail message or reviews. Latent Dirichlet Allocation (LDA) is a promising way of topic modeling, which classifies documents according to implicit multiple topics. In this paper, we tried to apply a requirements elicitation based on LDA to two different sources, i.e., Apache Commons User List and App Store reviews, and discuss the feasibility of this approach. An interesting finding was that some usual stop words indicated requirements description. This suggests that these words should be removed from the stop word list before applying LDA.

DOI： 10.18293/SEKE2015-103

Scopus

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：IEEE  

Self-adaptive systems can adapt to environmental changes. In spite of many studies of self-adaptive systems, there are few implementations of them on real-world hardware. One of the main reasons for this is that the existing programming frameworks do not pay enough attention to the constraints on real-world hardware. In this study, we focus on an adaptation mechanism for real-world embedded systems and present a preliminary programming framework to implement self-adaptive embedded systems. As a case study we build a self-adaptive system using our framework on LEGO Mindstorms EV3 to demonstrate the feasibility of our framework.

DOI： 10.1109/SASO.2015.33

Web of Science

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：Knowledge Systems Institute Graduate School  

Feedback comments, such as mailing lists and reviews, contain beneficial suggestion for software developers. Recently, developers have received more and more feedback comments
but it is still difficult to extract beneficial comments from a large amount of e-mail message or reviews. Latent Dirichlet Allocation (LDA) is a promising way of topic modeling, which classifies documents according to implicit multiple topics. In this paper, we tried to apply a requirements elicitation based on LDA to two different sources, i.e., Apache Commons User List and App Store reviews, and discuss the feasibility of this approach. An interesting finding was that some usual stop words indicated requirements description. This suggests that these words should be removed from the stop word list before applying LDA.

DOI： 10.18293/SEKE2015-103

Scopus

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：IEEE Computer Society  

This article discusses the location of faulty interactions in software testing. We propose an algorithm to generate a test suite that can be used to identify a faulty pair-wise interaction. This approach works as follows. First, a test suite is generated using an existing method for pair-wise testing. Pair-wise testing requires testing all pair-wise interactions but does not guarantee that the faulty interaction can be located. Second, pair-wise interactions that cannot be located by the test suite are enumerated. Finally, test cases are repeatedly added to the test suite until all pair-wise interactions can be located. The results of applying the algorithm to several problem instances show that the test suites obtained using the algorithm are nearly twice as large as those for ordinary pair-wise testing which does not ensure fault locating ability.

DOI： 10.1109/PRDC.2014.26

Scopus

researchmap

Language：Japanese   Publishing type：Research paper (other academic)   Publisher：Information Processing Society of Japan (IPSJ)  

This paper gives our report on the 22st IEEE International Requirements Engineering Conference (RE2014) held in Karlskrona of Sweden on August 18-22, 2014.

CiNii Article

CiNii Books

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (scientific journal)  

DOI： 10.11309/jssst.31.3_58

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (scientific journal)  

DOI： 10.11309/jssst.31.3_70

researchmap

Language：Japanese   Publishing type：Research paper (scientific journal)  

DOI： 10.11309/jssst.31.2_67

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)  

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)  

researchmap

Publishing type：Research paper (international conference proceedings)   Publisher：SciTePress  

DOI： 10.5220/0004916606390644

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：IEEE  

This article discusses the location of faulty interactions in software testing. We propose an algorithm to generate a test suite that can be used to identify a faulty pair-wise interaction. This approach works as follows. First, a test suite is generated using an existing method for pair-wise testing. Pair-wise testing requires testing all pair-wise interactions but does not guarantee that the faulty interaction can be located. Second, pair-wise interactions that cannot be located by the test suite are enumerated. Finally, test cases are repeatedly added to the test suite until all pair-wise interactions can be located. The results of applying the algorithm to several problem instances show that the test suites obtained using the algorithm are nearly twice as large as those for ordinary pair-wise testing which does not ensure fault locating ability.

DOI： 10.1109/PRDC.2014.26

Web of Science

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：IEEE  

This article discusses the location of faulty interactions in software testing. We propose an algorithm to generate a test suite that can be used to identify a faulty pair-wise interaction. This approach works as follows. First, a test suite is generated using an existing method for pair-wise testing. Pair-wise testing requires testing all pair-wise interactions but does not guarantee that the faulty interaction can be located. Second, pair-wise interactions that cannot be located by the test suite are enumerated. Finally, test cases are repeatedly added to the test suite until all pair-wise interactions can be located. The results of applying the algorithm to several problem instances show that the test suites obtained using the algorithm are nearly twice as large as those for ordinary pair-wise testing which does not ensure fault locating ability.

DOI： 10.1109/PRDC.2014.26

Web of Science

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：IEEE  

This paper reports a case study where pair-wise testing was applied to a real-world program. In particular we focus on weighting, an added feature which allows the tester to prioritize particular parameter values. In our previous work we proposed a weighting method that can reflect given weights in the resulting test suite more directly than can existing methods. To asses the effects of weighting in a practical testing process, we compare the number of execution times of the program's methods among three pair-wise test suites, including the test suite generated by our weighting method and those generated by an existing test case generation tool with and without the weighting option. The results show that the effects of weighting were most clearly observed when our weighting method was used.

DOI： 10.1109/ISSREW.2014.63

Web of Science

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：IEEE  

This paper reports a case study where pair-wise testing was applied to a real-world program. In particular we focus on weighting, an added feature which allows the tester to prioritize particular parameter values. In our previous work we proposed a weighting method that can reflect given weights in the resulting test suite more directly than can existing methods. To asses the effects of weighting in a practical testing process, we compare the number of execution times of the program's methods among three pair-wise test suites, including the test suite generated by our weighting method and those generated by an existing test case generation tool with and without the weighting option. The results show that the effects of weighting were most clearly observed when our weighting method was used.

DOI： 10.1109/ISSREW.2014.63

Web of Science

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：IEEE  

Software evolution is an essential activity that adapts existing software to changes in requirements. Because of recent rapid requirements changes, systems are strongly required to evolve even if the target systems are embedded systems, whose implementation code is generally hard to be changed. This paper discusses the feasibility of applying self-adaptation mechanism for software evolution. We use the MAPE loop mechanism to evolve embedded systems without changing code inside the existing systems. This paper also reports preliminary results that we experimentally evolved a cleaning robot by following our approach. Our demonstrations show a part of additional behaviors as the results of software evolution that makes the cleaning robot possible to move obstacles. We also discuss the future directions of software evolution for embedded systems with the self-adaptive mechanism.

DOI： 10.1109/SASO.2014.45

Web of Science

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：IEEE  

Software evolution is an essential activity that adapts existing software to changes in requirements. Because of recent rapid requirements changes, systems are strongly required to evolve even if the target systems are embedded systems, whose implementation code is generally hard to be changed. This paper discusses the feasibility of applying self-adaptation mechanism for software evolution. We use the MAPE loop mechanism to evolve embedded systems without changing code inside the existing systems. This paper also reports preliminary results that we experimentally evolved a cleaning robot by following our approach. Our demonstrations show a part of additional behaviors as the results of software evolution that makes the cleaning robot possible to move obstacles. We also discuss the future directions of software evolution for embedded systems with the self-adaptive mechanism.

DOI： 10.1109/SASO.2014.45

Web of Science

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：IEEE  

In this paper, we propose an image classification method that recognizes several poses of idol photographs. The proposed method takes unannotated idol photos as input, and classifies them according to their poses based on spatial layouts of the idol in the photos. Our method has two phases; the first one is to estimate the spatial layout of ten body parts (head, torso, upper and lower arms and legs) using Eichner's Stickman Pose Estimation. The second one is to classify the poses of the idols using Bayesian Network classifiers. In order to improve accuracy of the classification, we introduce Pose Guide Ontology (PGO). PGO contains useful background knowledge, such as semantic hierarchies and constraints related to the positional relationship between the body parts. The location information of body parts is amended by PGO. We also propose iterative procedures for making further refinements of PGO. Finally, we evaluated our method on a dataset consisting of 400 images in 8 poses, and the final results indicated that F-measure of the classification has become 15% higher than non-amended results.

DOI： 10.1109/ICSC.2014.20

Web of Science

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：IEEE  

In this paper, we propose an image classification method that recognizes several poses of idol photographs. The proposed method takes unannotated idol photos as input, and classifies them according to their poses based on spatial layouts of the idol in the photos. Our method has two phases; the first one is to estimate the spatial layout of ten body parts (head, torso, upper and lower arms and legs) using Eichner's Stickman Pose Estimation. The second one is to classify the poses of the idols using Bayesian Network classifiers. In order to improve accuracy of the classification, we introduce Pose Guide Ontology (PGO). PGO contains useful background knowledge, such as semantic hierarchies and constraints related to the positional relationship between the body parts. The location information of body parts is amended by PGO. We also propose iterative procedures for making further refinements of PGO. Finally, we evaluated our method on a dataset consisting of 400 images in 8 poses, and the final results indicated that F-measure of the classification has become 15% higher than non-amended results.

DOI： 10.1109/ICSC.2014.20

Web of Science

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：Association for Computing Machinery  

It is important to make sure that software satisfies stakeholders' requirements. However, as software has been getting more large-scale and complicated in recent years, it has certainly become more difficult to satisfy requirements. Even if there are goal-oriented requirements analysis approaches as techniques to systematically satisfy stakeholders' requirements, it is still difficult to maintain consistency of goal models and other requirements artifacts. In this paper, we propose a transformation approach that transforms models of KAOS, a well-known goal modeling methodology, into preliminary BPMN models by using refinement pattern of KAOS in a systematic way. It can assure consistency between systematically defined user's requirements and their realization process. Copyright 2014 ACM.

DOI： 10.1145/2554850.2555119

Scopus

researchmap

Language：English   Publishing type：Research paper (scientific journal)   Publisher：Information Processing Society of Japan  

The existing music recommendation systems rely on user's contexts or content analysis to satisfy the users' music playing needs. They achieved a certain degree of success and inspired future researches to get more progress. However, a cold start problem and the limitation to the similar music have been pointed out. Therefore, this paper proposes a unique recommendation method using a 'renso' alignment among Linked Data, aiming to realize the music recommendation agent in smartphone. We first collect data from Last.fm, Yahoo! Local, Twitter and LyricWiki, and create a large scale of Linked Open Data (LOD), then create the 'renso' relation on the LOD and select the music according to the context. Finally, we confirmed an evaluation result demonstrating its accuracy and serendipity. © 2014 Information Processing Society of Japan.

DOI： 10.2197/ipsjjip.22.279

Scopus

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：Association for Computing Machinery  

It is important to make sure that software satisfies stakeholders' requirements. However, as software has been getting more large-scale and complicated in recent years, it has certainly become more difficult to satisfy requirements. Even if there are goal-oriented requirements analysis approaches as techniques to systematically satisfy stakeholders' requirements, it is still difficult to maintain consistency of goal models and other requirements artifacts. In this paper, we propose a transformation approach that transforms models of KAOS, a well-known goal modeling methodology, into preliminary BPMN models by using refinement pattern of KAOS in a systematic way. It can assure consistency between systematically defined user's requirements and their realization process. Copyright 2014 ACM.

DOI： 10.1145/2554850.2555119

Scopus

researchmap

Other Link： http://dblp.uni-trier.de/db/conf/sac/sac2014.html#conf/sac/HoritaHSNTO14

Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：SPRINGER-VERLAG BERLIN  

A goal for the creation and improvement of music recommendation is to retrieve users' preferences and select the music adapting to the preferences. Although the existing researches achieved a certain degree of success and inspired future researches to get more progress, problem of the cold start recommendation and the limitation to the similar music have been pointed out. Hence we incorporate concept of serendipity using 'renso' alignments over Linked Data to satisfy the users' music playing needs. We first collect music-related data from Last. fm, Yahoo! Local, Twitter and LyricWiki, and then create the 'renso' relation on the Music Linked Data. Our system proposes a way of finding suitable but novel music according to the users' contexts. Finally, preliminary experiments confirm balance of accuracy and serendipity of the music recommendation.

DOI： 10.1007/978-3-319-06826-8_2

Web of Science

researchmap

Language：English   Publishing type：Research paper (scientific journal)   Publisher：Information Processing Society of Japan  

The existing music recommendation systems rely on user's contexts or content analysis to satisfy the users' music playing needs. They achieved a certain degree of success and inspired future researches to get more progress. However, a cold start problem and the limitation to the similar music have been pointed out. Therefore, this paper proposes a unique recommendation method using a 'renso' alignment among Linked Data, aiming to realize the music recommendation agent in smartphone. We first collect data from Last.fm, Yahoo! Local, Twitter and LyricWiki, and create a large scale of Linked Open Data (LOD), then create the 'renso' relation on the LOD and select the music according to the context. Finally, we confirmed an evaluation result demonstrating its accuracy and serendipity. © 2014 Information Processing Society of Japan.

DOI： 10.2197/ipsjjip.22.279

Scopus

researchmap

Publishing type：Research paper (international conference proceedings)   Publisher：Knowledge Systems Institute Graduate School  

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：SPRINGER-VERLAG BERLIN  

A goal for the creation and improvement of music recommendation is to retrieve users' preferences and select the music adapting to the preferences. Although the existing researches achieved a certain degree of success and inspired future researches to get more progress, problem of the cold start recommendation and the limitation to the similar music have been pointed out. Hence we incorporate concept of serendipity using 'renso' alignments over Linked Data to satisfy the users' music playing needs. We first collect music-related data from Last. fm, Yahoo! Local, Twitter and LyricWiki, and then create the 'renso' relation on the Music Linked Data. Our system proposes a way of finding suitable but novel music according to the users' contexts. Finally, preliminary experiments confirm balance of accuracy and serendipity of the music recommendation.

DOI： 10.1007/978-3-319-06826-8_2

Web of Science

researchmap

Publishing type：Research paper (international conference proceedings)   Publisher：SciTePress  

DOI： 10.5220/0004817304280436

researchmap

Language：Japanese   Publishing type：Research paper (scientific journal)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)  

Best Poster &amp; Demo Award

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：IEEE Computer Society  

DOI： 10.1109/RE.2013.6636715

researchmap

Other Link： https://dblp.uni-trier.de/db/conf/re/re2013.html#NakagawaOH13

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (scientific journal)   Publisher：The Institute of Electronics, Information and Communication Engineers  

CiNii Article

CiNii Books

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

学生研究賞受賞:吉田豊

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

DOI： 10.11309/jssst.31.2_67

researchmap

Language：Japanese   Publishing type：Research paper (other academic)   Publisher：The Institute of Electronics, Information and Communication Engineers  

Client-side usability become more and more important to develop the Web aplication For example, Ajax allows sending requests asynchronously without blocking clients However, server processing is performed in order not anticipated by the asynchronous communication In this paper, we demonstrate the possible problems caused by the asynchronism and how to solve aproblem It has been considered model checking can be used to solve this problem But expertise and effort is a challenge In tins paper, we propose a method for validation that can also be used for general engineer It is necessary only to describe the order of acquisition and release of resources So It can reduce the efforts and be eliminating the need for expertise mitigation.

CiNii Article

CiNii Books

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)  

We study a heterogeneous autonomous robot team composed of UAVs (Unmanned Air Vehicles) and UGVs (Unmanned Ground Vehicles) cooperate with each other to carry out global tasks. We introduce the system that UAVs and UGVs remove obstacles cooperatively. In our system, there are multiple type UGVs that have good points and shortcomings, and these UGVs remove a obstacle that block the way. Therefore, our systems can deal with more value of obstacles than existing systems. However our system is more complicated and has many problems to be solved. Therefore, we clarified the problems that our system need to be realized and implemented the robots. The system determines some ways to remove the obstacles using the aerial photograph taken by the UAV and the information of the obstacles by the UGVs, and then outputs a processed aerial photograph and some ways to remove the obstacles. The experimental results reminded us some necessary things for to carry out our goal. Our study has the goal that the autonomous robot team explores under unknown environment such as planetary explorations, or performs search and rescue operations in disaster areas. Copyright 2013 ACM.

DOI： 10.1145/2480362.2480379

Scopus

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)  

There is a need for the development of systems that are compliant with laws in public administration, because their administrative activities are based on laws. When new laws are made or existing laws are amended, however, civil servants need to develop or modify the systems in the short time before the laws are issued. Related work in requirements elicitation from the legal texts includes approaches using ontology but there are difficulties in building an ontology for practical use. In this paper we propose pre-defined templates with the expression of functional requirements to identify legal texts, including their functional requirements, and a support tool consisting of two functions, one for automatic summary creation from complicated legal texts and one for the suggestion of the legal texts, including their functional requirements. We have also applied this approach to Japanese laws and have evaluated its accuracy. Our research revealed that using this approach can identify functional requirements with high accuracy. © 2013 The authors and IOS Press.

DOI： 10.3233/978-1-61499-359-9-175

Scopus

researchmap

Language：English   Publishing type：Research paper (scientific journal)   Publisher：Springer Verlag  

In these days, an algorithmic trading in stock or foreign exchange (henceforth forex) market is in fashion, and needs for automatically performing stable asset management are growing. Machine learning techniques are increasingly used to construct trading rules of the algorithmic trading, as researches on the algorithmic trading advance. Our study aims to build an automatic trading agent, and in this paper, we concentrate in designing a module which determines trading rules by machine learning. We use Genetic Algorithm (henceforth GA), and we build trading rules by learning parameters of technical indices. Our contribution in this paper is that we propose new fitness functions in GA, in order to make them robuster to change of market trends. Although profits were used as a fitness function in the previous study, we propose the fitness functions which pay more attention to not making a loss than to gaining profits. As a result of our experiment using real TSE(Tokyo Stock Exchange) data for eight years, the proposed method has outperformed the previous method in terms of gained profits. © 2013 Springer International Publishing Switzerland.

DOI： 10.1007/978-3-319-00651-2_15

Scopus

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：IOS Press  

There is a need for the development of systems that are compliant with laws in public administration, because their administrative activities are based on laws. When new laws are made or existing laws are amended, however, civil servants need to develop or modify the systems in the short time before the laws are issued. Related work in requirements elicitation from the legal texts includes approaches using ontology but there are difficulties in building an ontology for practical use. In this paper we propose pre-defined templates with the expression of functional requirements to identify legal texts, including their functional requirements, and a support tool consisting of two functions, one for automatic summary creation from complicated legal texts and one for the suggestion of the legal texts, including their functional requirements. We have also applied this approach to Japanese laws and have evaluated its accuracy. Our research revealed that using this approach can identify functional requirements with high accuracy. © 2013 The authors and IOS Press.

DOI： 10.3233/978-1-61499-359-9-175

Scopus

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (scientific journal)  

researchmap

Language：Japanese   Publishing type：Research paper (scientific journal)   Publisher：IEEE Computer Society  

DOI： 10.1109/WI-IAT.2012.178

researchmap

Other Link： https://dblp.uni-trier.de/db/conf/webi/webi2012.html#IshinoONTO12

Language：Japanese   Publishing type：Research paper (scientific journal)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

学生優秀論文賞受賞: 越川兼地

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：SPRINGER-VERLAG BERLIN  

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.

Web of Science

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)  

Recently, the video hosting is one of the most popular services on the Web. The service user can search movies by title, tag, date, and so on. However, the user can hardly obtain information on a particular scene of a movie. Thus, it is very difficult to determine whether a movie contains interesting scenes or not. This research aims to provide information in order to help a user to choose a movie. Concretely, this paper proposes a method for labeling scenes in a movie using a video hosting service called "Nico Nico Douga". The proposed method extracts important scenes in a movie from "Nico Nico Douga" based on the statistics of social annotations attached to them. Also, using the characteristics of folksonomy the authors extract feature words for labeling. Moreover, in order to take advantage of the feature words, the authors estimate their semantic categories. We use the attached comments themselves to label the important scenes. In order to select the comments, the authors take into account the importance of the feature words with semantic categories in a scene. Finally, the authors carry out experiments to evaluate the proposed method and to discuss future works. © 2012 IEEE.

DOI： 10.1109/WI-IAT.2012.178

Scopus

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)  

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： 10.1109/SASO.2012.17

Scopus

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：IOS PRESS  

In the upstream software development processes, from requirements definition to design, one of the most important tasks is to make the requirements completely satisfied in the design process, therefore actually realizing the required system. Thus, a seamless connection between the requirements model and the design model is very effective to completely realize user requirements. KAOS [1] is one of the typical methodologies of Goal-oriented requirements engineering [2]. It elicits and builds up the requirements systematically and exhaustively. ICONIX process [3] designs a system using UML diagrams. In the ICONIX process, requirements are reviewed using use case models, and then designed with class and sequence diagrams to realize the use cases through robustness diagrams. Based on these methodologies, this paper presents an approach to transfer as much information as possible from KAOS requirements models to preliminary design of system behaviors in ICONIX. Our approach allows the use case models and robustness diagrams to reflect the requirements of the KAOS model with the refinement patterns. We also conducted a case study where flight reservations in an international airline were modeled for the requirements definition and the preliminary design. We could find every requirements defined by the KAOS model in the use case models and the robustness diagrams. Our approach was confirmed to be feasible through this case study.

DOI： 10.3233/978-1-61499-094-9-171

Web of Science

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)  

Self-adaptive systems have recently been receiving much attention because of their ability to cope with the changes of environment, failures, and unanticipated events. These systems need an adaptation mechanism, which automatically computes the possible configurations, and decides the most appropriate configuration to fit the environment. In particular, the satisfaction of non-functional requirements must be considered when selecting the best reconfiguration. However, there are trade-off problems among non-functional requirements. Moreover, the adaptation mechanisms are typically developed separately from the components to be implemented, and it complicates the construction of such systems. We propose (1) a feature-oriented analysis technique, which can identify adaptation points, and calculate the contribution to non-functional goals of the configuration
(2) a component specification model, which extends an architectural description language for self-adaptation
(3) a reconfiguration framework aimed to reduce the complexity of the reconfiguration and generate the best configuration at run-time. We evaluate the feasibility of our framework by four different scenarios, and show that our framework reduces the complexity of the reconfiguration, and solves the trade-off problem among non-functional requirements. © 2012 ACM.

DOI： 10.1145/2245276.2231956

Scopus

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)  

Consistency between various phases of the software development process is an important aspect in software engineering. Without this aspect, software products may not satisfy users' needs. The cause of the inconsistency is that users' requirements may not be sufficiently reflected in software products. We consider this situation as a gap between the requirements and the products. We focus on the early phases of the software development, because we need to deal with the problem before the inconsistency in the early phases affects the later phases. KAOS has been attracting attentions and UML has been widely adopted, in the early phases, for requirements analysis and design respectively. However, the requirements analysis phase and the design phase are often practiced separately which may cause a gap between them. In this paper, we propose a systematic approach, to reduce the gap between the requirement analysis phase and the design phase, by generating UML class diagram and OCL constraints from the KAOS model. We propose transformation rules between operation models and class diagrams and rules for producing OCL constraints from the KAOS model. In addition, we carried out a case study to confirm the validity of this approach. © 2012 ACM.

DOI： 10.1145/2245276.2231940

Scopus

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (scientific journal)   Publisher：The Institute of Electronics, Information and Communication Engineers  

CiNii Article

CiNii Books

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (scientific journal)   Publisher：The Institute of Electronics, Information and Communication Engineers  

CiNii Article

CiNii Books

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (scientific journal)   Publisher：The Institute of Electronics, Information and Communication Engineers  

CiNii Article

CiNii Books

researchmap

Language：Japanese   Publishing type：Research paper (scientific journal)   Publisher：The Institute of Electronics, Information and Communication Engineers  

CiNii Article

CiNii Books

researchmap

Language：Japanese   Publishing type：Research paper (scientific journal)   Publisher：The Institute of Electronics, Information and Communication Engineers  

CiNii Article

CiNii Books

researchmap

Language：Japanese   Publishing type：Research paper (scientific journal)   Publisher：The Institute of Electronics, Information and Communication Engineers  

CiNii Article

CiNii Books

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (other academic)  

researchmap

Language：Japanese   Publishing type：Research paper (scientific journal)  

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： 10.1527/tjsai.26.1

Scopus

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)  

During the massive Tohoku earthquake, while landlines and mobile phone lines got stuck, Twitter were used to exchange information about evacuation. On 11 March, the number of tweets from Japan dramatically increased to about 33 million, 1.8 times higher than the average figure. However, since texts on Twitter are unstructured data, are more complex than other text media, it is difficult to find a suitable evacuation center. Not only information in Twitter, people but also need to combine other information such as map information, shop information to find the suitable evacuation center. Since it takes much time to do these tasks, these manual processing are not suitable in the emergency status. Therefore, we need an approach to help computers to understand the meaning of evacuation, and to provide the most suitable evacuation center based on earthquake victims' behaviors in real-time. In this paper, we firstly design an earthquake evacuation ontology. Secondly, we indicate that by using this ontology, computers can provide the most suitable evacuation center based on earthquake victims' behaviors in real-time. © 2011 IEEE.

DOI： 10.1109/GRC.2011.6122613

Scopus

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)  

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： 10.1145/1988008.1988015

Scopus

researchmap

Language：Japanese   Publishing type：Research paper (scientific journal)  

In our definition, human activity can be expressed by five basic attributes: actor, action, object, time and location. The goal of this paper is describe a method to automatically extract all of the basic attributes and the transition between activities derived from sentences in Japanese web pages. However, previous work had some limitations, such as high setup costs, inability to extract all attributes, limitation on the types of sentences that can be handled, and insufficient consideration interdependency among attributes. To resolve these problems, this paper proposes a novel approach that uses conditional random fields and self-supervised learning. Given a small corpus sample as input, it automatically makes its own training data and a feature model. Based on the feature model, it automatically extracts all of the attributes and the transition between the activities in each sentence retrieved from the Web corpus. This approach treats activity extraction as a sequence labeling problem, and has advantages such as domain-independence, scalability, and does not require any human input. Since it is unnecessary to fix the number of elements in a tuple, this approach can extract all of the basic attributes and the transition between activities by making only a single pass. Additionally, by converting to simpler sentences, the approach can deal with complex sentences retrieved from the Web. In an experiment, this approach achieves high precision (activity: 88.9%, attributes: over 90%, transition: 87.5%).

DOI： 10.1527/tjsai.26.166

Scopus

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)  

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： 10.1145/1982185.1982491

Scopus

researchmap

Language：Japanese   Publishing type：Research paper (scientific journal)  

Ontology-enabled services are rapidly increasing in the Web. However, those are sort of "lighter" ontologies compared with ontologies used in design and diagnosis. In this paper, we propose ONTOMO that enables internet users to take part in building those ontologies. ONTOMO is designed not for ontology experts, but for general users of the light-weight ontology. So we focused on easy-use, no installation, and cooperative work environment. Also, it has an agent function which recommends instances and properties belong to ontology classes to boost the users' input. In the recommendation agent, we built our own proper noun extraction mechanism based on bootstrapping. Furthermore, ONTOMO provides a ontology-based blog search as a sample application to motivate the users' ontology building. After the ONTOMO overview, we present the instance and property recommendation agent with experimental evaluation.

DOI： 10.1527/tjsai.26.116

Scopus

researchmap