A Common-Sense Guide to Data Structures and Algorithms: Level Up Your Core Programming Skills, Wengrow Jay

Новое издание

Автор: Wengrow Jay Название: A Common-Sense Guide to Data Structures and Algorithms, Second Edition: Level Up Your Core Programming Skills ISBN: 1680507222 ISBN-13(EAN): 9781680507225 Издательство: Wiley Цена: 29300 T Описание: This new edition features practice exercises in every chapter, and new chapters on topics such as dynamic programming and heaps and tries. Get the hands-on info you need to master data structures and algorithms for your day-to-day work.

Автор: Hiroshi Nagamochi, Toshihide Ibaraki Название: Algorithmic Aspects of Graph Connectivity ISBN: 1108735495 ISBN-13(EAN): 9781108735490 Издательство: Cambridge Academ Рейтинг: Цена: 33260 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: With applications in communication, transportation, and production, graph connectivity has thrived using the theory of complexity and algorithms in modern computer science. This is the first thorough book on this central notion in graph and network theory, and covers new concepts and algorithms for quicker and more efficient computing.

Автор: Siu-Wing Cheng, Tamal K. Dey, Jonathan Shewchuk Название: Delaunay Mesh Generation ISBN: 1584887303 ISBN-13(EAN): 9781584887300 Издательство: Taylor&Francis Рейтинг: Цена: 76230 T Наличие на складе: Невозможна поставка. Описание: Going beyond, yet thoroughly rooted to theory, this book provides a comprehensive look at the algorithms that can produce quality Delaunay meshes through a paradigm called the Delaunay refinement. It describes meshing algorithms that can be built on the Delaunay refinement paradigm along with the involved mathematical analysis.

Автор: Li, Fanzhang / Zhang, Li / Zhang, Zhao Название: Dynamic Fuzzy Machine Learning ISBN: 3110518708 ISBN-13(EAN): 9783110518702 Издательство: Walter de Gruyter Рейтинг: Цена: 112200 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Machine learning is widely used for data analysis. Dynamic fuzzy data are one of the most difficult types of data to analyse in the field of big data, cloud computing, the Internet of Things, and quantum information. At present, the processing of this kind of data is not very mature. The authors carried out more than 20 years of research, and show in this book their most important results. The seven chapters of the book are devoted to key topics such as dynamic fuzzy machine learning models, dynamic fuzzy self-learning subspace algorithms, fuzzy decision tree learning, dynamic concepts based on dynamic fuzzy sets, semi-supervised multi-task learning based on dynamic fuzzy data, dynamic fuzzy hierarchy learning, examination of multi-agent learning model based on dynamic fuzzy logic. This book can be used as a reference book for senior college students and graduate students as well as college teachers and scientific and technical personnel involved in computer science, artificial intelligence, machine learning, automation, data analysis, mathematics, management, cognitive science, and finance. It can be also used as the basis for teaching the principles of dynamic fuzzy learning.

Автор: Dan Gusfield Название: Integer Linear Programming in Computational and Systems Biology: An Entry-Level Text and Course ISBN: 1108421768 ISBN-13(EAN): 9781108421768 Издательство: Cambridge Academ Рейтинг: Цена: 43550 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Integer linear programming is a versatile modeling and optimization technique with potential to transform biological computation. This hands-on text, designed for students, researchers, and professionals in both biology and computational fields, demonstrates applications in genomics, RNA and protein folding, DNA sequencing, phylogenetics, and more.

Автор: Daniel Ashlock Название: Exploring Representation in Evolutionary Level Design ISBN: 1681733323 ISBN-13(EAN): 9781681733326 Издательство: Eurospan Рейтинг: Цена: 71320 T Наличие на складе: Поставка под заказ. Описание: Automatic content generation is the production of content for games, web pages, or other purposes by procedural means. Search-based automatic content generation employs search-based algorithms to accomplish automatic content generation. This book presents a number of different techniques for search-based automatic content generation where the search algorithm is an evolutionary algorithm. The chapters treat puzzle design, the creation of small maps or mazes, the use of L-systems and a generalization of L-system to create terrain maps, the use of cellular automata to create maps, and, finally, the decomposition of the design problem for large, complex maps culminating in the creation of a map for a fantasy game module with designersupplied content and tactical features.The evolutionary algorithms used for the different types of content are generic and similar, with the exception of the novel sparse initialization technique are presented in Chapter 2. The points where the content generation systems vary are in the design of their fitness functions and in the way the space of objects being searched is represented. A large variety of different fitness functions are designed and explained, and similarly radically different representations are applied to the design of digital objects all of which are, essentially, maps for use in games.

