SearcharxivSearch

arXiv subjects

Ryosuke Yamamoto

Publications and source records attributed to Ryosuke Yamamoto.

7 recordsLinked to original sources

Violet: Enabling Full Virtualization for M-mode RTOS on RISC-V

In embedded systems, complex configurations may be required, such as the simultaneous execution of a real-time operating system (RTOS) and a general-purpose operating system (GPOS), or the operation of multiple RTOS instances. Embedded system hypervisors have been studied and developed to meet these requirements for architectures like ARM and x86. RISC-V is experiencing growing adoption in embedded systems and faces similar needs. However, RISC-V's virtualization support targets only U-mode (where applications run) and S-mode (where general-purpose OSs run) as virtualization levels. The M-mode, where RTOSs like FreeRTOS or Zephyr run, is excluded from virtualization. This means that, similar to architectures like ARM, running an RTOS on a Virtual Machine (VM) using methods based on virtualization support features is impossible. Therefore, this paper proposes the Violet hypervisor. Violet combines RISC-V's virtualization features with software-based emulation, enabling the execution of unmodified M-mode RTOSs. Evaluation verified the validity of the M-mode emulation functionality using RISC-V architecture tests. Furthermore, this was implemented on the SiFive HiFive Premier P550 hardware, demonstrating that existing RTOSs can run on Violet's VM and that coexistence with GPOSs like Linux is also possible. The performance evaluation also quantified the overhead introduced by M-mode emulation on M-mode CSR accesses, timer interrupt latency, and context switching.

cs.OS

Enhancing AI System Resiliency: Formulation and Guarantee for LSTM Resilience Based on Control Theory

This paper proposes a novel theoretical framework for guaranteeing and evaluating the resilience of long short-term memory (LSTM) networks in control systems. We introduce "recovery time" as a new metric of resilience in order to quantify the time required for an LSTM to return to its normal state after anomalous inputs. By mathematically refining incremental input-to-state stability ($\delta$ISS) theory for LSTM, we derive a practical data-independent upper bound on recovery time. This upper bound gives us resilience-aware training. Experimental validation on simple models demonstrates the effectiveness of our resilience estimation and control methods, enhancing a foundation for rigorous quality assurance in safety-critical AI applications.

cs.AI

Partitions of cyclic words and Goldman-Turaev Lie bialgebra

The free $\mathbb{Z}$-module generated from the set of non-trivial homotopy classes of closed curves on an oriented surface has the structure of Lie bialgebra by two operations, the Goldman bracket and Turaev cobracket. M. Chas gave a combinatorial redefinition of these two operations through a natural identification of the homotopy classes of closed curves on the surface with the cyclic words in the generators and their inverses of the fundamental group of the surface. We present a new approach to give a combinatorial definition of the bracket and cobracket, focusing on the information given by the partitions of cyclic words.

math.GT

A sharp sparse domination of pseudodifferential operators

In this paper, we give a sharp sparse domination of pseudodifferential operators associated with symbols belonging to the Hörmander class, and fundamental solutions of dispersive equations. Furthermore, we give boundedness results of these operators on weighted Besov spaces by using the sparse domination.

math.FA

Geometric intersection number of simple closed curves on a surface and symplectic expansions of free groups

For two oriented simple closed curves on a compact orientable surface with a connected boundary we introduce a simple computation of a value in the first homology group of the surface, which detects in some cases that the geometric intersection number of the curves is greater than zero when their algebraic intersection number is zero. The value, computed from two elements of the fundamental group of the surface corresponding to the curves, is found in the difference between one of the elements and its image of the action of Dehn twist along the other. To give a description of the difference symplectic expansions of free groups is an effective tool, since we have an explicit formula for the action of Dehn twist on the target space of the expansion due to N.\ Kawazumi and Y.\ Kuno.

math.GT

Open books supporting overtwisted contact structures and Stallings twist

We study open books (or open book decompositions) of a closed oriented 3-manifold which support overtwisted contact structures. We focus on a simple closed curve along which one can perform Stallings twist, called ``twisting loop''. We show that the existence of a twisting loop on the fiber surface of an open book is equivalent up to positive stabilization to the existence of an overtwisted disk in the contact manifold supported by the open book. We also show a criterion for overtwistedness using a certain arc properly embedded in the fiber surface, which is an extension of Goodman's one.

math.GT

Almost alternating diagrams and fibered links in S^3

Let $L$ be an oriented link with an alternating diagram $D$. It is known that $L$ is a fibered link if and only if the surface $R$ obtained by applying Seifert's algorithm to $D$ is a Hopf plumbing. Here, we call $R$ a Hopf plumbing if $R$ is obtained by successively plumbing finite number of Hopf bands to a disk. In this paper, we discuss its extension so that we show the following theorem. Let $R$ be a Seifert surface obtained by applying Seifert's algorithm to an almost alternating diagrams. Then $R$ is a fiber surface if and only if $R$ is a Hopf plumbing. We also show that the above theorem can not be extended to 2-almost alternating diagrams, that is, we give examples of 2-almost alternating diagrams for knots whose Seifert surface obtained by Seifert's algorithm are fiber surfaces that are not Hopf plumbing. This is shown by using a criterion of Melvin-Morton.

math.GT