Zobrazeno 1 - 10
of 6 073
pro vyhledávání: '"Masuzawa A"'
Autor:
Espinos, Driss Oumbarek, Zhidkov, Alexei, Rondepierre, Alexandre, Tawada, Masafumi, Masuzawa, Mika
Particle in cell simulations are widely used in most fields of physics to investigate known and new phenomena which cannot be directly observed or measured yet. However, the computational and time resources needed for PICs make them impractical when
Externí odkaz:
http://arxiv.org/abs/2411.04703
The independent set reconfiguration problem (ISReconf) is the problem of determining, for given independent sets I_s and I_t of a graph G, whether I_s can be transformed into I_t by repeatedly applying a prescribed reconfiguration rule that transform
Externí odkaz:
http://arxiv.org/abs/2407.11768
An \emph{$\alpha$-approximate vertex fault-tolerant distance sensitivity oracle} (\emph{$\alpha$-VSDO}) for a weighted input graph $G=(V, E, w)$ and a source vertex $s \in V$ is the data structure answering an $\alpha$-approximate distance from $s$ t
Externí odkaz:
http://arxiv.org/abs/2401.01103
Consider that there are $k\le n$ agents in a simple, connected, and undirected graph $G=(V,E)$ with $n$ nodes and $m$ edges. The goal of the dispersion problem is to move these $k$ agents to mutually distinct nodes. Agents can communicate only when t
Externí odkaz:
http://arxiv.org/abs/2310.04376
We propose a self-stabilizing leader election (SS-LE) protocol on ring networks in the population protocol model. Given a rough knowledge $\psi = \lceil \log n \rceil + O(1)$ on the population size $n$, the proposed protocol lets the population reach
Externí odkaz:
http://arxiv.org/abs/2305.08375
Autor:
Masayuki Hiraki, Kiminori Yanagisawa, Ryo Ikeshima, Taishi Hata, Kazumasa Komura, Asami Arita, Shinsuke Katsuyama, Go Shinke, Mitsuru Kinoshita, Yoshiaki Ohmura, Keijiro Sugimura, Toru Masuzawa, Yutaka Takeda, Kohei Murata
Publikováno v:
BMC Surgery, Vol 24, Iss 1, Pp 1-8 (2024)
Abstract Background Robotic three-dimensional magnified visual effects and field of view stabilization have enabled precise surgical operations. Intracorporeal anastomosis in right-sided colorectal cancer surgery is expected to shorten operation time
Externí odkaz:
https://doaj.org/article/8587eeebddaa489fa5fd327183f9aa4e
This paper describes a method of domain adaptive training for semantic segmentation using multiple source datasets that are not necessarily relevant to the target dataset. We propose a soft pseudo-label generation method by integrating predicted obje
Externí odkaz:
http://arxiv.org/abs/2303.00979
We investigated the computational power of a single mobile agent in an $n$-node graph with storage (i.e., node memory). Generally, a system with one-bit agent memory and $O(1)$-bit storage is as powerful as that with $O(n)$-bit agent memory and $O(1)
Externí odkaz:
http://arxiv.org/abs/2211.00332
Autor:
Atsushi Takeno, Masaaki Motoori, Kentaro Kishi, Takeshi Omori, Motohiro Hirao, Toru Masuzawa, Kazumasa Fujitani, Kazuyoshi Yamamato, Yukinori Kurokawa, Yuichiro Doki
Publikováno v:
Annals of Gastroenterological Surgery, Vol 8, Iss 3, Pp 431-442 (2024)
Abstract Background Conversion surgery (CS) is a highly anticipated strategy for stage IV advanced gastric cancer (AGC) with a good response to chemotherapy. However, prognostic factors limiting R0 resection remain unclear. In this multi‐institutio
Externí odkaz:
https://doaj.org/article/c059f0eccef74181a6b59eebdeb5ca7d
We investigate the computational power of the deterministic single-agent model where the agent and each node are equipped with a limited amount of persistent memory. Tasks are formalized as decision problems on properties of input graphs, i.e., the t
Externí odkaz:
http://arxiv.org/abs/2209.01906