Автор: Ashlock Daniel Название: Exploring Representation in Evolutionary Level Design ISBN: 1681733307 ISBN-13(EAN): 9781681733302 Издательство: Eurospan Рейтинг: Цена: 54060 T Наличие на складе: Поставка под заказ. Описание: Automatic content generation is the production of content for games, web pages, or other purposes by procedural means. Search-based automatic content generation employs search-based algorithms to accomplish automatic content generation. This book presents a number of different techniques for search-based automatic content generation where the search algorithm is an evolutionary algorithm. The chapters treat puzzle design, the creation of small maps or mazes, the use of L-systems and a generalization of L-system to create terrain maps, the use of cellular automata to create maps, and, finally, the decomposition of the design problem for large, complex maps culminating in the creation of a map for a fantasy game module with designersupplied content and tactical features.The evolutionary algorithms used for the different types of content are generic and similar, with the exception of the novel sparse initialization technique are presented in Chapter 2. The points where the content generation systems vary are in the design of their fitness functions and in the way the space of objects being searched is represented. A large variety of different fitness functions are designed and explained, and similarly radically different representations are applied to the design of digital objects all of which are, essentially, maps for use in games.

Автор: Matveev, Andrey O., Название: Pattern recognition on oriented matroids / ISBN: 3110530716 ISBN-13(EAN): 9783110530711 Издательство: Walter de Gruyter Рейтинг: Цена: 92930 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание:

Pattern Recognition on Oriented Matroids covers a range of innovative problems in combinatorics, poset and graph theories, optimization, and number theory that constitute a far-reaching extension of the arsenal of committee methods in pattern recognition. The groundwork for the modern committee theory was laid in the mid-1960s, when it was shown that the familiar notion of solution to a feasible system of linear inequalities has ingenious analogues which can serve as collective solutions to infeasible systems. A hierarchy of dialects in the language of mathematics, for instance, open cones in the context of linear inequality systems, regions of hyperplane arrangements, and maximal covectors (or topes) of oriented matroids, provides an excellent opportunity to take a fresh look at the infeasible system of homogeneous strict linear inequalities - the standard working model for the contradictory two-class pattern recognition problem in its geometric setting. The universal language of oriented matroid theory considerably simplifies a structural and enumerative analysis of applied aspects of the infeasibility phenomenon.

The present book is devoted to several selected topics in the emerging theory of pattern recognition on oriented matroids: the questions of existence and applicability of matroidal generalizations of committee decision rules and related graph-theoretic constructions to oriented matroids with very weak restrictions on their structural properties; a study (in which, in particular, interesting subsequences of the Farey sequence appear naturally) of the hierarchy of the corresponding tope committees; a description of the three-tope committees that are the most attractive approximation to the notion of solution to an infeasible system of linear constraints; an application of convexity in oriented matroids as well as blocker constructions in combinatorial optimization and in poset theory to enumerative problems on tope committees; an attempt to clarify how elementary changes (one-element reorientations) in an oriented matroid affect the family of its tope committees; a discrete Fourier analysis of the important family of critical tope committees through rank and distance relations in the tope poset and the tope graph; the characterization of a key combinatorial role played by the symmetric cycles in hypercube graphs.

Contents Oriented Matroids, the Pattern Recognition Problem, and Tope Committees Boolean Intervals Dehn-Sommerville Type Relations Farey Subsequences Blocking Sets of Set Families, and Absolute Blocking Constructions in Posets Committees of Set Families, and Relative Blocking Constructions in Posets Layers of Tope Committees Three-Tope Committees Halfspaces, Convex Sets, and Tope Committees Tope Committees and Reorientations of Oriented Matroids Topes and Critical Committees Critical Committees and Distance Signals Symmetric Cycles in the Hypercube Graphs

Fundamentals of Dependable Computing for Software Engineers presents the essential elements of computer system dependability. The book describes a comprehensive dependability-engineering process and explains the roles of software and software engineers in computer system dependability.

Readers will learn:

Why dependability matters What it means for a system to be dependable How to build a dependable software system How to assess whether a software system is adequately dependable

The author focuses on the actions needed to reduce the rate of failure to an acceptable level, covering material essential for engineers developing systems with extreme consequences of failure, such as safety-critical systems, security-critical systems, and critical infrastructure systems. The text explores the systems engineering aspects of dependability and provides a framework for engineers to reason and make decisions about software and its dependability. It also offers a comprehensive approach to achieve software dependability and includes a bibliography of the most relevant literature.

