MACIS 2007 - CALL FOR PARTICIPATION
- From: macis2007@xxxxxxxxx (MACIS 2007)
- Date: Tue, 27 Nov 2007 20:02:16 +0100
*** Apologies for multiple postings ***
MACIS 2007 - International Conference on
Mathematical Aspects of Computer and Information Sciences
Paris, France, December 5-7, 2007
http://www-spiral.lip6.fr/MACIS2007
CALL FOR PARTICIPATION
Mathematical Aspects of Computer and Information Sciences (MACIS) is a new series of conferences where foundational research on theoretical and practical problems of mathematics for computing and information processing may be presented and discussed. MACIS also addresses experimental and case studies, scientific and engineering computation, design and implementation of algorithms and software systems, and applications of mathematical methods and tools to outstanding and emerging problems in applied computer and information sciences.
Each conference focuses on two or three themes.
The themes for MACIS 2007 are:
- Computational Geometry and Computer Aided Geometric Design
- Polynomial System Solving
- Algorithms and Complexity
The first MACIS conference took place in Beijing (China), July 24-26, 2006 (see http://www.cc4cm.org/macis2006/ for more details).
Registration information is available at http://www-spiral.lip6.fr/MACIS2007 .
INVITED SPEAKERS
Mark Van Hoeij (Florida State University, USA)
The complexity of factoring univariate polynomials over the rationals
Oliver Labs (University of Saarbrücken, GERMANY)
Visualization Challenges in Real Algebraic Geometry
Chee Yap (New York University, USA)
Complete Adaptive Subdivision Algorithms and their Analysis
GENERAL CHAIRS
Fabrice Rouillier (INRIA, France) and Zhiming Zheng (Beihang University, China)
LOCAL COMMITTEE CHAIR
Mohab Safey El Din (Université Pierre et Marie Curie, France)
PROGRAM COMMITTEE
Saugata Basu, Jean-Charles Faugere, Laureano Gonzalez-Vega (Chair), David Jeffrey, Bert Juttler, Sylvain Lazard, Konrad Polthier, Fabrice Rouillier, Raimund Seidel, Rafael Sendra, Frank Sottile, Gert Vegter, Dongming Wang,
Lihong Zhi
ACCEPTED PAPERS
Wei Wei, Binghui Guo and Zhiming Zheng.
Complexity Analysis of Random Massive Algebraic System
Mridul Aanjaneya and Monique Teillaud.
Triangulating the Real Projective Plane
Brian Moore and Bert Juettler.
Computing Roots of Polynomials using Bivariate Quadratic Clipping
Michael Bender, Sandor Fekete, Alexander Kröller, Vincenzo Liberatore, Joseph Mitchell, Valentin Polishchuk and Jukka Suomela.
The Minimum-Backlog Problem
Chris Jefferson, Peter Jeavons, Martin Green and Marc van Dongen.
Representing and Solving Finite-Domain Constraint Problems Using Systems of Polynomials
Shmuel Friedland and Mechie Nkengla.
Fast low rank approximations of matrices and tensors
David Daney, Jean Pierre Merlet and Odile Pourtallier.
Certified solutions of polynomials with uncertainties
François Boulier, Marc Lefranc, François Lemaire and Pierre-Emmanuel Morant. Model Reduction of Chemical Reaction Systems using Elimination
Serge Burckel.
Certified 2-SAT with Modus Ponens
Songxin Liang, Jürgen Gerhard and David Jeffrey.
A New Maple Package for Solving Parametric Polynomial Systems
Bingyu Li, Zhuojun Liu and Lihong Zhi.
Structured Condition Numbers of Sylvester Matrices (Extended Abstract)
Isabel Bermejo, Ignacio Garcia-Marco and Juan Jose Salazar-Gonzalez.
An algorithm for checking whether the toric ideal of an affine monomial curve is a complete intersection
Gwenole Ars and Amir Hashemi.
Efficient Computation of Syzygies by Faugere's F5 algorithm
Ekaterina Shemyakova and Franz Winkler.
On the Invariant Properties of Hyperbolic Bivariate Third-Order Linear Partial Differential Operators
Masaaki Kanno, Silvia Gandy, Hirokazu Anai and Kazuhiro Yokoyama.
Optimizing the maximal real root of a polynomial by a special cylindrical algebraic decomposition
ChenGuang LIU, Kazuyuki TANAKA and Takeshi YAMAZAKI.
On the algorithmic complexity of partially random reals
Stefan Schuster and Armin Größlinger.
On Computing Solutions of Linear Diophantine Equations with One Non-linear Parameter
Isabel Bermejo and Philippe Gimenez.
Computational aspects of Castelnuovo-Mumford regularity
Sunayana Ghosh and Gert Vegter.
Minimizing the symmetric difference distance in conic spline approximation
Claire Herrbach, Alain Denise and Serge Dulucq.
Average complexity of the Jiang-Wang-Zhang pairwise tree alignment algorithm and of a RNA secondary structure alignment algorithm
Gema M. Diaz-Toca, Laureano Gonzalez-Vega and Jounaidi Abdeljaoued.
Bezout matrices, Subresultants and Parameters
Jürgen Garloff and Andrew Smith.
Application of Bernstein Expansion to the Solution of Polynomial Problems
Mark Giesbrecht and Daniel Roche.
Interpolation of Shifted-Lacunary Polynomials
Yun Guan and Jan Verschelde.
Parallel Implementation of a Subsystem-by-Subsystem Solver
Kathy Piret and Jan Verschelde.
Computing Critical Points by Continuation
Mohab Safey El Din.
Real solving polynomial systems of inequalities: the case of bounded sets of solutions
Jorge Caravantes and Laureano Gonzalez-Vega.
Dealing with the algebraic numbers arising when analyzing arrangements of quartic plane curves
Jean-Charles Faugere and Ye Liang
Numerical Computation of Grobner Bases for Zero-dimensional Polynomial Ideals
Andre Galligo.
Resultant and Random Multivariate Polynomials
--
------------------------------------------------------
Laureano Gonzalez-Vega
Departamento de Matematicas, Estadistica y Computacion
Facultad de Ciencias, Universidad de Cantabria,
Avda. Los Castros, Santander 39005, Cantabria, Spain
Phone: (34)942201437 Fax: (34)942201402
E_mail: laureano.gonzalez@xxxxxxxxx Skype: lalo_gvega
URL: http://personales.unican.es/gonzalezl/
------------------------------------------------------
--============_-1015932357==_ma===========Content-Type: text/html; charset="iso-8859-1"
Content-Transfer-Encoding: quoted-printable
<!doctype html public "-//W3C//DTD W3 HTML//EN">
<html><head><style type="text/css"><!--
blockquote, dl, ul, ol, li { padding-top: 0 ; padding-bottom: 0 }
--></style><title>MACIS 2007 - CALL FOR
PARTICIPATION</title></head><body>
<div align="center">*** Apologies for multiple postings ***</div>
<div align="center"><br></div>
<div align="center">MACIS 2007 - International Conference on</div>
<div align="center">Mathematical Aspects of Computer and Information
Sciences</div>
<div align="center">Paris, France, December 5-7, 2007</div>
<div align="center"><br></div>
<div align="center">http://www-spiral.lip6.fr/MACIS2007</div>
<div align="center"><br></div>
<div align="center">CALL FOR PARTICIPATION</div>
<div><br></div>
<div>Mathematical Aspects of Computer and Information Sciences (MACIS)
is a new series of conferences where foundational research on
theoretical and practical problems of mathematics for computing and
information processing may be presented and discussed. MACIS also
addresses experimental and case studies, scientific and engineering
computation, design and implementation of algorithms and software
systems, and applications of mathematical methods and tools to
outstanding and emerging problems in applied computer and information
sciences.</div>
<div>Each conference focuses on two or three themes.<br>
</div>
<div>The themes for MACIS 2007 are:</div>
<div> - Computational Geometry and Computer Aided Geometric
Design</div>
<div> - Polynomial System Solving</div>
<div> - Algorithms and Complexity</div>
<div><br></div>
<div>The first MACIS conference took place in Beijing (China), July
24-26, 2006 (see http://www.cc4cm.org/macis2006/ for more
details).</div>
<div><br></div>
<div>Registration information is available at
http://www-spiral.lip6.fr/MACIS2007 .</div>
<div><br></div>
<div>INVITED SPEAKERS</div>
<div> Mark Van Hoeij (Florida State University, USA)</div>
<div> <font color="#000000"> The
complexity of factoring univariate polynomials over the
rationals</font></div>
<div> Oliver Labs (University of Saarbrücken,
GERMANY)</div>
<div><font color="#000000">
Visualization Challenges in Real Algebraic Geometry</font></div>
<div> Chee Yap (New York University, USA)</div>
<div> <font color="#000000">
Complete Adaptive Subdivision Algorithms and their
Analysis</font></div>
<div><br>
GENERAL CHAIRS</div>
<div>Fabrice Rouillier (INRIA, France) and Zhiming Zheng (Beihang
University, China)<br>
<br>
LOCAL COMMITTEE CHAIR</div>
<div>Mohab Safey El Din (Université Pierre et Marie Curie,
France)<br>
<br>
PROGRAM COMMITTEE<br>
Saugata Basu, Jean-Charles Faugere, Laureano Gonzalez-Vega (Chair),
David Jeffrey, Bert Juttler, Sylvain Lazard, Konrad Polthier, Fabrice
Rouillier, Raimund Seidel, Rafael Sendra, Frank Sottile, Gert Vegter,
Dongming Wang,</div>
<div>Lihong Zhi</div>
<div><br></div>
<div>ACCEPTED PAPERS</div>
<div>Wei Wei, Binghui Guo and Zhiming Zheng.</div>
<div>Complexity Analysis of Random Massive Algebraic System<br>
</div>
<div>Mridul Aanjaneya and Monique Teillaud.</div>
<div>Triangulating the Real Projective Plane<br>
</div>
<div>Brian Moore and Bert Juettler.</div>
<div>Computing Roots of Polynomials using Bivariate Quadratic
Clipping</div>
<div><br></div>
<div>Michael Bender, Sandor Fekete, Alexander Kröller, Vincenzo
Liberatore, Joseph Mitchell, Valentin Polishchuk and Jukka
Suomela.</div>
<div>The Minimum-Backlog Problem<br>
</div>
<div>Chris Jefferson, Peter Jeavons, Martin Green and Marc van
Dongen.</div>
<div>Representing and Solving Finite-Domain Constraint Problems Using
Systems of Polynomials</div>
<div><br></div>
<div>Shmuel Friedland and Mechie Nkengla.</div>
<div>Fast low rank approximations of matrices and tensors</div>
<div><br></div>
<div>David Daney, Jean Pierre Merlet and Odile Pourtallier.</div>
<div>Certified solutions of polynomials with
uncertainties<br>
</div>
<div>François Boulier, Marc Lefranc, François Lemaire and
Pierre-Emmanuel Morant. Model Reduction of Chemical Reaction Systems
using Elimination<br>
</div>
<div>Serge Burckel.</div>
<div>Certified 2-SAT with Modus Ponens</div>
<div><br></div>
<div>Songxin Liang, Jürgen Gerhard and David Jeffrey.</div>
<div>A New Maple Package for Solving Parametric Polynomial Systems<br>
</div>
<div>Bingyu Li, Zhuojun Liu and Lihong Zhi.</div>
<div>Structured Condition Numbers of Sylvester Matrices (Extended
Abstract)<br>
</div>
<div>Isabel Bermejo, Ignacio Garcia-Marco and Juan Jose
Salazar-Gonzalez.</div>
<div>An algorithm for checking whether the toric ideal of an affine
monomial curve is a complete intersection<br>
</div>
<div>Gwenole Ars and Amir Hashemi.</div>
<div>Efficient Computation of Syzygies by Faugere's F5 algorithm<br>
</div>
<div>Ekaterina Shemyakova and Franz Winkler.</div>
<div>On the Invariant Properties of Hyperbolic Bivariate Third-Order
Linear Partial Differential Operators<br>
</div>
<div>Masaaki Kanno, Silvia Gandy, Hirokazu Anai and Kazuhiro
Yokoyama.</div>
<div>Optimizing the maximal real root of a polynomial by a special
cylindrical algebraic decomposition</div>
<div><br></div>
<div>ChenGuang LIU, Kazuyuki TANAKA and Takeshi YAMAZAKI.</div>
<div>On the algorithmic complexity of partially random reals</div>
<div><br></div>
<div>Stefan Schuster and Armin Größlinger.</div>
<div>On Computing Solutions of Linear Diophantine Equations with One
Non-linear Parameter</div>
<div><br></div>
<div>Isabel Bermejo and Philippe Gimenez.</div>
<div>Computational aspects of Castelnuovo-Mumford regularity</div>
<div><br></div>
<div>Sunayana Ghosh and Gert Vegter.</div>
<div>Minimizing the symmetric difference distance in conic spline
approximation<br>
</div>
<div>Claire Herrbach, Alain Denise and Serge Dulucq.</div>
<div>Average complexity of the Jiang-Wang-Zhang pairwise tree
alignment algorithm and of a RNA secondary structure alignment
algorithm<br>
</div>
<div>Gema M. Diaz-Toca, Laureano Gonzalez-Vega and Jounaidi
Abdeljaoued.</div>
<div>Bezout matrices, Subresultants and Parameters<br>
</div>
<div>Jürgen Garloff and Andrew Smith.</div>
<div>Application of Bernstein Expansion to the Solution of Polynomial
Problems<br>
</div>
<div>Mark Giesbrecht and Daniel Roche.</div>
<div>Interpolation of Shifted-Lacunary Polynomials</div>
<div><br></div>
<div>Yun Guan and Jan Verschelde.</div>
<div>Parallel Implementation of a Subsystem-by-Subsystem Solver<br>
</div>
<div>Kathy Piret and Jan Verschelde.</div>
<div>Computing Critical Points by Continuation<br>
</div>
<div>Mohab Safey El Din.</div>
<div>Real solving polynomial systems of inequalities: the case of
bounded sets of solutions<br>
</div>
<div>Jorge Caravantes and Laureano Gonzalez-Vega.</div>
<div>Dealing with the algebraic numbers arising when analyzing
arrangements of quartic plane curves<br>
</div>
<div>Jean-Charles Faugere and Ye Liang</div>
<div>Numerical Computation of Grobner Bases for Zero-dimensional
Polynomial Ideals<br>
</div>
<div>Andre Galligo.</div>
<div>Resultant and Random Multivariate Polynomials</div>
<x-sigsep><pre>--
</pre></x-sigsep>
<div>------------------------------------------------------<br>
Laureano
Gonzalez-Vega <span
|</span
| <span
|</span> <br
|
Departamento de Matematicas, Estadistica y Computacion<br>
Facultad de Ciencias, Universidad de
Cantabria, <br>
Avda. Los Castros, Santander 39005, Cantabria, Spain <br>
Phone: (34)942201437
Fax: (34)942201402 <br>
E_mail: laureano.gonzalez@xxxxxxxxx Skype: lalo_gvega</div>
<div>URL:
http://personales.unican.es/gonzalezl/ <span
|</span> <br>
------------------------------------------------------<br>
</div>
</body>
</html>
--============_-1015932357==_ma============--
.
- Prev by Date: Mark Hewitt
- Next by Date: FinalCFP: RV'08 - Runtime Verification
- Previous by thread: Mark Hewitt
- Next by thread: FinalCFP: RV'08 - Runtime Verification
- Index(es):
Relevant Pages
|
