📄 New blog post: We finished the Chinese release
✕

Anna’s Archive

📚 The largest truly open library in human history. 📈 61,344,044 books, 95,527,824 papers — preserved forever.
AA 38TB
direct uploads
IA 304TB
scraped by AA
DuXiu 298TB
scraped by AA
Hathi 9TB
scraped by AA
Libgen.li 188TB
collab with AA
Z-Lib 77TB
collab with AA
Libgen.rs 82TB
mirrored by AA
Sci-Hub 90TB
mirrored by AA
⭐️ Our code and data are 100% open source. Learn more…
✕ Recent downloads:  
Home Home Home Home
Anna’s Archive
Home
Search
Donate
🧬 SciDB
FAQ
Account
Log in / Register
Account
Public profile
Downloaded files
My donations
Referrals
Explore
Activity
Codes Explorer
ISBN Visualization ↗
Community Projects ↗
Open data
Datasets
Torrents
LLM data
Stay in touch
Contact email
Anna’s Blog ↗
Reddit ↗
Matrix ↗
Help out
Improve metadata
Volunteering & Bounties
Translate ↗
Development
Anna’s Software ↗
Security
DMCA / copyright claims
Alternatives
annas-archive.li ↗
annas-archive.se ↗
annas-archive.org ↗
SLUM [unaffiliated] ↗
SLUM 2 [unaffiliated] ↗
SearchSearch DonateDonate
AccountAccount
Search settings
Order by
Advanced
Add specific search field
Content
Filetype open our viewer
more…
Access
Source
Language
more…
Display
Search settings
Download Journal articles Digital Lending Metadata
Results 251-300 (500+ total)
lgli/John Canning & Alan Broder & Robert Lafore - Data Structures & Algorithms in Python (2022, Addison-Wesley Professional).pdf
Data Structures & Algorithms in Python John Canning & Alan Broder & Robert Lafore Addison-Wesley Professional, 1st, 2022
This practical introduction to data structures and algorithms can help every programmer who wants to write more efficient software. Building on Robert Lefore's legendary Java-based guide, this book helps you understand exactly how data structures and algorithms operate. You'll learn how to efficiently apply them with the enormously popular Python language and scale your code to handle today's big data challenges.Throughout, the authors focus on real-world examples, communicate key ideas with intuitive, interactive visualizations, and limit complexity and math to what you need to improve performance. Step-by-step, they introduce arrays, sorting, stacks, queues, linked lists, recursion, binary trees, 2-3-4 trees, hash tables, spatial data structures, graphs, and more. Their code examples and illustrations are so clear, you can understand them even if you're a near-beginner, or your experience is with other procedural or object-oriented languages.Build core computer science skills that take you beyond merely "writing code"Learn how data structures make programs (and programmers) more efficientSee how data organization and algorithms affect how much you can do with today's, and tomorrow's, computing resourcesDevelop data structure implementation skills you can use in any languageChoose the best data structure(s) and algorithms for each programming problem-and recognize which ones to avoid
Read more…
English [en] · PDF · 43.2MB · 2022 · 📘 Book (non-fiction) · 🚀/lgli/zlib · Save
base score: 11068.0, final score: 167510.62
nexusstc/Data Analytics and Digital Transformation/a27198d003e85a548185bd9f2dff3a4a.pdf
Data Analytics and Digital Transformation Erik Beulen, Marla A. Dans Routledge, 2023
Understanding the significance of data analytics is paramount for digital transformation but in many organizations they are separate units without fully aligned goals. As organizations are applying digital transformations to be adaptive and agile in a competitive environment, data analytics can play a critical role in their success. This book explores the crossroads between them and how to leverage their connection for improved business outcomes. The need to collaborate and share data is becoming an integral part of digital transformation. This not only creates new opportunities but also requires well-considered and continuously assessed decision-making as competitiveness is at stake. This book details approaches, concepts, and frameworks, as well as actionable insights and good practices, including combined data management and agile concepts. Critical issues are discussed such as data quality and data governance, as well as compliance, privacy, and ethics. It also offers insights into how both private and public organizations can innovate and keep up with growing data volumes and increasing technological developments in the short, mid, and long term. This book will be of direct appeal to global researchers and students across a range of business disciplines, including technology and innovation management, organizational studies, and strategic management. It is also relevant for policy makers, regulators, and executives of private and public organizations looking to implement successful transformation policies. Volumes of data are growing at an unprecedented speed, driven by the Internet of Things (IoT) and unstructured data (e.g. social media content), as well as additional data generated by transforming into digital organizations. This feeds back into data analytics as well as Data Science, requiring even more mature data management and governance to achieve enriched insights. In addition, the need to collaborate and share data is becoming an integral part of digital transformations. This not only creates new opportunities but also requires well-considered and continuously assessed decision-making as competitiveness is at stake. This book details approaches, concepts, and frameworks, as well as actionable insights and good practices, including combined data management and agile concepts. In addition, a deep dive into privacy and ethics will be included. Intuition and experience need to be powered by data analytics. Organizations need to integrate data-driven decision-making into their DNA. Data-driven decision-making is not limited to incremental (investment) decisions, it also extends to decision-making in day-to-day operations and processes. Improved incremental decision-making typically supports the more strategic decision-making by senior management and higher. Predictive and prescriptive Artificial Intelligence (AI) models predict future outcomes, enabling the decision maker to choose the best future course of action. Examples of data-driven algorithms are decision trees, support vector machines (SVM), K-means, k nearest neighbor (kNN), Adaboost, and Deep Learning (DL) algorithms. These will further drive innovation. This outlook is particularly relevant for decision-making in day-to-day processes; automatic pricing adjustments based on inventory, demand, and competitor pricing in retail would be good examples for data-driven analytics. In this book, data-driven analytics is embedded in data-driven decision-making.
Read more…
English [en] · PDF · 3.9MB · 2023 · 📘 Book (non-fiction) · 🚀/lgli/lgrs/nexusstc/zlib · Save
base score: 11065.0, final score: 167510.62
nexusstc/Deep learning with python/a7d1c0b2a05838001e68c723f055e089.pdf
Deep Learning with Python: Develop Deep Learning Models on Theano and TensorFLow Using Keras Jason brownlee Machine Learning Mastery, v1.7, 2016
English [en] · PDF · 4.9MB · 2016 · 📘 Book (non-fiction) · 🚀/lgli/lgrs/nexusstc/zlib · Save
base score: 11062.0, final score: 167510.62
nexusstc/Data Structures in C++/d48948a8391af1ec1481d27a57549301.pdf
Data Structures in C++ Muhammad Tauqueer Aikman Book Company
Page(0.9) Page(01) Page(01)a Page(02) Page(03) Page(3)a Page(04) Page(4)a Page(05) Page(5)a Page(06) Page(6)a Page(07) Page(7)a Page(08) Page(8)a Page(09) Page(9)a Page(10) Page(10)a Page(11) Page(11)a Page(12) Page(12)a Page(13) Page(13)a Page(14) Page(14)a Page(15) Page(15)a Page(16) Page(16)a Page(17) Page(17)a Page(18) Page(18)a Page(19) Page(19)a Page(20) Page(20)a Page(21) Page(21)a Page(22) Page(22)a Page(23) Page(23)a Page(24) Page(24)a Page(25) Page(25)a Page(26) Page(26)a Page(27) Page(27)a Page(28) Page(28)a Page(29) Page(29)a Page(30) Page(30)a Page(31) Page(31)a Page(32) Page(32)a Page(33) Page(33)a Page(34) Page(34)a Page(35) Page(35)a Page(36) Page(36)a Page(37) Page(37)a Page(38) Page(38)a Page(39) Page(39)a Page(40) Page(40)a Page(41) Page(41)a Page(42) Page(42)a Page(43) Page(43)a Page(44) Page(44)a Page(45) Page(45)a Page(46) Page(46)a Page(47) Page(47)a Page(48) Page(48)a Page(49) Page(49)a Page(50) Page(50)a Page(51) Page(51)a Page(52) Page(52)a Page(53) Page(53)a Page(54) Page(54)a Page(55) Page(55)a Page(56) Page(56)a Page(57) Page(57)a Page(58) Page(58)a Page(59) Page(59)a Page(60) Page(60)a Page(61) Page(61)a Page(62) Page(62)a Page(63) Page(63)a Page(64) Page(64)a Page(65) Page(65)a Page(66) Page(66)a Page(67) Page(67)a Page(68) Page(68)a Page(69) Page(69)a Page(70) Page(70)a Page(71) Page(71)a Page(72) Page(72)a Page(73) Page(73)a Page(74) Page(74)a Page(75) Page(75)a Page(76) Page(76)a Page(77) Page(77)a Page(78) Page(78)a Page(79) Page(79)a Page(80) Page(80)a Page(81) Page(81)a Page(82) Page(82)a Page(83) Page(83)a Page(84) Page(84)a Page(85) Page(85)a Page(86) Page(86)a Page(87) Page(87)a Page(88) Page(88)a Page(89) Page(89)a Page(90) Page(90)a Page(91) Page(91)a Page(92) Page(92)a Page(93) Page(93)a Page(94) Page(94)a Page(95) Page(95)a Page(96) Page(96)a Page(97) Page(97)a Page(98) Page(98)a Page(99) Page(99)a Page(100) Page(100)a Page(101) Page(101)a Page(102) Page(102)a Page(103) Page(103)a Page(104) Page(104)a Page(105) Page(105)a Page(106) Page(106)a Page(107) Page(107)a Page(108) Page(108)a Page(109) Page(109)a Page(110) Page(110)a Page(111) Page(111)a Page(112) Page(112)a Page(113) Page(113)a Page(114) Page(114)a Page(115) Page(115)a Page(116) Page(116)a Page(117) Page(117)a Page(118) Page(118)a Page(119) Page(119)a Page(120) Page(120)a Page(121)
Read more…
English [en] · PDF · 40.7MB · 📘 Book (non-fiction) · 🚀/lgli/lgrs/nexusstc/zlib · Save
base score: 11063.0, final score: 167510.62
Your ad here.
upload/newsarch_ebooks_2025_10/2020/10/19/Design and Analysis of Algorithms.pdf
Design and Analysis of Algorithms Karamagi, Robert 2020
Algorithm 6 Asymptotic Analysis 11 Recurrence 21 Substitution Method 21 Iteration Method 22 Recursion Tree Method 23 Master Method 28 Sorting Analysis 31 Bubble Sort 31 Selection Sort 34 Insertion Sort 36 Divide and Conquer 39 Max - Min Problem 41 Binary Search 43 Merge Sort 46 Tower of Hanoi 50 Sorting 56 Heap Sort 56 Quick Sort 68 Stable Sorting 77 Lower Bound Theory 79 Sorting in Linear Time 91 Linear Time Sorting 91 Counting Sort 92 Bucket Sort 109 Radix Sort 111 Hashing 112 Hash Tables 116 Methods of Hashing 119 Open Addressing Techniques 124 Hash Function 130 Binary Search Trees 132 Red Black Tree 140 Dynamic Programming 152 Fibonacci Sequence 157 Matrix Chain Multiplication 158 Longest Common Sequence (LCS) 178 0/1 Knapsack Problem 185 Dutch National Flag 189 Longest Palindrome Subsequence 193 Greedy Algorithm 200 Activity Selection Problem 201 Fractional Knapsack 203 Huffman Codes 206 Activity or Task Scheduling Problem 212 Travelling Sales Person Problem 214 Backtracking 220 Recursive Maze Algorithm 223 Hamiltonian Circuit Problems 224 Subset-Sum Problem 230 N-Queens Problem 232 Minimum Spanning Tree 237 Kruskal's Algorithm 242 Prim's Algorithm 247 Shortest Paths 255 Negative Weight Edges 256 Representing Shortest Path 259 Relaxation 261 Dijkstra's Algorithm 262 Bellman-Ford Algorithm 268 Single Source Shortest Path in Directed Acyclic Graphs 271 All-Pairs Shortest Paths 275 Floyd-Warshall Algorithm 275 Johnson's Algorithm 285 Flow 292 Network Flow Problems 294 Ford-Fulkerson Algorithm 297 Maximum Bipartite Matching 300 Sorting Networks 301 Comparison Networks 301 Bitonic Sorting Network 303 Merging Network 304 Complexity Theory 305 Polynomial Time Verification 307 NP-Completeness 310 Circuit Satisfiability 312 3CNF Satisfiability 313 Clique 314 Vertex Cover 316 Subset Cover 318 Approximate Algorithms 320 Vertex Cover 321 Traveling-salesman Problem 323 String Matching 324 Naive String Matching Algorithm 325 Rabin-Karp-Algorithm 327 String Matching with Finite Automata 330 Knuth-Morris-Pratt (KMP)Algorithm 333 Boyer-Moore Algorithm 341
Read more…
English [en] · PDF · 11.3MB · 2020 · 📘 Book (non-fiction) · 🚀/lgli/upload/zlib · Save
base score: 11066.0, final score: 167510.61
nexusstc/Algorithms and data structures in VLSI design/33feedf53dbf1445a439b8d1a866d85a.pdf
Algorithms and data structures in VLSI design Christoph Meinel, Thorsten Theobald Springer, 1998
One of the main problems in chip design is the enormous number of possible combinations of individual chip elements within a system, and the problem of their compatibility. The recent application of data structures, efficient algorithms, and ordered binary decision diagrams (OBDDs) has proven vital in designing the computer chips of tomorrow. This book provides an introduction to the foundations of this interdisciplinary research area, emphasizing its applications in computer aided circuit design.
Read more…
English [en] · PDF · 3.1MB · 1998 · 📘 Book (non-fiction) · 🚀/lgli/lgrs/nexusstc/zlib · Save
base score: 11065.0, final score: 167510.61
nexusstc/Rock your Python Interview: Interview Questions Pinched From The Fortune 500!/77989f57a14c41bd0693ac278ca8cb70.pdf
Rock your Python Interview: Interview Questions Pinched From The Fortune 500! GARVIT ARYA Self-Published, 2019
Theoretical Interview Questions Rapid Fire Interview Questions Coding Based Interview Questions Python Cheat Sheet NumPy Cheat Sheet ( import numpy as np ) Matplotlib Cheat Sheet ( import matplotlib.pyplot as plt ) Pandas Cheat Sheet ( import pandas as pd )
Read more…
English [en] · PDF · 0.3MB · 2019 · 📘 Book (non-fiction) · 🚀/lgli/lgrs/nexusstc/zlib · Save
base score: 11055.0, final score: 167510.61
nexusstc/A fuzzy-algorithmic approach to the definition of complex or imprecise concepts/b225a811432b3b93f76f297caa8ef05d.pdf
A fuzzy-algorithmic approach to the definition of complex or imprecise concepts Lotfi Asker Zadeh Electronics Research Laboratory, College of Engineering, University of Californi, Memorandum, 1974
English [en] · PDF · 11.2MB · 1974 · 📘 Book (non-fiction) · 🚀/lgli/lgrs/nexusstc/zlib · Save
base score: 11062.0, final score: 167510.61
nexusstc/Introduction to Computer Graphics/df9f0380beb7c4dbf73e20548377459a.pdf
Introduction to Computer Graphics David J. Eck
Preface 1 Introduction 1.1 Painting and Drawing 1.2 Elements of 3D Graphics 1.3 Hardware and Software 2 Two-Dimensional Graphics 2.1 Pixels, Coordinates, and Colors 2.1.1 Pixel Coordinates 2.1.2 Real-number Coordinate Systems 2.1.3 Aspect Ratio 2.1.4 Color Models 2.2 Shapes 2.2.1 Basic Shapes 2.2.2 Stroke and Fill 2.2.3 Polygons, Curves, and Paths 2.3 Transforms 2.3.1 Viewing and Modeling 2.3.2 Translation 2.3.3 Rotation 2.3.4 Combining Transformations 2.3.5 Scaling 2.3.6 Shear 2.3.7 Window-to-Viewport 2.3.8 Matrices and Vectors 2.4 Hierarchical Modeling 2.4.1 Building Complex Objects 2.4.2 Scene Graphs 2.4.3 The Transform Stack 2.5 Java Graphics2D 2.5.1 Graphics2D 2.5.2 Shapes 2.5.3 Stroke and Fill 2.5.4 Transforms 2.5.5 BufferedImage and Pixels 2.6 HTML Canvas Graphics 2.6.1 The 2D Graphics Context 2.6.2 Shapes 2.6.3 Stroke and Fill 2.6.4 Transforms 2.6.5 Auxiliary Canvases 2.6.6 Pixel Manipulation 2.6.7 Images 2.7 SVG: A Scene Description Language 2.7.1 SVG Document Structure 2.7.2 Shapes, Styles, and Transforms 2.7.3 Polygons and Paths 2.7.4 Hierarchical Models 2.7.5 Animation 3 OpenGL 1.1: Geometry 3.1 Shapes and Colors in OpenGL 1.1 3.1.1 OpenGL Primitives 3.1.2 OpenGL Color 3.1.3 glColor and glVertex with Arrays 3.1.4 The Depth Test 3.2 3D Coordinates and Transforms 3.2.1 3D Coordinates 3.2.2 Basic 3D Transforms 3.2.3 Hierarchical Modeling 3.3 Projection and Viewing 3.3.1 Many Coordinate Systems 3.3.2 The Viewport Transformation 3.3.3 The Projection Transformation 3.3.4 The Modelview Transformation 3.3.5 A Camera Abstraction 3.4 Polygonal Meshes and glDrawArrays 3.4.1 Indexed Face Sets 3.4.2 glDrawArrays and glDrawElements 3.4.3 Data Buffers in Java 3.4.4 Display Lists and VBOs 3.5 Some Linear Algebra 3.5.1 Vectors and Vector Math 3.5.2 Matrices and Transformations 3.5.3 Homogeneous Coordinates 3.6 Using GLUT and JOGL 3.6.1 Using GLUT 3.6.2 Using JOGL 3.6.3 About glsim.js 4 OpenGL 1.1: Light and Material 4.1 Introduction to Lighting 4.1.1 Light and Material 4.1.2 Light Properties 4.1.3 Normal Vectors 4.1.4 The OpenGL 1.1 Lighting Equation 4.2 Light and Material in OpenGL 1.1 4.2.1 Working with Material 4.2.2 Defining Normal Vectors 4.2.3 Working with Lights 4.2.4 Global Lighting Properties 4.3 Image Textures 4.3.1 Texture Coordinates 4.3.2 MipMaps and Filtering 4.3.3 Texture Target and Texture Parameters 4.3.4 Texture Transformation 4.3.5 Loading a Texture from Memory 4.3.6 Texture from Color Buffer 4.3.7 Texture Objects 4.3.8 Loading Textures in C 4.3.9 Using Textures with JOGL 4.4 Lights, Camera, Action 4.4.1 Attribute Stack 4.4.2 Moving Camera 4.4.3 Moving Light 5 Three.js: A 3D Scene Graph API 5.1 Three.js Basics 5.1.1 Scene, Renderer, Camera 5.1.2 THREE.Object3D 5.1.3 Object, Geometry, Material 5.1.4 Lights 5.1.5 A Modeling Example 5.2 Building Objects 5.2.1 Polygonal Meshes and IFSs 5.2.2 Curves and Surfaces 5.2.3 Textures 5.2.4 Transforms 5.2.5 Loading Models 5.3 Other Features 5.3.1 Instanced Meshes 5.3.2 User Input 5.3.3 Shadows 5.3.4 Cubemap Textures and Skyboxes 5.3.5 Reflection and Refraction 6 Introduction to WebGL 6.1 The Programmable Pipeline 6.1.1 The WebGL Graphics Context 6.1.2 The Shader Program 6.1.3 Data Flow in the Pipeline 6.1.4 Values for Uniform Variables 6.1.5 Values for Attributes 6.1.6 Drawing a Primitive 6.1.7 WebGL 2.0: Vertex Array Objects 6.1.8 WebGL 2.0: Instanced Drawing 6.2 First Examples 6.2.1 WebGL Context Options 6.2.2 A Bit of GLSL 6.2.3 The RGB Triangle in WebGL 6.2.4 Shape Stamper 6.2.5 The POINTS Primitive 6.2.6 WebGL Error Handling 6.3 GLSL 6.3.1 Basic Types 6.3.2 Data Structures 6.3.3 Qualifiers 6.3.4 Expressions 6.3.5 Function Definitions 6.3.6 Control Structures 6.3.7 Limits 6.4 Image Textures 6.4.1 Texture Units and Texture Objects 6.4.2 Working with Images 6.4.3 More Ways to Make Textures 6.4.4 Cubemap Textures 6.4.5 A Computational Example 6.4.6 Textures in WebGL 2.0 6.5 Implementing 2D Transforms 6.5.1 Transforms in GLSL 6.5.2 Transforms in JavaScript 7 3D Graphics with WebGL 7.1 Transformations in 3D 7.1.1 About Shader Scripts 7.1.2 Introducing glMatrix 7.1.3 Transforming Coordinates 7.1.4 Transforming Normals 7.1.5 Rotation by Mouse 7.2 Lighting and Material 7.2.1 Minimal Lighting 7.2.2 Specular Reflection and Phong Shading 7.2.3 Adding Complexity 7.2.4 Two-sided Lighting 7.2.5 Moving Lights 7.2.6 Spotlights 7.2.7 Light Attenuation 7.2.8 Diskworld 2 7.3 Textures 7.3.1 Texture Transforms with glMatrix 7.3.2 Generated Texture Coordinates 7.3.3 Procedural Textures 7.3.4 Bumpmaps 7.3.5 Environment Mapping 7.4 Framebuffers 7.4.1 Framebuffer Operations 7.4.2 Render To Texture 7.4.3 Renderbuffers 7.4.4 Dynamic Cubemap Textures 7.5 WebGL Extensions 7.5.1 Anisotropic Filtering 7.5.2 Floating-Point Colors 7.5.3 Instanced Drawing in WebGL 1.0 7.5.4 Deferred Shading 7.5.5 Multiple Draw Buffers in WebGL 2.0 8 Beyond Basic 3D Graphics 8.1 Ray Tracing 8.1.1 Ray Casting 8.1.2 Recursive Ray Tracing 8.1.3 Limitations of Ray Tracing 8.2 Path Tracing 8.2.1 BSDF's 8.2.2 The Path Tracing Algorithm A Programming Languages A.1 The Java Programming Language A.1.1 Basic Language Structure A.1.2 Objects and Data Structures A.1.3 Windows and Events A.2 The C Programming Language A.2.1 Language Basics A.2.2 Pointers and Arrays A.2.3 Data Structures A.3 The JavaScript Programming Language A.3.1 The Core Language A.3.2 Arrays and Objects A.3.3 JavaScript on Web Pages A.3.4 Interacting with the Page B Blender B.1 Blender Basics B.1.1 The 3D View B.1.2 Adding Objects to the Scene B.1.3 Edit Mode B.1.4 Light, Material, and Texture B.1.5 Saving Your Work B.1.6 More Features B.2 Blender Modeling B.2.1 Text B.2.2 Curves B.2.3 Proportional Editing B.2.4 Extruding Meshes B.2.5 Mesh Modifiers B.3 Blender Animation B.3.1 Keyframe Animation and F-Curves B.3.2 Tracking B.3.3 Path Animation B.3.4 Rendering an Animation B.4 More on Light and Material B.4.1 Lighting B.4.2 Eevee versus Cycles B.4.3 The Shader Editor C Gimp and Inkscape C.1 Gimp: A 2D Painting Program C.1.1 Painting Tools C.1.2 Selections and Paths C.1.3 Layers C.2 Inkscape: A 2D Drawing Program D Listing of Sample Programs E Glossary
Read more…
English [en] · PDF · 5.5MB · 📘 Book (non-fiction) · 🚀/lgli/lgrs/nexusstc/zlib · Save
base score: 11061.0, final score: 167510.61
Your ad here.
nexusstc/Chart Pattern Recognition For MetaStock/cc7301e70c119c3a4df6f929c3126e0b.doc
Chart Pattern Recognition For MetaStock John Murphy.
English [en] · DOC · 1.4MB · 📘 Book (non-fiction) · 🚀/lgli/lgrs/nexusstc/zlib · Save
base score: 11040.0, final score: 167510.61
nexusstc/Schaums Outline of Essential Computer Mathematics/2725111fa408ad7acdc8cca2d8d786db.pdf
Schaums Outline of Essential Computer Mathematics Seymour Lipschutz McGRAW-HILL, 1982
Fortunately for you, theres Schaums Outlines. More than 40 million students have trusted Schaums to help them succeed in the classroom and on exams. Schaums is the key to faster learning and higher grades in every subject. Each Outline presents all the essential course information in an easy-to-follow, topic-by-topic format. You also get hundreds of examples, solved problems, and practice exercises to test your skills.
Read more…
English [en] · PDF · 326.5MB · 1982 · 📘 Book (non-fiction) · 🚀/lgli/lgrs/nexusstc/zlib · Save
base score: 11065.0, final score: 167509.9
nexusstc/Practical Machine Learning in R (2021 Update)/35d503e42a092978492ecef23643322d.epub
Practical Machine Learning in R (2021 Update) Kyriakos Chatzidimitriou, Themistoklis Diamantopoulos, Thomas Karanikiotis, Michail Papamichail and Andreas Symeonidis leanpub.com, 2018
Do you want to start using R for crunching machine learning models right from the start with examples? Then this book is for you. R is an open source programming language and a free environment, mainly used for statistical computing and graphics. You can find information about R in the official website. By searching with the keyword R with other topic-specific words in sites like Google, one can find additional information from sites, blog posts, tutorials, documents etc. Even through R comes with its own environment: command line and graphical interfaces, one can use the popular RStudio, which offers additional graphical functionalities. Machine Learning (ML) is a subset of Artificial Intelligence (AI) in the field of computer science that often uses statistical techniques to give computers the ability to “learn” (i.e., progressively improve performance on a specific task) with data, without being explicitly programmed. Machine Learning is often closelly related, if not used as an alternate term, to fields like Data Mining (the process of discovering patterns in large data sets involving methods at the intersection of machine learning, statistics, and database systems), Pattern Recognition, Statistical Inference or Statistical Learning. All these areas often employ the same methods and perhaps the name changes based on the practitioner’s expertise or the application domain.
Read more…
English [en] · EPUB · 5.1MB · 2018 · 📘 Book (non-fiction) · 🚀/lgli/lgrs/nexusstc/zlib · Save
base score: 11065.0, final score: 167509.9
upload/newsarch_ebooks/2022/06/02/extracted__Everything Data Analytics by Elizabeth Clarke.zip/Everything Data Analytics by Elizabeth Clarke.pdf
Everything Data Analytics-A Beginner's Guide to Data Literacy: Understanding the Processes That Turn Data Into Insights Elizabeth Clarke 2022
Do you want to begin a career as a data professional but are unsure where to start? Look no further! this book will help you gain the necessary knowledge to pursue an amazing career as a data professional.LinkedIn has found that since 2012, there has been a 650% job growth in data science-related fields. Not to mention, there will be an estimated 11.5 million new jobs in the field by 2026 (source: U.S. Bureau of Labor Statistics).With the world going remote, and precisely this field following along, you can start and pursue a career in data right here, right now. How do I start? What do I need to know? What is data analytics? I'm sure one, if not all, of these questions have run through your mind. Well, the answer is data literacy. The ability to read, understand and communicate data into information.Building a solid foundation of practical knowledge is the first step to being successful in data. From there, you can finally decide what direction you should go in and start gaining the required knowledge. By the end of this book, you will finally understandWhat exactly are data science, data analytics, and big dataThe data collection, management, and storage processesThe essential fundamentals of cleaning dataBusiness intelligence and its importanceEssential machine learning algorithms required for analysis such as regression, clustering, classification, and more...Effective data visualizationSkillsets required for the many different career optionsAnd so much more...You will also get my Free data visualization checklist that might just help you out when you land your first interview. See inside to find out why!Whether you are entirely new to the wonderful world of data or transitioning from your current role, this book will build your data literacy foundation and set you up for success in one of the most sought-after careers of the decade.
Read more…
English [en] · PDF · 4.3MB · 2022 · 📘 Book (non-fiction) · 🚀/lgli/upload/zlib · Save
base score: 11066.0, final score: 167509.9
nexusstc/RailTech : Deep Analytics on Security & Safety/a62f6ebaf46a945f4b7592d2618a21d3.pdf
RailTech : Deep Analytics on Security & Safety Sumit Chakraborty Business Analytics Research Lab India, 1, 2017
Abstract : This work is focused on RailTech, an emerging technology in rail operation from the perspectives of intelligent management information systems. RailTech integrates intelligent Driver Advice System (DAS), traffic control centre (TCC) and real-time fault diagnostics (RTFD). The technology is analyzed through deep analytics along seven ‘S’ dimensions: scope (S1), system (S2), structure (S3), strategy (S4), security(S5), staff-resources (S6) and skill-style-support (S7). It highlights technology life-cycle analysis on S-Curve and also shows SWOT analysis on three different types of RailTech system architectures. Finally, this work outlines the basic building blocks of real–time fault diagnostics in terms of a set of system verification algorithms: System Verification Algorithm-Control [SVA-C], System Verification Algorithm-Resources [SVA-R], System Verification Algorithm-Data [SVA-D], Fault Tree Analytics [SVA-FTA], FME analytics [SVA-FMEA] and TFPG Analytics [SVA-TFPGA]. Keywords : RailTech, Driver Advice System, Real-time fault diagnostics, Fault tree analysis, FMEA, Time Propagation Failure Graph (TFPG), Control flow, Resource flow, Data flow
Read more…
English [en] · PDF · 0.4MB · 2017 · 📘 Book (non-fiction) · 🚀/lgli/lgrs/nexusstc/zlib · Save
base score: 11055.0, final score: 167509.9
Your ad here.
lgli/F:\Library.nu\82\_293133.82d771fc19a10c01bfda6c6d978f497b.pdf
Art & Architecture Thesaurus: User’s Guide to the AAT Data Releases Patricia Harpring
English [en] · PDF · 0.6MB · 📘 Book (non-fiction) · 🚀/lgli/lgrs/nexusstc/zlib · Save
base score: 11048.0, final score: 167509.9
lgli/G:\!upload\!add\!\Prentice Hall - Image Processing With LabVIEW And IMAQ Vision.pdf
Image Processing With LabVIEW And IMAQ Vision Prentice Hall
Figure 5.59. Reading an Analog Needle Instrument......Page 320 Bibliography......Page 1 Structure of This Book......Page 2 Software and Utilities......Page 3 Table 1.1. Summary of Discussed National Instruments' Software Packages......Page 4 Hardware Configuration......Page 5 Figure 1.1. Ultrasound Imager (left) and Refractometer (right)......Page 6 Figure 1.2. Scientific Microscope (left) and Visual Presenter (right)......Page 7 Figure 1.3. Network Structure with Simultaneous Use of Ethernet and IEEE 1394......Page 8 What Is an Image?......Page 9 Figure 1.4. Definition of an Image as a Rectangular Matrix......Page 10 Figure 1.5. Definition of a Color Image as Multiplane Image......Page 11 The Difference: Image Processing or Image Analysis?......Page 13 Figure 1.8. Image Analysis Example. The object detection algorithm returns the number of detected objects in the left image.......Page 14 Real Time or "Really Fast"?......Page 15 Introduction to IMAQ Vision Builder......Page 16 Figure 1.9. IMAQ Vision Builder Environment. 1 Reference Window, 2 Script Window, 3 Image Size, 4 Zoom Ratio, 5 Processing Window [7]......Page 17 Figure 1.10. IMAQ Vision Builder Image Browser. 1 Image Browser, 2 Image Location, 3 Browse Buttons, 4 Thumbnail/Full-Size Toggle, 5 Image Size, 6 Close Selected Image(s), 7 Image Type, 8 File Format [7]......Page 18 Figure 1.11. Acquiring Images into IMAQ Vision Builder. 1 Acquisition Window, 2 Acquisition Property Page, 3 Store Acquired Image in Browser Button, 4 IMAQ Image Acquisition Board and Channels [7]......Page 19 Figure 1.12. Edge Detection with a Line Profile. 1 Edges of Particles, 2 Fluctuation in Pixel Values, 3 Segment Drawn with Line Tool [7]......Page 21 Figure 1.13. Using the Caliper Tool [7]......Page 22 Figure 1.14. Creating a Script File for Blob Analysis [7]......Page 24 Figure 1.15. LabVIEW VI Creation Wizard......Page 28 Figure 1.16. metal.vi Created by the VI Creation Wizard......Page 29 NI Vision Builder for Automated Inspection......Page 30 Figure 1.18. NI Vision Builder AI Inspection Interface. 1 Results Panel, 2 Display Window, 3 Inspection Statistics Panel [10]......Page 31 Configuration Interface......Page 32 Figure 1.20. Measuring the Distance Between Two Edges [10]......Page 33 Inspection Interface......Page 34 Figure 2.1. Questions Regarding Pixel Transfer......Page 36 Figure 2.2. Principle of a CCD Sensor......Page 37 Figure 2.3. CCD Transfer Mechanism [14]......Page 38 Figure 2.4. Charge Transfer Efficiency (CTE) as a Function of Pulse Length [14]......Page 39 Figure 2.5. Impact of Charge Transfer Efficiency (CTE) on Pixel Brightness......Page 40 Figure 2.6. Charge Transfer Efficiency (CTE) Far Too Low......Page 41 Figure 2.7. Structure of Surface Channel and Buried Channel CCDs......Page 42 Buried Channel CCDs......Page 43 Sensitivity and Resolution......Page 44 Figure 2.8. Visualization of the Modulation Transfer Function (MTF). How many pixels are needed to distinguish between a certain number of black and white lines?......Page 45 Noise and "Hot Pixels"......Page 46 Figure 2.10. MediaChance Hot Pixel Eliminator......Page 47 Figure 2.11. Blooming Effect Caused by a Laser Pointer......Page 48 Figure 2.12. Blooming Effect (Exercise)......Page 49 Image Smear......Page 50 Linear CCD Sensors......Page 51 Image Sensors......Page 52 Figure 2.16. Comparison of Interline and Frame Transfer Structures......Page 53 Line-Scan Cameras......Page 54 Figure 2.19. Line-Scan Sensor Used in a Flat-Bed Scanner......Page 55 Figure 2.20. Principle of a CMOS Image Sensor......Page 56 Figure 2.21. CMOS (Color) Sensor Chip......Page 57 Figure 2.22. Blooming Effect in CCD (left) and CMOS Cameras (right)......Page 59 Video Standards......Page 60 Figure 2.24. Video Frames (European CCIR Standard)......Page 61 Figure 2.26. RS 170 Standard Timing Diagram......Page 62 Figure 2.27. Interlaced Mode of a CCD Video Sensor......Page 63 Figure 2.28. Noninterlaced Mode and Progressive Scan Sensor......Page 64 Color Images......Page 65 Color Models......Page 66 Figure 2.31. RGB Color Cube......Page 67 The CMY (CMYK) Color Model......Page 68 Figure 2.32. HSI Color Triangle and Color Solid......Page 70 Figure 2.33. Front Panel of the VI Created in Exercise 2.4......Page 71 Figure 2.34. Diagram of the VI Created in Exercise 2.4......Page 72 The YIQ Color Model......Page 73 Color Video Standards......Page 74 Table 2.5. Standards for Digital Video......Page 75 Other Image Sources......Page 76 Figure 2.36. Principle of Ultrasound A and M Mode [19]......Page 77 Figure 2.37. Curved Array Ultrasound Head and Corresponding Image......Page 78 Computed Tomography......Page 79 Figure 2.38. CT Device Generations 1 to 4 [20]......Page 80 CT Image Calculation and Back Projection......Page 81 Figure 2.39. Simple Calculation of a CT Image [20]......Page 82 Figure 2.41. Iterative Calculation of a CT Image......Page 83 Figure 2.42. Separation of Energy Levels According to Spin Directions......Page 85 Figure 2.43. Relaxation Times T1 and T2......Page 87 Figure 2.44. MRI Images: Based on T1 (left) and T2 (right) of a Knee Joint......Page 88 Figure 3.1. Getting an Image into a PC......Page 90 Figure 3.2. Typical Block Diagram of a PCI Frame Grabber......Page 91 IEEE 1394 (FireWire)......Page 92 Fundamentals......Page 93 Figure 3.4. Windows Device Manager Listing 1394 Devices......Page 94 Figure 3.5. 1394 Zip100 Drive and 1394 Hard Drive......Page 95 Figure 3.6. 1394 Video Camera......Page 96 Figure 3.8. 1394 PC104 Boards (1STT Components; www.1stt.com)......Page 97 Figure 3.9. Isochronous and Asynchronous Transactions[26]......Page 98 Table 3.2. Maximum Data Payload Size for Asynchronous and Isochronous Transfers......Page 99 Figure 3.11. 1394 4-Pin Connector (Plug and Socket)......Page 100 Figure 3.12. Cross Sections of 4-Conductor and 6-Conductor Cables......Page 101 1394 Bus Configuration......Page 102 1394 Bus Management......Page 103 Power Management......Page 104 1394 Images in LabVIEW......Page 105 Figure 3.16. 1394 Camera Image and Properties in IMAQ Vision Builder......Page 106 Universal Serial Bus (USB)......Page 107 Figure 3.18. Windows Device Manager Listing USB Devices......Page 108 Figure 3.19. USB Hub Types [27]......Page 109 USB Devices......Page 110 Figure 3.21. USB Hub with Four Ports......Page 111 Figure 3.22. USB Mass Storage Device and USB Camera......Page 112 Figure 3.23. Cross Sections of Low-Speed and High-Speed USB Cables [27]......Page 113 Figure 3.25. USB Cables Using NRZI Encoding and Differential Signaling [27]......Page 114 Figure 3.26. NRZI Encoding [27]......Page 115 Data Environment......Page 116 USB Images in LabVIEW......Page 117 Figure 3.27. Importing USB Camera Images in LabVIEW......Page 118 Camera Link......Page 119 Figure 3.28. Camera Link Block Diagram (Base Configuration)......Page 120 Table 3.3. Camera Link Configurations......Page 121 Compression Techniques......Page 122 Figure 3.30. Compression Techniques and Algorithms......Page 123 Huffman Coding......Page 124 Figure 3.31. Example of Huffman Coding......Page 125 Lempel-Ziv Coding......Page 126 Arithmetic Coding......Page 127 Figure 3.33. Arithmetic Coding Example......Page 128 MH, MR, and MMR Coding......Page 129 Discrete Cosine Transform (DCT)......Page 130 Figure 3.36. Calculating 8 x 8 DCT Coefficients with LabVIEW......Page 131 Figure 3.37. Diagram of Exercise 3.3......Page 132 JPEG Coding......Page 133 Figure 3.40. JPEG Quantization Table and Coefficient Reading......Page 134 Figure 3.41. 2D Wavelet Transform Example (LabVIEW Signal Processing Toolkit)......Page 135 Figure 3.42. JPEG2000 Generation Tool (www.aware.com)......Page 137 Windows Bitmap Format (BMP)......Page 138 Table 3.6. Structure of the BMP File Header......Page 139 Table 3.7. Structure of the BMP Info Header......Page 140 Graphics Interchange Format (GIF)......Page 141 Table 3.10. Structure of the GIF Logical Screen Descriptor......Page 142 Tag Image File Format (TIFF 6.0)......Page 143 Table 3.14. TIFF IFD Block Structure......Page 144 Table 3.16. Tag Data Types......Page 145 Table 3.18. Image Pointer Tags......Page 146 Table 3.20. Data Orientation Tags......Page 147 Table 3.23. Storage Management Tags......Page 148 Table 3.26. YCbCr Management Tags......Page 149 Table 3.27. CHUNK Structure......Page 150 Table 3.29. Palette (PLTE) CHUNK......Page 151 Table 3.32. Textual Data (tEXt) CHUNK......Page 152 ZSoft Paintbrush File Format (PCX)......Page 153 JPEG/JFIF and JPEG2000 (JPG, J2K)......Page 154 Table 3.36. JFIF EOI Segment......Page 155 Table 3.39. Define Huffman Table (DHT) Segment......Page 156 Table 3.42. Comparison of Image Standards......Page 157 Modalities......Page 158 Data Elements......Page 159 Value Representations (VRs)......Page 160 Value Lengths (VLs)......Page 161 DICOM Image Storing......Page 162 Figure 3.46. ActiveX Control Import List......Page 164 Figure 3.48. Verification of the Correct Import of Accusoft DICOM Comm SDK in LabVIEW......Page 165 Figure 3.50. Frames 0 and 1 of Exercise 3.5......Page 167 Histogram and Histograph......Page 169 Figure 4.1. Histogram Function in IMAQ Vision Builder......Page 170 Figure 4.3. Histogram Exported in MS Excel......Page 171 Using Look-up Tables (LuT)......Page 172 Figure 4.5. Exercise 4.2: Creating User LuTs......Page 173 Figure 4.6. Processing Look-up Tables (LuTs)......Page 174 Figure 4.8. Creating an Exponential Look-up Table......Page 176 Figure 4.9. Creating a Square Look-up Table......Page 177 Figure 4.11. Creating a Power x Look-up Table......Page 178 Figure 4.12. Creating a Power 1/x Look-up Table......Page 179 Figure 4.13. Image and Histogram Resulting from Equalizing......Page 180 Figure 4.14. Diagram of Exercise 4.3......Page 181 Figure 4.15. Inverting the Bear Image......Page 182 Figure 4.16. Diagram of Exercise 4.4......Page 183 Special LuTs: BCG Values......Page 184 Figure 4.17. Using Special LuTs for Modifying Brightness and Contrast......Page 185 Figure 4.18. Diagram of Exercise 4.5......Page 186 Spatial Image Filtering......Page 187 Figure 4.19. Moving the Filter Kernel......Page 188 Kernel Families......Page 190 Figure 4.21. Visualizing Effects of Various Filter Kernels......Page 191 Figure 4.22. Diagram of Exercise 4.7......Page 192 Figure 4.23. Filter Example: Smoothing (#5)......Page 193 Figure 4.24. Filter Example: Gaussian (#4)......Page 194 Filter Families: Gradient......Page 195 Figure 4.26. Filter Example: Gradient (#1)......Page 196 Figure 4.27. Filter Example: Gradient (#4)......Page 197 Figure 4.28. Filter Example: Laplace (#0)......Page 199 Figure 4.29. Filter Example: Laplace (#1)......Page 200 Figure 4.31. Filter Example: Laplace (#7)......Page 201 Figure 4.32. Waveform Spectrum......Page 202 Figure 4.34. FFT Spectrum of an Image......Page 204 FFT Filtering: Truncate......Page 206 Figure 4.37. Diagram of Exercise 4.9......Page 207 Figure 4.38. FFT High-Pass Filter......Page 208 FFT Filtering: Attenuate......Page 209 Figure 4.40. FFT High-Pass Attenuation Result......Page 210 Figure 4.41. Morphology Functions in IMAQ Vision Builder......Page 211 Figure 4.42. Thresholding with IMAQ Vision Builder......Page 212 Figure 4.43. Result of Thresholding Operation......Page 213 Figure 4.45. Diagram of Exercise 4.11......Page 214 Figure 4.47. Diagram of Exercise 4.12......Page 216 Figure 4.48. Examples of Structuring Elements......Page 218 Erosion and Dilation......Page 220 Figure 4.51. Diagram of Exercise 4.13......Page 221 Opening and Closing......Page 223 Figure 4.54. Morphology: Closing Result......Page 224 Proper Opening and Proper Closing......Page 225 Figure 4.55. Morphology: Proper Opening Result......Page 226 Hit-Miss Function......Page 227 Figure 4.58. Hit-Miss Result with Structuring Element That Is All 0s......Page 228 Figure 4.60. Outer Gradient (External Edge) Result......Page 230 Thinning and Thickening......Page 231 Figure 4.62. Morphology: Thinning Result......Page 232 Auto-Median Function......Page 233 Figure 4.65. Remove Particle: Low Pass......Page 234 Figure 4.66. Diagram of Exercise 4.14......Page 235 Figure 4.68. Particles Touching the Border Are Removed......Page 236 Figure 4.69. Diagram of Exercise 4.15......Page 237 Figure 4.70. Particle Filtering by x Coordinate......Page 238 Figure 4.71. Diagram of Exercise 4.16......Page 239 Figure 4.72. Filling Holes in Particles......Page 241 Figure 4.73. Diagram of Exercise 4.17......Page 242 Figure 4.75. Diagram of Exercise 4.18......Page 243 Separation and Skeleton Functions......Page 244 Figure 4.77. Diagram of Exercise 4.19......Page 245 Figure 4.78. IMAQ MagicWand: Separating Objects from the Background (National Instruments Example)......Page 246 Figure 4.79. L-Skeleton Function......Page 247 Figure 4.80. Diagram of Exercise 4.20......Page 248 Figure 4.81. M-Skeleton Function......Page 249 Gray-Level Erosion and Dilation......Page 250 Figure 4.84. Diagram of Exercise 4.21......Page 251 Gray-Level Opening and Closing......Page 253 Figure 4.88. Gray Morphology: Closing......Page 254 Figure 4.90. Gray Morphology: Proper Closing......Page 255 Figure 4.91. Gray Morphology: Auto-Median Function......Page 256 Figure 5.1. Line Profile Function in IMAQ Vision Builder......Page 257 Figure 5.2. Line Profile of an Image......Page 258 Figure 5.3. Diagram of Exercise 5.1......Page 259 Figure 5.4. Menu Palette Containing Overlay Functions......Page 260 Figure 5.5. Quantifying Image Areas with IMAQ Vision Builder......Page 261 Figure 5.7. IVB (IMAQ Vision Builder) Functions......Page 262 Linear Averages......Page 263 Figure 5.10. Diagram of Exercise 5.2......Page 264 Simple Edge Detector......Page 265 Figure 5.12. Diagram of Exercise 5.3......Page 266 IMAQ Edge Detection Tool......Page 267 Figure 5.15. Diagram of Exercise 5.4......Page 268 Figure 5.16. Detecting Peaks and Valleys of a Line Profile......Page 269 Figure 5.17. Diagram of Exercise 5.5......Page 270 Locating Edges......Page 271 Figure 5.19. Locating Edges in Images......Page 272 Figure 5.20. Locating Horizontal Edges......Page 273 Figure 5.22. Diagram of Exercise 5.7......Page 274 Figure 5.23. Edge-Locating Result (Motor)......Page 275 Distance and Danielsson......Page 276 Figure 5.25. Diagram of Exercise 5.8......Page 277 Figure 5.26. Distance Function Applied to a Binary Motor Image......Page 278 Figure 5.27. Danielsson Function Applied to a Binary Motor Image......Page 279 Figure 5.28. Labeling of Binary Images......Page 280 Figure 5.29. Diagram of Exercise 5.9......Page 281 Figure 5.31. Diagram of Exercise 5.10......Page 282 Circle Detection......Page 283 Figure 5.33. Circle Detection Exercise......Page 284 Figure 5.35. Diagram of Exercise 5.11......Page 286 Counting Objects......Page 289 Figure 5.37. Diagram of Exercise 5.12......Page 290 Measuring Distances (Clamping)......Page 291 Figure 5.38. Measuring Vertical Maximum Distances......Page 292 Figure 5.40. Measuring Horizontal Maximum Distances......Page 293 Figure 5.41. Measuring Horizontal Minimum Distances......Page 294 Complex Particle Measurements......Page 295 Figure 5.43. Diagram of Exercise 5.14......Page 296 Figure 5.45. Diagram of Exercise 5.15......Page 298 Figure 5.46. Calculating Other Complex Particle Parameters......Page 299 Figure 5.47. Diagram of Exercise 5.16......Page 300 Figure 5.48. Intercept and Chord Particle Measurements......Page 305 Image Calibration......Page 308 Figure 5.49. Calibrating the Motor Image......Page 309 Figure 5.51. Diagram of Exercise 5.17......Page 310 Figure 5.52. Grid Calibration with IMAQ Vision Builder......Page 311 Figure 5.53. Shape Matching with IMAQ Vision Builder......Page 312 Pattern Matching......Page 314 Figure 5.54. Pattern Matching with IMAQ Vision Builder......Page 315 Pattern Matching Techniques......Page 316 Figure 5.57. Part of the Pattern Matching Diagram......Page 317 Figure 5.58. Pattern Matching: Multiple Match......Page 318 Figure 5.60. Part of the Analog Meter Reading Diagram......Page 321 Figure 5.61. Reading a Digital LCD Instrument......Page 322 Figure 5.62. Part of the Digital LCD Reading Diagram......Page 323 Character Recognition......Page 324 Bar Code Reading......Page 325 Figure 5.65. Bar Code Reading Example (EAN 13 Setting)......Page 326 Figure 5.66. Focus Quality Rating with Edge Detection......Page 328 Figure 5.67. Focus Quality Diagram (Edge Detection)......Page 329 Figure 5.69. Focus Quality Diagram (Histogram Analysis)......Page 331 Figure 5.71. Focus Quality Diagram (FFT)......Page 333 Table 5.1. Comparison of Focus Quality Rating Metods......Page 334 Introduction......Page 335 IEEE 1394 (FireWire)......Page 336 The Moving Camera System......Page 337 Figure 5.74. Screenshot of a Typical Image Processing Application......Page 338 Moving Camera Software......Page 339 Object Detection and Counting in Public Places......Page 340 Fountain Control Hardware......Page 341 Figure 5.76. Villach City Hall Square with Interactive Fountain......Page 342 Object Detection Algorithms......Page 343 Figure 5.78. Principle of the Object Detection Algorithm......Page 344 Products Used......Page 345 Motivation......Page 346 The Layer Extraction Algorithm......Page 347 Figure 5.80. Diagram Window of the Layer Extraction Algorithm (Threshold Step)......Page 348 Figure 5.81. Visualization of NETQUEST Results in 2D and 3D View......Page 349 Figure 5.82. Feedback Form Prepared for Automatic Reading......Page 350 The Solution......Page 351 Functionality of the Form Reader Software......Page 352 Mark Detection Algorithm......Page 353 Figure 5.84. Block Diagram of find mark.vi......Page 354 Conclusion......Page 355 Application Papers:......Page 358 About the Author......Page 359
Read more…
English [en] · PDF · 10.0MB · 📘 Book (non-fiction) · 🚀/lgli/lgrs/nexusstc/zlib · Save
base score: 11061.0, final score: 167509.9
nexusstc/Anatomy of Deep Learning Principles: Writing a Deep Learning Library from Scratch/190a5df0009042da9eb4c4eacb06bc79.epub
Anatomy of Deep Learning Principles: Writing a Deep Learning Library from Scratch Hongwei Dong Independently published, 2023
This book introduces the basic principles and implementation process of Deep Learning in a simple way, and uses Python's Numpy library to build its own Deep Learning library from scratch instead of using existing Deep Learning libraries. On the basis of introducing basic knowledge of Python programming, calculus, and probability statistics, the core basic knowledge of Deep Learning such as regression model, neural network, convolutional neural network, recurrent neural network, and generative network is introduced in sequence according to the development of Deep Learning. While analyzing the principle in a simple way, it provides a detailed code implementation process. It is like not teaching you how to use weapons and mobile phones, but teaching you how to make weapons and mobile phones by yourself. This book is not a tutorial on the use of existing Deep Learning libraries, but an analysis of how to develop Deep Learning libraries from 0. This method of combining the principle from 0 with code implementation can enable readers to better understand the basic principles of Deep Learning and the design ideas of popular Deep Learning libraries. Through reading this book, readers can follow step by step to build a deep learning library from 0 without any deep learning platform. Finally, as a comparison, the use of the Deep Learning platform Pytorch is introduced, so that readers can easily learn to use this deep learning platform, which will help readers understand the design ideas of these platforms more deeply, so as to better grasp and use these deep learning platforms. This book is suitable not only for beginners without any Deep Learning knowledge, but also for practitioners who have experience in using deep learning libraries and want to understand its underlying implementation principles. This book is especially suitable as a Deep Learning textbook for colleges and universities.
Read more…
English [en] · EPUB · 23.2MB · 2023 · 📘 Book (non-fiction) · 🚀/lgli/lgrs/nexusstc/zlib · Save
base score: 11065.0, final score: 167509.9
nexusstc/The Art of Computer Programming/676dff9198365763055765c2e7adea56.pdf
The Art of Computer Programming Volume 4, Pre-fascicle 5C. Dancing Links Donald E. Knuth Addison-Wesley, Volume 4, Pre-fascicle 5C. Dancing Links, 2019
English [en] · PDF · 4.5MB · 2019 · 📘 Book (non-fiction) · 🚀/lgli/lgrs/nexusstc/zlib · Save
base score: 11062.0, final score: 167509.9
lgli/DVD-026/Ravishankar_M.K._Efficient_Algorithms_for_Speech_Recognition_(1996)(en)(132s).pdf
Efficient Algorithms for Speech Recognition Ravishankar M.K. 1996
English [en] · PDF · 0.7MB · 1996 · 📘 Book (non-fiction) · 🚀/lgli/lgrs/nexusstc/zlib · Save
base score: 11055.0, final score: 167509.9
Your ad here.
nexusstc/Deep Learning [draft of March 30, 2015]/8c61e74af17e726c08cea390a3678498.pdf
Deep Learning [draft of March 30, 2015] Ian Goodfellow, Yoshua Bengio, Aaron Courville MIT Press, 2016
The Deep Learning textbook is a resource intended to help students and practitioners enter the field of machine learning in general and deep learning in particular. The online version of the book is now complete and will remain available online for free. The print version will be available for sale soon.
Read more…
English [en] · PDF · 10.6MB · 2016 · 📘 Book (non-fiction) · 🚀/lgli/lgrs/nexusstc/zlib · Save
base score: 11065.0, final score: 167509.9
duxiu/initial_release/40952757.zip
Python Data Structures and Algorithms 40952757 Benjamin Baka Packt Publishing, 2017, 2017
English [en] · PDF · 101.6MB · 2017 · 📘 Book (non-fiction) · 🚀/duxiu/zlibzh · Save
base score: 11062.0, final score: 167509.9
lgli/Kanetkar, Yashavant; - Data Structures Through C++: Experience Data Structures C++ through animations, 4th Edition (2022, BPB Publications).pdf
Data Structures Through C++: Experience Data Structures C++ through animations, 4th Edition Kanetkar, Yashavant BPB Publications, 4th, 2022
There are two major hurdles faced by anybody trying to learn Data Structures :● Most books attempt to teach it using algorithms rather than complete working programs.● A lot is left to the imagination of the reader, instead of explaining it in detail.This is a different Data Structures book. It uses C++ language to teach Data Structures. Secondly, it goes far beyond merely explaining how Stacks, Queues and Linked Lists work. The readers can actually experience (rather than imagine) sorting of an array, traversing of a doubly-linked list, construction of a binary tree, etc. through carefully crafted animations that depict these processes. All these animations are available on the Downloadable DVD. In addition, it contains numerous carefully-crafted figures, working programs and real-world scenarios where different data structures are used. This would help you understand the complicated operations being performed on different data structures easily. Add to that the customary lucid style of Yashavant Kanetkar and you have a perfect Data Structures book in your hands.What you will learn● Analysis of Algorithms, Arrays, Linked Lists, Sparse Matrices● Stacks, Queues, Trees, Graphs, Searching and SortingWho this book is forStudents, Programmers, researchers, and software developers who wish to learn the basics of Data structures.Table of Contents1. Analysis of Algorithms2. Arrays3. Linked Lists4. Sparse Matrices5. Stacks6. Queues7. Trees8. Graphs9. Searching and Sorting
Read more…
English [en] · Hindi [hi] · PDF · 6.4MB · 2022 · 📘 Book (non-fiction) · 🚀/lgli/zlib · Save
base score: 11068.0, final score: 167509.9
lgli/J:\forlibgen\Математика\Digitale.Bibliothek.DBSK.Algorithmen.kurz.gefasst.[Uve.Schoening.DBSK.Verlag.1997].pdf
Digitale Bibliothek DBSK Algorithmen kurz gefasst Uwe Schöning 1997
Kapitel 1 - Grundlegende Konzepte......Page 4 Kapitel 2 - Sortier und Selektionsalgorithmen......Page 21 Kapitel 3 - Hashing......Page 33 Kapitel 4 - Dynamisches Programmieren......Page 40 Kapitel 5 - Greedy-Algorithmen und Matroide......Page 49 Kapitel 6 - Algorithmen und Graphen......Page 61 Kapitel 7 - Algebraische und zahlentheoretische Algorithmen......Page 75 Kapitel 8 - String Matching......Page 87 Kapitel 9 - Heuristische Algorithmen......Page 93 Index......Page 103
Read more…
English [en] · German [de] · PDF · 54.8MB · 1997 · 📘 Book (non-fiction) · 🚀/lgli/lgrs/nexusstc/zlib · Save
base score: 11063.0, final score: 167509.9
lgli/F:\twirpx\_13\_3\804619\starrett_c_requirements_tracing.pdf
Requirements tracing Starrett C.
Mentor Graphics Corporation, 2007. 7 p. На англ. языке. Статья сотрудника фирмы Mentor Graphics об отслеживании требований к функциям и зависимостям в программных продуктах. Приведены графические схемы и диаграммы. Описанные приёмы проверены в течение нескольких лет.
Read more…
English [en] · PDF · 0.5MB · 📘 Book (non-fiction) · 🚀/lgli/lgrs/nexusstc/zlib · Save
base score: 11051.0, final score: 167509.9
Your ad here.
nexusstc/Problems on algorithms/edcfef2f915e1be89631fba537bf77ed.pdf
Problems on algorithms Parberry I., Gasarch W. 2002
English [en] · PDF · 2.0MB · 2002 · 📘 Book (non-fiction) · 🚀/lgli/lgrs/nexusstc/zlib · Save
base score: 11060.0, final score: 167509.9
lgli/dvd39/Drozdek A. - Data Structures and Algorithms in C++(2000)(672).pdf
Data Structures and Algorithms in C++ Drozdek A. 2000
Building on widespread use of the C++ programming language in industry and education, this book provides a broad-based and case-driven study of data structures - and the algorithms associated with them - using C++ as the language of implementation. This book places special emphasis on the connection between data structures and their algorithms, including an analysis of the algorithms' complexity. It presents data structures in the context of object-oriented program design, stressing the principle of information hiding in its treatment of encapsulation and decomposition. The book also closely examines data structure implementation and its implications on the selection of programming languages.
Read more…
English [en] · PDF · 27.9MB · 2000 · 📘 Book (non-fiction) · 🚀/lgli/lgrs/nexusstc/zlib · Save
base score: 11063.0, final score: 167509.83
nexusstc/Nature-Inspired Algorithms for Optimisation/3067abd631f27ac4130ad649d9a8a4b6.pdf
Nature-Inspired Algorithms for Optimisation Raymond Chiong (ed.) Springer, Studies in Computational Intelligence,Volume 193, 2009
Nature-Inspired Algorithms have been gaining much popularity in recent years due to the fact that many real-world optimisation problems have become increasingly large, complex and dynamic. The size and complexity of the problems nowadays require the development of methods and solutions whose efficiency is measured by their ability to find acceptable results within a reasonable amount of time, rather than an ability to guarantee the optimal solution. This volume 'Nature-Inspired Algorithms for Optimisation' is a collection of the latest state-of-the-art algorithms and important studies for tackling various kinds of optimisation problems. It comprises 18 chapters, including two introductory chapters which address the fundamental issues that have made optimisation problems difficult to solve and explain the rationale for seeking inspiration from nature. The contributions stand out through their novelty and clarity of the algorithmic descriptions and analyses, and lead the way to interesting and varied new applications.
Read more…
English [en] · PDF · 44.7MB · 2009 · 📘 Book (non-fiction) · 🚀/lgli/lgrs/nexusstc/zlib · Save
base score: 11065.0, final score: 167509.83
upload/newsarch_ebooks/2020/07/30/B08DRX2G9P.epub
Design and Analysis of Computer Algorithms Library, Smartest 2020
English [en] · EPUB · 4.8MB · 2020 · 📘 Book (non-fiction) · 🚀/lgli/lgrs/nexusstc/upload/zlib · Save
base score: 11060.0, final score: 167509.83
lgli/F:\twirpx\_19\_9\1866436\databricks_databricks_spark_knowledge_base.pdf
Databricks. Databricks Spark Knowledge Base
Авторство: компания Databricks**Knowledgebase****Best Practices**Avoid GroupByKeyDon't copy all elements of a large RDD to the driverGracefully Dealing with Bad Input Data**General Troubleshooting**Job aborted due to stage failure: Task not serializable:Missing Dependencies in Jar FilesError running start-all.sh - Connection refusedNetwork connectivity issues between Spark components**Performance & Optimization**How Many Partitions Does An RDD Have?Data Locality**Spark Streaming**ERROR OneForOneStrategy
Read more…
English [en] · PDF · 0.8MB · 📘 Book (non-fiction) · 🚀/lgli/lgrs/nexusstc/zlib · Save
base score: 11054.0, final score: 167509.83
Your ad here.
upload/newsarch_ebooks_2025_10/2021/12/19/extracted__Data Structure and algorithms in C language.zip/Data Structure and algorithms in C language.pdf
Data Structure and algorithms' in C language: A step by step guide in C language Jackson, Theo 1, 2021
The manual is a training course that is focused on the C programming language, the common implementations of this language are described.Topics such as standard I / O streams, sequence processing algorithms, one-dimensional arrays, matrices, pointers and memory addresses are considered,special attention is paid to the consideration of strings, dynamic arrays, files, working with memory bits, data structures such as lists, stacks, queues, binary trees. Implementation algorithms are given for each of these topics.Also, on each topic there are a large number of tasks for practicing the basic techniques of programming in the C language.
Read more…
English [en] · PDF · 1.4MB · 2021 · 📘 Book (non-fiction) · 🚀/lgli/upload/zlib · Save
base score: 11066.0, final score: 167509.83
lgli/Heart Rate Variability Analysis with the R package RHRV.pdf
Heart Rate Variability Analysis with the R package RHRV (Use R!) Constantino Antonio García Martínez, Abraham Otero Quintana, Xosé A. Vila, María José Lado Touriño, Leandro Rodríguez-Liñares, Constantino Antonio Antonio García García Martínez, Jesús María Rodríguez Presedo, Arturo José Méndez Penín Springer International Publishing AG, 2, 2024
This book introduces readers to the fundamental concepts of Heart Rate Variability (HRV) and its most important analysis algorithms using a hands-on approach based on the open-source RHRV software. HRV refers to the variation over time of the intervals between consecutive heartbeats. Despite its apparent simplicity, HRV is one of the most important markers of autonomic nervous system activity and it has been recognized as a useful predictor of several pathologies. The book discusses all the basic HRV topics, including the physiological contributions to HRV, clinical applications, HRV data acquisition, HRV data manipulation and HRV analysis using time-domain, frequency-domain, time-frequency, nonlinear and fractal techniques. Detailed examples based on real data sets are provided throughout the book to illustrate the algorithms and discuss the physiological implications of the results. Offering a comprehensive guide to analyzing beat information with RHRV, the book is intended for masters and Ph.D. students in various disciplines such as biomedical engineering, human and veterinary medicine, biology, and pharmacy, as well as researchers conducting heart rate variability analyses on both human and animal data. The second edition of the book has been updated to RHRV version 5.0. This version introduces a functionality to perform heart rate variability analysis on entire populations. This functionality automates and streamlines both the calculation of HRV indices in the time, frequency, and nonlinear domains, as well as the subsequent statistical analysis.
Read more…
English [en] · PDF · 7.3MB · 2024 · 📘 Book (non-fiction) · 🚀/lgli/lgrs/zlib · Save
base score: 11065.0, final score: 167509.83
nexusstc/DESIGN AND ANALYSIS OF ALGORITHMS: The Learners Approach/e93926f52457266ba77bfc1db78ed4f6.epub
DESIGN AND ANALYSIS OF ALGORITHMS: The Learners Approach V, Rashmi 2020
English [en] · EPUB · 9.1MB · 2020 · 📘 Book (non-fiction) · 🚀/lgli/lgrs/nexusstc/zlib · Save
base score: 11060.0, final score: 167509.83
Optimization Algorithms (MEAP V08): AI techniques for design, planning, and control problems Alaa Khamis Manning Publications Co. LLC, Chapters 1 to 9 of 12, 2023
Search and optimization algorithms are powerful tools that can help practitioners find optimal or near-optimal solutions to a wide range of design, planning and control problems. When you open a route planning app, call for a rideshare, or schedule a hospital appointment, an AI algorithm works behind the scenes to make sure you get an optimized result. This guide reveals the classical and modern algorithms behind these services. Solve design, planning, and control problems using modern machine learning and AI techniques. In Optimization Algorithms: AI techniques for design, planning, and control problems you will learn:• Machine learning methods for search and optimization problems• The core concepts of search and optimization• Deterministic and stochastic optimization techniques• Graph search algorithms• Nature-inspired search and optimization algorithms• Efficient trade-offs between search space exploration and exploitation• State-of-the-art Python libraries for search and optimization Optimization problems are everywhere in daily life. What’s the fastest route from one place to another? How do you calculate the optimal price for a product? How should you plant crops, allocate resources, and schedule surgeries? Optimization Algorithms introduces the AI algorithms that can solve these complex and poorly-structured problems. Inside you’ll find a wide range of optimization methods, from deterministic and stochastic derivative-free optimization to nature-inspired search algorithms and machine learning methods. Don’t worry—there’s no complex mathematical notation. You’ll learn through in-depth case studies that cut through academic complexity to demonstrate how each algorithm works in the real world.
Read more…
English [en] · PDF · 24.6MB · 2023 · 📘 Book (non-fiction) · 🚀/zlib · Save
base score: 11065.0, final score: 167509.83
nexusstc/Complexity of algorithms/01fca752e0c77127071c4c1c7167ccd8.pdf
Complexity of algorithms Lovász László Typotex Kiadó, 2014
Introduction......Page 9 Some notation and definitions......Page 10 Models of Computation......Page 13 Finite automata......Page 15 The Turing machine......Page 18 The Random Access Machine......Page 29 Boolean functions and Boolean circuits......Page 35 Algorithmic decidability......Page 45 Recursive and recursively enumerable languages......Page 46 Other undecidable problems......Page 51 Godel's incompleteness theorem......Page 57 First-order logic......Page 60 Computation with resource bounds......Page 67 Polynomial time......Page 70 Other complexity classes......Page 82 General theorems on space and time complexity......Page 85 Non-deterministic algorithms......Page 95 Non-deterministic Turing machines......Page 96 Witnesses and the complexity of non-deterministic algorithms......Page 98 Examples of languages in NP......Page 103 NP-completeness......Page 111 Further NP-complete problems......Page 117 Verifying a polynomial identity......Page 127 Primality testing......Page 131 Randomized complexity classes......Page 136 Information complexity......Page 141 Information complexity......Page 142 Self-delimiting information complexity......Page 147 The notion of a random sequence......Page 151 Kolmogorov complexity, entropy and coding......Page 153 Pseudorandom numbers......Page 161 Classical methods......Page 162 The notion of a pseudorandom number generator......Page 164 One-way functions......Page 168 Discrete square roots......Page 172 Decision trees......Page 175 Algorithms using decision trees......Page 176 Non-deterministic decision trees......Page 181 Lower bounds on the depth of decision trees......Page 184 Models of algebraic computation......Page 191 Arithmetic operations on large numbers......Page 193 Matrix multiplication......Page 195 Inverting matrices......Page 197 Multiplication of polynomials......Page 198 Discrete Fourier transform......Page 200 The complexity of computing square-sums......Page 202 Evaluation of polynomials......Page 203 Formula complexity and circuit complexity......Page 206 Parallel random access machines......Page 209 The class NC......Page 214 Communication complexity......Page 219 Communication matrix and protocol-tree......Page 220 Examples......Page 225 Non-deterministic communication complexity......Page 227 Randomized protocols......Page 231 A classical problem......Page 233 A simple complexity-theoretic model......Page 234 Public-key cryptography......Page 235 The Rivest–Shamir–Adleman code (RSA code)......Page 237 Circuit complexity......Page 241 Lower bound for the Majority Function......Page 242 Monotone circuits......Page 245 How to save the last move in chess?......Page 247 How to use your password – without telling it?......Page 249 How to prove non-existence?......Page 251 How to referee exponentially long papers?......Page 254 Approximability......Page 256
Read more…
English [en] · PDF · 3.0MB · 2014 · 📘 Book (non-fiction) · 🚀/lgli/lgrs/nexusstc/zlib · Save
base score: 11065.0, final score: 167509.73
Your ad here.
lgli/K:\_add\3\nonlinear/Adaptive_Signal_Models_Theory_Algorithms_and_Audio_Applications_1461346509.pdf
Adaptive signal models.Theory,algorithms,and audio applications Goodwin M.M. 1997
Adaptive Signal Models: Theory, Algorithms and Audio Applications presents methods for deriving mathematical models of natural signals. The introduction covers the fundamentals of analysis-synthesis systems and signal representations. Some of the topics in the introduction include perfect and near-perfect reconstruction, the distinction between parametric and nonparametric methods, the role of compaction in signal modeling, basic and overcomplete signal expansions, and time-frequency resolution issues. These topics arise throughout the book as do a number of other topics such as filter banks and multiresolution. The second chapter gives a detailed development of the sinusoidal model as a parametric extension of the short-time Fourier transform. This leads to multiresolution sinusoidal modeling techniques in Chapter Three, where wavelet-like approaches are merged with the sinusoidal model to yield improved models. In Chapter Four, the analysis-synthesis residual is considered; for realistic synthesis, the residual must be separately modeled after coherent components (such as sinusoids) are removed. The residual modeling approach is based on psychoacoustically motivated nonuniform filter banks. Chapter Five deals with pitch-synchronous versions of both the wavelet and the Fourier transform; these allow for compact models of pseudo-periodic signals. Chapter Six discusses recent algorithms for deriving signal representations based on time-frequency atoms; primarily, the matching pursuit algorithm is reviewed and extended. The signal models discussed in the book are compact, adaptive, parametric, time-frequency representations that are useful for analysis, coding, modification, and synthesis of natural signals such as audio. The models are all interpreted as methods for decomposing a signal in terms of fundamental time-frequency atoms; these interpretations, as well as the adaptive and parametric natures of the models, serve to link the various methods dealt with in the text. Adaptive Signal Models: Theory, Algorithms and Audio Applications serves as an excellent reference for researchers of signal processing and may be used as a text for advanced courses on the topic
Read more…
English [en] · PDF · 2.0MB · 1997 · 📘 Book (non-fiction) · 🚀/lgli/lgrs/nexusstc/zlib · Save
base score: 11063.0, final score: 167509.73
nexusstc/Data Analysis for the Life Sciences/2f6953b27db27b1a44ea164e1e1c524c.epub
Data Analysis for the Life Sciences Rafael A Irizarry and Michael I Love leanpub.com, 2021
The unprecedented advance in digital technology during the second half of the 20th century has produced a measurement revolution that is transforming science. In the life sciences, data analysis is now part of practically every research project. Genomics, in particular, is being driven by new measurement technologies that permit us to observe certain molecular entities for the first time. These observations are leading to discoveries analogous to identifying microorganisms and other breakthroughs permitted by the invention of the microscope. Choice examples of these technologies are microarrays and next generation sequencing. This book will cover several of the statistical concepts and data analytic skills needed to succeed in data-driven life science research. We go from relatively basic concepts related to computing p-values to advanced topics related to analyzing high-throughput data. While statistics textbooks focus on mathematics, this book focuses on using a computer to perform data analysis. Instead of explaining the mathematics and theory, and then showing examples, we start by stating a practical data-related challenge. This book also includes the computer code that provides a solution to the problem and helps illustrate the concepts behind the solution. By running the code yourself, and seeing data generation and analysis happen live, you will get a better intuition for the concepts, the mathematics, and the theory. The book was created using the R markdown language and we make all this code available to the reade
Read more…
English [en] · EPUB · 16.3MB · 2021 · 📘 Book (non-fiction) · 🚀/lgli/lgrs/nexusstc/zlib · Save
base score: 11065.0, final score: 167509.73
lgli/Introduction_to_Algorithms.epub
Introduction to Algorithms: A Comprehensive Guide for Beginners: Unlocking Computational Thinking (for Raymond Rhine) Miguel Gonzalez Independently Published, 2024
Now you have access to our eLearning Platform which includes ✅ Free Repository Code with all code blocks used in this book.✅ Access to Free Chapters of all our library of programming published books.✅ Free premium customer support.✅ Much more... Unlock the world of algorithms and discover how to harness their power to solve complex problems with "Introduction to Algorithms: A Comprehensive Guide for Beginners". This immersive guide reveals the importance of algorithms and how they function in our daily digital lives. Is this book for me? Whether you are a beginner to computer science, a student delving into data analysis, a professional aiming to elevate their problem-solving skills, or simply a curious learner fascinated by logic and patterns, this book is for you. As it takes you on a journey through various types of algorithms, their applications, and how to implement them efficiently, it demystifies the often intimidating world of algorithmic thinking. This book starts with the basics, gradually escalating complexity with each chapter. You'll first understand what algorithms are and why they are essential. As you progress, you will explore different types of algorithms, their strengths, weaknesses, and the contexts where they shine. With engaging real-world applications, this book demonstrates how these robust tools are utilized in diverse fields such as computer science, data analysis, artificial intelligence, and more.
Read more…
English [en] · EPUB · 6.8MB · 2024 · 📘 Book (non-fiction) · 🚀/lgli/lgrs/zlib · Save
base score: 11065.0, final score: 167509.73
nexusstc/7 Algorithm Design Paradigms/6287e073b1abd85f2f9f22ae13e4bb6a.pdf
7 Algorithm Design Paradigms Sung-Hyuk Cha
The intended readership includes both undergraduate and graduate students majoring in computer science as well as researchers in the computer science area. The book is suitable either as a textbook or as a supplementary book in algorithm courses. Over 400 computational problems are covered with various algorithms to tackle them. Rather than providing students simply with the best known algorithm for a problem, this book presents various algorithms for readers to master various algorithm design paradigms. Beginners in computer science can train their algorithm design skills via trivial algorithms on elementary problem examples. Graduate students can test their abilities to apply the algorithm design paradigms to devise an efficient algorithm for intermediate-level or challenging problems. Key Features: Dictionary of computational problems: A table of over 400 computational problems with more than 1500 algorithms is provided. Indices and Hyperlinks: Algorithms, computational problems, equations, figures, lemmas, properties, tables, and theorems are indexed with unique identification numbers and page numbers in the printed book and hyperlinked in the e-book version. Extensive Figures: Over 435 figures illustrate the algorithms and describe computational problems. Comprehensive exercises: More than 352 exercises help students to improve their algorithm design and analysis skills. The answers for most questions are available in the accompanying solution manual.
Read more…
English [en] · PDF · 21.4MB · 📘 Book (non-fiction) · 🚀/lgli/lgrs/nexusstc/zlib · Save
base score: 11061.0, final score: 167509.73
lgli/D:\!Genesis\!!ForLG\1991178Цифровые водяные знаки\book\Farid - Fundamentals of Image Processing.pdf
Fundamentals of Image Processing Farid
English [en] · PDF · 1.4MB · 📘 Book (non-fiction) · 🚀/lgli/lgrs/nexusstc/zlib · Save
base score: 11058.0, final score: 167509.73
Your ad here.
nexusstc/Data Structures and Algorithms Made Easy: Data Structures and Algorithmic Puzzles/8dd78fcd0dc2a5f2f837c7eda3b081ac.epub
Data Structures and Algorithms Made Easy: Data Structures and Algorithmic Puzzles Narasimha Karumanchi 2017
Peeling Data Structures and Algorithms: Table of Contents: goo.gl/JFMgiU Sample Chapter: goo.gl/n2Hk4i Found Issue? goo.gl/forms/4Gt72YO81I Videos: goo.gl/BcHq74 "Data Structures And Algorithms Made Easy: Data Structures and Algorithmic Puzzles" is a book that offers solutions to complex data structures and algorithms. There are multiple solutions for each problem and the book is coded in C/C++, it comes handy as an interview and exam guide for computer scientists. A handy guide of sorts for any computer science professional, Data Structures And Algorithms Made Easy: Data Structures and Algorithmic Puzzles is a solution bank for various complex problems related to data structures and algorithms. It can be used as a reference manual by those readers in the computer science industry. This book serves as guide to prepare for interviews, exams, and campus work. In short, this book offers solutions to various complex data structures and algorithmic problems.
Read more…
English [en] · EPUB · 58.7MB · 2017 · 📘 Book (non-fiction) · 🚀/lgli/lgrs/nexusstc/zlib · Save
base score: 11063.0, final score: 167509.73
lgli/D:\!genesis\library.nu\8e\_218533.8ef87e885e74e972bbfa417ae5cee510.pdf
Advanced Topics in Database Research, Vol. 1 Keng Siau
English [en] · PDF · 4.7MB · 📘 Book (non-fiction) · 🚀/lgli/lgrs/nexusstc/zlib · Save
base score: 11058.0, final score: 167509.73
nexusstc/Instructor’s Manual for Introduction to Algorithms Third Edition/abaa82d924873411f9169cb260a880c6.pdf
Instructor’s Manual to Accompany Introduction to Algorithms Third Edition Thomas H. Cormen MIT Press, 3rd, 3, 2009
English [en] · PDF · 2.2MB · 2009 · 📘 Book (non-fiction) · 🚀/lgli/lgrs/nexusstc/zlib · Save
base score: 11062.0, final score: 167509.73
upload/newsarch_ebooks_2025_10/2022/10/10/B07NC8KRZL.epub
PHP Tutorials - Herong's Tutorial Examples Yang, Herong HerongYang.com, 2019
This PHP tutorial book is a collection of notes and sample codes written by the author while he was learning PHP himself. Topics include PHP script syntax; data types, variables, array, expressions, statements and functions; Web server integration; HTTP requests and controlling HTTP responses; sessions, cookies, and file uploads/downloads; MySQL database server access; files, directories, and ZIP archives; parsing HTML Documents; processing image files; SOAP extension; managing non-ASCII characters; classes and objects; using PHP on Windows, macOS and Linux; executing external programs on operating system. Updated in 2022 (Version v5.16) with minor changes. For latest updates and free sample chapters, visit https://www.herongyang.com/PHP. COMPUTERS / Programming / General
Read more…
English [en] · EPUB · 0.6MB · 2019 · 📘 Book (non-fiction) · 🚀/nexusstc/upload/zlib · Save
base score: 11055.0, final score: 167509.73
upload/newsarch_ebooks_2025_10/2023/04/15/9791222093178.epub
Introduction to Algorithms and Data Structures 1: A solid foundation for the real world of machine learning and data analytics Bolakale Aremu Ojula Technology Innovations, 2023
Learning algorithms and data structures from this book will help you become a better programmer. Algorithms and data structures will make you think more logically. Furthermore, they can help you design better systems for storing and processing data. They also serve as a tool for optimization and problem-solving.As a result, the concepts of algorithms and data structures are very valuable in any field. For example, you can use them when building a web app or writing software for other devices. You can apply them to machine learning and data analytics, which are two hot areas right now. If you are a hacker, algorithms and data structures in Python are also important for you everywhere.Now, whatever your preferred learning style, I've got you covered. If you're a visual learner, you'll love my clear diagrams and illustrations throughout this book. If you're a practical learner, you'll love my hands-on lessons so that you can get practical with algorithms and data structures and learn in a hands-on way.Course StructureThere are three volumes in this course. This is volume one. In this volume, you'll take a deep dive into the world of algorithms. With increasing frequency, algorithms are starting to shape our lives in many ways - from the products recommended to us, to the friends we interact with on social media, to even important social issues like policing, privacy and healthcare. So, the first part of this course covers what algorithms are, how they work, and where they can be found (real life applications).In the second volume, you'll work through an introduction to data structures. You're going to learn about two introductory data structures - arrays and linked lists. You'll look at common operations and how the runtimes of these operations affect our everyday code.In the third volume, you're going to bring your knowledge of algorithms and data structures together to solve the problem of sorting data using the Merge Sort algorithm. In this volume, we will look at...
Read more…
English [en] · EPUB · 1.5MB · 2023 · 📘 Book (non-fiction) · 🚀/upload/zlib · Save
base score: 11065.0, final score: 167509.73
Your ad here.
nexusstc/Algorithmic Problem Solving (2007)/0f1041538f242118735d0caeb888f22b.pdf
Algorithmic Problem Solving (2007) Roland Backhouse 2007, 2007
Algorithmic Problem Solving by Roland Backhouse. 2007 edition (latest edition is 2011).
Read more…
English [en] · PDF · 1.0MB · 2007 · 📘 Book (non-fiction) · 🚀/lgli/lgrs/nexusstc/zlib · Save
base score: 11058.0, final score: 167509.73
lgli/DVD-017/Freitas_A.A._A_Survey_of_Evolutionary_Algorithms_for_Data_Mining_and_Knowledge_Discovery(en)(27s).pdf
A Survey of Evolutionary Algorithms for Data Mining and Knowledge Discovery Freitas A.A.
This chapter discusses the use of evolutionary algorithms, particularly genetic algorithms and genetic programming, in data mining and knowledge discovery. We focus on the data mining task of classification. In addition, we discuss some preprocessing and postprocessing steps of the knowledge discovery process, focusing on attribute selection and pruning of an ensemble of classifiers. We show how the requirements of data mining and knowledge discovery influence the design of evolutionary algorithms. In particular, we discuss how individual representation, genetic operators and fitness functions have to be adapted for extracting high-level knowledge from data.
Read more…
English [en] · PDF · 0.2MB · 📘 Book (non-fiction) · 🚀/lgli/lgrs/nexusstc/zlib · Save
base score: 11051.0, final score: 167509.73
lgli/F:\twirpx\_19\_9\1866438\databricks_using_apache_spark.pdf
Databricks. Using Apache Spark
Мануал от компании Databricks по использованию Apache Spark. Introduction Log Analysis with Spark Introduction to Apache Spark Importing Data Exporting Data Log Analyzer Application Twitter Streaming Language Classifier Collect a Dataset of Tweets Examine the Tweets and Train a Model Apply the Model in Real-time
Read more…
English [en] · PDF · 0.6MB · 📘 Book (non-fiction) · 🚀/lgli/lgrs/nexusstc/zlib · Save
base score: 11049.0, final score: 167509.73
lgli/978-3-98547-570-4.pdf
On Efficient Algorithms for Computing Near-Best Polynomial Approximations to High-Dimensional, Hilbert-Valued Functions from Limited Samples Ben Adcock & Simone Brugiapaglia & Nick Dexter & Sebastian Moraga American Mathematical Society, MEMS, 13, 2024
Sparse polynomial approximation is an important tool for approximating high-dimensional functions from limited samples – a task commonly arising in computational science and engineering. Yet, it lacks a complete theory. There is a well-developed theory of best s-term polynomial approximation, which asserts exponential or algebraic rates of convergence for holomorphic functions. There are also increasingly mature methods such as (weighted) l1-minimization for practically computing such approximations. However, whether these methods achieve the rates of the best s-term approximation is not fully understood. Moreover, these methods are not algorithms per se, since they involve exact minimizers of nonlinear optimization problems. This paper closes these gaps by affirmatively answering the following question: are there robust, efficient algorithms for computing sparse polynomial approximations to finite- or infinite-dimensional, holomorphic and Hilbert-valued functions from limited samples that achieve the same rates as the best s-term approximation? We do so by introducing algorithms with exponential or algebraic convergence rates that are also robust to sampling, algorithmic and physical discretization errors. Our results involve several developments of existing techniques, including a new restarted primal-dual iteration for solving weighted l1-minimization problems in Hilbert spaces. Our theory is supplemented by numerical experiments demonstrating the efficacy of these algorithms.
Read more…
English [en] · PDF · 1.7MB · 2024 · 📘 Book (non-fiction) · 🚀/lgli/zlib · Save
base score: 11068.0, final score: 167509.73
nexusstc/Lecture Notes on Algorithm Analysis and Computational Complexity (Fourth Edition)/d2c7cf5420d709ff42ba16ece1b3cea0.pdf
Lecture Notes on Algorithm Analysis and Computational Complexity (Fourth Edition) Ian Parberry
Cover Page......Page 1 Preface......Page 2 Discrete......Page 0 1. Introduction......Page 4 2. Induction......Page 8 3. Correctness......Page 13 4. Analysis 1......Page 18 Heaps......Page 23 6. Analysis 3......Page 29 Maxmin......Page 34 Quicksort......Page 39 Selection......Page 44 10. Dynamic Programming 1......Page 49 Iterated Matrix Product......Page 54 Binary Search Trees......Page 60 13. Dynamic Programming 4......Page 65 Optimal Tape Storage......Page 71 Dijkstra's Algorithm......Page 76 Union-find Problem......Page 82 Bit strings......Page 89 Permutations......Page 94 Combinations......Page 99 Backtracking......Page 104 21. NP completeness 1......Page 108 3SAT......Page 114 Bubblesort......Page 21 NP-completeness......Page 115 Floyd's Algorithm......Page 66 Backtracking......Page 91 k-ary Strings......Page 90 Heapsort......Page 27 Vertex Cover......Page 117 Backtracking......Page 105 Continuous......Page 72 Dynamic Programming......Page 51 Kruskal's Algorithm......Page 87 Min-cost Spanning Trees......Page 84 Multiplication (shift-and-add)......Page 16 Multiplication (divide-and-conquer)......Page 36 Optimal Binary Search Trees......Page 62 Peaceful Queens......Page 96 Prim's Algorithm......Page 86 Ramsey Numbers......Page 106 Satisfiability Problem (SAT)......Page 112 Strassen's Algorithm......Page 37 Towers of Hanoi......Page 46 Travelling Salesperson......Page 92 Warshall's Algorithm......Page 67
Read more…
English [en] · PDF · 0.8MB · 📘 Book (non-fiction) · 🚀/lgli/lgrs/nexusstc/zlib · Save
base score: 11056.0, final score: 167509.73
Your ad here.
nexusstc/Competitive Programming 3: The New Lower Bound of Programming Contests/eabccec887295e5da350302deca61d7c.pdf
Competitive Programming 3: The New Lower Bound of Programming Contests Steven Halim 1, 3, 2013
This book contains a collection of relevant data structures, algorithms, and programming tips written for University students who want to be more competitive in the ACM International Collegiate Programming Contest (ICPC), high school students who are aspiring to be competitive in the International Olympiad in Informatics (IOI), coaches for these competitions, those who love problem solving using computer programs, and those who go for interviews in big IT-companies.
Read more…
English [en] · PDF · 4.9MB · 2013 · 📘 Book (non-fiction) · 🚀/lgli/lgrs/nexusstc/zlib · Save
base score: 11063.0, final score: 167509.73
Previous 1 2 3 … 5 6 7 8 9 10 Next
Previous 1 2 … 5 6 7 … 10 Next
Anna’s Archive
Home
Search
Donate
🧬 SciDB
FAQ
Account
Log in / Register
Account
Public profile
Downloaded files
My donations
Referrals
Explore
Activity
Codes Explorer
ISBN Visualization ↗
Community Projects ↗
Open data
Datasets
Torrents
LLM data
Stay in touch
Contact email
Anna’s Blog ↗
Reddit ↗
Matrix ↗
Help out
Improve metadata
Volunteering & Bounties
Translate ↗
Development
Anna’s Software ↗
Security
DMCA / copyright claims
Alternatives
annas-archive.li ↗
annas-archive.se ↗
annas-archive.org ↗
SLUM [unaffiliated] ↗
SLUM 2 [unaffiliated] ↗