Search results for "data structures using c"
Items we need to order for you
R 1,220.00
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,635.49
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
Algorithms and Data Structures
This volume contains the papers presented at the 11th Algorithms and Data Structures Symposium, WADS 2009 (formerly Workshop on Algorithms and Data Structures), held during August 21-23, 2009 in Ban?, Alberta, Canada. WADS alternates with the Scandinavian Workshop on Algorithms Theory (SWAT), continuing the tradition of SWAT and WADS starting with SWAT 1988 and WADS 1989. Inresponsetothecallforpapers,126papersweresubmitted. Fromtheses- missions, the ProgramCommittee selected 49 papers for presentation at WADS 2009. In addition, invited lectures were given by the following distinguished researchers: Erik Demaine, Richard Karp, and Christos Papadimitriou. On behalf of the Program Committee, we would like to express our appre- ation to the invited speakers, reviewers and all authors who submitted papers. May 2009 Frank Dehne Marina Gavrilova J.. org-Ru ..diger Sack Csaba D. T' oth Conference Organization Program Chairs Frank Dehne Marina Gavrilova Joerg-Ruediger Sack Csaba D.Toth Program Committee Sergei Bereg Allan Borodin Gerth Stolting Brodal Timothy Chan Mark de Berg Frank Devai Matt Duckham Rolf Fagerberg Randolph Franklin Joachim Gudmundsson Susanne Hambrusch Rolf Klein Mike Langston Ming Li Friedhelm Meyer auf der Heide Ian Munro Jon Rokne Shashi Shekhar Bettina Speckmann Paul Spirakis Gabor Tardos Je? Vitter Frances F. Yao Local Organization Marina Gavrilova Csaba D. Toth Jon Rokne Maruf Monwar Kushan Ahmadian Table of Contents On the Power of the Semi-Separated Pair Decomposition...1 Mohammad Ali Abam, Paz Carmi, Mohammad Farshi, and Michiel Smid Plane Graphs with Parity Constraints...
R 1,603.24
R 1,351.82
SymbolicC++:An Introduction to Computer Algebra using Object-Oriented Programming
Symbolic C++: An Introduction to Computer Algebra Using Object-Oriented Programming provides a concise introduction to C++ and object-oriented programming, using a step-by-step construction of a new object-oriented designed computer algebra system - Symbolic C++. It shows how object-oriented programming can be used to implement a symbolic algebra system and how this can then be applied to different areas in mathematics and physics. This second revised edition:- * Explains the new powerful classes that have been added to Symbolic C++. * Includes the Standard Template Library. * Extends the Java section. * Contains useful classes in scientific computation. * Contains extended coverage of Maple, Mathematica, Reduce and MuPAD.
R 1,619.40
Algorithms and Data Structures
The papers in this volume were presented at the Seventh Workshop on Al- rithms and Data Structures (WADS 2001). The workshop took place August 8-10, 2001 in Providence, Rhode Island, USA. The workshop alternates with the Scandinavian Workshop on Algorithms Theory (SWAT), continuing the t- dition of SWAT and WADS starting with SWAT '88 and WADS '89. In response to the call for papers, 89 papers were submitted. From these submissions, the program committee selected 40 papers for presentation at the workshop. In addition invited plenary lectures were given by the following - stinguished researchers: Mikhail J. Atallah, F. Thomson Leighton, and Mihalis Yannakakis. On behalf of the program committee, we would like to express our apprec- tion to the invited speakers and to all the authors who submitted papers. August 2001 Frank Dehne J.. org-Rudiger .. Sack Roberto Tamassia Organization Conference Chair Roberto Tamassia (Brown) Program Committee Chairs Frank Dehne (Carleton) J.. org-Rudiger .. Sack (Carleton) Roberto Tamassia (Brown) Program Committee Alberto Apostolico (Purdue, Padova) Giuseppe Liotta (Perugia) Timothy Chan (Waterloo) Ernst W. Mayr (Munc .. hen) Bruno Codenotti (IMC) Joseph S.B. Mitchell (SUNY) Giuseppe Di Battista (Roma Tre) Stefan N.. aher (Trier) Shlomi Dolev (Ben-Gurion) Takao Nishizeki (Tohoku) Martin Farach-Colton Viktor K. Prasanna (USC) (Rutgers, Google) Enrico Puppo (Genova) Pierre Fraigniaud (LRI) Jose Rolim (Geneva) Harold N. Gabow (Colorado) Jack Snoeyink (UNC) Sally A. Goldman (Washington) Ioannis G. Tollis (UTD) Michael T.
R 1,589.28
OpenVMS Alpha Internals and Data Structures
OpenVMS Alpha Internals and Data Structures: Memory Management is an updateto selected parts of the book OpenVMS AXP Internals and Data Structures Version 1.5 (Digital Press, 1994). This book covers the extensions to the memory management subsystem of OpenVMS Alpha to allow the operating system and applications to access 64 bits of address space. It emphasizes system data structures and their manipulation by paging and swapping routines and related system services.It also describes management of dynamic memory, such as nonpaged pool, and support for nonuniform memory access (NUMA) platforms.This book is intended for systems programmers, technical consultants, application designers, and other computer progressions interested in learning the details of the OpenVMS executive. Teachers and students of graduate and advanced undergraduate courses in operating systems will find this book a valuable study in how theory and practice are resolved in a complex commercialoperating system.
R 3,620.00
Algebraic Approach to Data Processing
The book explores a new general approach to selecting—and designing—data processing techniques. Symmetry and invariance ideas behind this algebraic approach have been successful in physics, where many new theories are formulated in symmetry terms.The book explains this approach and expands it to new application areas ranging from engineering, medicine, education to social sciences. In many cases, this approach leads to optimal techniques and optimal solutions. That the same data processing techniques help us better analyze wooden structures, lung dysfunctions, and deep learning algorithms is a good indication that these techniques can be used in many other applications as well. The book is recommended to researchers and practitioners who need to select a data processing technique—or who want to design a new technique when the existing techniques do not work. It is also recommended to students who want to learn the state-of-the-art data processing.
R 4,396.00
Fractal Structure of Data Reference
The architectural concept of a memory hierarchy has been immensely successful, making possible today's spectacular pace of technology evolution in both the volume of data and the speed of data access. Its success is difficult to understand, however, when examined within the traditional "memoryless" framework of performance analysis. The `memoryless' framework cannot properly reflect a memory hierarchy's ability to take advantage of patterns of data use that are transient. The Fractal Structure of Data Reference: Applications to the Memory Hierarchy both introduces, and justifies empirically, an alternative modeling framework in which arrivals are driven by a statistically self-similar underlying process, and are transient in nature. The substance of this book comes from the ability of the model to impose a mathematically tractable structure on important problems involving the operation and performance of a memory hierarchy. It describes events as they play out at a wide range of time scales, from the operation of file buffers and storage control cache, to a statistical view of entire disk storage applications. Striking insights are obtained about how memory hierarchies work, and how to exploit them to best advantage. The emphasis is on the practical application of such results. The Fractal Structure of Data Reference: Applications to the Memory Hierarchy will be of interest to professionals working in the area of applied computer performance and capacity planning, particularly those with a focus on disk storage. The book is also an excellent reference for those interested in database and data structure research.
R 4,630.93
R 1,916.48
Algorithms and Data Structures
This volume constitutes the proceedings of the Fourth International Workshop on Algorithms and Data Structures, WADS '95, held in Kingston, Canada in August 1995.The book presents 40 full refereed papers selected from a total of 121 submissions together with invited papers by Preparata and Bilardi, Sharir, Toussaint, and Vitanyi and Li. The book addresses various aspects of algorithms, data structures, computational geometry, scheduling, computational graph theory, and searching.
R 1,594.28
Using the C++ Standard Template Libraries
Using the C++ Standard Template Libraries is a contemporary treatment that teaches the generic programming capabilities that the C++ 14 Standard Library provides. In this book, author Ivor Horton explains what the class and function templates available with C++ 14 do, and how to use them in a practical context.You'll learn how to create containers, and how iterators are used with them to access, modify, and extend the data elements they contain. You'll also learn about stream iterators that can transfer data between containers and streams, including file streams. The function templates that define algorithms are explained in detail, and you'll learn how to pass function objects or lambda expressions to them to customize their behavior. Many working examples are included to demonstrate how to apply the algorithms with different types of containers. After reading this book, you will understand the scope and power of the templates that the C++ 14 Standard Library includes and how these can greatly reduce the coding and development time for many applications. You'll be able to combine the class and function templates to great effect in dealing with real-world problems.The templates in the Standard Library provide you as a C++ programmer with a comprehensive set of efficiently implemented generic programming tools that you can use for most types of application.How to use Standard Library templates with your C++ applications.Understand the different types of containers that are available and what they are used for.How to define your own class types to meet the requirements of use with containers.What iterators are, the characteristics of the various types of iterators, and how they allow algorithms to be applied to the data in different types of container.How you can define your own iterator types.What the templates that define algorithms do, and how you apply them to data stored in containers and arrays.How to access hardware clocks and use them for timing execution.How to use the templates available for compute-intensive numerical data processing.How to create and use pseudo-random number generators with distribution objects.
R 1,770.48
Mining of Data with Complex Structures
Mining of Data with Complex Structures:- Clarifies the type and nature of data with complex structure including sequences, trees and graphs- Provides a detailed background of the state-of-the-art of sequence mining, tree mining and graph mining.- Defines the essential aspects of the tree mining problem: subtree types, support definitions, constraints.- Outlines the implementation issues one needs to consider when developing tree mining algorithms (enumeration strategies, data structures, etc.)- Details the Tree Model Guided (TMG) approach for tree mining and provides the mathematical model for the worst case estimate of complexity of mining ordered induced and embedded subtrees.- Explains the mechanism of the TMG framework for mining ordered/unordered induced/embedded and distance-constrained embedded subtrees.- Provides a detailed comparison of the different tree mining approaches highlighting the characteristics and benefits of each approach.- Overviews the implications and potential applications of tree mining in general knowledge management related tasks, and uses Web, health and bioinformatics related applications as case studies.- Details the extension of the TMG framework for sequence mining- Provides an overview of the future research direction with respect to technical extensions and application areasThe primary audience is 3rd year, 4th year undergraduate students, Masters and PhD students and academics. The book can be used for both teaching and research. The secondary audiences are practitioners in industry, business, commerce, government and consortiums, alliances and partnerships to learn how to introduce and efficiently make use of the techniques for mining of data with complex structures into their applications. The scope of the book is both theoretical and practical and as such it will reach a broad market both within academia and industry. In addition, its subject matter is a rapidly emerging field that is critical for efficient analysis of knowledge stored in various domains.
R 4,662.24
Managing and Mining Uncertain Data
Managing and Mining Uncertain Data, a survey with chapters by a variety of well known researchers in the data mining field, presents the most recent models, algorithms, and applications in the uncertain data mining field in a structured and concise way. This book is organized to make it more accessible to applications-driven practitioners for solving real problems. Also, given the lack of structurally organized information on this topic, Managing and Mining Uncertain Data provides insights which are not easily accessible elsewhere. Managing and Mining Uncertain Data is designed for a professional audience composed of researchers and practitioners in industry. This book is also suitable as a reference book for advanced-level students in computer science and engineering, as well as the ACM, IEEE, SIAM, INFORMS and AAAI Society groups.
R 4,418.84
Algorithms and Data Structures
This book constitutes the refereed proceedings of the 14th Algorithms and Data Structures Symposium, WADS 2015, held in Victoria, BC, Canada, August 2015. The 54 revised full papers presented in this volume were carefully reviewed and selected from 148 submissions. The Algorithms and Data Structures Symposium - WADS (formerly Workshop on Algorithms And Data Structures), which alternates with the Scandinavian Workshop on Algorithm Theory, is intended as a forum for researchers in the area of design and analysis of algorithms and data structures. WADS includes papers presenting original research on algorithms and data structures in all areas, including bioinformatics, combinatorics, computational geometry, databases, graphics, and parallel and distributed computing.
R 1,614.56
Combinatorial Pattern Matching Algorithms in Computational Biology Using Perl and R
Emphasizing the search for patterns within and between biological sequences, trees, and graphs, Combinatorial Pattern Matching Algorithms in Computational Biology Using Perl and R shows how combinatorial pattern matching algorithms can solve computational biology problems that arise in the analysis of genomic, transcriptomic, proteomic, metabolomic, and interactomic data. It implements the algorithms in Perl and R, two widely used scripting languages in computational biology. The book provides a well-rounded explanation of traditional issues as well as an up-to-date account of more recent developments, such as graph similarity and search. It is organized around the specific algorithmic problems that arise when dealing with structures that are commonly found in computational biology, including biological sequences, trees, and graphs. For each of these structures, the author makes a clear distinction between problems that arise in the analysis of one structure and in the comparative analysis of two or more structures. He also presents phylogenetic trees and networks as examples of trees and graphs in computational biology.This book supplies a comprehensive view of the whole field of combinatorial pattern matching from a computational biology perspective. Along with thorough discussions of each biological problem, it includes detailed algorithmic solutions in pseudo-code, full Perl and R implementation, and pointers to other software, such as those on CPAN and CRAN.
R 3,956.00
Computational Finance Using C and C#
Computational Finance Using C and C#: Derivatives and Valuation, Second Edition provides derivatives pricing information for equity derivatives, interest rate derivatives, foreign exchange derivatives, and credit derivatives. By providing free access to code from a variety of computer languages, such as Visual Basic/Excel, C++, C, and C#, it gives readers stand-alone examples that they can explore before delving into creating their own applications. It is written for readers with backgrounds in basic calculus, linear algebra, and probability. Strong on mathematical theory, this second edition helps empower readers to solve their own problems. *Features new programming problems, examples, and exercises for each chapter. *Includes freely-accessible source code in languages such as C, C++, VBA, C#, and Excel.. *Includes a new chapter on the history of finance which also covers the 2008 credit crisis and the use of mortgage backed securities, CDSs and CDOs. *Emphasizes mathematical theory.
R 2,972.00
R 611.00
Morphological Structure, Lexical Representation and Lexical Access (RLE Linguistics C: Applied Linguistics)
The main concern of this work is whether morphemes play a role in the lexical representation and processing of several types of polymorphemic words and, more particularly, at what precise representational and processing level. The book comprises two theoretical contributions and a number of empirical ones. One theoretical paper discusses several possible motivations for a morphologically organised mental lexicon (like the economy of representation view, and the efficiency of processing view), and lays out the weaknesses that are associated with some of these motivations. The other theoretical paper offers an interactive-activation reinterpretation of the findings that were originally reported within the lexical search framework. The empirical papers together cover a relatively broad array of language types and mainly deal with visual word recognition in normals in the context of lexical morphology (derived and compound words). Evidence is reported on the function of stems and affixes as processing units in prefixed and suffixed derivations. The role of semantic transparency in the lexical representation of compounds is studied, as is the effect of orthographic ambiguity on the parsing of novel compounds. The inflection-derivational distinction is approached in the context of Finnish, a highly agglutinative language with much richer morphology than the languages usually studied in psycholinguistic experiments on polymorphemic words. Two other contributions also approach the study object in the context of relatively uncharted domains: one presents data on Chinese, a language which uses a different script-type (logographic) from the languages that are usually studied (alphabetic script), and another one presents data on language production.
R 9,312.77
Algorithms and Data Structures
This book constitutes the refereed proceedings of the 17th International Symposium on Algorithms and Data Structures, WADS 2021, held in virtually in August 2021. The 47 full papers, presented together with two invited lectures, were carefully reviewed and selected from a total of 123 submissions. They present original research on the theory, design and application of algorithms and data structures.
R 4,335.68
Fractal Structure of Data Reference
The architectural concept of a memory hierarchy has been immensely successful, making possible today's spectacular pace of technology evolution in both the volume of data and the speed of data access. Its success is difficult to understand, however, when examined within the traditional "memoryless" framework of performance analysis. The `memoryless' framework cannot properly reflect a memory hierarchy's ability to take advantage of patterns of data use that are transient. The Fractal Structure of Data Reference: Applications to the Memory Hierarchy both introduces, and justifies empirically, an alternative modeling framework in which arrivals are driven by a statistically self-similar underlying process, and are transient in nature. The substance of this book comes from the ability of the model to impose a mathematically tractable structure on important problems involving the operation and performance of a memory hierarchy. It describes events as they play out at a wide range of time scales, from the operation of file buffers and storage control cache, to a statistical view of entire disk storage applications. Striking insights are obtained about how memory hierarchies work, and how to exploit them to best advantage. The emphasis is on the practical application of such results. The Fractal Structure of Data Reference: Applications to the Memory Hierarchy will be of interest to professionals working in the area of applied computer performance and capacity planning, particularly those with a focus on disk storage. The book is also an excellent reference for those interested in database and data structure research.
R 4,631.50
R 1,067.00
Introduction to Optimization of Structures
to Optimization of Structures With 66 Illustrations Springer-Verlag New York Berlin Heidelberg London Paris Tokyo Hong Kong N.V. Banichuk Institute for Problems in Mechanics USSR Academy of ScienCes 117526 Moscow Soviet Union Translator Vadim Komkov Mathematics and Computer Science Department Air Force Institute of Technology Wright Patterson Air Force Base, OH 45433 USA Original Russian edition Vvedenie v Optimizatsiyu Konstruktsiy published (c) 1986 by Nauka Moscow. Library of Congress Cataloging-in-Publication Data Banichuk, Nikolai Vladimirovich. [Vvedenie v optimizatsiiii konstruktsii. English] Introduction to optimization of structuresfN.V. Banichuk. p. cm. Translation of: Vvedenie v optimizaiSiiu konstrukiSii. Includes bibliographical references. ISBN-13:978-1-4612-7988-4 (aIk. paper) 1. Structures, Theory of. I. Title. TA645.B3513 1990 624. 1 '7-dc20 89-26165 Printed on acid-free paper. (c) 1990 Springer-Verlag New York, Inc. Softcover reprint of the hardcover 1st edition 1990 All rights reserved. This work may not be translated or copied in whole or in part without the written permission of the publisher (Springer-Verlag New York, Inc.,175 Fifth Avenue, Ne\l York, NY 10010, USA), except for brief excerpts in connection with reviews or scholarly analysis Use in connection with any form of information storage and retrieval, electronic adaptation computer software, or by similar or dissimilar methodology now known or hereafter developec is forbidden.
R 3,040.41
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
Efficient Algorithms for Listing Combinatorial Structures
First published in 1993, this thesis is concerned with the design of efficient algorithms for listing combinatorial structures. The research described here gives some answers to the following questions: which families of combinatorial structures have fast computer algorithms for listing their members? What general methods are useful for listing combinatorial structures? How can these be applied to those families which are of interest to theoretical computer scientists and combinatorialists? Amongst those families considered are unlabelled graphs, first order one properties, Hamiltonian graphs, graphs with cliques of specified order, and k-colourable graphs. Some related work is also included, which compares the listing problem with the difficulty of solving the existence problem, the construction problem, the random sampling problem, and the counting problem. In particular, the difficulty of evaluating Pólya's cycle polynomial is demonstrated.
R 2,023.54
Dynamic Mixed Models for Familial Longitudinal Data
This book provides a theoretical foundation for the analysis of discrete data such as count and binary data in the longitudinal setup. Unlike the existing books, this book uses a class of auto-correlation structures to model the longitudinal correlations for the repeated discrete data that accommodates all possible Gaussian type auto-correlation models as special cases including the equi-correlation models. This new dynamic modelling approach is utilized to develop theoretically sound inference techniques such as the generalized quasi-likelihood (GQL) technique for consistent and efficient estimation of the underlying regression effects involved in the model, whereas the existing ‘working’ correlations based GEE (generalizedestimating equations) approach has serious theoretical limitations both for consistent and efficient estimation, and the existing random effects based correlations approach is not suitable to model the longitudinal correlations. The book has exploited the random effects carefully only to model the correlations of the familial data. Subsequently, this book has modelled the correlations of the longitudinal data collected from the members of a large number of independent families by using the class of auto-correlation structures conditional on the random effects. The book also provides models and inferences for discrete longitudinal data in the adaptive clinical trial set up.The book is mathematically rigorous and provides details for the development of estimation approaches under selected familial and longitudinal models. Further, while the book provides special cares for mathematics behind the correlation models, it also presents theillustrations of the statistical analysis of various real life data. This book will be of interest to the researchers including graduate students in biostatistics and econometrics, among other applied statistics research areas. Brajendra Sutradhar is a University Research Professor at Memorial University in St. John’s, Canada. He is an elected member of the International Statistical Institute and a fellow of the American Statistical Association. He has published about 110 papers in statistics journals in the area of multivariate analysis, time series analysis including forecasting, sampling, survival analysis for correlated failure times, robust inferences in generalized linear mixed models with outliers, and generalized linear longitudinal mixed models with bio-statistical and econometric applications. He has served as an associate editor for six years for Canadian Journal of Statistics and for four years for the Journal of Environmental and Ecological Statistics. He has served for 3 years as a member of the advisory committee on statistical methods in Statistics Canada. Professor Sutradhar was awarded 2007 distinguished service award of Statistics Society of Canada for his many years of services to thesociety including his special services for society’s annual meetings.
R 3,072.00
Numerical Simulations and Case Studies Using Visual C++.Net
Master the numerical simulation process required to design, test and support mobile and parallel computing systems. An accompanying ftp site contains all the Visual C++ based programs discussed in the text to help readers create their own programs. With its focus on problems and solutions, this is an excellent text for upper-level undergraduate and graduate students, and a must-have reference for researchers and professionals in the field of simulations. More information about Visual C++ based programs can be found at: ftp: //ftp.wiley.com/public/scitechmed/numericalsimulations/
R 5,665.00
New Data Structures and Algorithms for Logic Synthesis and Verification
This book introduces new logic primitives for electronic design automation tools. The author approaches fundamental EDA problems from a different, unconventional perspective, in order to demonstrate the key role of rethinking EDA solutions in overcoming technological limitations of present and future technologies. The author discusses techniques that improve the efficiency of logic representation, manipulation and optimization tasks by taking advantage of majority and biconditional logic primitives. Readers will be enabled to accelerate formal methods by studying core properties of logic circuits and developing new frameworks for logic reasoning engines.
R 2,102.27
Structures of Computing
Structures of Computing explains the behavioral meaning of fundamental concepts of computing from a practical viewpoint and in generic terms, unrestricted by specific computing devices or programming languages. To compute is understood as processing structures by a set of cooperating agents each of which executes an algorithm assigned to it and interacts with the other agents.Part I of the book defines the conceptual constituents of interactive processes: (i) data, i.e. structured objects with associated properties, relations and functions the algorithmic processes operate upon, (ii) basic operations that affect the data in single execution steps, and (iii) control mechanisms that determine the combination of single steps in multi-agent computations where the interaction happens via communication or other forms of data sharing.Part II analyses these constituents concerning (i) methods to achieve process correctness (inspection, experimental validation, reasoning), (ii) principal computational paradigms (architectures, programming styles, communication structures, control patterns from sequential and reflective to concurrent, mixed synchronous/asynchronous and data flow control), and (iii) complexity (power and limits of computing structures).The book is mainly addressed to students and professionals who want to understand the conceptual foundation of computing. It does not assume any specific programming experience but only a basic understanding of what are mechanically executable processes and their descriptions. Any unnecessary formalism is thus avoided, and definitions are formulated as much as possible in natural language, using common mathematical notation only where needed to prevent ambiguities. Numerous examples and exercises serve as comprehension checkpoints.
R 2,364.41
Management and Processing of Complex Data Structures
This volume presents the proceedings of the third workshop on Information Systems and Artificial Intelligence, organized by the German Computer Science Society. The 11 invited contributions by well known researchers and developers working in the fields of databases and knowledge representation systems are centered around the topic of management and processing of complex data structures; they give a representative snapshot of the state-of-the-art in this fruitful interdisciplinary research area important for further progress in both, information systems and artificial intelligence. Most of the papers stress the demands for new or extended formalisms and their deductive capabilities, including an analysis of their formal properties for managing complex structures.
R 1,546.52
Blockchain Fundamentals, Data Structures, and Algorithms for Data Science
Offering a systematic exploration of blockchain networks from both technical and analytical viewpoints, this book introduces the core structures that underpin blockchain systems, transactions, addresses, and smart contracts and explains how these can be modeled, visualized, and analyzed using modern data science methods. Bridging computer science, finance, and statistics, it integrates algorithmic reasoning with economic intuition to study decentralization, risk, and trust in digital economies. Through examples drawn from Bitcoin, Ethereum, Ripple, Monero, Zcash, IOTA, and DeFi, readers learn how blockchain data can be transformed into graph and temporal models for fraud detection, systemic risk analysis, and network behavior prediction. Featuring clear explanations, illustrative figures, and Solidity code, this volume serves as an essential reference for students, researchers, and practitioners in finance, data science, statistics, machine learning, and distributed systems.
R 3,391.00
Computer–Based Structure Elucidation from Spectral Data
Here, the authors introduce readers to solving molecular structure elucidation problems using the expert system ACD/Structure Elucidator. They explain in detail the concepts of the Computer-Assisted Structure Elucidation (CASE) approach and point out the crucial role of understanding the axiomatic nature of the data used to deduce the structure. Aspects covered include the main blocks of the expert system and essential features of the mathematical algorithms used. Graduate and PhD students as well as practicing chemists are provided with a detailed explanation of the various practical approaches depending on available spectral data peculiarities and the complexity of the unknown structure. This is supported by a large number of real-world completed examples, most of which are related to the structure elucidation of natural product molecules containing unusual skeletons. Dedicated software and further supplementary material are available at www.acdlabs.com/TeachingSE.
R 4,030.00
Using MPI
The thoroughly updated edition of a guide to parallel programming with MPI, reflecting the latest specifications, with many detailed examples. This book offers a thoroughly updated guide to the MPI (Message-Passing Interface) standard library for writing programs for parallel computers. Since the publication of the previous edition of Using MPI, parallel computing has become mainstream. Today, applications run on computers with millions of processors; multiple processors sharing memory and multicore processors with multiple hardware threads per core are common. The MPI-3 Forum recently brought the MPI standard up to date with respect to developments in hardware capabilities, core language evolution, the needs of applications, and experience gained over the years by vendors, implementers, and users. This third edition of Using MPI reflects these changes in both text and example code. The book takes an informal, tutorial approach, introducing each concept through easy-to-understand examples, including actual code in C and Fortran. Topics include using MPI in simple programs, virtual topologies, MPI datatypes, parallel libraries, and a comparison of MPI with sockets. For the third edition, example code has been brought up to date; applications have been updated; and references reflect the recent attention MPI has received in the literature. A companion volume, Using Advanced MPI, covers more advanced topics, including hybrid programming and coping with large data.
R 2,207.00
Knowledge Structures for Communications in Human-Computer Systems
A comprehensive look at General automata and how it can be used to establish the fundamentals for communication in human-computer systems Drawing on author Eldo C. Koenig's extensive expertise and culling from his thirty-four previously published works, this seminal resource presents knowledge structures for communication in Human-Computer Systems (HCS) based on General automata. The resulting model provides knowledge representations for software engineering. Of the many features required for a method to achieve the desired communication in HCS, Knowledge Structures for Communications in Human-Computer Systems identifies six of them in great length-extracting and storing the knowledge of sentences; knowledge association; deductive processes; inferences; feedback; and sequencing of knowledge-along with illustrations for achieving them by the General Automata Method. After presenting the analysis for each feature, the book includes practical applications that illustrate the results. Koenig also describes algorithms and programs that achieve some of the features, and provides readers with additional algorithms and further research. Richly illustrated throughout to elucidate concepts, Knowledge Structures for Communications in Human-Computer Systems is an excellent teaching text suitable for both academic and industrial settings.
R 3,157.00
Linguistic Structure Prediction
A major part of natural language processing now depends on the use of text data to build linguistic analyzers. We consider statistical, computational approaches to modeling linguistic structure. We seek to unify across many approaches and many kinds of linguistic structures. Assuming a basic understanding of natural language processing and/or machine learning, we seek to bridge the gap between the two fields. Approaches to decoding (i.e., carrying out linguistic structure prediction) and supervised and unsupervised learning of models that predict discrete structures as outputs are the focus. We also survey natural language processing problems to which these methods are being applied, and we address related topics in probabilistic inference, optimization, and experimental methodology. Table of Contents: Representations and Linguistic Data / Decoding: Making Predictions / Learning Structure from Annotated Data / Learning Structure from Incomplete Data / Beyond Decoding: Inference
R 2,371.09
Practical Graph Structures in SQL Server and Azure SQL
Use the graph table features in Azure SQL that were introduced in SQL Server 2017 and further refined in SQL Server 2019. This book shows you how to create data structures to capture complex connections between items in your data. These connections will help you analyze and draw insights from connections in your data that go beyond classic relationships. The graph examples in the book are useful for analyzing social media relationships, complex product-to-customer relationships, and any other type of data analysis in which indirect connections that otherwise might be missed using conventional techniques can be mined for their insight and business value. Tree structures are covered, with emphasis on a structure commonly used by organizations to aggregate data at different levels of an organization. The book provides code examples of SQL Graph objects as well as an alternate tree implementation technique. Included is sample data (and data generators) for you to test for performance and choose the implementation approach that best suits your needs and that of your application.If your job involves analyzing or storage of data elements that are connected in a networked topology, then this is the book that will help you bring the power of SQL Server to bear on that data and take advantage of your existing knowledge. What You Will LearnUnderstand the graph model and the associated terms used in graph analysisStore highly connected data in SQL Server and Azure SQL alongside existing relational dataMake full use of the graph table feature that is refined and enhanced in SQL Server 2019Implement high performance tree structures that will make storing and querying tree data possibleReport on data associated with a tree structure to aggregate results at different levelsWho This Book Is For
R 1,482.00
Algorithms and Data Structures
This book constitutes the refereed proceedings of the 13th Algorithms and Data Structures Symposium, WADS 2013, held in London, ON, Canada, August 2013. The Algorithms and Data Structures Symposium - WADS (formerly "Workshop on Algorithms and Data Structures") is intended as a forum for researchers in the area of design and analysis of algorithms and data structures. The 44 revised full papers presented in this volume were carefully reviewed and selected from 139 submissions. The papers present original research on algorithms and data structures in all areas, including bioinformatics, combinatorics, computational geometry, databases, graphics, and parallel and distributed computing.
R 1,597.36
Automated Verification of Concurrent Search Structures
Search structures support the fundamental data storage primitives on key-value pairs: insert a pair, delete by key, search by key, and update the value associated with a key. Concurrent search structures are parallel algorithms to speed access to search structures on multicore and distributed servers. These sophisticated algorithms perform fine-grained synchronization between threads, making them notoriously difficult to design correctly. Indeed, bugs have been found both in actual implementations and in the designs proposed by experts in peer-reviewed publications. The rapid development and deployment of these concurrent algorithms has resulted in a rift between the algorithms that can be verified by the state-of-the-art techniques and those being developed and used today. The goal of this book is to show how to bridge this gap in order to bring the certified safety of formal verification to high-performance concurrent search structures. Similar techniques and frameworks can be applied to concurrent graph and network algorithms beyond search structures.
R 2,252.93
