Otaru, Japan

Otaru University of Commerce is a national university in Japan. The main campus of the university is in Otaru, Hokkaido, with a satellite campus in Chūō-ku, Sapporo. Wikipedia.


Time filter

Source Type

Numazawa M.,Otaru University of Commerce | Noto M.,Kanagawa University
2016 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2016 - Conference Proceedings | Year: 2016

In recent years, in each stage of education from elementary to high school in Japan, the focus has been on teaching/learning programming. However, it cannot be said that all students are able to learn programming technology. Difficult problems exist in teaching programming because of differences in student achievement levels. These differences are found at the elementary and middle school levels of course, but are even more obvious at the high school level where courses begin to separate into humanities, science, and other fields. In existing note-taking practices, many effective learning methods have been shown in which teachers can explain notetaking methods effectively so that learners can learn how to take notes that they can easily read and understand. In our previous research, we reported our development of a teaching support system that enables students to redesign contents the teacher provides, whether on whiteboards or in projected slides. It enables students to freely revise the teacher's notes so that they can easily read and understand them. In this paper we show how the teaching and learning support system with a note-taking application we developed, as well as notes taken on paper, can be used to examine the effectiveness of note-taking in the teaching and learning of programming. Specifically, we describe experiments we carried out in which we compared cases where notes were not taken during actual lectures with cases where notes taken on paper were used. © 2016 IEEE.


Haraguchi K.,Otaru University of Commerce | Ono H.,Kyushu University
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2014

Among many variations of pencil puzzles, Latin square Completion-Type puzzles (LSCP), such as Sudoku, Futoshiki and BlockSum, are quite popular for puzzle fans. Concerning these puzzles, the solvability has been investigated from the viewpoint of time complexity in the last decade; it has been shown that, in most of these puzzles, it is NP-complete to determine whether a given puzzle instance has a proper solution. In this paper, we investigate the approximability of LSCP. We formulate LSCP as the maximization problem that asks to fill as many cells as possible, under the Latin square condition and the inherent condition. We then propose simple generic approximation algorithms for LSCP and analyze their approximation ratios. © 2014 Springer International Publishing.


Kamide N.,Teikyo University | Koizumi D.,Otaru University of Commerce
Journal of Advanced Computational Intelligence and Intelligent Informatics | Year: 2016

Computation tree logic (CTL) is known to be one of the most useful temporal logics for verifying concurrent systems by model checking technologies. However, CTL is not sufficient for handling inconsistency-tolerant and probabilistic accounts of concurrent systems. In this paper, a paraconsistent (or inconsistency-tolerant) probabilistic computation tree logic (PpCTL) is derived from an existing probabilistic computation tree logic (pCTL) by adding a paraconsistent negation connective. A theorem for embedding PpCTL into pCTL is proven, thereby indicating that we can reuse existing pCTL-based model checking algorithms. A relative decidability theorem for PpCTL, wherein the decidability of pCTL implies that of PpCTL, is proven using this embedding theorem. Some illustrative examples involving the use of PpCTL are also presented.


Haraguchi K.,Otaru University of Commerce
Journal of Heuristics | Year: 2016

A partial Latin square (PLS) is a partial assignment of n symbols to an (Formula presented.) grid such that, in each row and in each column, each symbol appears at most once. The PLS extension problem is an NP-hard problem that asks for a largest extension of a given PLS. We consider the local search such that the neighborhood is defined by (p, q)-swap , i.e., the operation of dropping exactly p symbols and then assigning symbols to at most q empty cells. As a fundamental result, we provide an efficient (Formula presented.)-neighborhood search algorithm that finds an improved solution or concludes that no such solution exists for (Formula presented.). The running time of the algorithm is (Formula presented.). We then propose a novel swap operation, Trellis-swap, which is a generalization of (p, q)-swap with (Formula presented.). The proposed Trellis-neighborhood search algorithm runs in (Formula presented.) time. The iterated local search (ILS) algorithm with Trellis-neighborhood is more likely to deliver a high-quality solution than not only ILSs with (Formula presented.)-neighborhood but also state-of-the-art optimization solvers such as IBM ILOG CPLEX and LocalSolver. © 2016 Springer Science+Business Media New York


Ishii T.,Otaru University of Commerce
Conferences in Research and Practice in Information Technology Series | Year: 2012

Given a graph G = (V;E) and an integer D ≥ 1, we consider the problem of augmenting G by a minimum set of new edges so that the diameter becomes at most D. It is known that no constant factor approximation algorithms to this problem with an arbitrary graph G can be obtained unless P = NP, while the problem with only a few graph classes such as forests is approximable within a constant factor. In this paper, we give the first constant factor approximation algorithm to the problem with an outerplanar graph G. We also show that if the target diameter D is even, then the case where G is a partial 2-tree is also approximable within a constant. © 2012, Australian Computer Society, Inc.


Harada M.,Otaru University of Commerce
Physics Essays | Year: 2011

Contrary to the prevailing lore, the twin paradox is shown to lose its raison d'tre when a proper account is taken of the intrinsic role of time in relativity theory. © 2011 Physics Essays Publication.


Haraguchi K.,Otaru University of Commerce
Studies in Computational Intelligence | Year: 2015

A partial Latin square (PLS) is a partial assignment of n symbols to an n× gridsuchthat,ineachrowandineachcolumn,eachsymbolappearsatmost once. The partial Latin square extension (PLSE) problem asks to find such a PLS that is a maximum extension of a given PLS. Recently Haraguchi et al. proposed a heuristic algorithm for the PLSE problem. In this paper, we present its effectiveness especially for the “hardest” instances. We show by empirical studies that, when n is large to some extent, the instances such that symbols are given in 60-70% of the n2 cells are the hardest. For such instances, the algorithm delivers a better solution quickly than IBM ILOG CPLEX, a state-of-the-art optimization solver, that is given a longer time limit. It also outperforms surrogate constraint based heuristics that are originally developed for the maximum independent set problem. © Springer International Publishing Switzerland 2015.


Haraguchi K.,Otaru University of Commerce
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2015

A partial Latin square (PLS) is a partial assignment of n symbols to an n × n grid such that, in each row and in each column, each symbol appears at most once. The partial Latin square extension problem is an NP-hard problem that asks for a largest extension of a given PLS. In this paper we propose an efficient local search for this problem. We focus on the local search such that the neighborhood is defined by (p, q)-swap, i.e., removing exactly p symbols and then assigning symbols to at most q empty cells. For p ∈ {1, 2, 3}, our neighborhood search algorithm finds an improved solution or concludes that no such solution exists in O(np+1) time. We also propose a novel swap operation, Trellis-swap, which is a generalization of (1, q)-swap and (2, q)-swap. Our Trellis-neighborhood search algorithm takes O(n3.5) time to do the same thing. Using these neighborhood search algorithms, we design a prototype iterated local search algorithm and show its effectiveness in comparison with state-of-the-art optimization solvers such as IBM ILOG CPLEX and LocalSolver. © Springer International Publishing Switzerland 2015.


Hirasawa N.,Otaru University of Commerce
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2013

Challenges for incorporating "quality in use" in embedded system development were discussed. In the Japanese embedded system industries the foundation of the quality in use management is not necessarily established because of their various backgrounds and histories. In the paper three key points to introduce the quality in use into the design process in the industries were proposed. These were implementation of user requirement process, understanding of "service" as final outcome and synchronization to functional safety. © 2013 Springer-Verlag Berlin Heidelberg.


Kaji T.,Otaru University of Commerce
Journal of Japan Industrial Management Association | Year: 2013

The standard particle swarm optimization (PSO) is an evolutionary algorithm for finding optimal regions of complex search spaces through the interaction of individuals in a population of particles. Many numerical experiments have reported that PSO can provide high-quality solutions. However, PSO cannot yield good solutions for large-scale problems; that is, high-dimensional problems. For this problem, this paper proposes new algorithms using the idea of effective particles moving. The basic idea is that moving of particles is updated according to the Cauchy distribution. The Cauchy distribution has a Gaussian-like peak and Lorentzian wing that imply occasional long jumps among local sampling. This proper trade-off between local search and semi-global search allows effective moving of particles. Moreover, this algorithm has been improved using the new search procedure that assumes a particle swarm is frequently reconstructed by the idea of scatter search. This search procedure operates on a set of good particles, the reference set, by combining these particles to create new ones. It uses strategies for search diversification and intensification by introducing the Cauchy distribution for the process of combining particles. The goal of this methodology is to enable the implementation of solution procedures that can derive new better particle swarms from combined elements. Finally, comparing the results on a set of benchmark multimodal functions, the proposed algorithm shows competitive performance with improved convergence speed and high optimizing precision for difficult problems.

Loading Otaru University of Commerce collaborators
Loading Otaru University of Commerce collaborators