"zlib_category_name:Computers/Algorithms and Data Structures" - Search

Spreadsheet Technology Peter Sestoft IT University, Technical Report Series, 0.12, 2012

Spreadsheet programs are used daily by millions of people fortasks ranging from neatly organizing a list of addresses to complex economical sim-ulations or analysis of biological data sets. Spreadsheet programs are easy to learnand convenient to use because they have a clear visual data model (tabular) and asimple efficient computation model (functional and side effect free).Spreadsheet programs are usually not held in high regard by professional soft-ware developers [19]. However, their implementation involves a large number ofnon-trivial design considerations and time-space tradeoffs. Moreover, the basicspreadsheet model can be extended, improved or otherwise experimented with inmany ways, both to test new technology and to provide new functionality in a con-text that could make a difference to a large number of users.Yet there does not seem to be a coherently designed, reasonably efficient opensource spreadsheet implementation that is a suitable platform for experiments. Ex-isting open source spreadsheet implementations such as Gnumeric and OpenOfficeare rather complex, written in unmanaged languages such as C and C++, and thedocumentation of their internals is sparse. Commercial spreadsheet implementa-tions such as Microsoft Excel neither expose their internals through their source

English [en] · PDF · 1.8MB · 2012 · 📘 Book (non-fiction) · 🚀/zlib · Save

lgli/Johan Sannemo - Principles of Algorithmic Problem Solving (2018, ).pdf

Principles of Algorithmic Problem Solving Johan Sannemo 2018

Algorithmic problem solving is the art of formulating efficient methods thatsolve problems of a mathematical nature. From the many numerical algorithms developed by the ancient Babylonians to the founding of graph theoryby Euler, algorithmic problem solving has been a popular intellectual pursuitduring the last few thousand years. For a long time, it was a purely mathematical endeavor with algorithms meant to be executed by hand. During the recentdecades algorithmic problem solving has evolved. What was mainly a topic ofresearch became a mind sport known as competitive programming. As a sportalgorithmic problem solving rose in popularity with the largest competitionsattracting tens of thousands of programmers. While its mathematical counterpart has a rich literature, there are only a few books on algorithms with astrong problem solving focus.The purpose of this book is to contribute to the literature of algorithmic problem solving in two ways. First of all, it tries to fill in some holes in existingbooks. Many topics in algorithmic problem solving lack any treatment at allin the literature – at least in English books. Much of the content is insteaddocumented only in blog posts and solutions to problems from various competitions. While this book attempts to rectify this, it is not to detract from thosesources. Many of the best treatments of an algorithmic topic I have seen areas part of a well-written solution to a problem. However, there is value incompleteness and coherence when treating such a large area. Secondly, I hopeto provide another way of learning the basics of algorithmic problem solvingby helping the reader build an intuition for problem solving. A large part ofthis book describes techniques using worked-through examples of problems.These examples attempt not only to describe the manner in which a problemis solved, but to give an insight into how a thought process might be guidedixx CONTENTSto yield the insights necessary to arrive at a solution.This book is different from pure programming books and most other algorithm textbooks. Programming books are mostly either in-depth studies of aspecific programming language or describe various programming paradigms.A single language is used in this book – C++. The text on C++ exists for thesole purpose of enabling those readers without prior programming experience to implement the solutions to algorithm problems. Such a treatment isnecessarily minimal and teach neither good coding style nor advanced programming concepts. Algorithm textbooks teach primarily algorithm analysis,basic algorithm design, and some standard algorithms and data structures.They seldom include as much problem solving as this book does. The bookalso falls somewhere between the practical nature of a programming bookand the heavy theory of algorithm textbooks. This is in part due to the book’sdual nature of being not only about algorithmic problem solving, but alsocompetitive programming to some extent. As such there is more real codeand efficient C++ implementations of algorithms included compared to mostalgorithm books.Acknowledgments. First and foremost, thanks to Per Austrin who providedmuch valuable advice and feedback during the writing of this book. Thanks toSimon and Mårten who have competed with me for several years as OmogenHeap. Finally, thanks to several othersThis version of the book is a preliminary draft. Expect tofind typos and other mistakes. If you do, please reportthem to johan.sannemo+book@gmail.com. Before reporting a bug, please check whether it still exists in the latest version of this draft, available at

English [en] · PDF · 1.4MB · 2018 · 📘 Book (non-fiction) · 🚀/lgli/zlib · Save

lgli/ADC_DaughterCard_User_Manual.pdf

Data Conversion HSMC Reference Manual Altera Corporation 2008

Cyclone III FPGA Starter Board Reference Manual

English [en] · PDF · 0.7MB · 2008 · 📘 Book (non-fiction) · 🚀/lgli/zlib · Save

lgli/Zubin Khabazi - Generative Algorithms using GRASSHOPPER (2010, www.morphogebesism.com).pdf

Generative Algorithms using GRASSHOPPER Zubin Khabazi www.morphogebesism.com, 2010

English [en] · PDF · 20.5MB · 2010 · 📘 Book (non-fiction) · 🚀/lgli/zlib · Save

Your ad here.

lgli/Hemant Jain - Data Structures & Algorithms In Go (2017, UNKNOWN).fb2

Data Structures & Algorithms In Go, First Edition Hemant Jain Hemant Jain, 2017

