Akitoshi Kawamura
YOU?
Author Swipe
View article: A Computer-Assisted Proof of the Optimal Density Bound for Pinwheel Covering
A Computer-Assisted Proof of the Optimal Density Bound for Pinwheel Covering Open
In the covering version of the pinwheel scheduling problem, a daily task must be assigned to agents under the constraint that agent $i$ can perform the task at most once in any $a_i$-day interval. In this paper, we determine the optimal co…
View article: Insights into widespread disturbance in gene expression and severe growth inhibition observed in transgenic rice producing polyhydroxybutyrate
Insights into widespread disturbance in gene expression and severe growth inhibition observed in transgenic rice producing polyhydroxybutyrate Open
Production of polyhydroxybutyrate (PHB), a kind of biodegradable polymer, was attempted using transformant rice, in which the genes involved in PHB biosynthesis in Cupriavidus necator were introduced. Accumulation of PHB was observe…
View article: Perpetual Scheduling Under Frequency Constraints
Perpetual Scheduling Under Frequency Constraints Open
We provide a brief overview of theoretical results to date on perpetual scheduling problems where we want to schedule recurring tasks or agents with minimum or maximum frequency requirements.
View article: The Ultimate Signs of Second-Order Holonomic Sequences
The Ultimate Signs of Second-Order Holonomic Sequences Open
A real-valued sequence f = {f(n)}_{n ∈ ℕ} is said to be second-order holonomic if it satisfies a linear recurrence f (n + 2) = P (n) f (n + 1) + Q (n) f (n) for all sufficiently large n, where P, Q ∈ ℝ(x) are rational functions. We study t…
View article: Proof of the Density Threshold Conjecture for Pinwheel Scheduling
Proof of the Density Threshold Conjecture for Pinwheel Scheduling Open
In the pinwheel scheduling problem, each task i is associated with a positive integer ai called its period, and we want to (perpetually) schedule one task per day so that each task i is performed at least once every ai days. An obvious nec…
View article: Simple strategies versus optimal schedules in multi-agent patrolling
Simple strategies versus optimal schedules in multi-agent patrolling Open
View article: SUN-054 A CASE WITH ASCITES, PROTEINURIA AND OLIGURIA FOLLOWING POST-PARTUM HELLP SYNDROME TREATED BY EXTRACORPOREAL ULTRAFILTRATION: RENAL CONGESTION AS THE 4TH CATEGORY OF ACUTE KIDNEY INJURY
SUN-054 A CASE WITH ASCITES, PROTEINURIA AND OLIGURIA FOLLOWING POST-PARTUM HELLP SYNDROME TREATED BY EXTRACORPOREAL ULTRAFILTRATION: RENAL CONGESTION AS THE 4TH CATEGORY OF ACUTE KIDNEY INJURY Open
Heart failure often causes acute kidney injury (AKI) and the relationship is called cardiorenal syndrome. Not only low cardiac output, but also renal congestion is increasingly considered as the major cause of AKI among heart failure patie…
View article: A lower bound on opaque sets
A lower bound on opaque sets Open
View article: Sequentially Swapping Colored Tokens on Graphs
Sequentially Swapping Colored Tokens on Graphs Open
We consider a puzzle consisting of colored tokens on an $n$-vertex graph, where each token has a distinct starting vertex and a set of allowable target vertices for it to reach, and the only allowed transformation is to "sequentially" move…
View article: Representation Theory of Compact Metric Spaces and Computational Complexity of Continuous Data
Representation Theory of Compact Metric Spaces and Computational Complexity of Continuous Data Open
Choosing an encoding over binary strings for input/output to/by a Turing Machine is usually straightforward and/or inessential for discrete data (like graphs), but delicate -- heavily affecting computability and even more computational com…
View article: Quantitatively Admissible Representations and the "Main Theorem" of Type-2 COMPLEXITY Theory.
Quantitatively Admissible Representations and the "Main Theorem" of Type-2 COMPLEXITY Theory. Open
Choosing an encoding over binary strings for input/output to/by a Turing Machine is usually straightforward and/or inessential for discrete data (like graphs), but crucially affects the computability of problems involving continuous data (…
View article: Invitation to Real Complexity Theory: Algorithmic Foundations to Reliable Numerics with Bit-Costs
Invitation to Real Complexity Theory: Algorithmic Foundations to Reliable Numerics with Bit-Costs Open
While concepts and tools from Theoretical Computer Science are regularly applied to, and significantly support, software development for discrete problems, Numerical Engineering largely employs recipes and methods whose correctness and eff…
View article: Average-Case Polynomial-Time Computability of Hamiltonian Dynamics
Average-Case Polynomial-Time Computability of Hamiltonian Dynamics Open
We apply average-case complexity theory to physical problems modeled by continuous-time dynamical systems. The computational complexity when simulating such systems for a bounded time-frame mainly stems from trajectories coming close to co…
View article: Polynomial running times for polynomial-time oracle machines
Polynomial running times for polynomial-time oracle machines Open
This paper introduces a more restrictive notion of feasibility of functionals on Baire space than the established one from second-order complexity theory. Thereby making it possible to consider functions on the natural numbers as running t…
View article: Polynomial Running Times for Polynomial-Time Oracle Machines
Polynomial Running Times for Polynomial-Time Oracle Machines Open
This paper introduces a more restrictive notion of feasibility of functionals on Baire space than the established one from second-order complexity theory. Thereby making it possible to consider functions on the natural numbers as running t…
View article: Folding and Punching Paper
Folding and Punching Paper Open
We show how to fold a piece of paper and punch one hole so as to produce any desired pattern of holes.Given n points on a piece of paper (finite polygon or infinite plane), we give algorithms to fold the paper flat so that those n points a…
View article: A Lower Bound on Opaque Sets
A Lower Bound on Opaque Sets Open
It is proved that the total length of any set of countably many rectifiable curves, whose union meets all straight lines that intersect the unit square U, is at least 2.00002. This is the first improvement on the lower bound of 2 by Jones …
View article: Measuring the Complexity of Computational Content (Dagstuhl Seminar 15392)
Measuring the Complexity of Computational Content (Dagstuhl Seminar 15392) Open
This report documents the program and the outcomes of Dagstuhl Seminar 15392 "Measuring the Complexity of Computational Content: Weihrauch Reducibility and Reverse Analysis." It includes abstracts on most talks presented during the seminar…
View article: Weight Balancing on Boundaries
Weight Balancing on Boundaries Open
Given a polygonal region containing a target point (which we assume is the origin), it is not hard to see that there are two points on the perimeter that are antipodal, that is, whose midpoint is the origin. We prove three generalizations …
View article: Computational benefit of smoothness: Parameterized bit-complexity of numerical operators on analytic functions and Gevrey’s hierarchy
Computational benefit of smoothness: Parameterized bit-complexity of numerical operators on analytic functions and Gevrey’s hierarchy Open
The synthesis of (discrete) Complexity Theory with Recursive Analysis provides a quantitative algorithmic foundation to calculations over real numbers, sequences, and functions by approximation up to prescribable absolute error 1/2n (rough…