Data Mining Techniques addresses all the major and latest techniques of data mining and data warehousing. It deals in detail with the latest algorithms for discovering association rules, decision trees, clustering, neural networks and genetic algorithms. The book contains the algorithmic details of different techniques such as A priori, Pincer-search, Dynamic Itemset Counting, FP-Tree growth, SLIQ, SPRINT, BOAT, CART, RainForest, BIRCH, CURE, BUBBLE, ROCK, STIRR, PAM, CLARANS, DBSCAN, GSP, SPADE, SPIRIT, etc. Interesting and recent developments such as Support Vector Machines and Rough Set Theory are also covered in the book. The book also discusses the mining of web data, spatial data, temporal data and text data. This book can serve as a textbook for students of computer science, mathematical science and management science. It can also be an excellent handbook for researchers in the area of data mining and data warehousing.

The revised edition includes a comprehensive chapter on rough set theory. The rough set theory, which is a tool of sets and relations for studying imprecision, vagueness, and uncertainty in data analysis, is a relatively new mathematical and artificial intelligence technique.

The discussion on association rule mining has been extended to include rapid association rule mining (RARM), FP-Tree Growth Algorithm for discovering association rule and the Eclat and dEclat algorithms. These appear in Chapter 4.

With the flood of information originating from genome sequencing projects, biology is being transformed from a laboratory-based science into an information science. Now, a stage has been reached where students and scholars of biology cannot study or carry out research in biology without using the tools of computers and bioinformatics—tools which an ordinary biologist may not be proficient in.

Bioinformatics and Bioprogramming in C is designed to introduce C language to the biology, biochemistry, microbiology and biotechnology community as a tool for solving biological problems. To help in understanding the concepts, most of the terminology used is biocentric and the programs written help in real-life problems like gene sequence analysis and prediction.

The book moves gradually from simple ideas to more complex programming concepts, thus equipping the reader to comprehend the case studies on dynamic programming and PAM matrices included at the end.

Special Features
• The programs in the book are all bio-centric.
• Hands-on approach
• Has already been prescribed as a textbook in Osmania University for bioinformatics students

Perspectives in Concurrency Theory is an excellent collection of research papers in concurrency theory, especially from the viewpoint of automata and logics, contributed by leading researchers in the field as a tribute to P S Thiagarajan, one of the principal researchers in the area, on the occasion of his sixtieth birthday. The range of topics covered includes formal methods and models in concurrent systems: net theory, process algebra, temporal and dynamic logics, control synthesis, security, message sequence charts, system testing and verification and process scheduling. Graduate students and professionals working in this area will find the book an invaluable source of reference.

Like many other incipient technologies, Web services are still surrounded by a substantial level of noise. This noise results from the always dangerous combination of wishful thinking on the part of research and industry and of a lack of clear understanding of how Web services came to be. On the one hand, multiple contradictory interpretations are created by the many attempts to realign existing technology and strategies with Web services. On the other hand, the emphasis on what could be done with Web services in the future often makes us lose track of what can be really done with Web services today and in the short term. These factors make it extremely difficult to get a coherent picture of what Web services are, what they contribute, and where they will be applied.

Alonso and his co-authors deliberately take a step back. Based on their academic and industrial experience with middleware and enterprise application integration systems, they describe the fundamental concepts behind the notion of Web services and present them as the natural evolution of conventional middleware, necessary to meet the challenges of the Web and of B2B application integration.

Rather than providing a reference guide or a "how to write your first Web service" kind of book, they discuss the main objectives of Web services, the challenges that must be faced to achieve them, and the opportunities that this novel technology provides. Established, as well as recently proposed, standards and techniques (e.g., WSDL, UDDI, SOAP, WS-Coordination, WS-Transactions, and BPEL), are then examined in the context of this discussion in order to emphasize their scope, benefits, and shortcomings. Thus, the book is ideally suited both for professionals considering the development of application integration solutions and for research and students interesting in understanding and contributing to the evolution of enterprise application technologies.

This is the thoroughly revised and updated edition of the text that helped establish computer algorithms as a discipline of computer science. Using the popular object-oriented language C++, the text incorporates the latest research and state-of-the-art applications, bringing this classic to the forefront of modern computer science education. A major strength of this text is its focus on design techniques rather than on individual algorithms.

The second edition of Computer Algorithms/C++ emphasizes:
• Design techniques: Divide and conquer, the greedy method, dynamic programming, backtracking and branch and bound are illustrated with several examples. Each algorithm is completely analyzed.
• Examples: A wide range of examples provides students with the actual implementation of correct design.
• The latest research: A thorough treatment of probabilistic and parallel algorithms is included.
• Full integration of randomized algorithms: Performance with nonrandomized algorithms is thoroughly compared.

Computer Algorithms/C++ is appropriate as a core text for upper- and graduate-level courses in algorithms.

This book provides a comprehensive coverage of database principles and practice. The author uses the open source database ‘MySQL’ for illustration. The standard database language for querying (interacting with) relational databases is SQL (structured query language). MySQL is the most popular “open source” database system with an installed base of over 5 million systems. It is very fast, multi-threaded, multi-user database which can be effectively used by teachers who want to teach concepts and practice, database users, programmers and computer scientists.