Computer Mathematics 8th Asian Symposium, ASCM 2007, Singapore, December 15-17, 2007. Revised and Invited Papers /

This book constitutes thoroughly refereed post-conference proceedings of the 8th Asian Symposium on Computer Mathematics, ASCM 2007, held in Singapore in December 2007. The 22 revised full papers and 5 revised poster papers presented together with 3 invited lectures were carefully selected during tw...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Kapur, Deepak (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2008.
Σειρά:Lecture Notes in Computer Science, 5081
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 05067nam a22005775i 4500
001 978-3-540-87827-8
003 DE-He213
005 20151204173944.0
007 cr nn 008mamaa
008 100301s2008 gw | s |||| 0|eng d
020 |a 9783540878278  |9 978-3-540-87827-8 
024 7 |a 10.1007/978-3-540-87827-8  |2 doi 
040 |d GrThAP 
050 4 |a Q334-342 
050 4 |a TJ210.2-211.495 
072 7 |a UYQ  |2 bicssc 
072 7 |a TJFM1  |2 bicssc 
072 7 |a COM004000  |2 bisacsh 
082 0 4 |a 006.3  |2 23 
245 1 0 |a Computer Mathematics  |h [electronic resource] :  |b 8th Asian Symposium, ASCM 2007, Singapore, December 15-17, 2007. Revised and Invited Papers /  |c edited by Deepak Kapur. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg,  |c 2008. 
300 |a XI, 359 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 5081 
505 0 |a Algorithms and Implementations -- Computing the Minkowski Value of the Exponential Function over a Complex Disk -- Unconstrained Parametric Minimization of a Polynomial: Approximate and Exact -- The Nearest Real Polynomial with a Real Multiple Zero in a Given Real Interval -- Practical and Theoretical Issues for the Computation of Generalized Critical Values of a Polynomial Mapping -- Which Symmetric Homogeneous Polynomials Can Be Proved Positive Semi-definite by Difference Substitution Method? -- Basis-Independent Polynomial Division Algorithm Applied to Division in Lagrange and Bernstein Basis -- Computing the Greatest Common Divisor of Polynomials Using the Comrade Matrix -- Efficient Algorithms for Computing Nœther Normalization -- Stability of GPBiCG_AR Method Based on Minimization of Associate Residual -- Evaluation of a Java Computer Algebra System -- A New Property of Hamming Graphs and Mesh of d-ary Trees -- Numerical Methods and Applications -- An Interpolation Method That Minimizes an Energy Integral of Fractional Order -- Solving Biomechanical Model Using Third-Order Runge-Kutta Methods -- An Efficient Fourth Order Implicit Runge-Kutta Algorithm for Second Order Systems -- Laplace Equation Inside a Cylinder: Computational Analysis and Asymptotic Behavior of the Solution -- A Method and Its Implementation for Constructing Bäcklund Transformations to Nonlinear Evolution Equations -- On the Invariant Properties of Hyperbolic Bivariate Third-Order Linear Partial Differential Operators -- Symbolic Solution to Magnetohydrodynamic Hiemenz Flow in Porous Media -- Local Similarity Solutions for Laminar Boundary Layer Flow along a Moving Cylinder in a Parallel Stream -- Elimination: Triangular Forms, Resultants, Equation Solving -- An Algorithm for Transforming Regular Chain into Normal Chain -- A Modified Van der Waerden Algorithm to Decompose Algebraic Varieties and Zero-Dimensional Radical Ideals -- Regular Decompositions -- Floating-Point Gröbner Basis Computation with Ill-conditionedness Estimation -- The Maximality of the Dixon Matrix on Corner-Cut Monomial Supports -- Properties of Ascending Chains for Partial Difference Polynomial Systems -- Cryptology -- Some Mathematical Problems in Cryptanalysis -- A Reduction Attack on Algebraic Surface Public-Key Cryptosystems -- Computational Logic -- The Four Colour Theorem: Engineering of a Formal Proof -- On the Computation of Elimination Ideals of Boolean Polynomial Rings -- Computer Search for Large Sets of Idempotent Quasigroups. 
520 |a This book constitutes thoroughly refereed post-conference proceedings of the 8th Asian Symposium on Computer Mathematics, ASCM 2007, held in Singapore in December 2007. The 22 revised full papers and 5 revised poster papers presented together with 3 invited lectures were carefully selected during two rounds of reviewing and improvement from 65 submissions. The papers are organized in topical sections on algorithms and implementations, numerical methods and applications, cryptology, and computational logic. 
650 0 |a Computer science. 
650 0 |a Computer communication systems. 
650 0 |a Computers. 
650 0 |a Numerical analysis. 
650 0 |a Computer science  |x Mathematics. 
650 0 |a Artificial intelligence. 
650 1 4 |a Computer Science. 
650 2 4 |a Artificial Intelligence (incl. Robotics). 
650 2 4 |a Computer Communication Networks. 
650 2 4 |a Theory of Computation. 
650 2 4 |a Symbolic and Algebraic Manipulation. 
650 2 4 |a Numeric Computing. 
650 2 4 |a Math Applications in Computer Science. 
700 1 |a Kapur, Deepak.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783540878261 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 5081 
856 4 0 |u http://dx.doi.org/10.1007/978-3-540-87827-8  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)