jQuery 2.0 is the latest version of the jQuery framework. Suitable for modern web browsers it provides a robust API for web application development. It is fast becoming the tool of choice for web developers the world over and sets the standard for simplicity,flexibility and extensibility in website design.

In Pro jQuery...

The standard of excellence set in the critically acclaimed Fundamentals of Telecommunications continues in this Second Edition, by offering a thorough introduction to the fundamentals of telecommunication networks without bogging the reader down in...

The art of compiler construction is a fascinating subject- It integrates the mathe matical foundations of formal languages, a wealth of well-established techniques for syntactic analysis, semantic analysis and optimization, and a tremendous amount of practical experience accumulated over the past four decades in designing and us ing...

In a tantalizing blend of history and mathematics, Julian Havil takes the reader on a journey through...

This is the definitive presentation of the history, development and philosophical significance of non-Euclidean geometry as well as of the rigorous foundations for it and for elementary Euclidean geometry, essentially according to Hilbert. Appropriate for liberal arts students, prospective high school teachers, math. majors, and even bright high...

If wo try to identify those contributions of computer science which will be long lasting, surely one of these will be the refinement of the concept called algorithm. Ever since man invented the idea of a machine which could per form basic mathematical operations, the study of what can be computed and how it can be done well was...

The important role that discrete structures plays in computer science is gaining recognition. Computing Curricula 2001 (CC2001), the latest curriculum recommendation for computer- related education, was a joint undertaking of the Institute for Electrical and Electronic Engineers/Computer Society (IEEE/CS) and the Association for...

Few technical lerms have gained such rapid notoriety as the appela tion "NP-complete." In the short lime since its introduction in the early 1970's, this term has come to symbolize the abyss of inherent intractability that algorithm designers increasingly face as they seek to solve larger and more complex problems. A...