This book introduces you to the world of data structures and algorithms. Data structure defines the way data is arranged in computer memory for fast and efficient access while algorithm is a set of instruction to solve problems by manipulating these data structures.Designing an efficient algorithm is a very important skill that all computer companies e.g. Microsoft, Google, Facebook etc. pursue. Most of the interview for these companies is focused on knowledge of data structure and algorithm. They look for how candidate use these to solve complex problem efficiently, which is also very important in everyday coding. Apart from knowing, a programming language you also need to have good command on these key Computer fundamentals to not only qualify the interview but also excel in the top high paying jobs.This book assumes that you are a Go language developer. You are not an expert in Go language, but you are well familiar with concepts of class, references, functions, list, tuple, dictionary and recursion. At the start of this book, we will be revising Go language fundamentals that will be used throughout this book. We will be looking into some of the problems in Lists and recursion too.

English [en] · FB2 · 7.6MB · 2017 · 📘 Book (non-fiction) · 🚀/lgli/zlib · Save

lgli/Hemant Jain - Data Structures & Algorithms In Go (2017, UNKNOWN).azw3

Data Structures & Algorithms In Go, First Edition Hemant Jain Hemant Jain, 2017

This book introduces you to the world of data structures and algorithms. Data structure defines the way data is arranged in computer memory for fast and efficient access while algorithm is a set of instruction to solve problems by manipulating these data structures.Designing an efficient algorithm is a very important skill that all computer companies e.g. Microsoft, Google, Facebook etc. pursue. Most of the interview for these companies is focused on knowledge of data structure and algorithm. They look for how candidate use these to solve complex problem efficiently, which is also very important in everyday coding. Apart from knowing, a programming language you also need to have good command on these key Computer fundamentals to not only qualify the interview but also excel in the top high paying jobs.This book assumes that you are a Go language developer. You are not an expert in Go language, but you are well familiar with concepts of class, references, functions, list, tuple, dictionary and recursion. At the start of this book, we will be revising Go language fundamentals that will be used throughout this book. We will be looking into some of the problems in Lists and recursion too.

English [en] · AZW3 · 5.6MB · 2017 · 📘 Book (non-fiction) · 🚀/lgli/zlib · Save

Principles of Data Science Sinan Ozdemir -.-, 3 / converted, 2024

Principles of Data Science provides an end-to-end framework for cultivating critical thinking about data, performing practical data science, building performant machine learning models, and mitigating bias in AI pipelines.

English [en] · PDF · 13.8MB · 2024 · 📘 Book (non-fiction) · 🚀/zlib · Save

Algorithms in Advanced Artificial Intelligence: Proceedings of International Conference on Algorithms in Advanced Artificial Intelligence (ICAAAI-2024) R. N. V. Jagan Mohan, B. H. V. S. Rama Krishnam Raju, V. Chandra Sekhar, T. V. K. P. Prasad CRC Press, 1, 2025

Algorithms in Advanced Artificial Intelligence is a collection of papers on emerging issues, challenges, and new methods in Artificial Intelligence, Machine Learning, Deep Learning, Cloud Computing, Federated Learning, Internet of Things, and Blockchain technology. It addresses the growing attention to advanced technologies due to their ability to provide “paranormal solutions” to problems associated with classical Artificial Intelligence frameworks. AI is used in various subfields, including learning, perception, and financial decisions. It uses four strategies: Thinking Humanly, Thinking Rationally, Acting Humanly, and Acting Rationally. The authors address various issues in ICT, including Artificial Intelligence, Machine Learning, Deep Learning, Data Science, Big Data Analytics, Vision, Internet of Things, Security and Privacy aspects in AI, and Blockchain and Digital Twin Integrated Applications in AI. This is a collection of papers on emerging issues, challenges, and new methods in Artificial Intelligence, Machine Learning, Deep Learning, Cloud Computing, Federated Learning, Internet of Things, and Blockchain technology.

English [en] · PDF · 23.4MB · 2025 · 📘 Book (non-fiction) · 🚀/zlib · Save

lgli/Ian Goodfellow, Yoshua Bengio and Aaron Courville - Deep Learning.pdf

Deep Learning Ian Goodfellow, Yoshua Bengio and Aaron Courville

English [en] · PDF · 21.7MB · 📘 Book (non-fiction) · 🚀/lgli/zlib · Save

Your ad here.

lgli/K. K. Panigrahi - GPRS Tutoial.pdf

DWH: Data Warehousing K. K. Panigrahi Tutorials Point, 2014

A data warehouse is constructed by integrating data from multiple heterogeneous sources. It supports analytical reporting, structured and/or ad-hoc queries and decision making. This tutorial adopts a step-by-step approach toexplain all the necessary concepts of data warehousing.

English [en] · PDF · 2.2MB · 2014 · 📘 Book (non-fiction) · 🚀/lgli/zlib · Save

lgli/Übung 4.pdf

Data Science and AI for Energy Systems Exercises with Solutions KIT 2024

Data Science and AI for Energy Systems Exercises with Solutions from KIT

English [en] · PDF · 2.8MB · 2024 · 📘 Book (non-fiction) · 🚀/lgli/zlib · Save

lgli/Sachi Nandan Mohanty & Pabitra Kumar Tripathy - Data Structure and Algorithms Using C++: A Practical Implementation (2021, ).pdf

Data Structure and Algorithms Using C++: A Practical Implementation Sachi Nandan Mohanty & Pabitra Kumar Tripathy 2021

