Music is an essential "element" in our lives. With the rapid development of technology, the use of compact disks and tapes for listening various forms of music of different cultures has become obsolete. Because of the generation of considerable music data, the accurate classification of music data has become a critical topic of research, and the development of deep learning technology provides a solution for music classification. Transfer learning techniques are widely used in image recognition but are rarely used for music classification. In this study, a small music dataset is used for music classification using transfer learning.

Detection of novel game cheating tools is critical for ensuring fair online play. Such cheating tools are visual-based and effectively avoid detection because they do not change the data of game software. With the development and popularity of artificial intelligence technology, it has become easier for individuals to develop cheating tools, such as a new cheating tool for first-person shooter games that searches for characters on the game screen and automatically targets them. Therefore, in this study, a new cheat detection method is proposed using machine learning. The proposed method can be used to detect new cheating tools based on object detection.

Information and communication technologies have spread rapidly, and as a result, people's attention to computer skills has reached a level as never before. However, most conventional skill assessment tools are often multiple-choice types and ask only for PC knowledge but not PC skills. Meanwhile, skill assessment using eye tracking has already been realized in the medical field and has been proven to be a reliable tool for skill assessment and may apply to other fields. Therefore, unlike the knowledge-questioning type PC skill assessment, this study is to propose a method to measure an operator's real skill level using PC operation log data. In this study, we use the operator's PC operation logs to generate heatmaps and operation features and compare these data with standard data generated by the KML model in order to assess the operator's pc skills.

Information technology has been advancing in many countries. In their daily lives, people encounter computerized systems in many situations and often take their operation for granted. If a system failure occurs temporarily, it is disadvantageous for the system operator and the user. The use of distributed and parallel processing systems has increased the prevalence of software failures due to resource sharing among processes. The purpose of this study is to verify the presence or absence of deadlock by using the validator called FDR for the processes of the LEGO® MINDSTORMS® EV3 robot while it climbs stairs.

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.

Databases are mainly used in many systems in order to store data. Databases in large scale systems are difficult to grasp their logical structure, therefore, visualizing databases are quite important. To the present entity relationship diagrams (ER diagrams) have been proposed and used in designing and managing databases. However there are not so many tools which are based on formal mechanisms. In this paper, we propose a graph grammar for entity relationship diagrams which are based on formal mechanisms by using graph grammars. We also describe an application of the grammar.

Psychodiagnostic tests are used by hospitals, schools, companies, etc. Their effectiveness has been observed as tests that can reveal the internal and external status of the subject in detail. The data or the results of psychodiagnostic tests are very difficult to interpret by non-professionals. The resulting data is numerous, making it very difficult to read and interpret. The levels of understanding will vary depending on the cognitive ability and experience of the researcher or counselor interpreting the results. This study takes the results from psychodiagnostic tests and displays them as an easily understood 3D graph. The 3D graph is displayed as a spiral shape through ‘Processing’. The Uchida-Kraepelin psychodiagnostic test (U-K test) is used on over one million people each year by hospitals, schools, companies, etc. The purpose of this study is to use the 3D spiral to display the U-K test's calculation of workload and to emphasize the use of color on the 3D spiral visualization. A version with colors visible to colorblind people is used in conjunction with the 3D spiral visualization; the usage of color displays the U-K calculation of workload for non-colorblind people, while a colorblind-accessible version is used for colorblind people. The graphs produced in the study were given to professionals, non-professionals and colorblind people for evaluation.

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.

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.

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.

We propose combined algorithms such as a multiple row deletion algorithm based on octgrid graph model for a heterogeneous table.

We designed and developed a visual programming language (VPL) APECbits that is based on the APEC (asynchronous program elements connection) model. The APEC model is a base model of computation for bit-level concurrent programming, which composes a network of operation elements called primitives connected by data carriers called carriers. The model can express bit-level concurrent computation briefly and diagrammatically. In particular, the model is suitable to express fine-grain concurrent programs such as virtual-machine emulators and multimedia applications. Programs are represented clearly by a new notion (function) called wireless edge, which reduces the number of crossed connection lines.

We present and evaluate a next generation learning technology that uses a 3D polarized light system. We first present the system structure of the learning system using 3D systems and describing how the system was developed from digital elevation map (DEM) data. Next, we test the system by providing content so users can view 3D geography, learning directly from 3D data. Finally, we evaluate our system and discuss its advantages.

We developed a bit-level concurrent visual programming language A-BITS. Few visual programming languages based on models of bit-level concurrent computation have been developed. Our programming language is useful for developing asynchronous and concurrent programs, which frequently use bit-level operations. Recently, use of such programs has been increasing in fields like video game design, multimedia, and graphical user interfaces. We also devised a concurrent model of computation called Ajiro Program Circuit (APC), as a base model for A-BITS. It uses processes called primitives, which communicate with each other using vehicles called carriers. In addition, to test the model and prepare for improvement of the system, we developed an APC simulator.

The hierarchical program diagram editor is a tool for visual program environments. We propose a model of a syntax-directed diagram editor using an attribute graph grammar We formalize and define editor commands by using productions of the attribute graph grammar which defines the hierarchical program diagram. This guarantees that any diagram that is grammatically correct can be generated and that there will be no syntax errors in the program generation and editing processes with the editor. We have implemented our editor based on the editor command definitions. The system is the first practical program diagram editor supporting complete syntax-directed commands and efficient automatic layouts by using attribute graph grammars. The methods should be applicable to development environments for various tree-structured diagrams.