KUKazunori Ueda

Kazunori Ueda

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Kazunori Ueda has a total of 49 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Graph Rewriting Language as a Platform for Quantum Diagrammatic Calculi

    by Kayo Tei, Haruto Mishina, Naoki Yamamoto, Kazunori Ueda

  • Open Access

    Grammar-based Pattern Matching and Type Checking for Difference Data Structures

    by Naoki Yamamoto, Kazunori Ueda

    We propose to extend the concept of difference lists to general data structures and call them difference data structures. Difference lists are well-known in logic programming as a data structure that realizes constant-time concatenation by retaining a reference to the tail as well as the head of the list. In recent years, they are also called list segments and appear as a typical example of separation logic, a logic for handling heaps and pointers. Difference data structures can be utilized to discuss various important concepts in programming languages including functions, evaluation contexts, and continuations, in a unified setting. To handle such structures succinctly and safely, we base this work on a graph rewriting language. We propose a typing method for graph rewriting languages based on graph grammar, which covers structures beyond algebraic data types, to allow users to define difference data types for two different major applications, i.e., (i) users can describe powerful pattern matching with user-defined shapes and (ii) the implementation can statically type-check operations on difference data structures efficiently. Our method introduces the concept of difference at the meta-level, i.e., difference data types are automatically derived from the base data type defined by graph grammar so that we can treat the base structure and difference structure uniformly without type conversion.


  • Open Access

    Enhancing Bundle Delivery Efficiency in Mobile Ad-hoc Networks with a Multi-protocol Delay-Tolerant Network

    by Olivia Nakayima, Mostafa I. Soliman, Kazunori Ueda, Samir A. Elsagheer

    Mobile Ad-hoc Networks (MANETs) are challenged by highly dynamic network conditions like delayed or frequently disrupted communication. Traditional MANETs typically rely on a single Delay-Tolerant Network (DTN) routing protocol across all nodes, which can limit efficiency in unfavourable network conditions. To address this, our research introduces a dynamic approach, employing multiple DTN routing protocols concurrently within a MANET. Each node can adaptively operate on a distinct DTN routing protocol based on the prevailing network conditions. This strategy harnesses the strengths of each protocol while mitigating their limitations, resulting in a notable enhancement in the delivery ratio, as evidenced by simulations of different network scenarios. Comparatively, this multi-protocol approach outperforms single-protocol MANETs, as simulated by the Opportunistic Network Environment (ONE) simulator. The findings emphasize that a multi-protocol strategy enhances adaptability, robustness, and overall performance in MANETs, offering a transformative approach to wireless communication network management and operation.

  • Open Access

    Combining Software-Defined and Delay-Tolerant Networking Concepts With Deep Reinforcement Learning Technology to Enhance Vehicular Networks

    by Olivia Nakayima, Mostafa I. Soliman, Kazunori Ueda, Samir A. Elsagheer Mohamed

    Ensuring reliable data transmission in all Vehicular Ad-hoc Network (VANET) segments is paramount in modern vehicular communications. Vehicular operations face unpredictable network conditions which affect routing protocol adaptiveness. Several solutions have addressed those challenges, but each has noted shortcomings. This work proposes a centralised-controller multi-agent (CCMA) algorithm based on Software-Defined Networking (SDN) and Delay-Tolerant Networking (DTN) principles, to enhance VANET performance using Reinforcement Learning (RL). This algorithm is trained and validated with a simulation environment modelling the network nodes, routing protocols and buffer schedules. It optimally deploys DTN routing protocols (Spray and Wait, Epidemic, and PRoPHETv2) and buffer schedules (Random, Defer, Earliest Deadline First, First In First Out, Large/smallest bundle first) based on network state information (that is; traffic pattern, buffer size variance, node and link uptime, bundle Time To Live (TTL), link loss and capacity). These are implemented in three environment types; Advanced Technological Regions, Limited Resource Regions and Opportunistic Communication Regions. The study assesses the performance of the multi-protocol approach using metrics: TTL, buffer management,link quality, delivery ratio, Latency and overhead scores for optimal network performance. Comparative analysis with single-protocol VANETs (simulated using the Opportunistic Network Environment (ONE)), demonstrate an improved performance of the proposed algorithm in all VANET scenarios.


  • Open Access

    Type Checking Data Structures More Complex than Trees

    by Jin Sano, Naoki Yamamoto, Kazunori Ueda

    Graphs are a generalized concept that encompasses more complex data structures than trees, such as difference lists, doubly-linked lists, skip lists, and leaf-linked trees. Normally, these structures are handled with destructive assignments to heaps, which is opposed to a purely functional programming style and makes verification difficult. We propose a new purely functional language, λGT, that handles graphs as immutable, first-class data structures with a pattern matching mechanism based on Graph Transformation and developed a new type system, FGT, for the language. Our approach is in contrast with the analysis of pointer manipulation programs using separation logic, shape analysis, etc. in that (i) we do not consider destructive operations but pattern matchings over graphs provided by the new higher-level language that abstract pointers and heaps away and that (ii) we pursue what properties can be established automatically using a rather simple typing framework.


  • Open Access

    Engineering Grammar-Based Type Checking for Graph Rewriting Languages

    by Naoki Yamamoto, Kazunori Ueda

    The ability to handle evolving graph structures is important both for programming languages and modeling languages. Of various languages that adopt graphs as primary data structures, a graph rewriting language LMNtal provides features of both (concurrent) programming languages and modeling languages, and its implementation unifies ordinary program execution and model checking functionalities. Unlike pointer manipulation in imperative languages, LMNtal allows us to manipulate graph structures in such a way that the well-formedness of graphs is guaranteed by the language itself. However, since the shapes of graphs can be complex and diverse compared to algebraic data structures such as lists and trees, it is a non-obvious important task to formulate types of graphs to verify individual programs. With this motivation, this paper discusses LMNtal ShapeType, a type checking framework that applies the basic idea of Structured Gamma to a concrete graph rewriting language. Types are defined by generative grammars written as LMNtal rules, and type checking of LMNtal programs can accordingly be done by exploiting the model checking features of LMNtal itself. We gave a full implementation of type checking exploiting the features of the LMNtal meta-interpreter and confirmed that it works for practical operations on various graph structures, including single-step and multi-step operations on non-algebraic data structures and data structures with numerical shape constraints.


  • Open Access

    Interlocking 3D-printed bars, trusses and space frames to build arbitrarily large structures

    by Kazunori Ueda

    It is shown that the 'Tsugite' (joint) technology used in the traditional Japanese construction method turns to be highly useful and practical in making small 3D-printed modules that can then be assembled to build arbitrarily large structures made up of bars and trusses. Of numerous variations of the Tsugite technology, we choose and focus on Okkake Daisen Tsugi, one of the most widely used methods for joining beams and columns, and study how it can be scaled down in such a way that it can be printed with low-cost FDM 3D printers using PETG and PLA filaments. Our tensile test shows that a 4.8 mm square bar with an Okkake Daisen Tsugi joint comes with a breaking load of 160-210 N. We further applied our idea to build arbitrarily large, functional 2D trusses and 3D trusses (space frames), which are expected to open up many new applications.