Advances in Computational Algorithms and Data Analysis offers state of the art tremendous advances in computational algorithms and data analysis. The selected articles are representative in these subjects sitting on the top-end-high technologies. The volume serves as an excellent reference work for researchers and graduate students working on computational algorithms and data analysis.

Data mining of massive data sets is transforming the way we think about crisis response, marketing, entertainment, cybersecurity and national intelligence. Collections of documents, images, videos, and networks are being thought of not merely as bit strings to be stored, indexed, and retrieved, but as potential sources of discovery and knowledge, requiring sophisticated analysis techniques that go far beyond classical indexing and keyword counting, aiming to find relational and semantic interpretations of the phenomena underlying the data. Frontiers in Massive Data Analysis examines the frontier of analyzing massive amounts of data, whether in a static database or streaming through a system. Data at that scale-terabytes and petabytes-is increasingly common in science (e.g., particle physics, remote sensing, genomics), Internet commerce, business analytics, national security, communications, and elsewhere. The tools that work to infer knowledge from data at smaller scales do not necessarily work, or work well, at such massive scale. New tools, skills, and approaches are necessary, and this report identifies many of them, plus promising research directions to explore. Frontiers in Massive Data Analysis discusses pitfalls in trying to infer knowledge from massive data, and it characterizes seven major classes of computation that are common in the analysis of massive data. Overall, this report illustrates the cross-disciplinary knowledge-from computer science, statistics, machine learning, and application disciplines-that must be brought to bear to make useful inferences from massive data.

In the age of Big Data, efficient algorithms are in high demand. It is also essential that efficient algorithms should be scalable. This book surveys a family of algorithmic techniques for the design of scalable algorithms. These techniques include local network exploration, advanced sampling, sparsification, and geometric partitioning.

Randomization and probabilistic techniques play an important role in modern computer science, with applications ranging from combinatorial optimization and machine learning to communication networks and secure protocols. This 2005 textbook is designed to accompany a one- or two-semester course for advanced undergraduates or beginning graduate students in computer science and applied mathematics. It gives an excellent introduction to the probabilistic techniques and paradigms used in the development of probabilistic algorithms and analyses. It assumes only an elementary background in discrete mathematics and gives a rigorous yet accessible treatment of the material, with numerous examples and applications. The first half of the book covers core material, including random sampling, expectations, Markov's inequality, Chevyshev's inequality, Chernoff bounds, the probabilistic method and Markov chains. The second half covers more advanced topics such as continuous probability, applications of limited independence, entropy, Markov chain Monte Carlo methods and balanced allocations. With its comprehensive selection of topics, along with many examples and exercises, this book is an indispensable teaching tool.

This book is Part II of the fourth edition of Robert Sedgewick and Kevin Wayne’s Algorithms, the leading textbook on algorithms today, widely used in colleges and universities worldwide. Part II contains Chapters 4 through 6 of the book. The fourth edition of Algorithms surveys the most important computer algorithms currently in use and provides a full treatment of data structures and algorithms for sorting, searching, graph processing, and string processing -- including fifty algorithms every programmer should know. In this edition, new Java implementations are written in an accessible modular programming style, where all of the code is exposed to the reader and ready to use. The algorithms in this book represent a body of knowledge developed over the last 50 years that has become indispensable, not just for professional programmers and computer science students but for any student with interests in science, mathematics, and engineering, not to mention students who use computation in the liberal arts. The companion web site, algs4.cs.princeton.edu contains An online synopsis Full Java implementations Test data Exercises and answers Dynamic visualizations Lecture slides Programming assignments with checklists Links to related material The MOOC related to this book is accessible via the "Online Course" link at algs4.cs.princeton.edu. The course offers more than 100 video lecture segments that are integrated with the text, extensive online assessments, and the large-scale discussion forums that have proven so valuable. Offered each fall and spring, this course regularly attracts tens of thousands of registrants. Robert Sedgewick and Kevin Wayne are developing a modern approach to disseminating knowledge that fully embraces technology, enabling people all around the world to discover new ways of learning and teaching. By integrating their textbook, online content, and MOOC, all at the state of the art, they have built a unique resource that greatly expands the breadth and depth of the educational experience.

