Search results for "data structures and algorithms in java"
Items in stock - 4 working days delivery time
Algorithms to Live By
A fascinating exploration of how computer algorithms can be applied to our everyday lives. In this dazzlingly interdisciplinary work, acclaimed author Brian Christian and cognitive scientist Tom Griffiths show us how the simple, precise algorithms used by computers can also untangle very human questions. Modern life is constrained by limited space and time, limits that give rise to a particular set of problems. What should we do, or leave undone, in a day or a lifetime? How much messiness should we accept? The authors explain how to have better hunches and when to leave things to chance, how to deal with overwhelming choices and how best to connect with others. From finding a spouse to finding a parking spot, from organizing one's inbox to understanding the workings of human memory, Algorithms To Live By is full of practical takeaways to help you solve common decision-making problems and illuminate the workings of the human mind.
R 360.00
Items we need to order for you
Structural and Functional Aspects of Biocomputing Systems for Data Processing
Due to the diversity of contexts in which biological computation is performed, a major problem is the selection of functional-oriented techniques for the analysis of biological sequences in a huge environment. The performances of various sequences in biocomputational algorithms are evaluated with variant features to prove their efficiency in real-time environments.Structural and Functional Aspects of Biocomputing Systems for Data Processing provides insight into the structural and functional aspects of biological sequences and the pattern recognition they embed into the data processingcepts, methodologies, and empirical research advances of various biological data mining systems through machine learning approaches. Covering topics such as DNA sequencing, high-speed architecture, and medical image processing, this premier reference source is an essential resource for healthcare professionals, biological systems in biocomputing systems. It extends recent con specialists, industrial professionals, PCR testing professionals, scientists, bioinformaticians, students and educators of higher education, librarians, researchers, and academicians.
R 10,407.12
Algorithms For Dummies
Your secret weapon to understanding—and using!—one of the most powerful influences in the world today From your Facebook News Feed to your most recent insurance premiums—even making toast!—algorithms play a role in virtually everything that happens in modern society and in your personal life. And while they can seem complicated from a distance, the reality is that, with a little help, anyone can understand—and even use—these powerful problem-solving tools! In Algorithms For Dummies, you'll discover the basics of algorithms, including what they are, how they work, where you can find them (spoiler alert: everywhere!), who invented the most important ones in use today (a Greek philosopher is involved), and how to create them yourself. You'll also find: Dozens of graphs and charts that help you understand the inner workings of algorithmsLinks to an online repository called GitHub for constant access to updated codeStep-by-step instructions on how to use Google Colaboratory, a zero-setup coding environment that runs right from your browser Whether you're a curious internet user wondering how Google seems to always know the right answer to your question or a beginning computer science student looking for a head start on your next class, Algorithms For Dummies is the can't-miss resource you've been waiting for.
R 730.00
Combinatorial Algorithms
This book constitutes the refereed proceedings of the 33rd International Workshop on Combinatorial Algorithms, IWOCA 2022, which took place as a hybrid event in Trier, Germany, during June 7-9, 2022.The 35 papers presented in these proceedings were carefully reviewed and selected from 86 submissions. They deal with diverse topics related to combinatorial algorithms, such as algorithms and data structures; algorithmic and combinatorical aspects of cryptography and information security; algorithmic game theory and complexity of games; approximation algorithms; complexity theory; combinatorics and graph theory; combinatorial generation, enumeration and counting; combinatorial optimization; combinatorics of words; computational biology; computational geometry; decompositions and combinatorial designs; distributed and network algorithms; experimental combinatorics; fine-grained complexity; graph algorithms and modelling with graphs; graph drawing and graph labelling; network theory and temporal graphs; quantum computing and algorithms for quantum computers; online algorithms; parameterized and exact algorithms; probabilistic andrandomized algorithms; and streaming algorithms.
R 3,930.54
Algorithms and Architectures for Parallel Processing
The three volume set LNCS 13155, 13156, and 13157 constitutes the refereed proceedings of the 21st International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2021, which was held online during December 3-5, 2021. The total of 145 full papers included in these proceedings were carefully reviewed and selected from 403 submissions. They cover the many dimensions of parallel algorithms and architectures including fundamental theoretical approaches, practical experimental projects, and commercial components and systems. The papers were organized in topical sections as follows:Part I, LNCS 13155: Deep learning models and applications; software systems and efficient algorithms; edge computing and edge intelligence; service dependability and security algorithms; data science; Part II, LNCS 13156: Software systems and efficient algorithms; parallel and distributed algorithms and applications; data science; edge computing and edge intelligence; blockchain systems; deept learning models and applications; IoT; Part III, LNCS 13157: Blockchain systems; data science; distributed and network-based computing; edge computing and edge intelligence; service dependability and security algorithms; software systems and efficient algorithms.
R 4,730.43
ISA '91 Algorithms
This volume presents the proceedings of the Second AnnualInternational Symposium on Algorithms held at AcademiaSinica, Taipei, Republic of China, December 16-18, 1991. Thesymposium was organized by the Institute of InformationScience, Academia Sinica, and the National Tsing HuaUniversity.In response to the program committee's call for papers, 90papers were submitted, from which the committee selected 36for presentation at the symposium. In addition to thesecontributed papers, the symposium included 5 invited talks.The subjects of the papers range widely in the area ofdiscrete algorithms, over such topics as computationalgeometry, graph algorithms, complexity theory, parallelalgorithms, distributed computing and computational algebra.
R 1,574.89
Parallel Algorithms for Irregular Problems: State of the Art
Efficient parallel solutions have been found to many problems. Some of them can be obtained automatically from sequential programs, using compilers. However, there is a large class of problems - irregular problems - that lack efficient solutions. IRREGULAR 94 - a workshop and summer school organized in Geneva - addressed the problems associated with the derivation of efficient solutions to irregular problems. This book, which is based on the workshop, draws on the contributions of outstanding scientists to present the state of the art in irregular problems, covering aspects ranging from scientific computing, discrete optimization, and automatic extraction of parallelism. Audience: This first book on parallel algorithms for irregular problems is of interest to advanced graduate students and researchers in parallel computer science.
R 4,662.37
Structures in Logic and Computer Science
This book is dedicated to Andrzej Ehrenfeucht on the occasion of his 65th birthday. On personal invitation by the volume editors, 22 internationally well-known scientists from mathematical logics and theoretical computer science participated in this project honoring an excellent scientist with excellent papers centered around his scientific work.The 22 invited papers are presented in topical sections on model theory, games and logic, graphs and algorithms, pattern matching and learning, combinatorics of words, algebra of languages, formal language theory, and computational molecular biology.
R 1,570.92
Solving Irregularly Structured Problems in Parallel
This book constitutes the refereed proceedings of the 5th International Symposium on Solving Irregularly Structured Problems in Parallel, IRREGULAR'98, held in Berkeley, California, in August 1998.The 26 revised full papers presented were carefully reviewed and selected for inclusion from several dozen submissions. Also included are abstracts of four invited talks and 6 invited presentations given during minisymposia held in parallel. The book presents a unique overview on algorithmic, applicational, and systems aspects arising in the development of efficient parallel solutions to irregularly structured problems.
R 1,576.36
Parallel Processing and Parallel Algorithms
Motivation It is now possible to build powerful single-processor and multiprocessor systems and use them efficiently for data processing, which has seen an explosive ex pansion in many areas of computer science and engineering. One approach to meeting the performance requirements of the applications has been to utilize the most powerful single-processor system that is available. When such a system does not provide the performance requirements, pipelined and parallel process ing structures can be employed. The concept of parallel processing is a depar ture from sequential processing. In sequential computation one processor is in volved and performs one operation at a time. On the other hand, in parallel computation several processors cooperate to solve a problem, which reduces computing time because several operations can be carried out simultaneously. Using several processors that work together on a given computation illustrates a new paradigm in computer problem solving which is completely different from sequential processing. From the practical point of view, this provides sufficient justification to investigate the concept of parallel processing and related issues, such as parallel algorithms. Parallel processing involves utilizing several factors, such as parallel architectures, parallel algorithms, parallel programming lan guages and performance analysis, which are strongly interrelated. In general, four steps are involved in performing a computational problem in parallel. The first step is to understand the nature of computations in the specific application domain.
R 3,147.48
Stochastic Algorithms: Foundations and Applications
This volume constitutes the proceedings of the 3rd Symposium on Stochastic Algorithms, Foundations and Applications (SAGA 2005), held in Moscow, R- sia, at Moscow State University on October 20-22, 2005. The symposium was organized by the Department of Discrete Mathematics, Faculty of Mechanics and Mathematics of Moscow State University and was partially supported by the Russian Foundation for Basic Research under Project No. 05-01-10140-?. The SAGA symposium series is a biennial meeting which started in 2001 in Berlin, Germany(LNCS vol. 2264). The second symposium was held in Sept- ber 2003 at the University of Hertfordshire, Hat?eld, UK (LNCS vol. 2827). Sincethe?rstsymposiuminBerlinin2001,anincreasedinterestintheSAGA series can be noticed. For SAGA 2005, we received submissions from China, the European Union, Iran, Japan, Korea, Russia, SAR Hong Kong, Taiwan, and USA, fromwhich 14 papers were?nally selected for publication after a thorough reviewing process. The contributed papers included in this volume cover both theoretical as well as applied aspects of stochastic computations, which is one of the main aims of the SAGA series. Furthermore, ?ve invited lectures were delivered at SAGA 2005: The talk by Alexander A.Sapozhenko (Moscow State University) summarizes results on the container method, a technique that is used to solve enumeration problems for various combinatorial structures and which has - merous applications in the design andanalysisof stochasticalgorithms. Christos D. Zaroliagis (University of Patras) presented recent advances in multiobjective optimization.
R 1,548.87
R 3,229.25
Damage Models and Algorithms for Assessment of Structures under Operating Conditions
Extensive amounts of operational data are generated over time by the health monitoring system of a structure’s management system, yet there are few analysis algorithms which can tell the exact working state of the structure on-line. Good maintenance engineers need to know the exact location and state of the structural components after an earthquake or some attack or accident involving the structure, possibly within a matter of hours, and the client also demands a rapid diagnosis of the structure before making decisions on any necessary remedial work. This book is devoted to the condition assessment of a structure under operational loading, with most of the illustrations related to a bridge deck under a group of moving vehicular loads. More generally, a wide variety of excitation forces can be exerted on a structure, from earthquake excitation, wind loading, vehicular loading or ambient excitation at the supports. Different algorithms may be used to enable real time identification with deterministic results on the state of the structure. This book also covers a group of damage-detection-oriented-models developed by the author, including a new decomposition of the system matrices of the beam element and plate element. Methods for extending the deterministic condition assessment to provide statistical information are also included. The methods and algorithms described can be implemented for the on-line condition assessment of a structure through model updating of the structure during the course of extreme loading such as an earthquake, or when under normal ambient excitation or operation excitation. Different sample structures are described and analysed, supplemented with major references.This leading-edge work will be especially useful for researchers and graduate students, and it is also heavily rooted in advanced engineering practice.Series: Structures and Infrastructures Series Structures and Infrastructures comprises advanced-level books dealing with the maintenance, management, and cost analysis of structures and infrastructures. Topics treated include research, development and application of the most advanced technologies for analyzing, predicting, and optimizing the performance of structures and infrastructures, such as buildings, bridges, dams, underground construction, offshore platforms, pipelines, naval vessels, ocean structures, and nuclear power plants, as well as airplanes, aerospace, and automotive structures. Themes featured are mathematical modeling, computer and experimental methods, practical applications in assessment and evaluation, construction and design for durability, decision making, deterioration modeling and aging, failure analysis, field testing, financial planning, inspection and diagnostics, life-cycle analysis and prediction, loads, maintenance strategies, management systems, nondestructive testing, maintenance and management optimization, specifications and codes, structural safety and reliability, system analysis,
R 7,712.95
Algorithmic Aspects in Information and Management
This book constitutes the proceedings of the 15th International Conference on Algorithmic Aspects in Information and Management, AAIM 2021, which was held online during December 20-22, 2021. The conference was originally planned to take place in Dallas, Texas, USA, but changed to a virtual event due to the COVID-19 pandemic. The 38 regular papers included in this book were carefully reviewed and selected from 62 submissions. They were organized in the following topical sections: approximation algorithms; scheduling; nonlinear combinatorial optimization; network problems; blockchain, logic, complexity and reliability; and miscellaneous.
R 3,536.10
Applied Discrete Structures - Part 2- Algebraic Structures
Applied Discrete Structures, Part II - Algebraic Structures, is an introduction to groups, monoids, vector spaces, lattices, boolean algebras, rings and fields. It corresponds with the content of Discrete Structures II at UMass Lowell, which is a required course for students in Computer Science. It presumes background contained in Part I - Fundamentals. Applied Discrete Structures has been approved by the American Institute of Mathematics as part of their Open Textbook Initiative. For more information on open textbooks, visit http://www.aimath.org/textbooks/. This version was created using Mathbook XML (https://mathbook.pugetsound.edu/) Al Doerr is Emeritus Professor of Mathematical Sciences at UMass Lowell. His interests include abstract algebra and discrete mathematics. Ken Levasseur is a Professor of Mathematical Sciences at UMass Lowell. His interests include discrete mathematics and abstract algebra, and their implementation using computer algebra systems.
R 1,048.06
Algorithms for VLSI Physical Design Automation
Algorithms for VLSI Physical Design Automation is a core reference text for graduate students and CAD professionals. It provides a comprehensive treatment of the principles and algorithms of VLSI physical design. Algorithms for VLSI Physical Design Automation presents the concepts and algorithms in an intuitive manner. Each chapter contains 3-4 algorithms that are discussed in detail. Additional algorithms are presented in a somewhat shorter format. References to advanced algorithms are presented at the end of each chapter. Algorithms for VLSI Physical Design Automation covers all aspects of physical design. The first three chapters provide the background material while the subsequent chapters focus on each phase of the physical design cycle. In addition, newer topics like physical design automation of FPGAs and MCMs have been included. The author provides an extensive bibliography which is useful for finding advanced material on a topic. Algorithms for VLSI Physical Design Automation is an invaluable reference for professionals in layout, design automation and physical design.
R 3,072.75
R 1,374.00
Modular Algorithms in Symbolic Summation and Symbolic Integration
This work brings together two streams in computer algebra: symbolic integration and summation on the one hand, and fast algorithmics on the other hand. In many algorithmically oriented areas of computer science, theanalysisof- gorithms–placedintothe limelightbyDonKnuth’stalkat the 1970ICM –provides a crystal-clear criterion for success. The researcher who designs an algorithmthat is faster (asymptotically, in the worst case) than any previous method receives instant grati?cation: her result will be recognized as valuable. Alas, the downside is that such results come along quite infrequently, despite our best efforts. An alternative evaluation method is to run a new algorithm on examples; this has its obvious problems, but is sometimes the best we can do. George Collins, one of the fathers of computer algebra and a great experimenter,wrote in 1969: “I think this demonstrates again that a simple analysis is often more revealing than a ream of empirical data (although both are important). ” Within computer algebra, some areas have traditionally followed the former methodology, notably some parts of polynomial algebra and linear algebra. Other areas, such as polynomial system solving, have not yet been amenable to this - proach. The usual “input size” parameters of computer science seem inadequate, and although some natural “geometric” parameters have been identi?ed (solution dimension, regularity), not all (potential) major progress can be expressed in this framework. Symbolic integration and summation have been in a similar state.
R 2,198.12
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management
This book constitutes the refereed proceedings of the 7th International Frontiers of Algorithmics Workshop, FAW 2013, and the 9th International Conference on Algorithmic Aspects in Information and Management, AAIM 2013, jointly held in Dalian, China, in June 2013. The 33 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 60 submissions. The Joint Conference provide a focused forum on current trends of research on algorithms, discrete structures, operation research, combinatorial optimization and their applications, and will bring together international experts at the research frontiers in these areas to exchange ideas and to present significant new results. The mission of the Joint Conference is to stimulate the various fields for which algorithmics can become a crucial enabler, and to strengthen the ties between the Eastern and Western research communities of algorithmics and applications.
R 2,186.38
Algorithms for Convex Optimization
In the last few years, Algorithms for Convex Optimization have revolutionized algorithm design, both for discrete and continuous optimization problems. For problems like maximum flow, maximum matching, and submodular function minimization, the fastest algorithms involve essential methods such as gradient descent, mirror descent, interior point methods, and ellipsoid methods. The goal of this self-contained book is to enable researchers and professionals in computer science, data science, and machine learning to gain an in-depth understanding of these algorithms. The text emphasizes how to derive key algorithms for convex optimization from first principles and how to establish precise running time bounds. This modern text explains the success of these algorithms in problems of discrete optimization, as well as how these methods have significantly pushed the state of the art of convex optimization itself.
R 4,342.15
Online Algorithms
This coherent anthology presents the state of the art in the booming area of online algorithms and competitive analysis of such algorithms. The 17 papers are carefully revised and thoroughly improved versions of presentations given first during a Dagstuhl seminar in 1996.An overview by the volume editors introduces the area to the reader. The technical chapters are devoted to foundational and methodological issues for the design and analysis of various classes of online algorithms as well as to the detailed evaluation of algorithms for various activities in online processing, ranging from load balancing and scheduling to networking and financial problems. An outlook by the volume editors and a bibliography listing more than 750 references complete the work.The book is ideally suited for advanced courses and self-study in online algorithms. It is indispensable reading for researchers and professionals active in the area.
R 2,390.30
Algorithms for Sensor Systems
This book constitutes revised selected papers from the 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, held in Vienna, in September 2017.The 17 full papers presented in this volume were carefully reviewed and selected from 30 submissions. ALGOSENSORS is an international symposium dedicated to the algorithmic aspects of wireless networks. Originally focused on sensor networks, it now covers algorithmic issues arising in wireless networks of all types of computational entities, static or mobile, including sensor networks, sensor-actuator networks, autonomous robots. The focus is on the design and analysis of algorithms, models of computation, and experimental analysis.
R 2,165.36
Practical Analysis of Algorithms
This book introduces the essential concepts of algorithm analysis required by core undergraduate and graduate computer science courses, in addition to providing a review of the fundamental mathematical notions necessary to understand these concepts. Features: includes numerous fully-worked examples and step-by-step proofs, assuming no strong mathematical background; describes the foundation of the analysis of algorithms theory in terms of the big-Oh, Omega, and Theta notations; examines recurrence relations; discusses the concepts of basic operation, traditional loop counting, and best case and worst case complexities; reviews various algorithms of a probabilistic nature, and uses elements of probability theory to compute the average complexity of algorithms such as Quicksort; introduces a variety of classical finite graph algorithms, together with an analysis of their complexity; provides an appendix on probability theory, reviewing the major definitions and theorems used in the book.
R 1,720.03
R 611.00
Experimental and Efficient Algorithms
This proceedings volume contains the accepted papers and invited talks p- sented at the 4th International Workshop of E?cient and Experimental Al- rithms (WEA 2005), that was held May 10-13, on Santorini Island, Greece. The WEA events are intended to be an international forum for research on the design, analysis and especially the experimental implementation, evaluation and engineering of algorithms, as well as on combinatorial optimization and its applications. The?rstthreeworkshopsinthisserieswereheldinRiga(2001),MonteVerita (2003) and Rio de Janeiro (2004). Thisvolumecontains3invitedpapersrelatedtocorrespondingkeynotetalks: by Prof. Christos Papadimitriou (University of California at Berkeley, USA), Prof. David Bader (University of New Mexico, USA) and Prof. Celso Ribeiro (University of Rio de Janeiro, Brazil). This proceedings includes 54 papers (47 regular and 7 short), selected out of a record number of 176 submissions. Each paper was reviewed by at least 2 Program Committee members, while many papers got 3 or 4 reviews. A total number of 419 reviews were solicited, with the help of trusted external referees.In addition to the 54 papers included in this volume, 6papers were accepted as poster presentations: these papers were published in a separate poster p- ceedings volume by CTI Press and a major publisher in Greece, "Ellinika Gr- mata." The presentation of these posters at the event was expected to create a fruitful discussion on interesting ideas.
R 3,094.34
Algorithms and Architectures for Cryptography and Source Coding in Non-Volatile Flash Memories
In this work, algorithms and architectures for cryptography and source coding are developed, which are suitable for many resource-constrained embedded systems such as non-volatile flash memories. A new concept for elliptic curve cryptography is presented, which uses an arithmetic over Gaussian integers. Gaussian integers are a subset of the complex numbers with integers as real and imaginary parts. Ordinary modular arithmetic over Gaussian integers is computational expensive. To reduce the complexity, a new arithmetic based on the Montgomery reduction is presented. For the elliptic curve point multiplication, this arithmetic over Gaussian integers improves the computational efficiency, the resistance against side channel attacks, and reduces the memory requirements. Furthermore, an efficient variant of the Lempel-Ziv-Welch (LZW) algorithm for universal lossless data compression is investigated. Instead of one LZW dictionary, this algorithm applies several dictionaries to speed up the encoding process. Two dictionary partitioning techniques are introduced that improve the compression rate and reduce the memory size of this parallel dictionary LZW algorithm.
R 2,015.00
Robustness and Complex Data Structures
This Festschrift in honour of Ursula Gather’s 60th birthday deals with modern topics in the field of robust statistical methods, especially for time series and regression analysis, and with statistical methods for complex data structures. The individual contributions of leading experts provide a textbook-style overview of the topic, supplemented by current research results and questions. The statistical theory and methods in this volume aim at the analysis of data which deviate from classical stringent model assumptions, which contain outlying values and/or have a complex structure. Written for researchers as well as master and PhD students with a good knowledge of statistics.
R 4,030.00
R 492.00
Introduction To The Analysis Of Algorithms, An (2nd Edition)
A successor to the first edition, this updated and revised book is a great companion guide for students and engineers alike, specifically software engineers who design reliable code. While succinct, this edition is mathematically rigorous, covering the foundations of both computer scientists and mathematicians with interest in algorithms.Besides covering the traditional algorithms of Computer Science such as Greedy, Dynamic Programming and Divide & Conquer, this edition goes further by exploring two classes of algorithms that are often overlooked: Randomised and Online algorithms — with emphasis placed on the algorithm itself. The coverage of both fields are timely as the ubiquity of Randomised algorithms are expressed through the emergence of cryptography while Online algorithms are essential in numerous fields as diverse as operating systems and stock market predictions.While being relatively short to ensure the essentiality of content, a strong focus has been placed on self-containment, introducing the idea of pre/post-conditions and loop invariants to readers of all backgrounds. Containing programming exercises in Python, solutions will also be placed on the book's website.
R 2,121.17
Computation of Biomolecular Structures
Computational techniques have become an indispensable part of Molecular Biology, Biochemistry, and Molecular Design. In conjunction with refined experimental methods and powerful hardware, they enable us to analyze and visualize biomolecular structures, simulate their motions and to a variable degree understand their physicochemical properties and function. In addition, they provide essentially the only way to analyze and correlate the astronomical amounts of experimental sequence and structural data accumulating in international databases. We have good reasons to believe that further advances in this area will eventually enable us to predict with sufficient accuracy many structural and functional properties of fairly large biomolecules, given their sequence and specified environmental conditions. However, it is also important to realize that in achieving this goal, we encounter several serious problems of conceptual and methodological nature, the solution of which requires new approaches and algorithms. For example, we need better force fields, more efficient optimization routines, an adequate description of electrostatics and hydration, reliable methods to compute free energies, and ways to extent the length of molecular dynamics simulations by several orders of magnitude.
R 3,032.18
Foundations of Software Science and Computation Structures
This book constitutes the proceedings of the 20th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2017, which took place in Uppsala, Sweden in April 2017, held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017. The 32 papers presented in this volume were carefully reviewed and selected from 101 submissions. They were organized in topical sections named: coherence spaces and higher-order computation; algebra and coalgebra; games and automata; automata, logic and formal languages; proof theory; probability; concurrency; lambda calculus and constructive proof; and semantics and category theory.
R 2,220.34
Structural and Functional Aspects of Biocomputing Systems for Data Processing
Due to the diversity of contexts in which biological computation is performed, a major problem is the selection of functional-oriented techniques for the analysis of biological sequences in a huge environment. The performances of various sequences in biocomputational algorithms are evaluated with variant features to prove their efficiency in real-time environments.Structural and Functional Aspects of Biocomputing Systems for Data Processing provides insight into the structural and functional aspects of biological sequences and the pattern recognition they embed into the data processingcepts, methodologies, and empirical research advances of various biological data mining systems through machine learning approaches. Covering topics such as DNA sequencing, high-speed architecture, and medical image processing, this premier reference source is an essential resource for healthcare professionals, biological systems in biocomputing systems. It extends recent con specialists, industrial professionals, PCR testing professionals, scientists, bioinformaticians, students and educators of higher education, librarians, researchers, and academicians.
R 7,910.21
Index Data Structures in Object-Oriented Databases
Object-oriented database management systems (OODBMS) are used to imple ment and maintain large object databases on persistent storage. Regardless whether the underlying database model follows the object-oriented, the rela tional or the object-relational paradigm, a key feature of any DBMS product is content based access to data sets. On the one hand this feature provides user-friendly query interfaces based on predicates to describe the desired data. On the other hand it poses challenging questions regarding DBMS design and implementation as well as the application development process on top of the DBMS. The reason for the latter is that the actual query performance depends on a technically meaningful use of access support mechanisms. In particular, if chosen and applied properly, such a mechanism speeds up the execution of predicate based queries. In the object-oriented world, such queries may involve arbitrarily complex terms referring to inheritance hierarchies and aggregation paths. These features are attractive at the application level, however, they increase the complexity of appropriate access support mechanisms which are known to be technically non-trivial in the relational world.
R 4,636.39
Parallel Architectures and Bioinspired Algorithms
This monograph presents examples of best practices when combining bioinspired algorithms with parallel architectures. The book includes recent work by leading researchers in the field and offers a map with the main paths already explored and new ways towards the future.Parallel Architectures and Bioinspired Algorithms will be of value to both specialists in Bioinspired Algorithms, Parallel and Distributed Computing, as well as computer science students trying to understand the present and the future of Parallel Architectures and Bioinspired Algorithms.
R 5,280.05
Advances in Algorithms, Languages, and Complexity
This book contains a collection of survey papers in the areas of algorithms, lan guages and complexity, the three areas in which Professor Ronald V. Book has made significant contributions. As a fonner student and a co-author who have been influenced by him directly, we would like to dedicate this book to Professor Ronald V. Book to honor and celebrate his sixtieth birthday. Professor Book initiated his brilliant academic career in 1958, graduating from Grinnell College with a Bachelor of Arts degree. He obtained a Master of Arts in Teaching degree in 1960 and a Master of Arts degree in 1964 both from Wesleyan University, and a Doctor of Philosophy degree from Harvard University in 1969, under the guidance of Professor Sheila A. Greibach. Professor Book's research in discrete mathematics and theoretical com puter science is reflected in more than 150 scientific publications. These works have made a strong impact on the development of several areas of theoretical computer science. A more detailed summary of his scientific research appears in this volume separately.
R 6,022.28
Applied AI for Enterprise Java Development
As a Java enterprise developer or architect, you know that embracing AI isn't just optional-it's critical to keeping your competitive edge. The question is, how can you skillfully incorporate these groundbreaking AI technologies into your applications without getting mired in complexity?Enter this clear-cut, no-nonsense guide to integrating generative AI into your Java enterprise ecosystem. With insights from authors Alex Soto Bueno, Markus Eisele, and Natale Vinto, you'll learn to marry the robustness of Java's enterprise world with the dynamism of AI. It's more than just a how-to-it's a way to elevate enterprise software with savvy AI integrations, ensuring your skills and your applications remain on the cutting edge.Inside, you'll unlock the power to:Demystify GenAI's role and impact on contemporary software developmentCraft actionable, AI-driven applications using Java's rich ecosystem of open source frameworksImplement field-tested AI patterns tailored for prod-ready, enterprise-strength applicationsAccess and integrate top-tier open source AI models with Java's Inference APIsNavigate the Java framework landscape with AI-centric agility and confidence
R 1,505.00
Approximation Theory and Algorithms for Data Analysis
This textbook offers an accessible introduction to the theory and numerics of approximation methods, combining classical topics of approximation with recent advances in mathematical signal processing, and adopting a constructive approach, in which the development of numerical algorithms for data analysis plays an important role.The following topics are covered:* least-squares approximation and regularization methods* interpolation by algebraic and trigonometric polynomials* basic results on best approximations* Euclidean approximation* Chebyshev approximation* asymptotic concepts: error estimates and convergence rates* signal approximation by Fourier and wavelet methods* kernel-based multivariate approximation* approximation methods in computerized tomographyProviding numerous supporting examples, graphical illustrations, and carefully selected exercises, this textbook is suitable for introductory courses, seminars, and distance learning programs on approximation for undergraduate students.
R 2,620.18
Numerical Algorithms for Personalized Search in Self-organizing Information Networks
This book lays out the theoretical groundwork for personalized search and reputation management, both on the Web and in peer-to-peer and social networks. Representing much of the foundational research in this field, the book develops scalable algorithms that exploit the graphlike properties underlying personalized search and reputation management, and delves into realistic scenarios regarding Web-scale data. Sep Kamvar focuses on eigenvector-based techniques in Web search, introducing a personalized variant of Google's PageRank algorithm, and he outlines algorithms--such as the now-famous quadratic extrapolation technique--that speed up computation, making personalized PageRank feasible. Kamvar suggests that Power Method-related techniques ultimately should be the basis for improving the PageRank algorithm, and he presents algorithms that exploit the convergence behavior of individual components of the PageRank vector. Kamvar then extends the ideas of reputation management and personalized search to distributed networks like peer-to-peer and social networks.He highlights locality and computational considerations related to the structure of the network, and considers such unique issues as malicious peers. He describes the EigenTrust algorithm and applies various PageRank concepts to P2P settings. Discussion chapters summarizing results conclude the book's two main sections. Clear and thorough, this book provides an authoritative look at central innovations in search for all of those interested in the subject.
R 2,672.85
Foundations and Methods in Combinatorial and Statistical Data Analysis and Clustering
This book offers an original and broad exploration of the fundamental methods in Clustering and Combinatorial Data Analysis, presenting new formulations and ideas within this very active field. With extensive introductions, formal and mathematical developments and real case studies, this book provides readers with a deeper understanding of the mutual relationships between these methods, which are clearly expressed with respect to three facets: logical, combinatorial and statistical. Using relational mathematical representation, all types of data structures can be handled in precise and unified ways which the author highlights in three stages:Clustering a set of descriptive attributesClustering a set of objects or a set of object categories Establishing correspondence between these two dual clusterings Tools for interpreting the reasons of a given cluster or clustering are also included.Foundations and Methods in Combinatorial and Statistical Data Analysis and Clustering will be a valuable resource for students and researchers who are interested in the areas of Data Analysis, Clustering, Data Mining and Knowledge Discovery.
R 4,713.36
R 1,527.00
Wireless Algorithms, Systems, and Applications
The three-volume set constitutes the proceedings of the 17th International Conference on Wireless Algorithms, Systems, and Applications, WASA 2022, which was held during October 28-30, 2022. The conference took place in Dalian, China.The 95 full and 62 short papers presented in these proceedings were carefully reviewed and selected from 265 submissions. The contributions in theoretical frameworks and analysis of fundamental cross-layer protocol and network design and performance issues; distributed and localized algorithm design and analysis; information and coding theory for wireless networks; localization; mobility models and mobile social networking; underwater and underground networks; vehicular networks; algorithms, systems, and applications of edge computing
R 4,336.43
Algorithms in Ambient Intelligence
The advent of the digital era, the Internet, and the development of fast com puting devices that can access mass storage servers at high communication bandwidths have brought within our reach the world of ambient intelligent systems. These systems provide users with information, communication, and entertainment at any desired place and time. Since its introduction in 1998, the vision of Ambient Intelligence has attracted much attention within the re search community. Especially, the need for intelligence generated by smart al gorithms, which run on digital platforms that are integrated into consumer elec tronics devices, has strengthened the interest in Computational Intelligence. This newly developing research field, which can be positioned at the inter section of computer science, discrete mathematics, and artificial intelligence, contains a large variety of interesting topics including machine learning, con tent management, vision, speech, data mining, content augmentation, profiling, contextual awareness, feature extraction, resource management, security, and privacy.
R 4,663.11
Optimization-based Molecular Dynamics Studies of SARS-CoV-2 Molecular Structures
COVID-19 has brought us extensive research databases in the fields of biophysics, biology, and bioinformatics. To extract valuable structural bioinformatic information of SARS-CoV-2 structural and nonstructural proteins, it is necessary to work with large-scale datasets of molecular dynamics (MD) trajectories that need to be optimized.This monograph serves as a comprehensive guide to optimization-based MD studies of the molecular structures of SARS-CoV-2 proteins and RNA. The book begins by performing local optimization, taking into account the three-body movement and optimizing the noncovalent bonds of each molecular structure. The optimized structures reach a transition state that offers the best stability and lowest energy. The optimization process utilizes a hybrid strategy that combines mathematical optimization with various local search algorithms. This approach significantly reduces data volume while eliminating irrelevant bioinformatics data.To gain a thorough understanding of molecular stability and the mechanism of action, it is essential to consider not only static NMR, X-ray, or cryo-EM structures but also dynamic information obtained through MD or Quantum Mechanics/Molecular Mechanics (QM/MM) simulations. These simulations capture the internal motions and dynamic processes of molecules. Furthermore, for each protein, the structural bioinformatics obtained from the optimized structure is validated by analyzing large-scale MD trajectory databases, which are openly and freely available online. The analysis includes key structural bioinformatics aspects such as salt bridge electrostatic interactions, hydrogen bonds, van der Waals interactions, and hydrophobic interactions specific to each SARS-CoV-2 molecular structure. The book also delves into discussions on drugs, vaccines, and the origins of the virus. Additionally, pandemic mathematical models, including those incorporating time delays, are explored.This book is particularly valuable for professionals working in practical computing roles within computational biochemistry, computational biophysics, optimization and molecular dynamics, structural bioinformatics, biological mathematics, and related fields. It serves as an accessible introduction to these disciplines and is also an excellent teaching resource for students.
R 8,059.00
Concurrent Programming: Algorithms, Principles, and Foundations
This book is devoted to the most difficult part of concurrent programming, namely synchronization concepts, techniques and principles when the cooperating entities are asynchronous, communicate through a shared memory, and may experience failures. Synchronization is no longer a set of tricks but, due to research results in recent decades, it relies today on sane scientific foundations as explained in this book.In this book the author explains synchronization and the implementation of concurrent objects, presenting in a uniform and comprehensive way the major theoretical and practical results of the past 30 years. Among the key features of the book are a new look at lock-based synchronization (mutual exclusion, semaphores, monitors, path expressions); an introduction to the atomicity consistency criterion and its properties and a specific chapter on transactional memory; an introduction to mutex-freedom and associated progress conditions such as obstruction-freedom and wait-freedom; a presentation of Lamport's hierarchy of safe, regular and atomic registers and associated wait-free constructions; a description of numerous wait-free constructions of concurrent objects (queues, stacks, weak counters, snapshot objects, renaming objects, etc.); a presentation of the computability power of concurrent objects including the notions of universal construction, consensus number and the associated Herlihy's hierarchy; and a survey of failure detector-based constructions of consensus objects. The book is suitable for advanced undergraduate students and graduate students in computer science or computer engineering, graduate students in mathematics interested in the foundations of process synchronization, and practitioners and engineers who need to produce correct concurrent software. The reader should have a basic knowledge of algorithms and operating systems.
R 3,784.27
