Yasunori Shiono

Implementation and Verification of Concurrent Sorting Algorithms with CSP based Architecture

Communicating Sequential Processes (CSP) based architecture is regarded as a useful method in the development of concurrent embedded systems. Products around us are embedded in many computer systems. Concurrent processing by software is necessary in multi-core and multi-processor environments to make more effective use of hardware resources. There is strong demand for hierarchy, resource constraints, and safety for implementation of embedded systems. We implemented a sorting model as a concurrent system in an experiment. We tried to design, implement, and verify concurrent sorting model with CSP based architecture. In this study, we try to parallelize of sorting as the subject of embedded systems for implementing. Because sorting has been widely studied, it is suitable as the subject of parallelization. We also evaluated the system. We will consider the usefulness of CSP, which we present in this paper, using examples of development.

Development of Web Counseling System

Some areas in Asian have no medical facilities and proper mental health care is unavailable. Therefore, online counseling systems are needed. We have been studying and putting into practice online counseling for people assigned overseas. We constructed a system using agile software development for those assigned overseas in Asia. The first step involved developing a prototype system based on system requirements after we repeatedly discussed system development with people in charge of a clinic. Next, we conducted interviews about the online counseling system. We also discussed and analyzed the interviews. Finally, we completed the online Web counseling system by repeatedly discussing possible improvements with the clinic and then incorporating the changes in the system. We report on the construction of the system.

O(n) and O(n2) Time Algorithms for Drawing Problems of Tree-Structured Diagrams

We investigate sets of conditions with respect to narrower drawing of tree-structured diagrams on an integral lattice. We found that under certain sets of conditions there are practical procedural algorithms for narrower drawing of tree-structured diagrams, while under other sets of conditions there are none. Based on our findings, we present efficient algorithms that provide narrower placement satisfying given amorphous conditions. In intractable conditions, we propose a constraint-based algorithm for drawing tree-structured diagrams with a minimum-width by limiting the number of cells. Our results provide a criterion for deciding under given conditions, whether to use procedural or constraint-based algorithms to draw a tree-structured diagram.

Behavioral Verification in Hichart Development Environment for Embedded Software

Developing embedded systems is becoming more complicated. However, the time taken to develop an embedded system must be shortened. Software development environments especially for test purposes are still inadequate. To reduce bugs, specifications in the upper process need to be checked, and model checking-methodologies are often used to do so. So far we have developed a visual software development environment for Hichart that targets LEGO MINDSTORM. We also enhanced the behavioral specifications table function to make it applicable to the environment for checking physical parameters of real machine. In this paper, we adopt model-checking methodologies to the environment. We propose a visual software development environment for embedded software with physical and logical checking.

Data structure and triangulation algorithm for non-uniform landscapes

Landscape modeling is important in computer graphics applications. In the field of computer graphics, representations for rectangular dissections are used in synthetic design processes. There are unavoidable problems with real-time rendering of non-uniform landscapes. One of them is ability of expression on terrain rendering. In this paper, we propose a data structure of rectangular dissections with heterogeneous cells and present a triangulation algorithm for the data structure with elevation data. The data structure possesses the potential for high-quality expression. The triangulation algorithm generates base triangular meshes for the data structure with consideration of visualization problems and produces a fundamental polygon model of the data structure for terrain maps.

Effectiveness of Multi-touch Interface for Fuzzy Graph Analysis

We propose a new method to analyze human relations and mental process through touch interface dynamically. There is a sociometry analysis that applies the fuzzy graph an approach to clearly express the measurement and evaluation of the structure of human relationships. The analysis conditions are not constant in the analysis of human relationships, and not in addition to performing the analysis by trial and error for that. Previously in the study, in the relationship such as between the groups, it has not been studied the individual relationships analysis in the groups. Similarly, it has never been also studied to analyze the human relationships dynamically. We propose a method to dynamically the human relationships by intuitive operation through the touch interface. In this paper, we describe our principle of the sociometry analysis that using the fuzzy graph, the our method through the touch interface, and their application to sociometry analysis in case of 30 people of human relationships.

Information Retrieval Based on Heuristic Key Words Extraction and Clusterings for Documents

Accumulated data has become enormous according to development and spread of Information technology. Generally the data is saved and is organized on the database system with some kinds of keywords and its clustering. In the case of performing the decision for some problems, we often refer to past cases that are similar to the problem. In such a case, if solutions of past cases are kept in the database as documents, it is very useful to solve a problem. We propose a new information retrieval system based on-heuristic key words extracted from documents and a set of clusters for the documents.

Optimality and Complexity for Drawing Problems of Tree-Structured Diagrams

We investigated sets of conditions with respect to narrower drawing of tree-structured diagrams on an integral lattice. We found that under certain sets of conditions there are practical procedural algorithms for narrower drawing of tree-structured diagrams, while under other sets of conditions there are none. Based on our findings, we presented efficient algorithms that provide narrower placement satisfying given amorphous conditions. In this paper we review our these previous results regarding with sets of constraints for tidily drawing TSDs, efficient algorithms which produce minimum width drawings of TSDs while satisfying certain constraints and NP-completeness of drawing problems of TSDs. Then we discuss the relation among constraints and the optimality with respect to the widths of drawing TSDs. Finally we indicate a key constraint which is not only for obtaining the optimality but also for the practical uses.

Efficiency of Concurrent Processing of Sort Using CSP

Embedded systems have become an essential technology in fields that require electronic control. These technologies must work in real time and have high reliability and low cost. Among them, safety verification of embedded systems is very important in fields related to human life. In addition, as multi-core and multiprocessors have spread, the processing power of the hardware has been improved. As a result, concurrent processing has become necessary. In developing concurrent embedded systems, Communicating Sequential Processes (CSP) is regarded as useful. The purpose of this study is to verify, implement, and evaluate the concurrent sorting algorithm using the characteristics of CSP. In this study, we use two characteristics of CSP: synchronous communication and verification based on the formal method. In addition, we describe the extended improvement concurrent sorting algorithm.

A Visual Software Development Environment that Considers Tests of Physical Units

Embedded systems are extensively used in various small devices, such as mobile phones, in transportation systems, such as those in cars or aircraft, and in large-scale distributed systems, such as cloud computing environments. We need a technology that can be used to develop low-cost, high-performance embedded systems. This technology would be useful for designing, testing, implementing, and evaluating embedded prototype systems by using a software simulator.