Topological data analysis (TDA) has emerged recently as a viable tool for analyzing complex data, and the area has grown substantially both in its methodologies and applicability. Providing a computational and algorithmic foundation for techniques in TDA, this comprehensive, self-contained text introduces students and researchers in mathematics and computer science to the current state of the field. The book features a description of mathematical objects and constructs behind recent advances, the algorithms involved, computational considerations, as well as examples of topological structures or ideas that can be used in applications. It provides a thorough treatment of persistent homology together with various extensions – like zigzag persistence and multiparameter persistence – and their applications to different types of data, like point clouds, triangulations, or graph data. Other important topics covered include discrete Morse theory, the Mapper structure, optimal generating cycles, as well as recent advances in embedding TDA within machine learning frameworks.

This book presents the latest developments in bioinformatics, highlighting the importance of bioinformatics in genomics, transcriptomics, metabolism and cheminformatics analysis, as well as in drug discovery and development. It covers tools, data mining and analysis, protein analysis, computational vaccine, and drug design. Covering cheminformatics, computational evolutionary biology and the role of next-generation sequencing and neural network analysis, it also discusses the use of bioinformatics tools in the development of precision medicine. This book offers a valuable source of information for not only beginners in bioinformatics, but also for students, researchers, scientists, clinicians, practitioners, policymakers, and stakeholders who are interested in harnessing the potential of bioinformatics in many areas.

This book plays a significant role in improvising human life to a great extent. The new applications of soft computing can be regarded as an emerging field in computer science, automatic control engineering, medicine, biology application, natural environmental engineering, and pattern recognition. Now, the exemplar model for soft computing is human brain. The use of various techniques of soft computing is nowadays successfully implemented in many domestic, commercial, and industrial applications due to the low-cost and very high-performance digital processors and also the decline price of the memory chips. This is the main reason behind the wider expansion of soft computing techniques and its application areas. These computing methods also play a significant role in the design and optimization in diverse engineering disciplines. With the influence and the development of the Internet of things (IoT) concept, the need for using soft computing techniques has become more significant than ever. In general, soft computing methods are closely similar to biological processes than traditional techniques, which are mostly based on formal logical systems, such as sentential logic and predicate logic, or rely heavily on computer-aided numerical analysis. Soft computing techniques are anticipated to complement each other. The aim of these techniques is to accept imprecision, uncertainties, and approximations to get a rapid solution. However, recent advancements in representation soft computing algorithms (fuzzy logic,evolutionary computation, machine learning, and probabilistic reasoning) generate a more intelligent and robust system providing a human interpretable, low-cost, approximate solution. Soft computing-based algorithms have demonstrated great performance to a variety of areas including multimedia retrieval, fault tolerance, system modelling, network architecture, Web semantics, big data analytics, time series, biomedical and health informatics, etc. Soft computing approaches such as genetic programming (GP), support vector machine–firefly algorithm (SVM-FFA), artificial neural network (ANN), and support vector machine–wavelet (SVM–Wavelet) have emerged as powerful computational models. These have also shown significant success in dealing with massive data analysis for large number of applications. All the researchers and practitioners will be highly benefited those who are working in field of computer engineering, medicine, biology application, signal processing, and mechanical engineering. This book is a good collection of state-of-the-art approaches for soft computing-based applications to various engineering fields. It is very beneficial for the new researchers and practitioners working in the field to quickly know the best performing methods. They would be able to compare different approaches and can carry forward their research in the most important area of research which has direct impact on betterment of the human life and health. This book is very useful because there is no book in the market which provides a good collection of state-of-the-art methods of soft computing-based models for multimedia retrieval, fault tolerance, system modelling, network architecture, Web semantics, big data analytics, time series, and biomedical and health informatics.

The aim of the present book is to show, in a broad and yet deep way, the state of the art in computational science and engineering. Examples of topics addressed are: fast and accurate numerical algorithms, model-order reduction, grid computing, immersed-boundary methods, and specific computational methods for simulating a wide variety of challenging problems, problems such as: fluid-structure interaction, turbulent flames, bone-fracture healing, micro-electro-mechanical systems, failure of composite materials, storm surges, particulate flows, and so on. The main benefit offered to readers of the book is a well-balanced, up-to-date overview over the field of computational science and engineering, through in-depth articles by specialists from the separate disciplines.