Search results for "data structures in depth using c"
Items we need to order for you
C# 15 and .NET 11 – Modern Cross-Platform Development Fundamentals
An easy-to-follow guide for beginners and students to learn C# 15 and .NET 11 through practical examples, responsible AI-assisted learning, cross-platform projects, and MCP-enabled web servicesKey FeaturesBuild strong C# foundations with clear explanations and expanded knowledge checksCreate data-driven apps with, EF Core, LINQPad, and BlazorExplore union types, async processes, xUnit v3, Zstandard compression, and Minimal APIsBook DescriptionC# and .NET are used to build console apps, websites, cloud services, and enterprise software. Updated for C# 15 and .NET 11, this eleventh edition offers a clear and practical introduction to the Microsoft development platform. You’ll begin with C# essentials, including types, control flow, functions, object-oriented programming, debugging, exception handling, and testing with xUnit v3. Hands-on exercises teach current practices without unnecessary comparisons with older versions.Next, you’ll work with .NET libraries, packages, processes, asynchronous tasks, files, streams, serialization, collections, and regular expressions. You’ll also explore union types and closed class hierarchies, the major new language features in C# 15. The final chapters introduce data and web development with Entity Framework Core, LINQ, LINQPad, Blazor, and Minimal APIs. You’ll create data-driven applications, test web services, and use MCP to make application features available to AI clients.Throughout the book, suggested AI prompts help you explore challenging topics with your preferred chatbot, while expanded questions at the end of each chapter reinforce what you’ve learned. By the end, you’ll have the skills to build modern apps, websites, and services with C# and .NET.What you will learnControl program flow, convert values, and handle exceptionsDesign reusable types with classes, interfaces, and inheritancePackage and distribute reusable .NET librariesUse collections, Unicode text, and regular expressionsRead, write, compress, and serialize files and streamsScaffold database models and improve read-only query performanceConnect interactive Blazor components to application dataTest HTTP services and connect them to AI clientsWho this book is forThis book is for absolute beginners, students, self-taught programmers, and early-career developers who want a structured introduction to C# and .NET. It is also suitable for developers returning to the Microsoft ecosystem or updating their skills for C# 15 and .NET 11. No professional C# or .NET experience is required, although basic familiarity with programming concepts can be helpful.
R 1,954.00
Adaptive Processing of Sequences and Data Structures
This book is devoted to adaptive processing of structured information similar to flexible and intelligent information processing by humans - in contrast to merely sequential processing of predominantly symbolic information within a deterministic framework. Adaptive information processing allows for a mixture of sequential and parallel processing of symbolic as well as subsymbolic information within deterministic and probabilistic frameworks.The book originates from a summer school held in September 1997 and thus is ideally suited for advanced courses on adaptive information processing and advanced learning techniques or for self-instruction. Research and design professionals active in the area of neural information processing will find it a valuable state-of-the-art survey.
R 1,580.61
Memory as a Programming Concept in C and C++
The overwhelming majority of bugs and crashes in computer programming stem from problems of memory access, allocation, or deallocation. Such memory related errors are also notoriously difficult to debug. Yet the role that memory plays in C and C++ programming is a subject often overlooked in courses and in books because it requires specialised knowledge of operating systems, compilers, computer architecture in addition to a familiarity with the languages themselves. Most professional programmers learn entirely through experience of the trouble it causes. This 2004 book provides students and professional programmers with a concise yet comprehensive view of the role memory plays in all aspects of programming and program behaviour. Assuming only a basic familiarity with C or C++, the author describes the techniques, methods, and tools available to deal with the problems related to memory and its effective use.
R 2,333.94
R 1,422.53
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
Verified Signal Processing Algorithms in MATLAB and C
This book is written for engineers who need to develop algorithms used for signal processing and/or implement algorithms using the C programming language or MATLAB. The book features a rich collection of recipes for applied signal processing such as FIR, IIR, FFT, correlation, complex FIR, adaptive filters and others. The book applies to those who want to implement in the shortest time to market working systems that are built from a collection of building blocks implemented in an FPGA firmware or C language software, running on an SBC or DSP. Structured as an instantly applicable guide, the author covers a wide collection of required solutions to common encountered problems with a software guide.All Codes in the book are verified and processing times for all C codes are specified, enabling the reader to estimate processing time on his own target, by comparing it to the I5 2.9 GHz CPU used here. Endorsements: “Your book bridges a gap between theory and implementation on hardware - which is a topic relevant to many in industry and many students who are targeting the digital signal processing industry (including communications and robotics)”Professor Alfred Hero, University of Michigan, Ann Arbor, USA“I believe you that for many engineers the book will be practical”Professor Anthony J. Weiss, Tel Aviv University, Israel
R 3,252.86
R 611.00
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
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
Foundations of Software Science and Computational Structures
The present volume contains the proceedings of the international conference Foundations of Software Science and Computation Structures(FOSSACS)2003, held in Warsaw, Poland, April 7-9, 2003. FOSSACS is an event of the Joint European Conferences on Theory and Practice of Software (ETAPS). The pre- ous ?ve FOSSACS conferences took place in Lisbon (1998), Amsterdam (1999), Berlin (2000), Genoa (2001), and Grenoble (2002). FOSSACS presents original papers on foundational researchwith a clear s- ni?cancetosoftwarescience.TheProgramCommitteeinvitedpapersontheories and methodsto supportthe analysis,integration,synthesis,transformation,and veri?cation of programs and software systems. We identi?ed the following t- ics, in particular: algebraic models; automata and language theory; behavioural equivalences; categorical models; computation processes over discrete and c- tinuous data; computation structures; logics of programs; modal, spatial, and temporallogics;modelsof concurrent,reactive,distributed, and mobile systems; processalgebrasandcalculi;semanticsofprogramminglanguages;softwaresp- i?cation and re?nement; transition systems; and type systems and type theory.We received 96 submissions, of which 2 were withdrawn. This proceedings consists of 27 papers. The ?rst-A Game Semantics for Generic Polymorphism-accompanies the invited lecture by Samson Abramsky, University of Oxford. The remaining 26 were selected for publication by the Program Committee during a week-long electronic discussion. I sincerely thank all the authors of papers submitted to FOSSACS 2003; the number and the quality of papers were exceptionally high this year. Moreover, I would like to thank all the members of the ProgramCommittee for the excellent job they did during a rather demanding selection process, and to thank all our subreferees for their invaluable contributions to this process.
R 1,582.10
R 6,002.41
R 336.00
Domain-Specific Computer Architectures for Emerging Applications
With the end of Moore’s Law, domain-specific architecture (DSA) has become a crucial mode of implementing future computing architectures. This book discusses the system-level design methodology of DSAs and their applications, providing a unified design process that guarantees functionality, performance, energy efficiency, and real-time responsiveness for the target application.DSAs often start from domain-specific algorithms or applications, analyzing the characteristics of algorithmic applications, such as computation, memory access, and communication, and proposing the heterogeneous accelerator architecture suitable for that particular application. This book places particular focus on accelerator hardware platforms and distributed systems for various novel applications, such as machine learning, data mining, neural networks, and graph algorithms, and also covers RISC-V open-source instruction sets. It briefly describes the system design methodology based on DSAs and presents the latest research results in academia around domain-specific acceleration architectures.Providing cutting-edge discussion of big data and artificial intelligence scenarios in contemporary industry and typical DSA applications, this book appeals to industry professionals as well as academicians researching the future of computing in these areas.
R 2,674.00
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
Handbook of Logic in Computer Science: Volume 5. Algebraic and Logical Structures
This handbook volume covers fundamental topics of semantics in logic and computation. The chapters (some monographic in length), were written following years of co-ordination and follow a thematic point of view. The volume brings the reader up to front line research, and is indispensable to any serious worker in the areas.
R 25,714.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
Student's Guide to Data and Error Analysis
All students taking laboratory courses within the physical sciences and engineering will benefit from this book, whilst researchers will find it an invaluable reference. This concise, practical guide brings the reader up-to-speed on the proper handling and presentation of scientific data and its inaccuracies. It covers all the vital topics with practical guidelines, computer programs (in Python), and recipes for handling experimental errors and reporting experimental data. In addition to the essentials, it also provides further background material for advanced readers who want to understand how the methods work. Plenty of examples, exercises and solutions are provided to aid and test understanding, whilst useful data, tables and formulas are compiled in a handy section for easy reference.
R 3,751.13
Foundations of Software Science and Computation Structures
ETAPS 2001 was the fourth instance of the European Joint Conferences on Theory and Practice of Software. ETAPS is an annual federated conference that was established in 1998 by combining a number of existing and new conferences. This year it comprised ve conferences (FOSSACS, FASE, ESOP, CC, TACAS), ten satellite workshops (CMCS, ETI Day, JOSES, LDTA, MMAABS, PFM, RelMiS, UNIGRA, WADT, WTUML), seven invited lectures, a debate, and ten tutorials. The events that comprise ETAPS address various aspects of the system de- lopment process, including speci cation, design, implementation, analysis, and improvement. The languages, methodologies, and tools which support these - tivities are all well within its scope. Di erent blends of theory and practice are represented, with an inclination towards theory with a practical motivation on one hand and soundly-based practice on the other. Many of the issues involved in software design apply to systems in general, including hardware systems, and the emphasis on software is not intended to be exclusive.
R 2,015.00
Organic Structures from Spectra
The derivation of structural information from spectroscopic data is now an integral part of organic chemistry courses at all Universities. A critical part of any such course is a suitable set of problems to develop the students’ understanding of how organic structures are determined from spectra. The book builds on the very successful teaching philosophy of learning by hands-on problem solving; carefully graded examples build confidence and develop and consolidate a student’s understanding of organic spectroscopy. Organic Structures from Spectra, 6th Edition is a carefully chosen set of about 250 structural problems employing the major modern spectroscopic techniques, including Mass Spectrometry, 1D and 2D 13C and 1H NMR Spectroscopy and Infrared Spectroscopy. There are 25 problems specifically dealing with the interpretation of spin–spin coupling in proton NMR spectra and 10 problems based on the quantitative analysis of mixtures using proton and carbon NMR spectroscopy. The accompanying text is descriptive and only explains the underlying theory at a level that is sufficient to tackle the problems. The text includes condensed tables of characteristic spectral properties covering the frequently encountered functional groups. The examples themselves have been selected to include all important structural features and to emphasise connectivity arguments and stereochemistry. Many of the compounds were synthesised specifically for this book. In this collection, there are many additional easy problems designed to build confidence and to demonstrate basic principles. The Sixth Edition of this popular textbook: now incorporates many new problems using 2D NMR spectra (C–H Correlation spectroscopy, HMBC, COSY, NOESY and TOCSY);has been expanded and updated to reflect the new developments in NMR spectroscopy;has an additional 40 carefully selected basic problems;provides a set of problems dealing specifically with the quantitative analysis of mixtures using NMR spectroscopy;features proton NMR spectra obtained at 200, 400 and 600 MHz and 13C NMR spectra including routine 2D C–H correlation, HMBC spectra and DEPT spectra;contains a selection of problems in the style of the experimental section of a research paper;includes examples of fully worked solutions in the appendix;has a complete set of solutions available to instructors and teachers from the authors. Organic Structures from Spectra, Sixth Edition will prove invaluable for students of Chemistry, Pharmacy and Biochemistry taking a first course in Organic Chemistry.
R 2,147.00
Memory as a Programming Concept in C and C++
The overwhelming majority of bugs and crashes in computer programming stem from problems of memory access, allocation, or deallocation. Such memory related errors are also notoriously difficult to debug. Yet the role that memory plays in C and C++ programming is a subject often overlooked in courses and in books because it requires specialised knowledge of operating systems, compilers, computer architecture in addition to a familiarity with the languages themselves. Most professional programmers learn entirely through experience of the trouble it causes. This 2004 book provides students and professional programmers with a concise yet comprehensive view of the role memory plays in all aspects of programming and program behaviour. Assuming only a basic familiarity with C or C++, the author describes the techniques, methods, and tools available to deal with the problems related to memory and its effective use.
R 5,170.58
Computer Architectures for Spatially Distributed Data
These are the proceedings of a NATO Advanced Study Institute (ASI) held in Cetraro, Italy during 6-17 June 1983. The title of the ASI was Computer Arehiteetures for SpatiaZZy vistributed Vata, and it brouqht together some 60 participants from Europe and America. Presented ~ere are 21 of the lectures that were delivered. The articles cover a wide spectrum of topics related to computer architecture s specially oriented toward the fast processing of spatial data, and represent an excellent review of the state-of-the-art of this topic. For more than 20 years now researchers in pattern recognition, image processing, meteorology, remote sensing, and computer engineering have been looking toward new forms of computer architectures to speed the processing of data from two- and three-dimensional processes. The work can be said to have commenced with the landmark article by Steve Unger in 1958, and it received a strong forward push with the development of the ILIAC III and IV computers at the University of Illinois during the 1960's. One clear obstacle faced by the computer designers in those days was the limitation of the state-of-the-art of hardware, when the only switching devices available to them were discrete transistors. As aresult parallel processing was generally considered to be imprae tieal, and relatively little progress was made.
R 3,194.44
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 3,595.24
R 1,099.00
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,661.34
Foundations of Software Science and Computation Structures
This book constitutes the proceedings of the 19thInternational Conference on Foundations of Software Science and ComputationStructures, FOSSACS 2016, which took place in Eindhoven, The Netherlands, inApril 2016, held as Part of the European Joint Conferences on Theory andPractice of Software, ETAPS 2016.The 31 full papers presented in this volume werecarefully reviewed and selected from 85 submissions. They were organized intopical sections named: types; recursion and fixed-points; verification andprogram analysis; automata, logic, games; probabilistic and timed systems;proof theory and lambda calculus; algorithms for infinite systems; and monads.
R 2,216.35
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
Foundations of Software Science and Computation Structures
This book constitutes the refereed proceedings of the First International Conference on the Foundations of Software Science and Computation Structures, FoSSaCS'98, held as part of the Joint European Conferences on Theory and Practice of Software, ETAPS'98, in Lisbon, Portugal, in March/April 1998.The 19 revised full papers presented in the book were carefully selected from a total of 44 submissions. Among the topics covered are formal specification, automata theory, term rewriting and rewriting systems, process algebras, formal language theory, type theory, event structures, and iteration theory.
R 1,557.71
Computational Modelling of Concrete and Concrete Structures
Computational Modelling of Concrete and Concrete Structures contains the contributions to the EURO-C 2026 conference (March 9-12, 2026, Seefeld in Tirol, Austria).The papers review and discuss research advancements and assess the applicability and robustness of methods and models for the analysis and design of concrete, fibre-reinforced, and prestressed concrete structures, as well as masonry structures. Recent developments encompass data-driven approaches, artificial intelligence, and machine learning methods, as well as novel discretization techniques, probabilistic models, and an increasing focus on microstructural aspects in a multi-scale and multi-physics context. Additionally, there is a noticeable trend towards material-scale innovations, including the use of more eco-efficient binders, new fibres, and 3D-printable concretes, along with life-cycle-oriented models that address the aging and durability of both new and existing concrete infrastructure.Overall computational robustness, mathematical and mechanical rigour, and the quality of predictions and have further increased, accompanied by careful model validation based on respective experimental programmes. The book will serve as an important reference for both academics and professionals, stimulating new research directions in the field of computational modelling of concrete and its application to the analysis of concrete structures.EURO-C 2026 is the ninth edition of the EURO-C conference series after Innsbruck 1994, Bad Gastein 1998, St. Johann im Pongau 2003, Mayrhofen 2006, Schladming 2010, St. Anton am Arlberg 2014, Bad Hofgastein 2018, and Vienna 2022. The overarching focus of the conferences is on computational methods and numerical models for the analysis of concrete and concrete structures.
R 12,679.85
New Structures for Physics
This volume provides a series of tutorials on mathematical structures which recently have gained prominence in physics, ranging from quantum foundations, via quantum information, to quantum gravity. These include the theory of monoidal categories and corresponding graphical calculi, Girard’s linear logic, Scott domains, lambda calculus and corresponding logics for typing, topos theory, and more general process structures. Most of these structures are very prominent in computer science; the chapters here are tailored towards an audience of physicists.
R 3,967.49
Foundations of Software Science and Computation Structures
This open access book constitutes the proceedings of the 25th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2022, which was held during April 4-6, 2022, in Munich, Germany, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022. The 23 regular papers presented in this volume were carefully reviewed and selected from 77 submissions. They deal with research on theories and methods to support the analysis, integration, synthesis, transformation, and verification of programs and software systems.
R 2,013.35
Fitting Equations to Data
Helps any serious data analyst with a computer to recognize the strengths and limitations of data, to test the assumptions implicit in the least squares methods used to fit the data, to select appropriate forms of the variables, to judge which combinations of variables are most influential, and to state the conditions under which the fitted equations are applicable. This edition includes numerous extensions and new devices such as component and component-plus-residual plots, cross verification with a second sample, and an index of required x-precision; also, the search for better subset equations is enlarged to cover 262,144 alternatives. The methods described have been applied in agricultural, environmental, management, marketing, medical, physical, and social sciences. Mathematics is kept to the level of college algebra.
R 5,762.00
Algorithms and Data Structures
This volume presents the proceedings of the Second Workshop on Algorithms and Data Structures (WADS '91), held at Carleton University in Ottawa. The workshop was organized by the School of Computer Science at Carleton University. The workshop alternates with the Scandinavian Workshop on Algorithm Theory (SWAT), continuing the tradition of SWAT '88 (LNCS, Vol. 318), WADS '89 (LNCS, Vol. 382), and SWAT '90 (LNCS, Vol. 447). From 107 papers submitted, 37 were selected for presentation at the workshop. In addition, there were 5 invited presentations.
R 1,591.06
Research Issues in Structured and Semistructured Database Programming
The Seventh International Workshop on Database Programming Languages (DBPL99) took place in Kinloch Rannoch,Perthshire,UK from the 1st to the 3rd of September 1999. This series of workshops focuses on the interaction of theory and practice in the design and development of database programming languages. The workshop has occurred biennially since 1987,and was previously held in: Rosco?,Finist'ere,France (1987) Salishan,Oregon,USA (1989) Nafplion,Argolida,Greece (1991) Manhattan,New York,USA (1993) Gubbio,Umbria,Italy (1995) Estes Park,Colorado,USA (1997) The workshop,as always,was organised as a mixture of invited speakers, informal paper presentations and discussion. Attendance at the workshop was limited to those who submitted papers and members of the Programme C- mittee,to ensure a su?ciently small forum for useful discussion. Before ?nding their way into this volume,papers were refereed by at least three members of the Programme Committee. Sixteen of the 31 submitted papers were accepted for presentation at the workshop.In the tradition of the series,authors were - couraged to improve their papers based on both referees' comments and ensuing discussion at the workshop,and resubmit them for publication in this volume, after which a further stage of refereeing took place. The result,we believe,is a volume of high-quality and well-polished papers. Two invited presentations were given,by Luca Cardelli (Microsoft Research Labs,Cambridge,UK) and Alon Levy (University of Washington).
R 1,563.43
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
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
Foundations of Software Science and Computation Structures
This book constitutes the proceedings of the 16th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2013, held as part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2013, which took place in Rome, Italy, in March 2013The 28 papers presented in this volume were carefully reviewed and selected from 109 submissions. They are organized in topical sections named: models of computation; reasoning about processes; bisimulation; modal and higher-order logics; reasoning about programs; computational complexity; quantitative models; and categorical models.
R 2,201.94
