SYNASC 2011

13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
September 26-29, 2011, Timisoara, Romania
http://synasc11.info.uvt.ro/

Aim

SYNASC aims to stimulate the interaction between the two scientific communities of symbolic and numeric computing and to exhibit interesting applications of the areas both in theory and in practice. The choice of the topic is motivated by the belief of the organizers that the dialogue between the two communities is very necessary for accelerating the progress in making the computer a truly intelligent aid for mathematicians and engineers.

Important Dates

Topics of Interest

* Symbolic Computation

+ computer algebra
+ symbolic techniques applied to numerics
+ hybrid symbolic and numeric algorithms
+ numerics and symbolics for geometry
+ programming with constraints, narrowing

* Logic and Programming

+ automatic reasoning
+ formal system verification
+ formal verification and synthesis
+ software quality assessment
+ static analysis
+ timing analysis

* Artificial Intelligence

+ hard computational problem solving
+ intelligent systems (front-ends) for scientific computing
+ agent-based complex systems modeling and development
+ knowledge and data intensive systems
+ soft computing
+ recommender systems for scientific computing
+ data mining and web mining
+ information retrieval
+ hybrid systems

* Numerical Computing

+ iterative approximation of fixed points
+ solving systems of nonlinear equations
+ numerical and symbolic algorithms for differential equations
+ numerical and symbolic algorithms for optimization
+ parallel algorithms for numerical computing
+ scientific visualization and image processing

* Distributed Computing

+ parallel, distributed and web computing for symbolics and numerics
+ cloud computing
+ grid middleware and applications
+ agent-based grid computing
+ grid services
+ workflow management

Symposium special sessions

* Advances in the Theory of Computing

+ Data Structures and algorithms;
+ Combinatorial Optimization;
+ Formal languages and Combinatorics on Words.;
+ Graph-theoretic and Combinatorial methods in Computer Science;
+ Algorithmic paradigms, including distributed, online, approximation, probabilistic, game-theoretic algorithms.
+ Computational Complexity Theory, including structural complexity, boolean complexity, communication complexity, average-case complexity, derandomization and property testing.
+ Logical approaches to complexity, including finite model theory;
+ Algorithmic and computational learning theory;
+ Aspects of computability theory, including computability in analysis and algorithmic information theory;
+ Proof complexity;
+ Computational social choice and game theory;
+ New computational paradigms: CNN computing, quantum, holographic and other non-standard approaches to Computability;
+ Randomized methods, random graphs, threshold phenomena and typical-case complexity;
+ Automata theory and other formal models, particularly in relation to formal verification methods such as model checking and runtime verification;
+ Applications of theory, including wireless and sensor networks, computational biology and computational economics;
+ Experimental algorithmics;

Submission

Submissions of research papers are invited. The papers must contain original research results not submitted and not published elsewhere.

The submission process consists of two steps:

* In the first step the authors are invited to express their intention to participate at the conference by submitting a short abstract (1/2 page, at maximum) where the main contributions of the paper are clearly stated.

* In the second step the authors should submit the full paper (up to 8 pages prepared according to this style).

Both the abstract and the full paper should be submitted electronically through
http://www.easychair.org/conferences/?conf=synasc2011 .

Publication

* The research papers accepted and presented at the conference will be collected in  post-proceedings published by Conference Publishing Service (CPS) (ISI Proceedings). For previous proceedings see http://ieeexplore.ieee.org.
* The SYNASC post-proceedings will be submitted for indexing to: ISI Web of Knowledge, ACM Digital Library, EI Compendex, DBLP, SCOPUS.

Workshops

* 8th Workshop on Natural Computing and Applications

+ Evolutionary computing,
+ Neural computing, Bayesian networks, learning algorithms,
+ Membrane computing, DNA computing, molecular computing,information processing in cells and tissues,
+ Quantum computing,
+ Immunocomputing,
+ Swarm intelligence, particle swarm optimization, ant colony optimization, artificial bee colony
+ Bacterial foraging
+ Computation with words, granular computation,
+ Artificial life, emergent computing and self-organizing systems, complex adaptive systems
+ Hybridization of evolutionary, neural, molecular and quantum computing,
+ Hybrid optimization algorithms involving natural computing techniques and other global and local optimization methods,
+ Integration of natural computing techniques in intelligent systems,
+ Implementation issues of natural computing techniques,
+ Natural computing approaches for multi-objective, multimodal and dynamic optimization,
+ Natural computing approaches in knowledge discovery, natural language processing, image processing, planning and scheduling,information security, human-computer interaction, Web Intelligence, Web-based support systems,
+ Natural computing applications in science, business, finance,  engineering,  medicine, bioinformatics and other fields.

* 8th Workshop on Agents for Complex Systems

+ Agent-based distributed problem solving
+ Multi-agent programming languages  
+ Agent oriented software design and methodology
+ Quantitative and qualitative analysis / modeling of multi-agent systems
+ Task-based agent context and task-oriented agents
+ Multi-agent systems for modeling and simulation
+ Recommendation agents for scientific problem solving
+ Distributed knowledge integration and sharing for scientific applications
+ Agent based resource and service discovery
+ Agents and emergent behavior
+ Learning in multi-agent systems

* High Performance Computing with application in environment

+ Multicore/manycore architectures in environmental applications
+ GPU support for environmental applications
+ Cluster, Grid and Cloud Computing in environmental applications
+ Parallelization of compute- or data-intensive tasks in environmental applications
+ Data handling, integration and visualization in environmental applications
+ Distributed infrastructures for environmental applications
+ Programming paradigms for high-performance computing in environmental applications
+ Tools and programming environments supporting high-performance computing in environmental applications
+ Scheduling in high-performance computing for environmental applications
+ Workflow management and remote collaboration in environmental applications
+ System level support for high-performance computing in environmental applications
+ Fault-tolerance of distributed environmental applications
+ Scalability of infrastructures and applications in environmental applications

