Research Achievements - Other -
-
Hoshi Kaito, Yamamura Akihiro, Fazekas Szilard Zsolt
数理解析研究所講究録 ( 京都大学数理解析研究所 ) ( 2188 ) 125 - 130 2021.07
Recently, new types of non-sequential machine models have been introduced and studied, such as jumping automata and one-way jumping automata. We study the abilities and limitations of automata with these two jumping modes of tape heads with respect to how they affect the class of accepted languages. We give several methods to determine whether a language is accepted by a machine with jumping mode. We also consider relationships among the classes of languages defined by the new machines and their classical counterparts.
-
Fazekas Szilard Zsolt, Mercas Robert
数理解析研究所講究録 ( 京都大学数理解析研究所 ) ( 2188 ) 131 - 140 2021.07
This work proposes a new approach towards solving an over 20 years old conjecture regarding the maximum number of distinct squares that a word can contain. To this end we look at clusters of repetition roots, that is, the set of positions where the root u of a repetition u^[l] occurs. We lay the foundation of this theory by proving basic properties of these clusters and establishing upper bounds on the number of distinct squares when their roots form a chain with respect to the prefix order.
-
An Experiment with Ant Colony Optimization for Edge Detection in Images (代数系、論理、言語とその周辺領域)
MuhammadAsyranbinOthman, Fazekas Szilard Zsolt, Yamamura Akihiro
数理解析研究所講究録 ( 京都大学数理解析研究所 ) ( 2096 ) 90 - 101 2018.12
Ant colony optimization (ACO) is a simulation of the natural behavior of ant species; where ants find the shortest path between its nest and food source. Image edge detection is a basic image processing task, where the outlines of the objects in an image are identified, and then extracted. We present the results of an experiment conducted with the ACO algorithm applied to the edge detection problem.
-
An experiment with ant colony optimization for edge detection in images
Muhammad Asyran, bin, Othman, Szilard, Zsolt Fazekas, Akihiro Yamamura
2096 90 - 101 2018.12
-
Tsuya Kohei, Takaya Mayumi, Fazekas Szilard Zsolt, Yamamura Akihiro
数理解析研究所講究録 ( 京都大学数理解析研究所 ) ( 2051 ) 149 - 157 2017.10
We apply the firefly algorithm to the uncapacitatcd facility location problem which is one of optimization problems and investigate the optimum number of the fireflies. The light absorption coefficient parameter $gamma$ of the firefly algorithm is examined to obtain better performance and suitable values of $gamma$ are explored for the uncapacitated facility location problem. Effectiveness of local search in the firefly algorithm is also investigated. In addition, we investigate the optimum number of fireflies for the firefly algorithm.
-
属性ベース署名を用いた匿名シングルサインオンの提案 (言語、論理、代数系と計算機科学の展開)
堀川 航洋, 高谷 眞弓, Fazekas Szilard Zsolt, 山村 明弘
数理解析研究所講究録 ( 京都大学数理解析研究所 ) ( 2051 ) 158 - 166 2017.10
-
Firefly Algorithm for Uncapacitated Facility Location Problem and Number of Fireflies
TSUYA Kohei, TAKAYA Mayumi, FAZEKAS Szilard Zsolt, YAMAMURA Akihiro
2051 149 - 157 2017.10