Mathematical Aspects of Computer and Information Sciences

Mathematical Aspects of Computer
 
Author:
Ilias S. Kotsireas, Siegfried M. Rump & Chee K. Yap
Publisher: Springer
ISBN No: 978-3-319-32859-1
Release at: 2016
Pages: 631
Edition:
First Edition
File Size: 25 MB
File Type: pdf
Language: English



Description of Mathematical Aspects of Computer and Information Sciences


This Mathematical Aspects of Computer book is a series of biennial conferences focusing on research in mathematical and computational aspects of computing and information science. It's broadly concerned with algorithms, their embedding, and their complexity in larger logical systems. At the algorithmic level, there is a rich interplay along the numerical, algebraic, geometric, topological axes. 

Content of Mathematical Aspects of Computer and Information Sciences



Invited Papers
Current Challenges in Developing Open Source Computer Algebra Systems . . . 3
Janko Böhm, Wolfram Decker, Simon Keicher, and Yue Ren

Exploiting Structure in Floating-Point Arithmetic . . . . . . . . . . . . . . . . . . . . 25
Claude-Pierre Jeannerod

Symbolic Geometric Reasoning with Advanced Invariant Algebras . . . . . . . . 35
Hongbo Li

Congruence Testing of Point Sets in Three and Four Dimensions: Results and Techniques. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 50
Günter Rote

Curves and Surfaces
Mesh Reduction to Exterior Surface Parts via Random Convex-Edge Affine Features . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 63
Andreas Beyer, Yu Liu, Hubert Mara, and Susanne Krömker 

Numeric and Certified Isolation of the Singularities of the Projection of a Smooth Space Curve. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 78
Rémi Imbach, Guillaume Moroz, and Marc Pouget

Linear k-Monotonicity Preserving Algorithms and Their Approximation Properties. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 93
S.P. Sidorov

Applied Algebraic Geometry  Workspace Multiplicity and Fault Tolerance of Cooperating Robots . . . . . . . 109
Daniel A. Brake, Daniel J. Bates, Vakhtang Putkaradze,  and Anthony A. Maciejewski

Numerical Local Irreducible Decomposition . . . . . . . . . . . . . . . . . . . . . . . . 124
Daniel A. Brake, Jonathan D. Hauenstein, and Andrew J. Sommese

Computing the Chow Variety of Quadratic Space Curves. . . . . . . . . . . . . . . 130
Peter Bürgisser, Kathlén Kohn, Pierre Lairez, and Bernd Sturmfels
Numerically Testing Generically Reduced Projective Schemes for the Arithmetic Gorenstein Property. . . . . . . . . . . . . . . . . . . . . . . . . . . . 137
Noah S. Daleo and Jonathan D. Hauenstein

Some Results Concerning the Explicit Isomorphism Problem over Number Fields. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 143
Péter Kutas

Cryptography Implementing Cryptographic Pairings on Accumulator Based Smart
Card Architectures. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 151
Peter Günther and Volker Krummel

Short Group Signatures with Distributed Traceability. . . . . . . . . . . . . . . . . . 166
Johannes Blömer, Jakob Juhnke, and Nils Löken

On the Optimality of Differential Fault Analyses on CLEFIA . . . . . . . . . . . . 181
Ágnes Kiss, Juliane Krämer, and Anke Stüber

Verified Numerical Computation
H3 and H4 Regularities of the Poisson Equation on Polygonal Domains . . . . 199
Takehiko Kinoshita, Yoshitaka Watanabe, and Mitsuhiro T. Nakao

Explicit Error Bound for Modified Numerical Iterated Integration by Means
of Sinc Methods . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 202
Tomoaki Okayama

Verified Computations for Solutions to Semilinear Parabolic Equations
Using the Evolution Operator . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 218
Akitoshi Takayasu, Makoto Mizuguchi, Takayuki Kubo,
and Shin’ichi Oishi

Verified Error Bounds for the Real Gamma Function Using Double
Exponential Formula over Semi-infinite Interval . . . . . . . . . . . . . . . . . . . . . 224
Naoya Yamanaka, Tomoaki Okayama, and Shin’ichi Oishi

Polynomial System Solving
Improving a CGS-QE Algorithm. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 231
Ryoya Fukasaku, Hidenao Iwane, and Yosuke Sato

Efficient Subformula Orders for Real Quantifier Elimination
of Non-prenex Formulas . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 236
Munehiro Kobayashi, Hidenao Iwane, Takuya Matsuzaki,
and Hirokazu Anai

Solving Extended Ideal Membership Problems in Rings of Convergent
Power Series via Gröbner Bases . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 252
Katsusuke Nabeshima and Shinichi Tajima

Advanced Algebraic Attack on Trivium . . . . . . . . . . . . . . . . . . . . . . . . . . . 268
Frank-M. Quedenfeld and Christopher Wolf

