Computer Software
Print ISSN : 0289-6540
Current issue
Showing 1-16 articles out of 16 articles from the selected issue
  • [in Japanese]
    2020 Volume 37 Issue 1 Pages 1_1
    Published: January 24, 2020
    Released: March 24, 2020
    JOURNALS FREE ACCESS
  • Yasuyuki TAHARA, Fumihiro KUMENO, Nobukazu YOSHIOKA, Norihiro YOSHIDA
    2020 Volume 37 Issue 1 Pages 1_2
    Published: January 24, 2020
    Released: March 24, 2020
    JOURNALS FREE ACCESS
  • Yusuke GOTO, Hisashi ICHIKAWA, Koichi MATSUDA, Jun HAKURA
    2020 Volume 37 Issue 1 Pages 1_3-1_18
    Published: January 24, 2020
    Released: March 24, 2020
    JOURNALS FREE ACCESS

    The primary purpose of this research is to analyze various expectations of companies and teachers about a PBL course for students majoring in Information Science which intends to solve actual problems provided by the companies. We conducted the M-GTA analysis on our PBL course after preliminary interviews. We identified a hypothetical mechanism that explains what are the expectations, how the expectations formed, and which factors have influences on the expectations. This hypothetical mechanism would have a balancing structure operated by companies and teachers. Companies and teachers would recognize their benefit of the PBL course by understanding the hypothetical mechanism.

    Download PDF (1430K)
  • Sachio SAIKI, Naoki FUKUYASU, Tetsuya KANDA, Kohei ICHIKAWA, Shinichi ...
    2020 Volume 37 Issue 1 Pages 1_19-1_30
    Published: January 24, 2020
    Released: March 24, 2020
    JOURNALS FREE ACCESS

    AiBiC Kansai offers an education course, AiBiC Spiral, designed to develop abilities to solve individual social issues using Big Data, artificial intelligence, and Cloud technologies through teamwork. In this paper, we report on the problems of the environments for the education program and the discrepancies in the expectations on topics and contents found by the analysis of the questionnaire conducted in 2017, and describe the activities and results performed to improve the program in 2018. Through the improvements, we have found that the problem on the program environments has been dissolved. However, as for the discrepancies in the expectations, we have revealed that only some part of the problem was improved and there were still some students found the topics and contents provided by the program were different from their expectations.

    Download PDF (1198K)
  • Hidemi YAMACHI, Yutaro OHASHI, Yasuhiro MUROKOSHI, Fumihiro KUMENO, Hi ...
    2020 Volume 37 Issue 1 Pages 1_31-1_37
    Published: January 24, 2020
    Released: March 24, 2020
    JOURNALS FREE ACCESS

    Although the computer programming education in elementary schools has become imminent, the authors have dispatched students to support programming education, but it is difficult to sufficiently respond to requests. However, there are retired engineers and seniors interested in computer programming in every community. In order to find out such seniors, we offer computer programming courses for seniors, and work on supporting programming education at the elementary school in cooperation with the seniors who have taken the course. By reporting the history and contents of our effort, we analyze the meaning for participants of this activity and problems to be solved.

    Download PDF (1862K)
  • Tomoyuki AOTANI, Tomoharu UGAWA, Koichi SASADA, Kohei SUENAGA
    2020 Volume 37 Issue 1 Pages 1_38
    Published: January 24, 2020
    Released: March 24, 2020
    JOURNALS FREE ACCESS
  • Daisuke KIMURA, Koji NAKAZAWA, Tachio TERAUCHI, Hiroshi UNNO
    2020 Volume 37 Issue 1 Pages 1_39-1_52
    Published: January 24, 2020
    Released: March 24, 2020
    JOURNALS FREE ACCESS

    This paper studies the role of the cut rule in cyclic proof systems for separation logic. A cyclic proof system is a sequent-calculus style proof system for proving properties involving inductively defined predicates. Recently, there has been much interest in using cyclic proofs for proving properties described in separation logic with inductively defined predicates. In particular, for program verification, several theorem provers based on mechanical proof search procedures in cyclic proof systems for separation logic have been proposed. This paper shows that the cut-elimination property fails in cyclic proof systems for separation logic in several settings. We present two systems, one for sequents with single-antecedent and single-conclusion, and another for sequents with single-antecedent and multiple-conclusions. To show the cut-elimination failure, we present concrete and reasonably simple counter-example sequents which the systems can prove with cuts but not without cuts. This result suggests that the cut rule is important for a practical application of cyclic proofs to separation logic, since a naïve proof search procedure, which tries to find a cut-free proof, gives a limit to what one would be able to prove.

    Download PDF (474K)
  • Tomoharu UGAWA, Seiji UMATANI, Jin NAKAZAWA, Shinpei HAYASHI, Mutsunor ...
    2020 Volume 37 Issue 1 Pages 1_53
    Published: January 24, 2020
    Released: March 24, 2020
    JOURNALS FREE ACCESS
  • Yixiao LI, Yutaka MATSUBARA, Hiroaki TAKADA
    2020 Volume 37 Issue 1 Pages 1_54-1_67
    Published: January 24, 2020
    Released: March 24, 2020
    JOURNALS FREE ACCESS

    Embedded systems are moving to multi-core and many-core platforms to satisfy the ever-growing demand for computing power. Complex task like autonomous driving will include both real-time applications and high-performance applications. Research has shown that traditional RTOS can be optimized to provide good scalability for parallel computing. The lack of performance analysis tools, however, is one of the major obstacles for identifying bottlenecks.
    In this paper, we first discuss the characteristics and challenges of existing tools used in high-performance computing. To meet the requirements of embedded systems, a generic infrastructure for creating customized profilers flexibly and effortlessly is then presented. As an example, a scalable and optimized call graph profiler has been developed. At last, we evaluate our profiler and existing profiler by measuring benchmark application on a 36-core platform. The results show that our profiler can provide much higher accuracy with very low overhead.

    Download PDF (1099K)
  • Tetsuo KAMINA, Tomoyuki AOTANI
    2020 Volume 37 Issue 1 Pages 1_68-1_72
    Published: January 24, 2020
    Released: March 24, 2020
    JOURNALS FREE ACCESS
  • Daisaku YOKOYAMA
    2020 Volume 37 Issue 1 Pages 1_73-1_77
    Published: January 24, 2020
    Released: March 24, 2020
    JOURNALS FREE ACCESS
  • Yutaka MATSUNO, Fumio MACHIDA
    2020 Volume 37 Issue 1 Pages 1_78-1_83
    Published: January 24, 2020
    Released: March 24, 2020
    JOURNALS FREE ACCESS

    We report DSN2019 (The 49th IEEE/IFIP International Conference on Dependable Systems and Networks). DSN is a long-established international conference in computer science and the most prestigious international forum in the field of dependable computing systems and networks. While there were many contributions from Japanese academia and industry in the past,the number is declining in recent years. This report overviews the presentations at DSN 2019 and aims to facilitate more interests in this research field to the readers.

    Download PDF (889K)
  • [in Japanese]
    2020 Volume 37 Issue 1 Pages 1_84-1_85
    Published: January 24, 2020
    Released: March 24, 2020
    JOURNALS FREE ACCESS
  • Hiroyuki OKAZAKI, Shogo SHIMURA, Tatsuki MIYAMOTO, Tatsuki WATANABE, Y ...
    2020 Volume 37 Issue 1 Pages 1_99-1_113
    Published: January 24, 2020
    Released: February 22, 2020
    JOURNALS FREE ACCESS

    Cryptographic technology is a fundamental element used to realize information security. Learning about cryptography and training in cryptographic techniques are processes that are indispensable to not only researchers and engineers specialized in cryptography but also to information and communications technology (ICT) engineers, such as network engineers and operators. However, the educational environment and teaching materials on the topic of cryptographic technology for ICT engineers are not sufficient to provide practical knowledge. There are also not enough teachers who can teach the theoretical foundations as well as the technological applications of cryptography. In this report, we present the trial performed to teach the basics of cryptographic technology using ProVerif, one of the most successful automatic cryptographic protocol verifiers. Moreover, we propose a plan to develop an e-learning system for topics in cryptographic technology using ProVerif.

    Download PDF (2569K)
  • Shio MIYAFUJI, Soichiro TOYOHARA, Toshiki SATO, Hideki KOIKE
    2020 Volume 37 Issue 1 Pages 1_114-1_124
    Published: January 24, 2020
    Released: February 22, 2020
    JOURNALS FREE ACCESS

    DisplayBowl is a prototype of a semitransparent bowl shaped hemispherical display for showing omnidirectional images. DisplayBowl allows users to observe an omnidirectional image with direction data. The feature of the semitransparent bowl shaped hemispherical display solves the problem of inability to notice what happens around them, which occurs with conventional displays such as flat displays and head-mounted displays. In this paper, we conducted a user study, in which we asked participants to control a remote drone with an omnidirectional video streaming, to compare the uniqueness and advantages of three displays: a flat panel display, a head-mounted display and a DisplayBowl.

    Download PDF (3205K)
  • Koji NAKAZAWA, Makoto TATSUTA, Daisuke KIMURA, Mitsuru YAMAMURA
    2020 Volume 37 Issue 1 Pages 1_125-1_144
    Published: January 24, 2020
    Released: February 22, 2020
    JOURNALS FREE ACCESS

    We propose a new proof system for entailment checking in the separation logic with general inductive predicates. The proposed system is based on a cyclic-proof system and using the Unfold-Match-Remove proof strategy. One of the difficulties in this strategy is to find the predicates which should be unfolded. In order to solve this problem, we introduce a new inference rule, called the factor rule, which enables us to factorize the inductive predicates in spatial formulas and to find predicates to be unfolded in the Unfold-Match-Remove strategy. Our proof system is complete and decidable when we restrict inductive predicates to linear ones. We also give some experimental results by a prototype implementation of our proof-search procedure. Our system proves some challenging examples without the help of any heuristic mechanisms such as finding cut formulas or lemmas.

    Download PDF (830K)
feedback
Top