English [en] · PDF · 9.3MB · 2021 · 📘 Book (non-fiction) · 🚀/lgli/zlib · Save

lgli/3b70d9b1-3909-4096-81cc-ff2f58d378a9.pdf

Knowledge-Driven Harmonization of Sensor Observations: Exploiting Linked Open Data for IoT Data Streams Matthias T. Frank KIT Scientific Publishing, 2021

English [en] · PDF · 28.0MB · 2021 · 📘 Book (non-fiction) · 🚀/lgli/zlib · Save

Kafka Connect (Eleventh Release) Mickael Maison & Kate Stanley O'Reilly Media, Incorporated, 2023

With this practical guide, authors Mickael Maison and Kate Stanley show data engineers, site reliability engineers, and application developers how to build data pipelines between Kafka clusters and a variety of data sources and sinks. Connect allows you to quickly adopt Kafka by tapping into existing data and enabling many advanced use cases. No matter where you are in your event streaming journey, Kafka Connect is the ideal tool for building a modern data pipeline.

English [en] · EPUB · 3.6MB · 2023 · 📘 Book (non-fiction) · 🚀/zlib · Save

Your ad here.

Algorithmic Thinking, 2nd Edition Daniel Zingaro No Starch Press, Inc., 2024

Are you hitting a wall with data structures and algorithms? Whether you’re a student prepping for coding interviews or an independent learner, this book is your essential guide to efficient problem-solving in programming.UNLOCK THE POWER OF DATA STRUCTURES & ALGORITHMSLearn the intricacies of hash tables, recursion, dynamic programming, trees, graphs, and heaps. Become proficient in choosing and implementing the best solutions for any coding challenge.REAL-WORLD, COMPETITION-PROVEN CODE EXAMPLESThe programs and challenges in this book aren’t just theoretical—they’re drawn from real programming competitions. Train with problems that have tested and honed the skills of coders around the world.GET INTERVIEW-READYPrepare yourself for coding interviews with practice exercises that help you think algorithmically, weigh different solutions, and implement the best choices efficiently.WRITTEN IN C, USEFUL ACROSS LANGUAGESThe code examples are written in C and designed for clarity and accessibility to those familiar with languages like C++, Java, or Python. If you need help with the C code, no problem: We’ve got recommended reading, too.Algorithmic Thinking is the complete package, providing the solid foundation you need to elevate your coding skills to the next level.

English [en] · PDF · 5.4MB · 2024 · 📘 Book (non-fiction) · 🚀/zlib · Save

lgli/Übung 11.pdf

Machine Learning – Foundations and Algorithms Presentations KIT KIT, Institut für Anthrophomatik und Robotik, 2024

English [en] · PDF · 83.3MB · 2024 · 📘 Book (non-fiction) · 🚀/lgli/zlib · Save

lgli/John Thomas - Data Structure and Algorithms With Python: The Ultimate Guide Towards Coding (2022, ).pdf

Data Structure and Algorithms With Python: The Ultimate Guide Towards Coding John Thomas 2022

Computers store and process data with an extra ordinary speed and accuracy. So, it is highly essential that the data is stored efficiently and can be accessed fast. Also, the processing of data should happen in the smallest possible time, but without losing the accuracy.Data structures deal with how the data is organised and held in the memory, when a program processes it. It is important to note that, the data that is stored in the disk as part of persistent storages (like relational tables) are not referred as data structure here.An Algorithm is step by step set of instruction to process the data for a specific purpose. So, an algorithm utilises various data structures in a logical way to solve a specific computing problem.In this book, we will cover these two fundamental concepts of computer science using the Python programming language.This book is designed for Computer Science graduates as well as Software Professionals who are willing to learn data structures and algorithm programming in simple and easy steps using Python as a programming language.

English [en] · PDF · 1.3MB · 2022 · 📘 Book (non-fiction) · 🚀/lgli/zlib · Save

lgli/Frank Neumann and Carsten Witt - Bioinspired Computation in Combinatorial Optimization – Algorithms and Their Computational Complexity.pdf

Bioinspired Computation in Combinatorial Optimization – Algorithms and Their Computational Complexity Frank Neumann and Carsten Witt

English [en] · PDF · 1.7MB · 📘 Book (non-fiction) · 🚀/lgli/zlib · Save

lgli/Dedov, Florian - The Bible of Algorithms and Data Structures: A Complex Subject Simply Explained (Runtime Complexity, Big O Notation, Programming) (2020, Unknown).lit

The Bible of Algorithms and Data Structures: A Complex Subject Simply Explained (Runtime Complexity, Big O Notation, Programming) Dedov, Florian Unknown, 2020

English [en] · LIT · 1.6MB · 2020 · 📘 Book (non-fiction) · 🚀/lgli/zlib · Save

Your ad here.

lgli/Nussbaumer Knaflic, Cole - Storytelling with Data: A Data Visualization Guide for Business Professionals (2015, cj5_3868).epub

Storytelling with Data: A Data Visualization Guide for Business Professionals Nussbaumer Knaflic, Cole cj5_3868, 2015

English [en] · EPUB · 5.6MB · 2015 · 📘 Book (non-fiction) · 🚀/lgli/zlib · Save

lgli/Donald E. Knuth - TAOCP - Sorting and Searching (2011, ).pdf

Art of Computer Programming, The: Volume 3: Sorting and Searching Donald E. Knuth Addison-Wesley Professional, 3, 2nd, 1998

This volume comprises Chapters 5 and 6 of the complete series. Chapter 5 is concerned with sorting into order; this is a large subject that has been divided chiefly into two parts, internal sorting and external sorting. There also are supplementary sections, which develop auxiliary theories about permutations (Section 5.1) and about optimum techniques for sorting (Section 5.3). Chapter 6 deals with the problem of searching for specified items in tables or files; this is subdivided into methods that search sequentially, or by comparison of keys, or by digital properties, or by hashing, and then the more difficult problem of secondary key retrieval is considered. There searching related to sorting is a surprising amount of interplay between both chapters, with strong analogies tying the topics together. Two important varieties of information structures are also discussed, in addition to those considered in Chapter 2, namely priority queues (Section 5.2.3) and linear lists represented as balanced trees (Section 6.2.3).

English [en] · PDF · 48.0MB · 1998 · 📘 Book (non-fiction) · 🚀/lgli/zlib · Save

lgli/Kiiker, Helene - Cryptocurrency Basics: An Introduction to Master Bitcoin - Blockchain and Cryptocurrency Technologies for Beginners (2022, ).lit

Cryptocurrency Basics: An Introduction to Master Bitcoin - Blockchain and Cryptocurrency Technologies for Beginners Kiiker, Helene 2022

English [en] · LIT · 1.4MB · 2022 · 📘 Book (non-fiction) · 🚀/lgli/zlib · Save

lgli/Rahman, Mizanur - PHP 7 Data Structures and Algorithms (2017, chenjin5.com 万千书友聚集地).epub

PHP 7 Data Structures and Algorithms Rahman, Mizanur chenjin5.com 万千书友聚集地, 2017

English [en] · EPUB · 2.4MB · 2017 · 📘 Book (non-fiction) · 🚀/lgli/zlib · Save

lgli/hu, yang - Easy Learning Data Structures & Algorithms ES6+Javascript: Classic data structures and algorithms in ES6+ JavaScript (2019, ).epub

Easy Learning Data Structures & Algorithms ES6+Javascript: Classic data structures and algorithms in ES6+ JavaScript hu, yang 2019

English [en] · EPUB · 13.7MB · 2019 · 📘 Book (non-fiction) · 🚀/lgli/zlib · Save

Your ad here.

lgli/NANDI, SAYAN - VALUES BEHIND BLOCKCHAIN I An Easy-to Understand Practical Guide for Fundamental Analysis upon Cryptocurrency (2022, ).pdf

VALUES BEHIND BLOCKCHAIN I An Easy-to Understand Practical Guide for Fundamental Analysis upon Cryptocurrency NANDI, SAYAN 2022

Cryptocurrencies are just pump & dump Scheme by manipulating the emotions of people. There is no solid fundamentals behind any Cryptocurrency."

English [en] · PDF · 1.2MB · 2022 · 📘 Book (non-fiction) · 🚀/lgli/zlib · Save

Automating Data Transformations Satish Jayanthi, Armon Petrossian O'Reilly Media, Incorporated, 2023

In this report, Satish Jayanthi and Armon Petrossian examine key concepts that will enable you to automate data transformation at scale. IT decision makers, CTOs, and data team leaders will explore ways to democratize data transformation by shifting from activity-oriented to outcome-oriented teams--from manufacturing-line assembly to an approach that lets even junior analysts implement data with only a brief code review.

English [en] · EPUB · 3.0MB · 2023 · 📘 Book (non-fiction) · 🚀/zlib · Save

The Bible of Algorithms and Data Structures: A Complex Subject Simply Explained Florian Dedov Independently published, 2020

The Most Important Skill in Computer Science! The field of algorithms and data structures is one of the most important in computer science. You will rarely be invited to a coding interview at Google, Microsoft or Facebook and not be asked questions about it. This is because these companies know how valuable the skills taught are. It doesn't matter if you are into machine learning, ethical hacking, cyber security or enterprise software engineering. You will always need to be able to work with algorithms and data structures. However, this field is also by many considered to be one of the hardest, since it is so abstract and complex. This is mainly due to the style in which it is taught. Most professors in colleges focus on exact mathematical definitions instead of understanding. And while you can't blame them for doing their job, there are better ways to learn about this subject. This book is for everyone who is interested in an intuitive and simple approach to algorithms and data structures. It is for everyone who is frustrated with memorizing dry formal definitions. This bible covers all the formal definitions that are important and necessary but it mainly focuses on breaking complex things down in a simple way. At the end, you will not only know how to formally analyze algorithms but you will also deeply understand what is happening behind the scenes and why things are the way they are. After Reading This Book You Will Have The Following Skills: - Intuitive understanding of algorithms and data structures - Analyzing the runtime complexity of algorithms - Using the Big O notation - Dissecting and analyzing sorting algorithms (Bubble Sort, Merge Sort, Quick Sort...) - Understanding and applying graph theory and related algorithms (BFS, DFS, Kruskal, Dijkstra) - Understanding basic data structures and their time complexities (Linked Lists, Stacks, Heaps, Trees...) - Using self-balancing trees (AVL, B-Tree...) - Understanding and applying hashing and collision...

English [en] · PDF · 2.3MB · 2020 · 📘 Book (non-fiction) · 🚀/zlib · Save

Recent Advances in Swarm Intelligence Algorithms and Their Applications Jian Dong MDPI AG, 2023