Managing Massive Data
Compressing Big Data: When the Rate of Convergence to the Entropy
Matters . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 285
Salvatore Aronica, Alessio Langiu, Francesca Marzi,
Salvatore Mazzola, Filippo Mignosi, and Giulio Nazzicone

Trends in Temporal Reasoning: Constraints, Graphs and Posets . . . . . . . . . . 290
Jacqueline W. Daykin, Mirka Miller, and Joe Ryan

Reconstructing a Sparse Solution from a Compressed Support Vector
Machine. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 305
Joachim Giesen, Sören Laue, and Jens K. Mueller

Subquadratic-Time Algorithms for Abelian Stringology Problems . . . . . . . . . 320
Tomasz Kociumaka, Jakub Radoszewski, and Bartłomiej Wiśniewski
Using Statistical Search to Discover Semantic Relations of Political Lexica Evidences from Bulgarian-Slovak EUROPARL 7 Corpus . . . . . . . . . . . . . 335
Velislava Stoykova

Computational Theory of Differential and Difference Equations
Simple Differential Field Extensions and Effective Bounds. . . . . . . . . . . . . . 343
James Freitag and Wei Li

A New Bound for the Existence of Differential Field Extensions . . . . . . . . . 358
Richard Gustavson and Omar León Sánchez

Dimension Polynomials of Intermediate Fields of Inversive Difference
Field Extensions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 362
Alexander Levin

A “Polynomial Shifting” Trick in Differential Algebra. . . . . . . . . . . . . . . . . 377
Gleb Pogudin

Data and Knowledge Exploration
Searching for Geometric Theorems Using Features Retrieved from
Diagrams . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 383
Wenya An, Xiaoyu Chen, and Dongming Wang

New Method for Instance Feature Selection Using Redundant Features
for Biological Data . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 398
Waad Bouaguel, Emna Mouelhi, and Ghazi Bel Mufti

Faceted Search for Mathematics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 406
Radu Hambasan and Michael Kohlhase

Evaluation of a Predictive Algorithm for Converting Linear Strings to
Mathematical Formulae for an Input Method . . . . . . . . . . . . . . . . . . . . . . . 421
Shizuka Shirai and Tetsuo Fukui

Algorithm Engineering in Geometric Computing
Linear Programs and Convex Hulls Over Fields of Puiseux Fractions . . . . . . 429
Michael Joswig, Georg Loho, Benjamin Lorenz, and Benjamin Schröter

Another Classroom Example of Robustness Problems in Planar Convex
Hull Computation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 446
Marc Mörig

Precision-Driven Computation in the Evaluation of Expression-Dags
with Common Subexpressions: Problems and Solutions . . . . . . . . . . . . . . . . 451
Marc Mörig and Stefan Schirra

Real Complexity: Theory and Practice
Rigorous Numerical Computation of Polynomial Differential Equations
Over Unbounded Domains . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 469
Olivier Bournez, Daniel S. Graça, and Amaury Pouly

Using Taylor Models in Exact Real Arithmetic . . . . . . . . . . . . . . . . . . . . . . 474
Franz Brauße, Margarita Korovina, and Norbert Müller
On the Computational Complexity of Positive Linear Functionals on C1⁄20; 1 . . . 489
Hugo Férée and Martin Ziegler

Average-Case Bit-Complexity Theory of Real Functions . . . . . . . . . . . . . . . 505
Matthias Schröder, Florian Steinberg, and Martin Ziegler

Certifying Trajectories of Dynamical Systems. . . . . . . . . . . . . . . . . . . . . . . 520
Joris van der Hoeven

Global Optimization
A New Matrix Splitting Based Relaxation for the Quadratic
Assignment Problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 535
Marko Lange

Global Optimization of H1 Problems: Application to Robust Control
Synthesis Under Structural Constraints. . . . . . . . . . . . . . . . . . . . . . . . . . . . 550
Dominique Monnet, Jordan Ninin, and Benoit Clement

Global Optimization Based on Contractor Programming:
An Overview of the IBEX Library. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 555
Jordan Ninin

The Bernstein Branch-and-Prune Algorithm for Constrained Global
Optimization of Multivariate Polynomial MINLPs. . . . . . . . . . . . . . . . . . . . 560
Bhagyesh V. Patil

General Session
Maximum Likelihood Estimates for Gaussian Mixtures Are Transcendental . . . 579
Carlos Améndola, Mathias Darton, and Bernd Sturmfels

On the Quality of Some Root-Bounds . . . . . . . . . . . . . . . . . . . . . . . . . . . . 591
Prashant Batra

Relative Hilbert-Post Completeness for Exceptions . . . . . . . . . . . . . . . . . . . 596
Jean-Guillaume Dumas, Dominique Duval, Burak Ekici, Damien Pous, and Jean-Claude Reynaud

Optimal Coverage in Automotive Configuration . . . . . . . . . . . . . . . . . . . . . 611
Rouven Walter, Thore Kübart, and Wolfgang Küchlin

GET THIS BOOK
Similar Books

0 comments: