arXiv subjects

Masato Tanaka

Publications and source records attributed to Masato Tanaka.

11 recordsLinked to original sources

arXiv2026

Modular fabrication and design of thick rigid-foldable origami metamaterials

Origami metamaterials offer significant potential for stiff deployable structures However, fabricating load-bearing cellular structures from thick panels introduces geometric interference at non-manifold junctions. Conventional thick-panel fabrication often disrupt ideal kinematics, thereby compromising smooth motion and scalability. This study proposes a modular fabrication framework that preserves one-degree-of-freedom rigid-folding kinematics in thick and non-manifold origami metamaterials. By decomposing non-manifold junctions into a hierarchy of stacked, modular hinged panels, our approach successfully accommodates synchronized hinge motions using scissor-like linkages. Exploiting this representation, we implement a graph-based topology optimization framework that tailors macroscopic stiffness while preserving folding connectivity. We demonstrate this approach by fabricating optimized prototypes that deploy seamlessly with a one-degree-of-freedom motion. Furthermore, we demonstrate engineering scalability through the large-scale construction of extensive deployable systems assembled from modular panels, which exhibit high load-bearing capacity. These results pave the way for the practical fabrication of structural, large-scale deployable metamaterials.

cs.CE↗

arXiv2026

Broad-band High-Energy Resolution Hard X-ray Spectroscopy using Transition Edge Sensors at SPring-8

We have succeeded in operating a transition-edge sensor (TES) spectrometer and evaluating its performance at the SPring-8 synchrotron X-ray light source. The TES spectrometer consists of a 240 pixel National Institute of Standards and Technology (NIST) TES system, and 220 pixels are operated simultaneously with an energy resolution of $4$~eV at 6~keV at a rate of about 1~c/s/pixel. The tolerance for high count rates is evaluated in terms of energy resolution and live time fraction, leading to an empirical compromise of about 2 x 10^3 c/s/all pixels with an energy resolution of 5 eV at 6 keV. By utilizing the TES's wide-band spectroscopic capability, simultaneous multi-element analysis is demonstrated for a standard sample. We conducted X-ray absorption near-edge structure (XANES) analysis in fluorescence mode using the TES spectrometer. The excellent energy resolution of the TES enabled us to detect weak fluorescence lines from dilute samples and trace elements that have previously been difficult to resolve due to the nearly overlapping emission lines of other dominant elements. The neighboring lines of As K alpha and Pb L alpha2 of the standard sample were clearly resolved and the XANES of Pb L alpha2 was obtained. Moreover, the X-ray spectrum from the small amount of Fe in aerosols was distinguished from the spectrum of a blank target, which helps us to understand the targets and the environment. These results are the first important step for the application of high resolution TES-based spectroscopy at hard X-ray synchrotron facilities.

astro-ph.IM↗

arXiv2026

Data-driven model order reduction for structures with piecewise linear nonlinearity using dynamic mode decomposition

Piecewise-linear nonlinear systems appear in many engineering disciplines. Prediction of the dynamic behavior of such systems is of great importance from practical and theoretical viewpoint. In this paper, a data-driven model order reduction method for piecewise-linear systems is proposed, which is based on dynamic mode decomposition (DMD). The overview of the concept of DMD is provided, and its application to model order reduction for nonlinear systems based on Galerkin projection is explained. The proposed approach uses impulse responses of the system to obtain snapshots of the state variables. The snapshots are then used to extract the dynamic modes that are used to form the projection basis vectors. The dynamics described by the equations of motion of the original full-order system are then projected onto the subspace spanned by the basis vectors. This produces a system with much smaller number of degrees of freedom (DOFs). The proposed method is applied to two representative examples of piecewise linear systems: a cantilevered beam subjected to an elastic stop at its end, and a bonded plates assembly with partial debonding. The reduced order models (ROMs) of these systems are constructed by using the Galerkin projection of the equation of motion with DMD modes alone, or DMD modes with a set of classical constraint modes to be able to handle the contact nonlinearity efficiently. The obtained ROMs are used for the nonlinear forced response analysis of the systems under harmonic loading. It is shown that the ROMs constructed by the proposed method produce accurate forced response results.

math.DS↗

arXiv2024

Examples of solvable and nilpotent finite quantum groups

We prove the solvability and nilpotency of Kac--Paljutkin's finite quantum group and Sekine quantum groups and we classify the solvable series of Kac--Paljutkin's finite quantum group via Cohen--Westreich's Burnside theorem. Some semisimple quasitriangular Hopf algebras of dimensions $2pq$ are also studied. In Appendix A, we give a direct computation of the universal $R$-matrices for Kac--Paljutkin's $8$-dimensional finite quantum group.