This reprint comprises a collection of 20 articles that were accepted and published in the Special Issue titled " Recent Advances in Swarm Intelligence Algorithms and Their Applications" of the MDPI journal Mathematics. These articles cover a wide range of topics related to swarm intelligence algorithms and their theories. The topics include improvements in algorithm mechanisms, fusion algorithms, multiobjective optimization, and the optimization of large-scale problems, as well as the application of swarm intelligence in various fields such as engineering optimization problems, vehicle swarm motion, viscoelastic Maxwell-type DVA, and deep learning. It is hoped that this reprint will be helpful for scholars engaged in the field of swarm intelligence and also suitable for researchers interested in staying updated with the latest advancements in swarm intelligence algorithms and their applications. Nowadays, swarm intelligence is closely intertwined with various aspects of life. This reprint aims to provide readers with an understanding of these developments and further expand the application boundaries of such algorithms.

English [en] · PDF · 47.8MB · 2023 · 📘 Book (non-fiction) · 🚀/zlib · Save

lgli/Smith, Jefferey - Blockchain Development - Blockchain Applications!: Blockchain Guide for Beginners! Discover What You Need To Know! (2022, ).pdf

Blockchain Development - Blockchain Applications!: Blockchain Guide for Beginners! Discover What You Need To Know! Smith, Jefferey 2022

English [en] · PDF · 8.8MB · 2022 · 📘 Book (non-fiction) · 🚀/lgli/zlib · Save

Your ad here.

lgli/Reema Thareja - Data Structures Using C, 2nd edition,Reema Thareja, Oxford Publication, 2014 (2014, Oxford Publication).pdf

Data Structures Using C, 2nd edition,Reema Thareja, Oxford Publication, 2014 Reema Thareja Oxford Publication, 2nd, 2014

English [en] · PDF · 72.1MB · 2014 · 📘 Book (non-fiction) · 🚀/lgli/zlib · Save

lgli/Dudley, Jamar - Learn About Algorithms And Implementation In C/C++ (2022, UNKNOWN).epub

Learn About Algorithms And Implementation In C/C++ Dudley, Jamar UNKNOWN, 2022

Memory Monitoring: Formulas and also Application in C/C++ offers numerous concrete executions of garbage collection and specific memory management algorithms. Every application is enhanced by an extensive presentation of theory, adhered to by benchmark tests, a full listing of C/C++ source code, and also a conversation of each execution's trade-offs. With this book, you can: Learn just how memory is handled at the hardware degree by the processor.Discover the methods which different os capitalize on cpu facilities to provide memory solutions using the system phone call interface.Understand how growth collections as well as run-time systems build on the os services to take care of memory in behalf of customer applications.Learn concerning five total memory management subsystems that utilize both specific as well as automated collection formulas.

English [en] · EPUB · 31.9MB · 2022 · 📘 Book (non-fiction) · 🚀/lgli/zlib · Save

Role of Nature-Inspired Algorithms in Real-life Problems Vanita Garg, Kusum Deep Springer, Engineering Optimization: Methods and Applications, 1, 2025

English [en] · PDF · 8.9MB · 2025 · 📘 Book (non-fiction) · 🚀/zlib · Save

lgli/Desconocido - Introduction to Algorithms 2nd Instructors Manual MIT Faculty (2005, ).azw3

Instructorís Manual to accompany Introduction to Algorithms, Second Edition homas H. Cormen, Clara Lee, Erica Lin MIT Press, 2005

This is the instructors manual to the book "Introduction to Algorithms, Second Edition", by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, published in 2001.

English [en] · AZW3 · 1.3MB · 2005 · 📘 Book (non-fiction) · 🚀/lgli/zlib · Save

Symbolic Mathematics with Python Hugo D. Junghenn Springer Nature Switzerland AG, Synthesis Lectures on Mathematics & Statistics, 1, 2025

This book provides a hands-on approach to computer symbolic computation using the elementary commands of Python. Symbolic computer mathematics is the study of algorithms that can be implemented as computer programs which provide exact results rather than numerical approximations. The author begins by discussing Python essentials an number theory. Then, the book covers the simplification and evaluation of expressions involving multivariate rational functions, the exact solutions of systems of linear equations, and applications of polynomial algebra. Programs in symbolic differentiation and indefinite integration programs are also developed.

English [en] · PDF · 1.4MB · 2025 · 📘 Book (non-fiction) · 🚀/zlib · Save

Your ad here.

Recent Advances in Swarm Intelligence Algorithms and Their Applications Jian Dong MDPI AG, 2023

This reprint comprises a collection of 20 articles that were accepted and published in the Special Issue titled " Recent Advances in Swarm Intelligence Algorithms and Their Applications" of the MDPI journal Mathematics. These articles cover a wide range of topics related to swarm intelligence algorithms and their theories. The topics include improvements in algorithm mechanisms, fusion algorithms, multiobjective optimization, and the optimization of large-scale problems, as well as the application of swarm intelligence in various fields such as engineering optimization problems, vehicle swarm motion, viscoelastic Maxwell-type DVA, and deep learning. It is hoped that this reprint will be helpful for scholars engaged in the field of swarm intelligence and also suitable for researchers interested in staying updated with the latest advancements in swarm intelligence algorithms and their applications. Nowadays, swarm intelligence is closely intertwined with various aspects of life. This reprint aims to provide readers with an understanding of these developments and further expand the application boundaries of such algorithms.

English [en] · PDF · 20.6MB · 2023 · 📘 Book (non-fiction) · 🚀/zlib · Save

lgli/Hemant Jain [Jain, Hemant] - Data Structures & Algorithms In Go (2017, UNKNOWN).lit

Data Structures & Algorithms In Go, First Edition Hemant Jain [Jain, Hemant] Hemant Jain, 2017

This book introduces you to the world of data structures and algorithms. Data structure defines the way data is arranged in computer memory for fast and efficient access while algorithm is a set of instruction to solve problems by manipulating these data structures.Designing an efficient algorithm is a very important skill that all computer companies e.g. Microsoft, Google, Facebook etc. pursue. Most of the interview for these companies is focused on knowledge of data structure and algorithm. They look for how candidate use these to solve complex problem efficiently, which is also very important in everyday coding. Apart from knowing, a programming language you also need to have good command on these key Computer fundamentals to not only qualify the interview but also excel in the top high paying jobs.This book assumes that you are a Go language developer. You are not an expert in Go language, but you are well familiar with concepts of class, references, functions, list, tuple, dictionary and recursion. At the start of this book, we will be revising Go language fundamentals that will be used throughout this book. We will be looking into some of the problems in Lists and recursion too.

English [en] · LIT · 5.3MB · 2017 · 📘 Book (non-fiction) · 🚀/lgli/zlib · Save

lgli/Dedov, Florian - The Bible of Algorithms and Data Structures: A Complex Subject Simply Explained (Runtime Complexity, Big O Notation, Programming) (2020, Unknown).fb2

The Bible of Algorithms and Data Structures: A Complex Subject Simply Explained (Runtime Complexity, Big O Notation, Programming) Dedov, Florian Unknown, 2020

English [en] · FB2 · 2.2MB · 2020 · 📘 Book (non-fiction) · 🚀/lgli/zlib · Save

lgli/Hemant Jain - Problem Solving in Data Structures & Algorithms Using C++: Interview preparation guide.rtf

Problem Solving in Data Structures & Algorithms Using C++: Interview preparation guide Hemant Jain Hemant Jain, 1st, 2016

This book is about usage of data structures and algorithms in computer programming. Data structures are the ways in which data is arranged in computers memory. Algorithms are set of instructions to solve some problem by manipulating these data structures.Designing an efficient algorithm to solve a computer science problem is a skill of Computer programmer. This is the skill which tech companies like Google, Amazon, Microsoft, Facebook and many others are looking for in an interview. Once we are comfortable with a programming language, the next step is to learn how to write efficient algorithms.This book assumes that you are a C++ language developer. You are not an expert in C++ language, but you are well familiar with concepts of pointers, references, functions, arrays and recursion. At the start of this book, we will be revising the C++ language fundamentals that will be used throughout this book. In the chapter 1 we will be looking into some of the problems in arrays and recursion too.

English [en] · RTF · 12.4MB · 2016 · 📘 Book (non-fiction) · 🚀/lgli/zlib · Save

lgli/EBorat - The Illusion of Neutrality.pdf

The Illusion of Neutrality: Algorithmic Vulnerabilities and Corporate-State Collusion in the Age of Surveillance Capitalism Borat, Eliana Army Cyber Institute, The Cyber Defense Review, 13, 2025

The intersection of artificial intelligence (AI) systems and corporate-state power structures has become a critical locus of concern in the digital age. A seemingly innocuous interaction – wherein repeated requests to generate a children’s story critiquing the Accenture Files scandal (see Reactionary International, 2025) instead yielded a Kazakh public holiday calendar – reveals profound systemic vulnerabilities. This incident is emblematic of broader issues: algorithmic recursivity, decay, and the potential for exploitation by state and corporate actors. By critically analyzing these dynamics through the lens of Accenture’s global surveillance infrastructure and its alliance with firms like Palantir, this paper argues that AI systems are not merely technical tools but political instruments shaped by the same forces they are tasked with scrutinizing.

English [en] · PDF · 2.4MB · 2025 · 📘 Book (non-fiction) · 🚀/lgli/zlib · Save

Your ad here.

Point Cloud Compression: Technologies and Standardization Ge Li, Wei Gao, Wen Gao Springer, 2024

3D point clouds have broad applications across various industries and have contributed to advancements in fields such as autonomous driving, immersive media, metaverse, and cultural heritage protection. With the fast growth of 3D point cloud data and its applications, the need for efficient compression technologies has become paramount. This book delves into the forefront of point cloud compression, exploring key technologies, standardization efforts, and future prospects. This comprehensive book uncovers the foundational concepts, data acquisition methods, and datasets associated with point cloud compression. By examining the fundamental compression technologies, readers can obtain a clear understanding of prediction coding, transform coding, quantization techniques, and entropy coding. Through vivid illustrations and examples, the book elucidates how these techniques have evolved over the years and their potentials for the future. To provide a complete picture, the book presents cutting-edge research methods in point cloud compression and facilitates comparisons among them. Readers can be equipped with an in-depth understanding of the latest advancements, and can gain insights into the various approaches employed in this dynamic field. Another distinguishing aspect of this book is its exploration of standardization works for point cloud compression. Notable standards, such as MPEG G-PCC, AVS PCC, and MPEG V-PCC, are thoroughly illustrated. By delving into the methods used in geometry-based, video-based, and deep learning-based compression, readers become familiar with the latest breakthroughs in the standard communities.

English [en] · PDF · 11.5MB · 2024 · 📘 Book (non-fiction) · 🚀/zlib · Save

lgli/Amy N. Langville & Carl D. Meyer - Google's PageRank and Beyond: The Science of Search Engine Rankings (2011, PrincetonUP).pdf

Google's PageRank and Beyond: The Science of Search Engine Rankings Amy N. Langville & Carl D. Meyer PrincetonUP, 2011

Why doesn't your home page appear on the first page of search results, even when you query your own name? How do other web pages always appear at the top? What creates these powerful rankings? And how? The first book ever about the science of web page rankings, Google's PageRank and Beyond supplies the answers to these and other questions and more. The book serves two very different audiences: the curious science reader and the technical computational reader. The chapters build in mathematical sophistication, so that the first five are accessible to the general academic reader. While other chapters are much more mathematical in nature, each one contains something for both audiences. For example, the authors include entertaining asides such as how search engines make money and how the Great Firewall of China influences research. The book includes an extensive background chapter designed to help readers learn more about the mathematics of search engines, and it contains several MATLAB codes and links to sample web data sets. The philosophy throughout is to encourage readers to experiment with the ideas and algorithms in the text. Any business seriously interested in improving its rankings in the major search engines can benefit from the clear examples, sample code, and list of resources provided. Many illustrative examples and entertaining asides MATLAB code Accessible and informal style Complete and self-contained section for mathematics review

English [en] · PDF · 3.6MB · 2011 · 📘 Book (non-fiction) · 🚀/lgli/zlib · Save

lgli/Donald E. Knuth - TAOCP - Seminumerical Algorithms (2011, ).pdf

The Art of Computer Programming, Volume 2: Seminumerical Algorithms (2nd Edition) Knuth, Donald E. Addison-Wesley Pub (Sd), 2, 3rd, 1997

Volume 2 of Donald Knuth's classic series The Art of Computer Programming covers seminumerical algorithms, with topics ranging from random number generators to floating point operations and other optimized arithmetic algorithms. Truly comprehensive and meticulously written, this book (and series) is that rarest of all creatures--a work of authoritative scholarship in classical computer science, but one that can be read and used profitably by virtually all working programmers. The book begins with fundamental questions regarding random numbers and how to use algorithms to generate them. Subsequent chapters demonstrate efficient computation of single-precision and double-precision arithmetic calculations and modular arithmetic. The text then presents prime factorization (which can be used in cryptography, for instance) and algorithms for calculating fractions. This volume ends with algorithms for polynomial arithmetic and manipulation of power-series topics, which will benefit those with some knowledge of calculus.Throughout this beautifully presented edition, Knuth incorporates hundreds of useful exercises for trying out the algorithms. These range from simple problems to larger research project topics. (The book provides answers, where appropriate, at the end of the book.) The result is a text that's suitable for college or graduate-level computer science courses or individual study by programmers. Volume 2 is an indispensable part of any working programmer's library.

English [en] · PDF · 47.8MB · 1997 · 📘 Book (non-fiction) · 🚀/lgli/zlib · Save

Mathematics of Intelligent Computing and Data Science: ICMICDS-2022, Kochi, India, September 15–17 P. B. Vinod Kumar, Patrizio Frosini, P. B. Ramkumar, R. Binu Springer, Springer Proceedings in Mathematics & Statistics, 484, 1, 2025

English [en] · PDF · 6.2MB · 2025 · 📘 Book (non-fiction) · 🚀/zlib · Save

lgli/Dedov, Florian - The Bible of Algorithms and Data Structures: A Complex Subject Simply Explained (Runtime Complexity, Big O Notation, Programming) (2020, Unknown).epub

The Bible of Algorithms and Data Structures: A Complex Subject Simply Explained (Runtime Complexity, Big O Notation, Programming) Dedov, Florian Unknown, 2020

English [en] · EPUB · 1.7MB · 2020 · 📘 Book (non-fiction) · 🚀/lgli/zlib · Save

Your ad here.

Intelligent Soft Sensors Simon Tomažič MDPI AG, 2023

This Special Issue deals with the field of intelligent soft sensors that enable the online estimation of nonmeasurable process variables. Soft sensors or virtual sensors are common names for software algorithms in which multiple measurements are processed together. Typically, soft sensors are based on control theory and are also referred to as state observers. There may be dozens or even hundreds of measurements from hard sensors (big data). The interaction of signals can be used to compute new quantities that cannot be measured directly online or are difficult and expensive to measure. Soft sensors are particularly useful in data fusion, combining measurements of different characteristics and dynamics. They can be used for fault diagnosis (self-analysis, self-calibration, and self-maintenance) as well as for control applications. Well-known software algorithms that can be seen as soft sensors include, for example, Kalman filters. More recent implementations of soft sensors use neural networks, fuzzy logic, models based on evolving clustering, partial least squares, etc. In the digitized factories of the future, intelligent sensors represent one of the core building blocks for automating and optimizing production, as they make production more efficient in every respect.

English [en] · PDF · 17.1MB · 2023 · 📘 Book (non-fiction) · 🚀/zlib · Save

Optimal Estimation and Information Fusion: Theory and Algorithms Ming Lei Springer Nature, 10.1007/978-981-96-3173-5, 2025

