Theory and Applications of Models of Computation 15th Annual Conference, TAMC 2019, Kitakyushu, Japan, April 13-16, 2019, Proceedings

This book constitutes the refereed proceedings of the 15th Annual Conference on Theory and Applications of Models of Computation, TAMC 2019, held in Kitakyushu, Japan, in April 2019.The 43 revised full papers were carefully reviewed and selected from 60 submissions. The main themes of the selected p...

Full description

Saved in:
Bibliographic Details
Main Authors TAMC, Gopal, T. V., 和多田, 淳三
Format eBook Book
LanguageEnglish
Published Cham Springer Nature 2019
Springer
Springer International Publishing AG
Edition1
SeriesLNCS sublibrary. SL 1, Theoretical computer science and general issues
Subjects
Computer programming, programs, data
Computer science-Mathematics
Online AccessGet full text
ISBN3030148122
9783030148126
3030148114
9783030148119

Cover

Table of Contents:
  • 4 Polynomial Time Algorithms -- 4.1 The MDCL and MICL Problems -- 4.2 The MDCI and MICI Problems -- 5 Conclusion -- References -- Algorithms for Closest and Farthest String Problems via Rank Distance -- 1 Introduction -- 1.1 Our Results -- 1.2 Previous Work -- 2 Preliminaries -- 3 An Exact Algorithm for the SFRD Problem -- 4 Heuristic Algorithm for the CSRD Problem -- 5 Integer Programming Formulations for the CSRD Problem -- 5.1 The Standard IP Formulation -- 5.2 Geometric Formulation -- 6 An Exact Algorithm for the FSRD Problem -- 7 Conclusions and Future Work -- References -- Computable Analysis of Linear Rearrangement Optimization -- 1 Introduction -- 1.1 Contributions of the Paper -- 1.2 Our Approach -- 1.3 Structure of the Paper -- 2 Preliminaries -- 2.1 Rearrangement Theory -- 2.2 Further Definitions and Notations -- 3 Distribution Function and Non-increasing Rearrangement -- 4 Linear Rearrangement Optimization -- 4.1 Simple Step Function Generator -- 4.2 General Case -- 5 Generalizations -- 6 Conclusions and Future Work -- References -- On the Power of Oritatami Cotranscriptional Folding with Unary Bead Sequence -- 1 Introduction -- 2 Preliminaries -- 3 Quadratic Lower Bound for Delay 2, Arity 1 -- 4 Upper Bounds for Determinisitc Unary Oritatami Systems at Delay 1 or Arity 1 -- 4.1 Upper Bounds on the Length of Conformation Foldable Deterministically at Delay = 1 -- 4.2 Quadratic Upper Bounds for Arity 1 and Delay 2 or 3 -- 5 Conclusion -- References -- Stochastic Programming for Energy Plant Operation -- Abstract -- 1 Introduction -- 2 Introduction Model for Photovoltaic Generation -- 3 Formulation of Photovoltaic Generation Introduction Model -- 4 Piecewise Linear Approximation of Nonlinear Constraint Equation -- 5 Evaluation of Solution by Stochastic Programming -- 6 Numerical Experiments -- 7 Concluding Remarks -- References
  • Theoretical Model of Computation and Algorithms for FPGA-Based Hardware Accelerators -- 1 Introduction -- 1.1 Previous Work -- 1.2 Our Contributions -- 2 Preliminaries -- 2.1 Boolean Circuits -- 2.2 Field Programmable Gate Arrays -- 3 Model of Computation -- 4 Algorithmic Results -- 4.1 Aggregation -- 4.2 Sorting -- 4.3 Associative Operation -- 4.4 Dynamic Programs -- 4.5 Recursive Algorithms -- 5 Lower Bounds -- 5.1 I/O Model -- 5.2 Lower Bounds -- 6 Open Problems -- A Simulation of Word-RAM -- References -- On the Complexity of and Algorithms for Min-Max Target Coverage On a Line Boundary -- 1 Introduction -- 1.1 Related Works -- 1.2 Our Results -- 1.3 Organization -- 2 NP-Completeness of Decision 1D-LBTC -- 3 A Greedy Algorithm for 2D-LBTC with Uniform Sensors -- 4 The Complete Algorithms -- 4.1 A Simple Binary Search Based Algorithm -- 4.2 An Improved Algorithm via Discretized Binary Search -- 5 Conclusion -- References -- Online Travelling Salesman Problem on a Circle -- 1 Introduction -- 1.1 Preliminaries -- 1.2 Related Work -- 1.3 Our Contribution -- 2 Lower Bound Proofs -- 3 Online Algorithms -- 3.1 Algorithm for N-OLTSP-C -- 3.2 Algorithm for H-OLTSP-C -- 4 Concluding Remarks -- References -- Second-Order Linear-Time Computability with Applications to Computable Analysis -- 1 Introduction -- 2 Machines -- 2.1 Runtimes and Input Sizes -- 2.2 Second-Order Polynomials -- 2.3 Composition of Machines -- 3 A Notion of Type-Two Linear-Time -- 3.1 Counter Examples and Composition -- 3.2 Quantitative Continuity -- 4 Operating on Real Numbers and Functions -- 4.1 Signed-Digit and Cauchy Representation Compared -- 4.2 Operating on Continuous Functions -- 5 Conclusion -- References -- Consistency as a Branching Time Notion -- 1 Introduction -- 2 Basic Definitions -- 2.1 Operational Semantics -- 3 Progressive (Bi-)Consistency
  • 4 Snapshot Algorithms Analyzed
  • Intro -- Preface -- Organization -- Contents -- Battery Scheduling Problem -- 1 Introduction -- 2 Preliminaries -- 2.1 Our Results -- 3 Algorithm for EnergyMinimization -- 3.1 Analysis -- 4 Algorithm for EnergyTimeTradeoff -- 4.1 Analysis -- 5 Conclusion -- References -- The Volume of a Crosspolytope Truncated by a Halfspace -- 1 Introduction -- 2 The Volume of the Convex Hull of a Hypercube and a Point -- 3 The Volume of a Crosspolytope Truncated by a Halfspace -- 3.1 Basic Definitions -- 3.2 Our Algorithm -- 4 Conclusion and Future Works -- Appendix Supplemental Proof -- References -- Computable Isomorphisms of Distributive Lattices -- 1 Introduction -- 2 Preliminaries -- 2.1 Isomorphism Relation -- 2.2 Hyperarithmetical Equivalence Relations -- 2.3 Pairs of Computable Structures -- 2.4 Distributive Lattices -- 3 0 Isomorphism for Distributive Lattices -- 4 Consequences of the Main Result -- 4.1 Heyting Algebras -- 4.2 Undirected Graphs -- 4.3 Metric Spaces -- 4.4 Boolean Algebras with Distinguished Subalgebra -- 5 Further Discussion -- References -- Minmax-Regret Evacuation Planning for Cycle Networks -- 1 Introduction -- 2 Preliminaries -- 2.1 Model -- 2.2 Graphical Representation -- 2.3 Completion Time Functions -- 2.4 Regret -- 2.5 Road Map -- 3 Critical Vertices and Dominant Clusters -- 4 Minmax-Regret 1-Sink -- 4.1 Worst-Case Scenarios -- 4.2 Binary Search Based Algorithm -- 4.3 Proof of Theorem1 -- 5 Conclusion -- References -- Planar Digraphs for Automatic Complexity -- 1 Introduction -- 2 Automatic Complexity as Chains of Trees of Lumps -- 3 The Asymptotic Number of Words of Given Complexity -- References -- Approximation Algorithms for Graph Burning -- 1 Introduction -- 2 Approximation Algorithm for Burning Graphs -- 3 Approximation Algorithm for Trees -- 4 Algorithms for Disjoint Paths -- 5 Concluding Remarks -- References
  • Sublinear Decoding Schemes for Non-adaptive Group Testing with Inhibitors -- 1 Introduction -- 1.1 Problem Definition -- 1.2 Problem Model -- 1.3 Our Contributions -- 2 Preliminaries -- 2.1 Tensor Product -- 2.2 Reed-Solomon Codes -- 2.3 Disjunct Matrix -- 2.4 Bui et al.'s Scheme -- 3 Improved Instantiation of Nonrandom (d, r -- z]-Disjunct Matrices -- 4 Identification of Defective Items -- 4.1 Encoding Procedure -- 4.2 Decoding Procedure -- 4.3 Correctness of Decoding Procedure -- 4.4 Decoding Complexity -- 5 Identification of Defectives and Inhibitors -- 5.1 Identification of an Inhibitor -- 5.2 Encoding Procedure -- 5.3 Decoding Procedure -- 5.4 Correctness of the Decoding Procedure -- 5.5 Decoding Complexity -- 6 Simulation -- 6.1 Identification of Defective Items -- 6.2 Identification of Defectives and Inhibitors -- 7 Conclusion -- References -- Compacting and Grouping Mobile Agents on Dynamic Rings -- 1 Introduction -- 2 Preliminaries -- 3 CCP with Global Snapshot -- 3.1 The Asymmetric Case -- 3.2 The Palindrome Case -- 4 ColoredCCP with Global Snapshot and c&gt -- 2 -- 4.1 Asymmetric Initial Configuration and h 3 -- 4.2 Asymmetric Initial Configuration and h=2 -- 4.3 Palindrome Initial Configuration for c &gt -- 2 Colors -- 5 Colored CCP with Global Snapshot and c=2 -- 5.1 Asymmetric Initial Configuration -- 5.2 Palindrome Initial Configuration -- 6 Special Case: Compaction of k=2 Agents -- 7 Conclusions -- References -- Maximum Independent and Disjoint Coverage -- 1 Introduction -- 1.1 Our Contributions -- 1.2 Related Work -- 2 PTASes -- 2.1 PTASes: The MDCUD and MDCUS Problems -- 2.2 PTAS: The MICUS Problem -- 3 NP-Completeness Results -- 3.1 NP-Completeness: The MICHLVSeg Problem -- 3.2 NP-Completeness: The MDCUSeg and MICUSeg Problems -- 3.3 NP-Completeness: The MDCUD and MICUD Problems -- 3.4 NP-Completeness: The MDCUS and MICUS problems
  • Compact I/O-Efficient Representation of Separable Graphs and Optimal Tree Layouts -- 1 Introduction -- 1.1 Related Work -- 1.2 Our Contribution -- 2 Preliminaries -- 2.1 Separators -- 2.2 I/O Complexity -- 3 Representation for Random Walks -- 3.1 Proofs of Theorems1-3 -- 3.2 Expanding Relative Offsets to Relative Bit-Offsets -- 4 Separator Hierarchy -- 5 Representation for Paths in Trees -- 5.1 Hardness of Worst-Case Optimal Compact Layouts -- 6 Further Research -- References -- Unshuffling Permutations: Trivial Bijections and Compositions -- 1 Introduction -- 2 Definitions -- 3 Generalized Square Permutations and Enumerative Properties -- 4 Recognizing Generalized Square Permutations -- 5 Conclusion and Perspectives -- References -- Continuous Team Semantics -- 1 Introduction -- 2 Definitions -- 2.1 Approximate Dependence/Independence Atoms -- 3 Restricting Teams to Closed Sets -- 3.1 Closed Formulae -- 3.2 Open Formulae -- 3.3 Counterexamples -- 4 Background on Computability on Metric Spaces and for Closed Sets -- 4.1 Overtness and Compactness -- 4.2 Computable Operations on the Closed and Overt Sets -- 4.3 Compact Metric Structures -- 5 Topological Complexity -- 5.1 Topological Complexity of Dependence Atoms -- 5.2 Complexity of Formula Satisfaction -- 5.3 The Complexity of Model Checking -- 6 Translations Between Approximate Atoms -- 7 Outlook -- References -- Exact Satisfiabitity with Jokers -- 1 Introduction -- 2 The Underlying Logic and Joker Assignments -- 3 Encodings of Truth Values and Clauses -- 3.1 Encoding of Truth Values as Pairs of Booleans -- 3.2 Encoding of 2CNFs -- 3.3 Encoding of Truth Values as Triples of Booleans -- 3.4 Encoding of 3CNFs -- 4 The Decision Problem JX2SAT -- 5 The Optimisation Problem MinJX2SAT -- 6 The Decision Problem JX3SAT -- 7 An Exponential Algorithm to Solve MinJXSAT -- 8 Conclusion -- References