* Iterative aproximation of Fixed Points

+ Picard, Mann, Ishikawa and other type iterations.
+ Weakly Picard operators.
+ Ciric operators.
+ Almost contractions.
+ Demicontractive operators.
+ Strong convergence of the Mann/Ishikawa iterations.
+ Stability of iteration procedures.
+ Ulam-Hyers stability and fixed points.
+ Applications (convex feasibility, variational inequalities, etc.).

Tutorials

* Symbolic Computation and Theorem Proving for Verified Software

* Symbolic Computation

+ Groebner basis
+ Quantifier elimination
+ Symbolic summation

* Theorem Proving

+ Resolution and superposition calculus
+ Saturation algorithms
+ Redundancy elimination

* Program Assertion Synthesis using Symbolic Computation

+ Program verification
+ Inductive assertions
+ Polynomial invariants

* Invariant Generation using Theorem Proving

+ Quantified invariants
+ Interpolants
+ Symbol elimination

Invited Speakers

* Erich Kaltofen, Mathematics Department, North Carolina State University, USA
+ Talk: "What is hybrid symbolic-numeric computation"
* Gerald Schaefer, Department of Computer Science, Loughborough University, UK
+ Talk: "Hybrid fuzzy rule-based classification"
* Franz Winkler, RISC-Linz, Johannes Kepler University, Austria
+ Talk: "What can Symbolic Computation contribute to Mathematics?"

Invited Tutorial Speakers

* Laura Kovacs, Vienna University of Technology, Austria
+ Talks: "Program Assertion Synthesis using Symbolic Computation"
"Invariant Generation using Theorem Proving"
* Veronika Pillwein, Johannes Kepler University, Austria
+ Talk: "Symbolic Computation (Groebner Bases, Cylindrical Decomposition,  Symbolic Summation)"
* Andrei Voronkov, The University of Manchester, UK
+ Talk: "Theorem Proving"

Honorary Chairs

* Bruno Buchberger, Johannes Kepler University, Austria
* Stefan Maruster, West University of Timisoara, Romania

Steering Committee

* Tetsuo Ida, University of Tsukuba, Japan
* Tudor Jebelean, Johannes Kepler University, Austria
* Viorel Negru, West University of Timisoara, Romania
* Dana Petcu, West University of Timisoara, Romania
* Stephen Watt, University of Western Ontario, Canada
* Daniela Zaharie, West University of Timisoara, Romania

General Chair

* Viorel Negru, West University of Timisoara, Romania

Program Chair

* Dongming Wang, Universite Pierre et Marie Curie - CNRS, France

Track Chairs

* Symbolic Computation

+ Tetsuo Ida, University of Tsukuba, Japan
+ Stephen Watt, University of Western Ontario, Canada

* Logic and Programming

+ Tudor Jebelean, Johannes Kepler University, Austria
+ Jens Knoop, Vienna University of Technology, Austria

* Artificial Intelligence

+ Ajith Abraham, Norwegian University of Science and Technology, Norway
+ Daniela Zaharie, West University of Timisoara, Romania

* Numerical Computing

+ Yonghong Yao, Tianjin Polytechnic University, China
+ Stefan Maruster, West University of Timisoara, Romania

* Distributed Computing

+ Dana Petcu, West University of Timisoara, Romania
+ Wolfgang Schreiner, Johannes Kepler University, Austria

Special session chairs

* Advances in the Theory of Computing

+ Mircea Marin, Research Institute e-Austria Timisoara, Romania
+ Gabriel Istrate, Research Institute e-Austria Timisoara, Romania

Workshop chairs

* Workshop on Natural Computing and Application

+ Ajith Abraham, Norwegian University of Science and Technology, Norway
+ Dan Dumitrescu, Babes Bolyai University Cluj-Napoca, Romania

* 8th Workshop on Agents for Complex Systems

+ Adina Magda Florea, "Politehnica" University of Bucharest, Romania
+ Costin Badica, University of Craiova, Romania

* High Performance Computing with application in environment

+ Emil Slusanschi - University "Politehnica" of Bucharest, Romania, emil.slusanschi at cs.pub.ro
+ Ralf-Peter Mundani - Technische Universität München, mundani at tum.de
+ Ioan Lucian Muntean - Technical University of Cluj-Napoca, Ioan.Lucian.Muntean at cs.utcluj.ro

* Iterative aproximation of Fixed Points

+ Liubomir Ciric, Institute of Mathematics, Univ. of Belgrade, Serbia
+ Ioan A Rus, Department of Mathematics, Univ. “Babes-Bolyai”, Cluj-Napoca, Romania
+ Stefan Maruster, Department of Computer Science, West Univ. of Timisoara, Romania

Tutorial Chairs

* Tudor Jebelean, Johannes Kepler University, Austria
* Laura Kovacs, University of Technology, Vienna, Austria

Proceedings Chairs

* Dongming Wang, Universite Pierre et Marie Curie - CNRS, France
* Daniela Zaharie, West University of Timisoara, Romania

Local Committee Chairs

* Isabela Dramnesc, West University of Timisoara, Romania
* Silviu Panica, Institute e-Austria Timisoara, Romania

SYNASC 2011
West University of Timisoara
Department of Computer Science
Bd. V. Parvan 4, 300223 Timisoara, Romania
tel: + (40) 256 592155
fax: + (40) 256 592316
e-mail: synasc11@info.uvt.ro