math.QA↗

arXiv2024

Shell topology optimization based on level set method

This paper proposes a level set-based method for optimizing shell structures with large design changes in shape and topology. Conventional shell optimization methods, whether parametric or nonparametric, often only allow limited design changes in shape. In the proposed method, the shell structure is defined as the isosurface of a level set function. The level set function is iteratively updated based on the shape sensitivity on the surface mesh. Therefore, the proposed method can represent an arbitrary manifold surface while dealing with topological changes, for example, from a spherical surface to a toroidal surface. We applied the proposed method to the mean compliance minimization problems of 3D shell structural designs for dome, bending plate and cantilever beam examples to demonstrate its efficacy of the proposed method.

cs.CE↗

arXiv2023

A proper generating functional on a Podle\'{s} sphere

We construct a proper generating functional $L$ on a Podle\'{s} sphere and we show that $1$-cocycle arising from $L$ coincides with the one in our previous work. We also show that our 1-cocycle is purely non Gaussian and that the full `group' $C^{\ast}$-algebra of the quantum $SL(2,\mathbb{R})$ is liminal.

math.QA↗

arXiv2023

Computational synthesis of locomotive soft robots by topology optimization

Locomotive soft robots (SoRos) have gained prominence due to their adaptability. Traditional locomotive SoRo design is based on limb structures inspired by biological organisms and requires human intervention. Evolutionary robotics, designed using evolutionary algorithms (EAs), have shown potential for automatic design. However, EA-based methods face the challenge of high computational cost when considering multiphysics in locomotion, including materials, actuations, and interactions with environments. Here, we present a design approach for pneumatic SoRos that integrates gradient-based topology optimization with multiphysics material point method (MPM) simulations. This approach starts with a simple initial shape (a cube with a central cavity). The topology optimization with MPM then automatically and iteratively designs the SoRo shape. We design two SoRos, one for walking and one for climbing. These SoRos are 3D printed and exhibit the same locomotion features as in the simulations. This study presents an efficient strategy for designing SoRos, demonstrating that a purely mathematical process can produce limb-like structures seen in biological organisms.

cs.CE↗

arXiv2023

A proper 1-cocycle on a Podle\'{s} sphere

We define $1$-cocycles on coideal $*$-subalgebras of CQG Hopf $\ast$-algebras and consider the condition for $1$-cocycles to extend to $1$-cocycles on Drinfeld double coideals. We construct a $1$-cocycle on a Podle\'{s} sphere, which extends to a $1$-cocycle on $SL_q(2,\mathbb{R})$ and prove that it is proper.

math.QA↗

arXiv2021

New Formulation for Coloring Circle Graphs and its Application to Capacitated Stowage Stack Minimization

A circle graph is a graph in which the adjacency of vertices can be represented as the intersection of chords of a circle. The problem of calculating the chromatic number is known to be NP-complete, even on circle graphs. In this paper, we propose a new integer linear programming formulation for a coloring problem on circle graphs. We also show that the linear relaxation problem of our formulation finds the fractional chromatic number of a given circle graph. As a byproduct, our formulation gives a polynomial-sized linear programming formulation for calculating the fractional chromatic number of a circle graph. We also extend our result to a formulation for a capacitated stowage stack minimization problem.

cs.DM↗

arXiv2021

Pseudo Polynomial Size LP Formulation for Calculating the Least Core Value of Weighted Voting Games

In this paper, we propose a pseudo polynomial size LP formulation for finding a payoff vector in the least core of a weighted voting game. The numbers of variables and constraints in our formulation are both bounded by $\mbox{O}(n W_+)$, where $n$ is the number of players and $W_+$ is the total sum of (integer) voting weights. When we employ our formulation, a commercial LP solver calculates a payoff vector in the least core of practical weighted voting games in a few seconds. We also extend our approach to vector weighted voting games.

cs.GT↗

arXiv2021

Monte Carlo Methods for Calculating Shapley-Shubik Power Index in Weighted Majority Games

This paper addresses Monte Carlo algorithms for calculating the Shapley-Shubik power index in weighted majority games. First, we analyze a naive Monte Carlo algorithm and discuss the required number of samples. We then propose an efficient Monte Carlo algorithm and show that our algorithm reduces the required number of samples as compared to the naive algorithm.

cs.GT↗