الصفحة 5
الصفحة 5
Developments in language theory ; Vol. 3572 ; 9th International Conference, DLT 2005, Palermo, Italy, July 4-8, 2005, Proceedings
Constitutes the refereed proceedings of the 9th International Conference on Developments in Language Theory, DLT 2005, held in Palermo, Italy in July 2005. Several issues in language theory are addressed including grammars, acceptors, and transducers for strings frees, graphs, and arrays; efficient text algorithms; and more.
Developments in language theory ; 8th International Conference, DLT 2004, Auckland, New Zealand, December 13-17, Proceedings
Basic Notions of Reaction Systems / A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms / Algebraic and Topological Models for DNA Recombinant Processes / Contributed Papers : Regular Expressions for Two-Dimensional Languages Over One-Letter Alphabet / On Competence in CD Grammar Systems / The Dot-Depth and the Polynomial Hierarchy Correspond on the Delta Levels, and other
Developments in Language Theory ; 12th International Conference, DLT 2008, Kyoto, Japan, September 16-19, 2008. Proceedings
This book constitutes the refereed proceedings of the 12th International Conference on Developments in Language Theory, DLT 2008, held in Kyoto, Japan, September 2008.
Developments in Language Theory ; 11th International Conference, DLT 2007, Turku, Finland, July 3-6, 2007, Proceedings
It addresses all important issues in language theory including grammars, acceptors and transducers for words, trees and graphs; algebraic theories of automata; relationships to cryptography, concurrency, complexity theory and logic; bioinspired computing, and quantum computing.
Determinantal Ideals
Determinantal ideals are ideals generated by minors of a homogeneous polynomial matrix. Some classical ideals that can be generated in this way are the ideal of the Veronese varieties, of the Segre varieties, and of the rational normal scrolls. Determinantal ideals are a central topic in both commutative algebra and algebraic geometry, and they also have numerous connections with invariant theory, representation theory, and combinatorics. Due to their important role, their study has attracted many researchers and has received considerable attention in the literature. In this book three crucial problems are addressed: CI-liaison class and G-liaison class of standard determinantal ideals; the multiplicity conjecture for standard determinantal ideals; and unobstructedness and dimension of families of standard determinantal ideals.
Deformations of Algebraic Schemes
This study has become increasingly important in algebraic geometry in every context where variational phenomena come into play, and in classification theory, e.g. the study of the local properties of moduli spaces.Today deformation theory is highly formalized and has ramified widely within mathematics. This self-contained account of deformation theory in classical algebraic geometry (over an algebraically closed field) brings together for the first time some results previously scattered in the literature, with proofs that are relatively little known, yet of everyday relevance to algebraic geometers. Based on Grothendieck's functorial approach it covers formal deformation theory, algebraization, isotriviality, Hilbert schemes, Quot schemes and flag Hilbert schemes. It includes applications to the construction and properties of Severi varieties of families of plane nodal curves, space curves, deformations of quotient singularities, Hilbert schemes of points, local Picard functors, etc. Many examples are provided. Most of the algebraic results needed are proved.
Darboux Transformations in Integrable Systems : Theory and their Applications to Geometry
This book presents the Darboux transformations in matrix form and provides purely algebraic algorithms for constructing the explicit solutions. A basis for using symbolic computations to obtain the explicit exact solutions for many integrable systems is established. Moreover, the behavior of simple and multi-solutions, even in multi-dimensional cases, can be elucidated clearly. The method covers a series of important equations such as various kinds of AKNS systems in R1+n, harmonic maps from 2-dimensional manifolds, self-dual Yang-Mills fields and the generalizations to higher dimensional case, theory of line congruences in three dimensions or higher dimensional space etc. All these cases are explained in detail.
Cycle Spaces of Flag Domains : A Complex Geometric Viewpoint
This monograph, divided into four parts, presents a comprehensive treatment and systematic examination of cycle spaces of flag domains. Assuming only a basic familiarity with the concepts of Lie theory and geometry, this work presents a complete structure theory for these cycle spaces, as well as their applications to harmonic analysis and algebraic geometry.
Cryptography and coding ; 11th IMA International Conference, Cirencester, UK, December 18-20, 2007, Proceedings
This book presented signatures, boolean functions, block cipher cryptanalysis, side channels, linear complexity, public key encryption, curves, and RSA implementation.
Cryptography and coding ; 10th IMA International Conference, Cirencester, UK, December 19-21, 2005, Proceedings
Constitutes the refereed proceedings of the 10th IMA International Conference on Cryptography and Coding, held in Cirencester, UK, in December 2005. This book features papers that are organized in topical sections on coding theory, signatures and signcryption, symmetric cryptography, side channels, algebraic cryptanalysis, and more.
Cours doptique : Simulations et exercices résolus avec Maple, Matlab, Mathematica, Mathcad = Optics course: Simulations and exercises solved with Maple, Matlab, Mathematica, Mathcad
Intended for students at the L and M levels of the university as well as for engineers wishing to study certain subjects in greater depth. It covers all the themes of a traditional optics course, from geometric optics to holography, interference, diffraction, coherence and the use of the Fourier transform for spectroscopy. The presentation is developed from mathematical models deriving from typical situations and fundamental examples which are presented in the form of computer programs ready to be implemented. These programs are also available on the CD accompanying the book, for each of the following scientific programming environments: Matlab, Maple, Mathematica and Mathcad. Thus, the reader will be able to modify the parameters of the examples proposed to adapt them to new situations.
Courbes algébriques planes = Plane Algebraic Curves
Resulting from a master's course at the University of Paris VII, this text is re-edited as it appeared in 1978. Various tools are introduced in connection with Bézout's theorem necessary for the development of the notion of the multiplicity of intersection of two algebraic curves in the complex projective plane. Starting from elementary notions on affine and projective algebraic subsets, we define the intersection multiplicities and interpret their sum in terms of the resultant of two polynomials. The local study is a pretext for the introduction of formal or convergent series rings; it culminates in Puiseux's theorem, the convergence of which is reduced by splits to that of the theorem of implicit functions. Various figures illuminate the text: we "see" in particular that the homogeneous equation x3 + y3 + z3 = 0 defines a torus in the complex projective plane.
Coordination models and languages ; Vol.4038 ; 8th International Conference, COORDINATION 2006, Bologna, Italy, June 14-16, 2006, Proceedings
This book constitutes the refereed proceedings of the 8th International Conference on Coordination Models and Languages, COORDINATION 2006, held in Bologna, Italy, June 2006. The 17 revised full papers presented were carefully reviewed and selected from 50 submissions. Among the topics addressed are component connectors, negotiation in service-oriented computing, process algebraic specification, workflow patterns, reactive XML, ubiquitous coordination, type systems, ad-hoc network coordination, choreography, communication coordination, and distributed embedded systems.
Continuous System Simulation
Continuous System Simulation describes systematically and methodically how mathematical models of dynamic systems, usually described by sets of either ordinary or partial differential equations possibly coupled with algebraic equations, can be simulated on a digital computer.
Constructive Negations and Paraconsistency
This book presents the author’s recent investigations of the two main concepts of negation developed in the constructive logic: the negation as reduction to absurdity (L.E.J. Brouwer) and the strong negation (D. Nelson) are studied in the setting of paraconsistent logic. The paraconsistent logics are those, which admit inconsistent but non-trivial theories, i.e., the logics which allow making inferences in non-trivial fashion from an inconsistent set of hypotheses. The study is based on algebraic methods, demonstrates the remarkable regularity and the similarity of structures of both lattices of logics, and gives essential information on the paraconsistent nature of logics Lj and N4.The methods developed in this book can be applied for investigation of other classes of paraconsistent logics.
Constructing Correct Software
Central to Formal Methods is the so-called Correctness Theorem which relates a specification to its correct Implementations. This theorem is the goal of traditional program testing and, more recently, of program verification (in which the theorem must be proved). Proofs are difficult, though even with the use of powerful theorem provers. This volume explains and illustrates an alternative method, which allows the construction of (necessarily correct) algorithms from a specification using algebraic transformations and refinement techniques which prevent the introduction of errors. Based on teaching material used extensively at Loughborough University, John Cooke introduces the basics, using simple examples and lots of detailed working (which can often be re-used). Constructing Correct Software will provide invaluable reading for students and practitioners of Computer Science and Software Engineering to whom correctness of software is of prime importance.
Conics and Cubics : A Concrete Introduction to Algebraic Curves
Its focus on curves of degree at most three keeps results tangible and proofs transparent. Theorems follow naturally from high school algebra and two key ideas: homogenous coordinates and intersection multiplicities. By classifying irreducible cubics over the real numbers and proving that their points form Abelian groups, the book gives readers easy access to the study of elliptic curves. It includes a simple proof of Bezout's Theorem on the number of intersections of two curves.The book is a text for a one-semester course on algebraic curves for junior-senior mathematics majors. The only prerequisite is first-year calculus.
Computing in Algebraic Geometry : A Quick Start using SINGULAR
Algebraic geometry generally studies the properties of solution sets of systems of polynomial equations without direct reference to the actual polynomials used in these systems. … This is especially desirable for classwork where the development of the abstract machinery generally outlasts the patience of the students, except possibly the most motivated ones.
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.
Computer Algebra in Scientific Computing ; Vol. 4194 ; 9th International Workshop, CASC 2006, Chisinau, Moldova, September 11-15, 2006, Proceedings
This volume contains revised versions of the papers submitted to the workshop by the participants and accepted by the program committee after a thorough reviewing process. The collection of papers included in the proceedings covers not only various expanding applications of computer algebra to scienti?c computing but also the computer algebra systems themselves and the CA algorithms.