This book mainly focuses on the theme of optimizing estimation and sensor information fusion processing for stochastic dynamic systems. It summarizes the basic theories and methods of optimizing estimation and information fusion direction, including stochastic system models, optimal estimation methods, linear state estimation, nonlinear state estimation, information fusion models, structures, data processing methods, data association based on multi-source data estimation, and other aspects.-On the basis of years of teaching practice, the author optimizes the content layout, focuses on the basic theoretical methods of the subject, emphasizes the systematic nature of the theory and the rigor of expression, selectively cuts out some outdated content, and introduces some important and widely accepted new developments in the subject.-On the other hand, this book also serves as a reference material for technical developers in this field.

English [en] · PDF · 16.7MB · 2025 · 📘 Book (non-fiction) · 🚀/zlib · Save

lgli/Mark Allen Weiss - Data Structures and Algorithm Analysis in C (1st Edition) (1992, Akash Kumar).pdf

Data Structures and Algorithm Analysis in C (1st Edition) Mark Allen Weiss Akash Kumar, 1992

OverviewData Structures and Algorithm Analysis in CMarkAllen Weiss' successful book provides a modern approach to algorithmsand data structures using the C programming language. The book'sconceptual presentation focuses on ADTs and the analysis of algorithmsfor efficiency, with a particular concentration on performance andrunning time. The second edition contains a new chapter that examinesadvanced data structures such as red black trees, top down splay trees,treaps, k-d trees, and pairing heaps among others. All code examples nowconform to ANSI C and coverage of the formal proofs underpinning

English [en] · PDF · 7.9MB · 1992 · 📘 Book (non-fiction) · 🚀/lgli/zlib · Save

lgli/Hemant Jain - Problem Solving in Data Structures & Algorithms Using C++: Interview preparation guide (2017, UNKNOWN).fb2

Problem Solving in Data Structures & Algorithms Using C++: Interview preparation guide Hemant Jain Hemant Jain, 2017

This book is about usage of data structures and algorithms in computer programming. Data structures are the ways in which data is arranged in computers memory. Algorithms are set of instructions to solve some problem by manipulating these data structures.Designing an efficient algorithm to solve a computer science problem is a skill of Computer programmer. This is the skill which tech companies like Google, Amazon, Microsoft, Facebook and many others are looking for in an interview. Once we are comfortable with a programming language, the next step is to learn how to write efficient algorithms.This book assumes that you are a C++ language developer. You are not an expert in C++ language, but you are well familiar with concepts of pointers, references, functions, arrays and recursion. At the start of this book, we will be revising the C++ language fundamentals that will be used throughout this book. In the chapter 1 we will be looking into some of the problems in arrays and recursion too.

English [en] · FB2 · 8.5MB · 2017 · 📘 Book (non-fiction) · 🚀/lgli/zlib · Save

lgli/NARASIMHA KARUMANCHI - Data Structure and Algorithmic Thinking with Python: Data Structure and Algorithmic Puzzles 2020 (2021, CAREER MONK).pdf

Data Structure and Algorithmic Thinking with Python: Data Structure and Algorithmic Puzzles 2020 NARASIMHA KARUMANCHI CAREER MONK, 2021

The sample chapter should give you a very good idea of the quality and style of our book. In particular, be sure you are comfortable with the level and with our Python coding style. This book focuses on giving solutions for complex problems in data structures and algorithm. It even provides multiple solutions for a single problem, thus familiarizing readers with different possible approaches to the same problem.

English [en] · PDF · 7.2MB · 2021 · 📘 Book (non-fiction) · 🚀/lgli/zlib · Save

Your ad here.

lgli/Lane, Ronald - Practical Guide To Computer Algorithms Using Python And C# (2022, UNKNOWN).pdf

Practical Guide To Computer Algorithms Using Python And C# Lane, Ronald UNKNOWN, 2022

A pleasant intro to one of the most valuable formulas written in basic, user-friendly EnglishThe modified as well as updated 2nd edition of Vital Formulas, offers an available intro to computer algorithms. The book includes a summary of essential timeless formulas as well as describes when each is appropriate. The writer shows how to evaluate algorithms in order to comprehend their behavior and also shows methods that the can be made use of to produce new formulas to fulfill future requirements. The message includes valuable algorithms such as: methods for manipulating typical data structures, advanced data frameworks, network formulas, and mathematical algorithms. It likewise supplies a selection of basic problem-solving methods.In addition to describing formulas and also approaches, the author supplies details on just how to evaluate the efficiency of algorithms. The book is filled with workouts that can be used to check out ways to modify the formulas in order to apply them to new scenarios. This updated version of Vital FormulasConsists of descriptions of formulas in basic terms, as opposed to challenging mathematicsTips through effective formulas that can be made use of to solve tough shows issuesAids prepare for programs job interviews that normally consist of algorithmic concernsUses approaches can be applied to any programs languageConsists of exercises and options useful to both professionals and also traineesSupplies code instances updated and also written in Python and also C#Vital Algorithms has been updated and modified as well as uses specialists and students a hands-on guide to evaluating formulas along with the techniques and also applications. The book additionally includes a collection of questions that may show up in a job interview. Guide's site will include referral applications in Python and C# (which can be conveniently related to Java and C++).

English [en] · PDF · 212.1MB · 2022 · 📘 Book (non-fiction) · 🚀/lgli/zlib · Save