[in Japanese]

View full abstract

Recently, public museums play a main role in public culture facilities, there are many facilities where the government should manage and invest public funds. It is evaluated for a short term the efficiency that made a point of the cost reduction in the facility management. In our research, we consider the influence of the middle and long term, and evaluate the management efficiency of public culture museums by Network DEA method.

View full abstract

High accuracy human action recognition is becoming an essential part in developing intelligent systems. Due to the enormous number of motion archives, a structured motion database is developed with directional organization independent of the viewpoint. Nevertheless, it had the drawbacks of recognizing the observed motion which is similar to several motions within the motion database. This is called boundary problem that occurs because of the mis-selection of neighboring motions in the retrieval process. The performance may highly drop when this problem exists. In this paper, we propose a novel resolution approach to this problem to improve the system's performance. We propose two sets of B-Tree database structure: the original B-tree and a left- or right-shifted B-tree. The motions are represented as Motion History Image (MHI) and Exclusive-OR (XOR) representations, and the directional eigenspaces are used as motion extracted feature vector space. The improvement in the recognition rate adopting the proposed approach signifies high accuracy human motion recognition.

View full abstract

Gene ontology (GO) which describes a biological concept of genes has attracted attention as an index for measuring semantic similarity of genes. This paper considers a new method for measuring a semantic similarity of GO, which removes some drawbacks of existing measurement methods. The proposed method is constructed by incorporating the concept of information content into the semantic value. It is shown that the proposed method is superior to existing methods through experiments with pathway data.

View full abstract

Although universal design and barrier free have been recognized globally as shared awareness for city development in these days, physical properties such as visco-elastic coefficients of pavement surface have been referenced in the design of a pedestrian space. Against the men tioned background, a variety of works for gait analysis have been done, however neither gait analysis method nor measurement instrument have not been used well in constructing more conformable pedestrian space. Then, this study aims to propose a novel gait analysis method focusing on the dy namics of the joint of ankle, because this joint is essential to realize smooth walking motion for human. By using a tri-axes acceleration sensor, a portable measurement system is firstly developed to measure the impact acceleration data occurred around the joint of ankle while walking. For the purpose of quantitative evaluation, statistical processing methods are applied to the measured acceleration data. From experiments, some of trends of individual gait characteristics were found.

View full abstract

In this paper, we focus on two-level nonlinear programming problems with no coordination between the decision maker at the upper level (the leader) and the decision maker at the lower level (the follower), and propose a computational method through particle swarm optimization (PSO) for obtaining Stackelberg solutions to two-level nonlinear programming problems. Furthermore, we carry out numerical experiments in order to demonstrate the feasibility and effectiveness of the proposed method by comparing with existing methods.

View full abstract

Ambient information environments will lead to a large degree of interactions among the environment and human users through integrating heterogeneous services, devices, and networking elements. The main goal of such systems is to provide users with services they desire and improve their living situation. Generating ambient environments faces several challenges, such as designing the appropriate platforms and interfaces to realize human interactions. Furthermore, decision tasks in everyday life can be simplified to provide benefits to the user. In this paper we discuss the general concepts of ambient information environments and how to support decision making there by using rough sets.

View full abstract

Learning Classifier Systems (LCSs) are rule-based systems that automatically build their rule set so as to get optimal policies through evolutionary processes. This paper considers an evolutionary multiobjective optimization-based method for constructing LCSs that adjust to non-Markov environments. Our goal is to construct an XCSMH (eXtended Classifier System - Memory Hierarchic) that can obtain not only optimal policies but also highly generalized rule sets. Results of numerical experiments show that the proposed method is superior to an existing method with respect to the generality of the obtained rule sets.

View full abstract

This paper considers a DEA-based model of technical and cost efficiencies with fuzziness. Previous studies of fuzzy DEA model in terms of cost efficiency had critical shortcoming if the unit prices of the inputs are not identical across DMUs in the economy. Therefore, in this paper, a new fuzzy model is proposed by extending the revised scheme of DEA -based cost efficiency that is free from such inconsistencies. The proposed model is a fuzzy programming problem, and so introducing order relations of fur y inequalities, it is equivalently transformed into a linear programming problem. Furthermore, comparing the proposed model with the original model, a numerical example derived from hospital data is provided.

View full abstract

This paper proposes a versatile heuristic solution algorithm for nonlinear programming problems. Differential Evolution (DE), proposed by Storn et al., has the following two issues: one is that the algorithm has a tendency to fall into a local optimal solution, and the other is that the algorithm cannot be applied to nonlinear programming problems with constraints directly. For searching widely in a feasible set, the movement of individuals and their evaluation function are improved. The efficiency of the solution algorithm is shown by applying it to various types and scales of non-linear programming problems.

View full abstract