Emphasizing the software engineering elements of dependability, this book helps software and computer engineers in fields requiring ultra-high levels of dependability, such as avionics, medical devices, automotive electronics, weapon systems, and advanced information systems, construct software systems that are dependable and within budget and time constraints.

Автор: Johnson Название: A Concise Introduction to Data Structures using Java ISBN: 1138402206 ISBN-13(EAN): 9781138402201 Издательство: Taylor&Francis Рейтинг: Цена: 130680 T Наличие на складе: Поставка под заказ. Описание: A student-friendly text, A Concise Introduction to Data Structures Using Java takes a developmental approach, starting with simpler concepts first and then building toward greater complexity. Important topics, such as linked lists, are introduced gradually and revisited with increasing depth. More code and guidance are provided at the beginning, allowing students time to adapt to Java while also beginning to learn data structures. As students develop fluency in Java, less code is provided and more algorithms are outlined in pseudocode. The text is designed to support a second course in computer science with an emphasis on elementary data structures. The clear, concise explanations encourage students to read and engage with the material, while partial implementations of most data structures give instructors the flexibility to develop some methods as examples and assign others as exercises. The book also supplies an introductory chapter on Java basics that allows students who are unfamiliar with Java to quickly get up to speed. The book helps students become familiar with how to use, design, implement, and analyze data structures, an important step on the path to becoming skilled software developers.

Автор: Cole Timothy W Название: Coding with XML for Efficiencies in Cataloging and Metadata ISBN: 1783303697 ISBN-13(EAN): 9781783303694 Издательство: Facet Рейтинг: Цена: 58030 T Наличие на складе: Невозможна поставка. Описание: This handbook will assist cataloguers when creating metadata for sharing bibliographic records or digital collections on the web and provides examples of how to use XLML or XSLT scripting with library records.

Автор: Lei Ying, Kai Zhu Название: Diffusion Source Localization in Large Networks ISBN: 1681733692 ISBN-13(EAN): 9781681733692 Издательство: Eurospan Рейтинг: Цена: 54060 T Наличие на складе: Поставка под заказ. Описание: Diffusion processes in large networks have been used to model many real-world phenomena, including how rumors spread on the Internet, epidemics among human beings, emotional contagion through social networks, and even gene regulatory processes. Fundamental estimation principles and efficient algorithms for locating diffusion sources can answer a wide range of important questions, such as identifying the source of a widely spread rumor on online social networks. This book provides an overview of recent progress on source localization in large networks, focusing on theoretical principles and fundamental limits. The book covers both discrete-time diffusion models and continuous-time diffusion models. For discrete-time diffusion models, the book focuses on the Jordan infection center; for continuous-time diffusion models, it focuses on the rumor center. Most theoretical results on source localization are based on these two types of estimators or their variants. This book also includes algorithms that leverage partial-time information for source localization and a brief discussion of interesting unresolved problems in this area.

Автор: Haitham Hassanieh Название: The Sparse Fourier Transform ISBN: 1947487078 ISBN-13(EAN): 9781947487079 Издательство: Eurospan Рейтинг: Цена: 83340 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: The Fourier transform is one of the most fundamental tools for computing the frequency representation of signals. It plays a central role in signal processing, communications, audio and video compression, medical imaging, genomics, astronomy, as well as many other areas. Because of its widespread use, fast algorithms for computing the Fourier transform can benefit a large number of applications. The fastest algorithm for computing the Fourier transform is the Fast Fourier Transform (FFT), which runs in near-linear time making it an indispensable tool for many applications. However, today, the runtime of the FFT algorithm is no longer fast enough especially for big data problems where each dataset can be few terabytes. Hence, faster algorithms that run in sublinear time, i.e., do not even sample all the data points, have become necessary.This book addresses the above problem by developing the Sparse Fourier Transform algorithms and building practical systems that use these algorithms to solve key problems in six different applications: wireless networks; mobile systems; computer graphics; medical imaging; biochemistry; and digital circuits.This is a revised version of the thesis that won the 2016 ACM Doctoral Dissertation Award.

Казахстан, 010000 Нур-султан(Астана) р-он Сарыарка, ул. Маскеу, 40 , офис 202 ТОО "Логобук" Тел:+7(7172) 448953 , +7 707 857-29-98 www.logobook.kz