Algorithms and data structures Books

992 products


  • Bonnier Books Ltd Filterworld: How Algorithms Flattened Culture

    Out of stock

    Book Synopsis'The story told here is instrumental to your own' - Jared Lanier 'Timely, erudite, important' - Ayad Akhtar What happens when our cultural and artistic lives are dictated to us by an algorithm? What does it mean when shareability supersedes innovation? How can we make a choice when the options have been so carefully arranged for us? From coffee shops to city grids to TikTok feeds and Netflix homepages the world over, algorithmic recommendations prescribe our experiences. This network of mathematically determined choices - the 'Filterworld' - has taken over, almost unnoticed, as we've grown accustomed to an insipid new normal. But to have our tastes, behaviours, and emotions governed by computers calls the very notion of free will into question. Internationally recognized journalist and New Yorker staff writer Kyle Chayka journeys through this ever-tightening web woven by algorithms. He explores how online and offline spaces alike have been engineered for seamless consumption. How the lowest common denominator is promoted at the expense of the complex, diverse or challenging. How users of technology contend with data-driven equations that promise to anticipate their desires but often get them wrong. How the FIlterworld is determining the very shape of culture itself. Chayka skilfully and compellingly traces this creeping, machine-guided curation that influences not just what culture we consume, but what culture is produced. In doing so, he attempts to answer to the most urgent question currently facing us: is personal freedom ever again possible on the Internet?Filterworld is a fascinating history of the rise of the algorithm and an important investigation into where it could take us next - if we let it.Trade Review'Necessary reading for anyone who has wondered just how, in expanding our world, the internet has ended up emptying our experience of it. [...] Timely, erudite, important.' -- Ayad Akhtar, Pulitzer Prize winner and author of Homeland Elegies'Kyle Chayka is a vital observer of how digital technology shapes our culture, and Filterworld will change how you think about the internet. In his invigorating new book, Chayka demonstrates how everything from movies to music, design, media, and travel is at the mercy of algorithms.' -- Ben Smith, author of Traffic: Genius, Rivalry, and Delusion in the Billion-Dollar Race to Go Viral'Filterworld is a vital interrogation of algorithmic technology and its unrelenting power in shaping both our online and offline experiences. Chayka deftly explains how today's social media ecosystem operates and, more importantly, reveals a way out of the ever-tightening grip of this stifling digital filtration. [...] Filterworld is required reading for anyone who uses the Internet.' -- Taylor Lorenz, author of Extremely Online...'Filterworld skillfully interrogates how the giant project of measuring humanity using the internet turned into an unfortunate modification of humanity. The story told here is instrumental to your own, even if you do not realize it.' -- Jaron Lanier, author of Dawn of the New Everything and The Father of Virtual Reality'An essential book for anyone questioning if their phones are "listening" to them.' * i-D *'The promise of the Internet is that it is boundless, full of original content and unique cultural connections. So why does everything look, sound and feel the same? Kyle Chayka's insightful and timely book explains how big tech's algorithms have homogenized our experiences for profit, and too often left us poorer for it.' -- James Griffiths, author of The Great Firewall of China and Speak Not'Filterworld incisively diagnoses a problem that I've long felt but struggled to name and is the most convincing explanation I've encountered for why so many of our cultural products carry an uncanny whiff of familiarity. Amidst cheers for the death of the monoculture, Chayka offers a sharp and necessary counterpoint, demonstrating how mass culture, even as it diffuses into niche datastreams, trends toward a vacuous mean.' -- Meghan O’Gieblyn, author of God, Human, Animal, Machine

    Out of stock

    £20.90

  • Skew PBW Extensions: Ring and Module-theoretic

    Springer Nature Switzerland AG Skew PBW Extensions: Ring and Module-theoretic

    Out of stock

    Book SynopsisThis monograph is devoted to a new class of non-commutative rings, skew Poincaré–Birkhoff–Witt (PBW) extensions. Beginning with the basic definitions and ring-module theoretic/homological properties, it goes on to investigate finitely generated projective modules over skew PBW extensions from a matrix point of view. To make this theory constructive, the theory of Gröbner bases of left (right) ideals and modules for bijective skew PBW extensions is developed. For example, syzygies and the Ext and Tor modules over these rings are computed. Finally, applications to some key topics in the noncommutative algebraic geometry of quantum algebras are given, including an investigation of semi-graded Koszul algebras and semi-graded Artin–Schelter regular algebras, and the noncommutative Zariski cancellation problem. The book is addressed to researchers in noncommutative algebra and algebraic geometry as well as to graduate students and advanced undergraduate students.Trade Review“The text under review attempts to summarize the breadth of research on skew PBW extensions since that initial paper. … Readers familiar with the area of skew PBW extensions may find this book a convenient reference.” (Jason Gaddis, Mathematical Reviews, June, 2023)“This very well-written book … . there are a few new techniques and approaches in the book via which the authors attack successfully the proofs of some classical results from this branch. Besides, certain innovations in the presentation of some specific moments in the subject are also demonstrated.” (Peter Danchev, zbMATH 1489.16002, 2022)Table of ContentsPreface.- I Ring and Module-Theoretic Properties of Skew PBW Extensions.- II Projective Modules Over Skew PBW Extensions.- III Matrix and Gröbner Methods for Skew PBW Extensions.- IV Applications: The Noncommutative AlgebraicGeometry of Skew PBW Extensions.- References.

    Out of stock

    £999.99

  • Modern Optimization with R

    Springer Nature Switzerland AG Modern Optimization with R

    Out of stock

    Book SynopsisThe goal of this book is to gather in a single work the most relevant concepts related in optimization methods, showing how such theories and methods can be addressed using the open source, multi-platform R tool. Modern optimization methods, also known as metaheuristics, are particularly useful for solving complex problems for which no specialized optimization algorithm has been developed. These methods often yield high quality solutions with a more reasonable use of computational resources (e.g. memory and processing effort). Examples of popular modern methods discussed in this book are: simulated annealing; tabu search; genetic algorithms; differential evolution; and particle swarm optimization. This book is suitable for undergraduate and graduate students in computer science, information technology, and related areas, as well as data analysts interested in exploring modern optimization methods using R.This new edition integrates the latest R packages through text and code examples. It also discusses new topics, such as: the impact of artificial intelligence and business analytics in modern optimization tasks; the creation of interactive Web applications; usage of parallel computing; and more modern optimization algorithms (e.g., iterated racing, ant colony optimization, grammatical evolution). Table of ContentsChapter 1. introduction.- Chapter 2. R. Basics.- Chapter 3. Blind Search.- Chapter 4. Local Search.- Chapter 5. Population Based Search.- Chapter 6. Multi-Object Optimization.

    Out of stock

    £999.99

  • Annalyn Ng & Kenneth Soo Numsense! Data Science for the Layman: No Math

    15 in stock

    Book Synopsis

    15 in stock

    £20.40

  • Modern Deep Learning for Tabular Data

    APress Modern Deep Learning for Tabular Data

    1 in stock

    Book SynopsisDeep learning is one of the most powerful tools in the modern artificial intelligence landscape. While having been predominantly applied to highly specialized image, text, and signal datasets, this book synthesizes and presents novel deep learning approaches to a seemingly unlikely domain - tabular data. Whether for finance, business, security, medicine, or countless other domain, deep learning can help mine and model complex patterns in tabular data - an incredibly ubiquitous form of structured data.Part I of the book offers a rigorous overview of machine learning principles, algorithms, and implementation skills relevant to holistically modeling and manipulating tabular data. Part II studies five dominant deep learning model designs - Artificial Neural Networks, Convolutional Neural Networks, Recurrent Neural Networks, Attention and Transformers, and Tree-Rooted Networks - through both their ''default'' usage and their application to tabular data. Part III compounds the powTable of Contents○ Section 1: Machine Learning and Tabular Data ■ Chapter 1 – Introduction to Machine Learning ■ Chapter 2 – Data Tools ○ Section 2: Applied Deep Learning Architectures ■ Chapter 3 – Artificial Neural Networks ■ Chapter 4 – Convolutional Neural Networks ■ Chapter 5 – Recurrent Neural Networks ■ Chapter 6 – Attention Mechanism ■ Chapter 7 – Tree-based Neural Networks ○ Section 3: Deep Learning Design and Tools ■ Chapter 8 – Autoencoders ■ Chapter 9 – Data Generation ■ Chapter 10 – Meta-optimization ■ Chapter 11 – Multi-model arrangement ■ Chapter 12 – Deep Learning Interpretability ○ Appendix A

    1 in stock

    £41.24

  • Practical Business Analytics Using R and Python

    APress Practical Business Analytics Using R and Python

    Out of stock

    Book SynopsisThis book illustrates how data can be useful in solving business problems. It explores various analytics techniques for using data to discover hidden patterns and relationships, predict future outcomes, optimize efficiency and improve the performance of organizations. You''ll learn how to analyze data by applying concepts of statistics, probability theory, and linear algebra. In this new edition, both R and Python are used to demonstrate these analyses. Practical Business Analytics Using R and Python also features new chapters covering databases, SQL, Neural networks, Text Analytics, and Natural Language Processing.Part one begins with an introduction to analytics, the foundations required to perform data analytics, and explains different analytics terms and concepts such as databases and SQL, basic statistics, probability theory, and data exploration. Part two introduces predictive models using statistical machine learning and discusses concepts like regression, classifiTable of ContentsSection 1: Introduction to AnalyticsIn this section, we discuss the necessary foundations required to perform data analytics. We discuss different analytics terms, basics statistics and probability theory, descriptive statistics including various plots, and various measures for evaluating your predictive models. Chapter 1: Business Analytics RevolutionChapter 2: Foundations of Business AnalyticsChapter 3: Structured Query Language (SQL) AnalyticsChapter 4: Business Analytics Process Chapter 5: Exploratory Data Analysis (EDA)Chapter 6: Evaluating Analytics Model PerformanceSection II: Supervised Learning and Predictive AnalyticsIn this section, we introduce statistical learning models and machine learning models. We present various regression analysis and classification analysis. We also discuss logistic regression and end our discussion by introducing Neural Network and gradient descent algorithms. Chapter 7: Simple Linear RegressionsChapter 8: Multiple Linear RegressionsChapter 9: ClassificationChapter 10: Neural NetworksChapter 11: Logistic RegressionSection III: Time series modelsIn this section, we introduce optimization models and Time series analysis. In time series, we discuss different forecasting models, and in optimization models, we introduce both linear and non-linear optimization models.Chapter 12: Time Series – ForecastingSection IV: Unsupervised model and Text MiningIn this section, we discuss two popular unsupervised models - cluster analysis and relationship data mining techniques. Finally, we end this section by introducing text mining and NLP and briefly introducing big data. Chapter 13: Cluster AnalysisChapter 14: Relationship Data MiningChapter 15: Mining Text and Text Analytics Chapter 16: Big Data and Big Data AnalyticsSection V: Business Analytics ToolsThis is the last part. In this section we This section summarizes what we have learned in the earlier section by working on some case studies. We work on practical cases using public datasets using both ‘R’ and ‘Python’.Chapter 17: R programming for AnalyticsChapter 18: Python Programming for Analytics

    Out of stock

    £41.24

  • Architecture of Advanced Numerical Analysis

    APress Architecture of Advanced Numerical Analysis

    1 in stock

    Book SynopsisThis unique open access book applies the functional OCaml programming language to numerical or computational weighted data science, engineering, and scientific applications. This book is based on the authors' first-hand experience building and maintaining Owl, an OCaml-based numerical computing library.You'll first learn the various components in a modern numerical computation library. Then, you will learn how these components are designed and built up and how to optimize their performance. After reading and using this book, you'll have the knowledge required to design and build real-world complex systems that effectively leverage the advantages of the OCaml functional programming language. What You Will LearnOptimize core operations based on N-dimensional arraysDesign and implement an industry-level algorithmic differentiation moduleImplement mathematical optimization, regression, and deep neural network functionalities based on algorithmic differentiationDesign and optimize a compTable of ContentsPrologueA Brief HistoryReductionism vs. HolismKey FeaturesContact MePART 1: NUMERICAL TECHNIQUES1. IntroductionWhat Is Scientific ComputingWhat is Functional ProgrammingWho Is This Book ForStructure of the BookInstallationOption 1: Install from OPAMOption 2: Pull from Docker HubOption 3: Pin the Dev-RepoOption 4: Compile from SourceCBLAS/LAPACKE DependencyInteracting with OwlUsing ToplevelUsing NotebookUsing Owl-JupyterSummary2. ConventionsPure vs. ImpureNdarray vs. ScalarInfix OperatorsOperator ExtensionModule StructuresNumber and PrecisionPolymorphic FunctionsModule ShortcutsType Casting3. VisualisationCreate PlotsSpecificationSubplotsMultiple LinesLegendDrawing PatternsLine PlotScatter PlotStairs PlotBox PlotStem PlotArea PlotHistogram & CDF PlotLog Plot3D PlotAdvanced Statistical PlotSummaryReferences4. Mathematical FunctionsBasic FunctionsBasic Unary Math FunctionsBasic Binary FunctionsExponential and Logarithmic FunctionsTrigonometric FunctionsOther Math FunctionsSpecial FunctionsAiry FunctionsBessel FunctionsElliptic FunctionsGamma FunctionsBeta FunctionsStruve FunctionsZeta FunctionsError FunctionsIntegral FunctionsFactorialsInterpolation and ExtrapolationIntegrationUtility FunctionsSummary5. Statistical FunctionsRandom VariablesDiscrete Random VariablesContinuous Random VariablesDescriptive StatisticsOrder StatisticsSpecial DistributionGamma DistributionBeta DistributionChi-Square DistributionStudent-t DistributionCauchy DistributionMultiple VariablesSamplingHypothesis TestsTheoryGaussian Distribution in Hypothesis TestingTwo-Sample InferencesGoodness-of-fit TestsNon-parametric StatisticsCovariance and CorrelationsAnalysis of VarianceSummary6. N-Dimensional ArraysNdarray TypesCreation FunctionsProperties FunctionsMap FunctionsFold FunctionsScan FunctionsComparison FunctionsVectorised FunctionsIteration FunctionsManipulation FunctionsSerialisationTensorsSummaryReferences7. Slicing and BroadcastingSlicingBasic SlicingFancy SlicingConventions in DefinitionExtended OperatorsAdvanced UsageBroadcastingWhat Is Broadcasting?Shape ConstraintsSupported OperationsSlicing in NumPy and JuliaInternal MechanismSummary8. Linear AlgebraVectors and MatricesCreating MatricesAccessing ElementsIterate, Map, Fold, and FilterMath OperationsGaussian EliminationLU FactorisationInverse and TransposeVector SpacesRank and BasisOrthogonalitySolving Ax = bMatrix SensitivityDeterminantsEigenvalues and EigenvectorsSolving Ax=λ xComplex MatricesSimilarity Transformation and DiagonalisationPositive Definite MatricesPositive DefinitenessSingular Value DecompositionInternal: CBLAS and LAPACKELow-level Interface to CBLAS & LAPACKESparse MatricesSummaryReferences9. Ordinary Differential EquationsWhat Is An ODEExact SolutionsLinear SystemsSolving An ODE NumericallyOwl-ODEExample: Linear Oscillator SystemSolver StructureSymplectic SolversFeatures and LimitsExamples of using Owl-ODEExplicit ODETwo Body ProblemLorenz AttractorDamped OscillationStiffnessSolve Non-Stiff ODEsSolve Stiff ODEsSummaryReferences10. Signal ProcessingDiscrete Fourier TransformFast Fourier TransformExamplesApplications of FFTFind period of sunspotsDecipher the ToneImage ProcessingFilteringExample: SmoothingGaussian FilterSignal ConvolutionFFT and Image ConvolutionSummaryReferences11. Algorithmic DifferentiationChain RuleDifferentiation MethodsHow Algorithmic Differentiation WorksForward ModeReverse ModeForward or Reverse?A Strawman AD EngineSimple Forward ImplementationSimple Reverse ImplementationUnified ImplementationsForward and Reverse Propagation APIExpressing ComputationExample: Forward ModeExample: Reverse ModeHigh-Level APIsDerivative and GradientJacobianHessian and LaplacianOther APIsInternal of Algorithmic DifferentiationGo Beyond Simple ImplementationExtend AD moduleLazy EvaluationSummaryReferences12. OptimisationIntroductionRoot FindingUnivariate Function OptimisationUse DerivativesGolden Section SearchMultivariate Function OptimisationNelder-Mead Simplex MethodGradient Descent MethodsConjugate Gradient MethodNewton and Quasi-Newton MethodsGlobal Optimisation and Constrained OptimisationSummaryReferences13. RegressionLinear RegressionProblem: Where to locate a new McDonald’s restaurant?Cost FunctionSolving Problem with Gradient DescentMultiple RegressionFeature NormalisationAnalytical SolutionNon-linear regressionsRegularisationOls, Ridge, Lasso, and Elastic_netLogistic RegressionSigmoid FunctionCost FunctionExampleMulti-class classificationSupport Vector MachineKernel and Non-linear BoundaryExampleModel error and selectionError MetricsModel SelectionSummaryReferences14. Deep Neural NetworksPerceptronYet Another RegressionModel RepresentationForward PropagationBack propagationFeed Forward NetworkLayersActivation FunctionsInitialisationTrainingTestNeural Network ModuleModule StructureNeuronsNeural GraphTraining ParametersConvolutional Neural NetworkRecurrent Neural NetworkLong Short Term Memory (LSTM)Generative Adversarial NetworkSummaryReferences15. Natural Language ProcessingIntroductionText CorpusStep-by-step OperationUse the Corpus ModuleVector Space ModelsBag of Words (BOW)Term Frequency–Inverse Document Frequency (TF-IDF)Latent Dirichlet Allocation (LDA)ModelsDirichlet DistributionGibbs SamplingTopic Modelling ExampleLatent Semantic Analysis (LSA)Search Relevant DocumentsEuclidean and Cosine SimilarityLinear SearchingSummaryReferences16. Dataframe for Tabular DataBasic ConceptsCreate FramesManipulate FramesQuery FramesIterate, Map, and FilterRead/Write CSV FilesInfer Type and SeparatorSummary17. Symbolic RepresentationIntroductionDesignCore abstractionEnginesONNX EngineExample 1: Basic operationsExample 2: Variable InitialisationExample 3: Neural networkLaTeX EngineOwl EngineSummary18. Probabilistic ProgrammingGenerative Model vs Discriminative ModelBayesian NetworksSampling TechniquesInferencePART 2: SYSTEM ARCHITECTURE19. Architecture OverviewIntroductionArchitecture OverviewCore ImplementationN-dimensional ArrayInterfaced LibrariesAdvanced FunctionalityComputation GraphAlgorithmic DifferentiationRegressionNeural NetworkParallel ComputingActor EngineGPU ComputingOpenMPCommunity-Driven R&DSummary20. Core OptimisationBackgroundNumerical LibrariesOptimisation of Numerical ComputationInterfacing to C CodeNdarray OperationsFrom OCaml to COptimisation TechniquesMap OperationsConvolution OperationsReduction OperationsRepeat OperationsSummaryReferences21. Automatic Empirical TuningWhat is Parameter TuningWhy Parameter Tuning in OwlHow to Tune OpenMP ParametersMake a DifferenceSummary22. Computation GraphIntroductionWhat is a Computation Graph?From Dynamic to StaticSignificance in ComputingExamplesExample 01: Basic CGraphExample 02: CGraph with ADExample 03: CGraph with DNNDesign RationaleOptimisation of CGraphOptimising memory with pebblesAllocation AlgorithmAs Intermediate RepresentationsSummary23. Scripting and Zoo SystemIntroductionShare Script with ZooTypical ScenarioCreate a ScriptShare via GistImport in Another ScriptSelect a Specific VersionCommand Line ToolMore ExamplesSystem DesignServicesType CheckingBackendDomain Specific LanguageService DiscoveryUse CaseSummaryReferences24. Compiler BackendsBase LibraryBackend: JavaScriptUse Native OCamlUse Facebook ReasonBackend: MirageOSMirageOS and UnikernelExample: Gradient DescentExample: Neural NetworkEvaluationSummary25. Distributed ComputingActor SystemDesignActor EnginesMap-Reduce EngineParameter Server EnginePeer-to-Peer EngineClassic Synchronise ParallelBulk Synchronous ParallelAsynchronous ParallelStale Synchronous ParallelProbabilistic Synchronise ParallelBasic idea: samplingCompatibilityBarrier Trade-off DimensionsConvergenceA Distributed Training ExampleStep ProgressAccuracySummaryReferences26. Testing FrameworkUnit TestExampleWhat Could Go WrongCorner CasesTest CoverageUse FunctorSummary27. Constants and Metric SystemWhat Is a Metric SystemFour Metric SystemsSI PrefixExample: Physics and Math constantsInternational System of UnitsTimeLengthAreaVolumeSpeedMassForceEnergyPowerPressureViscosityLuminanceRadioactivity28. Internal Utility ModulesDataset ModuleMNISTCIFAR-10Graph ModuleStack and Heap ModulesCount-Min SketchSummaryPART 3: CASE STUDIES29. Case - Image RecognitionBackgroundLeNetAlexNetVGGResNetSqueezeNetCapsule NetworkBuilding InceptionV3 NetworkInceptionV1 and InceptionV2FactorisationGrid Size ReductionInceptionV3 ArchitecturePreparing WeightsProcessing ImageRunning InferenceApplicationsSummaryReferences30. Case - Instance SegmentationIntroductionMask R-CNN NetworkBuilding Mask R-CNNFeature ExtractorProposal GenerationClassificationRun the CodeSummaryReferences31. Case - Neural Style TransferContent and StyleContent ReconstructionStyle RecreationCombining Content and StyleRunning NSTExtending NSTFast Style TransferBuilding FST NetworkRunning FSTSummaryReferences32. Case - Recommender SystemIntroductionArchitectureBuild Topic ModelsIndex Text CorpusRandom ProjectionOptimising Vector StorageOptimise Data StructureOptimise Index AlgorithmSearch ArticlesCode ImplementationMake It LiveSummaryReferences33. Case - Applications in FinanceIntroductionBond PricingBlack-Scholes ModelMathematical ModelOption PricingPortfolio OptimisationMathematical ModelEfficient FrontierMaximise Sharpe Ratio

    1 in stock

    £33.74

  • Make Your Data Speak

    APress Make Your Data Speak

    1 in stock

    Book SynopsisTable of ContentsIntroduction. Three stories that made me write this bookChapter 1. Data preparation 1.1 Analyzing and transforming the original data 1.2 Preparing the basis for a dashboard 1.3 Making data samples for visualizations 1.4. Setting up an interactivity 1.5. Summary and conclusions of the chapter, quick tricks Chapter 2. Dashboard assembling 2.1 Assembling a dashboard according to the layout 2.2 Creating KPI cards 2.3 Aligning a dashboard, adding a header 2.4 Summary and conclusions of the chapter, quick tricks Chapter 3. Anatomy of diagrams 3.1 Analyzing ready-made design styles 3.2 Setting up data labels 3.3 Working with the text: remove the excess, add the necessary 3.4 Designing bar charts 3.5 Setting up the chart template 3.6 Summary and conclusions of the chapter, quick tricks Chapter 4. Final dashboard design 4.1 Aligning the headers to the grid 4.2 Creating new cards on the top of the cells 4.3 Making interactive slicers 4.4 Working with Excel colors and fonts 4.5 Improving standard Excel themes 4.6. Summary and conclusions of the chapter, quick tricks Chapter 5. Corporate identity 5.1 Creating a theme in accordance with the brandbook 5.2 Adapting the theme according to the checklist 5.3 Creating a dashboard in a dark theme 5.4 Summary and conclusions of the chapter, quick tricks Chapter 6. Data visualization rules 6.1 Types of data analysis 6.2 How to choose charts 6.3 Life hacks for multiple data series 6.4 When you need everything at once 6.5 Funnel and waterfall 6.6 Summary and conclusions of the chapter, quick tricks Conclusion

    1 in stock

    £41.24

  • Random Number GeneratorsPrinciples and Practices

    De Gruyter Random Number GeneratorsPrinciples and Practices

    Out of stock

    Book SynopsisRandom Number Generators, Principles and Practices has been written for programmers, hardware engineers, and sophisticated hobbyists interested in understanding random numbers generators and gaining the tools necessary to work with random number generators with confidence and knowledge. Using an approach that employs clear diagrams and running code examples rather than excessive mathematics, random number related topics such as entropy estimation, entropy extraction, entropy sources, PRNGs, randomness testing, distribution generation, and many others are exposed and demystified. If you have ever Wondered how to test if data is really random Needed to measure the randomness of data in real time as it is generated Wondered how to get randomness into your programs Wondered whether or not a random number generator is trustworthy Wanted to be able to choose between random number generator solutions Needed to turn uniform random data into a different distribution NeededTable of Contents1 Introduction 1.1 Tools 1.2 Terminology 1.3 The Many Types of Random Numbers 1.3.1 Uniform Random Numbers 2 Random Number Generators 2.1 Classes of Random Number Generators 2.2 Names for RNGs 3 Making Random Numbers 3.1 A Quick Overview of the RNG Types 3.2 The Structure of Full RNG Implementations 3.3 Pool Extractor Structures 3.4 Multiple Input Extractors 4 Physically Uncloneable Functions 21 4.1 The other kind âAS Static vs. Dynamic Random Number Generators . 5 Testing Random Numbers 5.1 Known Answer Tests 5.2 Distinguishing From Random 5.3 PRNG Test Suites 5.4 Entropy Measurements 5.5 Min Entropy Estimation 5.6 Model Equivalence Testing 5.7 Statistical Prerequisite Testing 5.8 The problem Distinguishing Entropy and Pseudo-randomness 5.9 PRNG Tests: DieHarder, NIST SP800-22,TestU01, China ICS 35.040 5.10 Entropy Measurements 5.11 Min Entropy Measurements 5.12 Modeling to Test a Source 5.13 Statistical Prerequisites 5.14 Testing for bias . 5.15 results that are âAŸtoo goodâAZ (E.G. Chi-square == 0.5) 5.16 Distinguishing Correlation from Bias 5.17 Testing for Stationary properties 5.18 FFT analysis 5.19 Online Testing 5.20 Working From the Source RNG 5.21 Tools 5.22 Summary 6 Entropy Extraction or Distillation 6.1 A simple extractor, the XOR gate 6.2 A simple way of improving the distribution of random numbers that have known missing values using XOR 7 Quantifying Entropy 7.1 Rényi Entropy 7.2 Distance From Uniform Topics to put somewhere in the book- in existing chapters and new chapters 8.1 XOR as a 2 bit extractor 8.2 Properties of real random numbers 8.3 Binomial distributions 8.4 Normal distributions 8.4.1 Dice, more dice 8.4.2 Central limit theorem 8.5 Seeing patterns 8.6 Regression to the mean 8.7 Lack of correlation, bias, algorithmic connections, predictability 8.8 What’s a True random number? 8.9 Random numbers in cryptography 8.10 Things they help with liveness, unpredictability, resistance to attacks 8.11 Examples of use 8.11.1 Salting Passwords . 8.11.2 802.11i exchange 8.11.3 PKMv2 exchange 8.11.4 Making Keys 8.12 Examples of RNG crypto failures 8.12.1 Sony PS3 attack 8.12.2 MiFare Classic 8.12.3 Online Poker 8.12.4 Debian OpenSSL Fiasco 8.12.5 Linux Boot Time Entropy 8.13 Humans and random numbers 8.14 Result of asking people for a random number 8.14.1 Normal People 8.14.2 Crypto People 8.15 Mental Random Number Tricks 8.15.1 How to think of a really random number 8.16 PRNGs 8.17 extractors 8.17.1 CBC MAC 8.17.2 BIW 8.17.3 Von Neumann 8.18 Extractor Theory 8.19 Random Number Standards 8.19.1 SP800-90A B C . 8.19.2 Ansi X9.82 8.20 PRNG Algorithms 8.20.1 SP800-90A CTR DRBG 8.20.2 SP800-90A SHA DRBG 8.20.3 XOR Construction 8.20.4 Oversampling Construction 8.21 Yarrow 8.22 Whirlpool 8.23 Linux Kernel random service 8.24 Appendices 8.25 Resources 8.25.1 SW Sources 8.25.2 Online random number sources 8.26 Example Algorithm Vectors 8.26.1 SP800-90A CTR DRBG 128 & 256 8.26.2 SP800-90A Hash DRBG SHA-1 & SHA 256 8.26.3 AES-CBC-MAC Conditioner 128 8.26.4 AES-CBC-MAC Conditioner 8.27 SP800-90 LZ Tests Issues

    Out of stock

    £999.99

  • Nova Science Publishers Inc Embedded Cryptographic Hardware: Methodologies &

    Out of stock

    Book SynopsisModern cryptology, which is the basis of information security techniques, started in the late 70''s and developed in the 80''s. As communication networks were spreading deep into society, the need for secure communication greatly promoted cryptographic research. The need for fast but secure cryptographic systems is growing bigger. Therefore, dedicated systems for cryptography are becoming a key issue for designers. With the spread of reconfigurable hardware such as FPGAs, hardware implementations of cryptographic algorithms become cost-effective. The focus of this book is on all aspects of embedded cryptographic hardware. Of special interest are contributions that describe new secure and fast hardware implementations and new efficient algorithms, methodologies and protocols for secure communications. This book is organised in two parts. The first part is dedicated to embedded hardware of cryptosystems while the second part focuses on new algorithms for cryptography, design methodologies and secure protocols.

    Out of stock

    £129.74

  • Trends in Computer Science

    Nova Science Publishers Inc Trends in Computer Science

    1 in stock

    Book Synopsis

    1 in stock

    £152.79

  • Nova Science Publishers Inc Algorithms & Tools for Parallel Computing on

    Out of stock

    Book SynopsisThis book features chapters which explore algorithms, programming languages, systems, tools and theoretical models aimed at high performance computing on heterogeneous networks of computers.

    Out of stock

    £73.49

  • Nova Science Publishers Inc Flexible Text Searching

    Out of stock

    Book Synopsis

    Out of stock

    £999.99

  • Nova Science Publishers Inc Measuring Power of Algorithms, Programs &

    1 in stock

    Book SynopsisWe are living in a world where complexity of systems created and studied by people grows beyond all imaginable limits. Computers, their software and their networks are among the most complicated systems of our time. Science is the only efficient tool for dealing with this overwhelming complexity. One of the methodologies developed in science is the axiomatic approach. It proved to be very powerful in mathematics. In this book, the authors developed further an axiomatic approach in computer science initiated by Floyd, Manna, Blum and other researchers. In the traditional constructive setting, different classes of algorithms (programs, processes or automata) are studied separately, with some indication of relations between these classes. In such a way, the constructive approach gave birth to the theory of Turing machines, theory of partial recursive functions, theory of finite automata, and other theories of constructive models of algorithms. The axiomatic context allows one to research collections of classes of algorithms, automata, and processes. These classes are united in a collection by common properties in a form of axioms. As a result, axiomatic approach goes higher in the hierarchy of computer and network models, reducing in such a way complexity of their study.

    1 in stock

    £99.19

  • Succeeding with AI

    Manning Publications Succeeding with AI

    Out of stock

    Book SynopsisThe big challenge for a successful AI project isn’t deciding which problems you can solve. It’s deciding which problems you should solve. In Managing Successful AI Projects, author and AI consultant Veljko Krunic reveals secrets for succeeding in AI that he developed with Fortune 500 companies, early-stage start-ups, and other business across multiple industries. Key Features · Selecting the right AI project to meet specific business goals · Economizing resources to deliver the best value for money · How to measure the success of your AI efforts in the business terms · Predict if you are you on the right track to deliver your intended business results For executives, managers, team leaders, and business-focused data scientists. No specific technical knowledge or programming skills required. About the technology Companies small and large are initiating AI projects, investing vast sums of money on software, developers, and data scientists. Too often, these AI projects focus on technology at the expense of actionable or tangible business results, resulting in scattershot results and wasted investment. Managing Successful AI Projects sets out a blueprint for AI projects to ensure they are predictable, successful, and profitable. It’s filled with practical techniques for running data science programs that ensure they’re cost effective and focused on the right business goals. Veljko Krunic is an independent data science consultant who has worked with companies that range from start-ups to Fortune 10 enterprises. He holds a PhD in Computer Science and an MS in Engineering Management, both from the University of Colorado at Boulder. He is also a Six Sigma Master Black Belt.

    Out of stock

    £999.99

  • Learn Concurrent Programming with Go

    Manning Publications Learn Concurrent Programming with Go

    Out of stock

    Book SynopsisWrite concurrent code in Go that improves application performance, scales up to handle bigger loads, and takes full advantage of modern multi-processor hardware. Suitable for programmers who already know the basics of Go or another C-style language. No experience in concurrent programming required. In Learn Concurrent Programming with Go you will learn how to: Implement effective concurrency for more responsive, higher performing, scalable software Avoid common concurrency problems such as deadlocks and race conditions Manage concurrency using goroutines, mutexes, readers-writer locks, and more Identify concurrency patterns such as pipelining, worker pools, and message passing Discover advantages, limits and properties of parallel computing Improve your Go coding skills with advanced multithreading About the technology Concurrent programming is essential for getting the most out of modern multi-processor computer hardware. It allows multiple tasks to execute and interact simultaneously, speeding up performance and reducing user wait time. Thanks to its baked-in concurrency models, Google's Go is one of the best languages you can use to learn and apply concurrent programming to your systems.

    Out of stock

    £999.99

  • Knowledge-based Expert Systems in Chemistry:

    Royal Society of Chemistry Knowledge-based Expert Systems in Chemistry:

    2 in stock

    Book SynopsisThere have been significant developments in the use of knowledge-based expert systems in chemistry since the first edition of this book was published in 2009. This new edition has been thoroughly revised and updated to reflect the advances. The underlying theme of the book is still the need for computer systems that work with uncertain or qualitative data to support decision-making based on reasoned judgements. With the continuing evolution of regulations for the assessment of chemical hazards, and changes in thinking about how scientific decisions should be made, that need is ever greater. Knowledge-based expert systems are well established in chemistry, especially in relation to toxicology, and they are used routinely to support regulatory submissions. The effectiveness and continued acceptance of computer prediction depends on our ability to assess the trustworthiness of predictions and the validity of the models on which they are based. Written by a pioneer in the field, this book provides an essential reference for anyone interested in the uses of artificial intelligence for decision making in chemistry.Table of ContentsArtificial Intelligence – Making Use of Reasoning; Synthesis Planning by Computer;Other Programs to Support Chemical Synthesis Planning; International Repercussions of the Harvard LHASA Project; Current Interest in Synthesis Planning by Computer; Structure Representation; Structure, Substructure and Superstructure Searching; Protons That Come and Go; Aromaticity and Stereochemistry; DEREK – Predicting Toxicity; Other Alert-based Toxicity Prediction Systems; Rule Discovery; The 2D–3D Debate; Making Use of Reasoning: Derek for Windows; Predicting Metabolism; Relative Reasoning; Predicting Biodegradation; Other Applications and Potential Applications of Knowledge-based Prediction in Chemistry; Combining Predictions; The Adverse Outcome Pathways Approach; Evaluation of Knowledge-based Systems; Validation of Computer Predictions; Artificial Intelligence Developments in Other Fields; A Subjective View of the Future

    2 in stock

    £141.55

  • Data structures based on linear relations

    De Gruyter Data structures based on linear relations

    1 in stock

    Book Synopsis

    1 in stock

    £44.25

  • Artificial Intelligence for Data-Driven Medical

    Out of stock

    £999.99

  • Nature-Inspired Optimization Algorithms: Recent

    De Gruyter Nature-Inspired Optimization Algorithms: Recent

    1 in stock

    Book SynopsisThis book will focus on the involvement of data mining and intelligent computing methods for recent advances in Biomedical applications and algorithms of nature-inspired computing for Biomedical systems. The proposed meta heuristic or nature-inspired techniques should be an enhanced, hybrid, adaptive or improved version of basic algorithms in terms of performance and convergence metrics. In this exciting and emerging interdisciplinary area a wide range of theory and methodologies are being investigated and developed to tackle complex and challenging problems. Today, analysis and processing of data is one of big focuses among researchers community and information society. Due to evolution and knowledge discovery of natural computing, related meta heuristic or bio-inspired algorithms have gained increasing popularity in the recent decade because of their significant potential to tackle computationally intractable optimization dilemma in medical, engineering, military, space and industry fields. The main reason behind the success rate of nature inspired algorithms is their capability to solve problems. The nature inspired optimization techniques provide adaptive computational tools for the complex optimization problems and diversified engineering applications. Tentative Table of Contents/Topic Coverage:  - Neural Computation - Evolutionary Computing Methods - Neuroscience driven AI Inspired Algorithms - Biological System based algorithms - Hybrid and Intelligent Computing Algorithms - Application of Natural Computing - Review and State of art analysis of Optimization algorithms - Molecular and Quantum computing applications - Swarm Intelligence - Population based algorithm and other optimizations

    1 in stock

    £85.12

  • Data structures based on non-linear relations and

    2 in stock

    £44.25

  • Algorithms: Design and Analysis

    De Gruyter Algorithms: Design and Analysis

    15 in stock

    Book SynopsisAlgorithms play a central role both in the theory and in the practice of computing. The goal of the authors was to write a textbook that would not trivialize the subject but would still be readable by most students on their own. The book contains over 120 exercises. Some of them are drills; others make important points about the material covered in the text or introduce new algorithms not covered there. The book also provides programming projects. From the Table of Contents: Chapter 1: Basic knowledge of Mathematics, Relations, Recurrence relation and Solution techniques, Function and Growth of functions. Chapter 2: Different Sorting Techniques and their analysis. Chapter 3: Greedy approach, Dynamic Programming, Branch and Bound techniques, Backtracking and Problems, Amortized analysis, and Order Statics. Chapter 4: Graph algorithms, BFS, DFS, Spanning Tree, Flow Maximization Algorithms. Shortest Path Algorithms. Chapter 5: Binary search tree, Red black Tree, Binomial heap, B-Tree and Fibonacci Heap. Chapter 6: Approximation Algorithms, Sorting Networks, Matrix operations, Fast Fourier Transformation, Number theoretic Algorithm, Computational geometry Randomized Algorithms, String matching, NP-Hard, NP-Completeness, Cooks theorem.

    15 in stock

    £47.02

  • Blockchain 3.0 for Sustainable Development

    De Gruyter Blockchain 3.0 for Sustainable Development

    1 in stock

    Book Synopsis

    1 in stock

    £85.12

  • Computer Intelligence Against Pandemics: Tools

    De Gruyter Computer Intelligence Against Pandemics: Tools

    1 in stock

    Book SynopsisThis book introduces the most recent research and innovative developments regarding the new strains of COVID-19. While medical and natural sciences have been working instantly on deriving solutions and trying to protect humankind against such virus types, there is also a great focus on technological developments for improving the mechanism – momentum of science for effective and efficient solutions. At this point, computational intelligence is the most powerful tools for researchers to fight against COVID-19. Thanks to instant data-analyze and predictive techniques by computational intelligence, it is possible to get positive results and introduce revolutionary solutions against related medical diseases. By running capabilities – resources for rising the computational intelligence, technological fields like Artificial Intelligence (with Machine / Deep Learning), Data Mining, Applied Mathematics are essential components for processing data, recognizing patterns, modelling new techniques and improving the advantages of the computational intelligence more. Nowadays, there is a great interest in the application potentials of computational intelligence to be an effective approach for taking humankind more step away, after COVID-19 and before pandemics similar to the COVID-19 many appear.

    1 in stock

    £108.38

  • Lit Verlag Algorithms of Power: Key Invisibles

    Out of stock

    Book Synopsis

    Out of stock

    £24.26

  • (Dis)Obedience in Digital Societies: Perspectives

    Transcript Verlag (Dis)Obedience in Digital Societies: Perspectives

    1 in stock

    Book SynopsisAlgorithms are not to be regarded as a technical structure but as a social phenomenon - they embed themselves, currently still very subtle, into our political and social system. Algorithms shape human behavior on various levels: they influence not only the aesthetic reception of the world but also the well-being and social interaction of their users. They act and intervene in a political and social context. As algorithms influence individual behavior in these social and political situations, their power should be the subject of critical discourse - or even lead to active disobedience and to the need for appropriate tools and methods which can be used to break the algorithmic power.Table of Contents(Dis)obeying Algorithms? Introductory Thoughts on the Power of Algorithms and the Possible Necessity of Resisting it; The Dialectics of Dis-Obedience. Notes from the Crystal Palace; Surveillance, Artificial Intelligence and Power; Embodied Algorithmic Optimization. How Our Bodies are Becoming a Product of Code; The Lock Down City and the Utopian Program of Open Interfaces; Hacking Google Maps; The Algorithmic Construction of Space; Torn Between Autonomy and Algorithmic Management. (Dis)Obedience of Solo Self-Employed Working via Digital Platforms; A Crack in the Algorithm's Facade. A Fundamental Rights Perspective on "Efficiency" and "Neutrality" Narratives of Algorithms; When Search Engines Discriminate. The Posthuman Mimesis of Gender Bias; Discrimination by Correlation. Towards Eliminating Algorithmic Biases and Achieving Gender Equality; The Power of Algorithms and the Structural Transformation of the Digital Public; Reclaim your Face and the Streets. Why Facial Recognition, and Other Biometric Surveillance Technology in Public Spaces, Should be Banned; Identity 5.0: How to Fight Algorithms Online (Fast). Heuristic Compressions of Personality Concepts (Dis)Obedient to Algorithmic Powerfrom Film, Television and a Cult Classic Novel; About the Authors.

    1 in stock

    £29.69

  • Design and Analysis of Algorithms

    PHI Learning Design and Analysis of Algorithms

    Out of stock

    Book SynopsisThis book focuses on the standard algorithm design methods and the concepts are illustrated through representative examples to offer a ready text.

    Out of stock

    £999.99

  • Prentice-Hall of India Pvt.Ltd Computer Graphics: Algorithms and Implementations

    Out of stock

    Book SynopsisTextbook on Computer Graphics for students, covering theory, C program implementations, Windows programming, geometric transformations, drawing techniques, surface removal, illumination. Includes exercises, summaries, companion CD with C programs.

    Out of stock

    £14.99

  • BPB Publications Data Structures Through C

    Out of stock

    Book SynopsisData Structures Through C by Yashavant Kanetkar is a guidebook using C language to explain data structure concepts like arrays, linked lists, sorting, and more. Includes animations on CD-ROM for hands-on learning. Published in 2010 by BPB Publication, praised for clear presentation.

    Out of stock

    £14.99

  • Practical Guide To Computer Simulations (With

    World Scientific Publishing Co Pte Ltd Practical Guide To Computer Simulations (With

    1 in stock

    Book SynopsisThis book presents all the computational techniques and tools needed to start doing scientific research using computer simulations. After working through this book, the reader will possess the necessary basic background knowledge, from program design, programming in C, fundamental algorithms and data structures, random numbers, and debugging, all the way to data analysis, presentation and publishing. In each of these fields, no preliminary knowledge is assumed. The reader will be equipped to successfully perform complete projects from the first idea until the final publication. All techniques are explained using many examples in C; these C codes, as well as the solutions to exercises, are readily available in the accompanying CD-ROM.The techniques in this book are independent of the fields of research, and hence they are suitable for conducting research projects in physics, chemistry, computer science, biology and engineering. This also means that no problem-dependent algorithms are introduced; therefore, this book does NOT explain molecular dynamics, Monte Carlo, finite elements and other special-purpose techniques, which would be beyond the scope of a general-purpose book.There has been no similar comprehensive book written so far. Currently, one needs many different books to learn all the necessary elements. With this book, however, one basically needs only a second book on field-specific algorithms in order to be fully equipped to perform computer simulations research.Table of ContentsProgramming in C; Software Engineering; Object-oriented Software Development; Algorithms and Data Structures; Debugging and Testing; Libraries; Random Numbers; Data Analysis; Information Retrieval; Publishing and Presentations.

    1 in stock

    £50.35

  • Contemporary Algorithms: Theory and Applications

    Nova Science Publishers Inc Contemporary Algorithms: Theory and Applications

    2 in stock

    Book Synopsis

    2 in stock

    £163.19

  • Nova Science Publishers Inc A Guide to Design and Analysis of Algorithms

    Out of stock

    Book Synopsis

    Out of stock

    £999.99

  • MIT Press Ltd Distributed Algorithms An Intuitive Approach

    Out of stock

    Book Synopsis

    Out of stock

    £40.00

  • Introduction to Probability for Computing

    Cambridge University Press Introduction to Probability for Computing

    2 in stock

    Book SynopsisA rigorous, yet accessible, textbook for computer science students learning probability. It covers topics of interest to computer scientists, including randomized algorithms, simulation, statistical inference, and stochastic systems modeling. Replete with engaging real-world examples, exercises, and full-color illustrations.Trade Review'Based on 20 years of teaching Computer Science and Operations Research at Carnegie Mellon University, Professor Harchol-Balter provides a unique presentation of probability and statistics that is both highly engaging and also strongly motivated by realworld computing applications that students will encounter in industry. This book is approachable and fun for undergraduate students, while also covering advanced concepts relevant to graduate students.' Eytan Modiano, Massachusetts Institute of Technology'This book provides a fantastic introduction to probability for computer scientists and computing professionals, addressing concepts and techniques crucial to the design and analysis of randomized algorithms, to performing well-designed simulations, to statistical inference and machine learning, and more. Also contains many great exercises and examples. Highly recommend!' Avrim Blum, Toyota Technological Institute at Chicago'Mor Harchol-Balter's new book does a beautiful job of introducing students to probability! The book is full of great computer science-relevant examples, wonderful intuition, simple and clear explanations, and mathematical rigor. I love the question-answer style she uses, and could see using this book for students ranging from undergraduate students with zero prior exposure to probability all the way to graduate students (or researchers of any kind) who need to brush up and significantly deepen (and/or broaden) their knowledge of probability.' Anna Karlin, University of Washington'Probability is at the heart of modeling, design, and analysis of computer systems and networks. This book by a pioneer in the area is a beautiful introduction to the topic for undergraduate students. The material in the book introduces theoretical topics rigorously, but also motivates each topicwith practical applications. This textbook is an excellent resource for budding computer scientists who are interested in probability.' R. Srikant, University of Illinois at Urbana-Champaign'I know probability theory, and have taught it to undergrads and grads at MIT, UC Berkeley, and Carnegie Mellon University. Yet this book has taught me some wonderfully interesting important material that I did not know. Mor is a great thinker, lecturer, and writer. I would love to have learned from this book as a student - and to have taught from it as an instructor!' Manuel Blum, University of California, Berkeley, and Carnegie Mellon UniversityTable of ContentsPreface; Part I. Fundamentals and Probability on Events: 1. Before we start ... some mathematical basics; 2. Probability on events; Part II. Discrete Random Variables: 3. Probability and discrete random variables; 4. Expectations; 5. Variance, higher moments, and random sums; 6. z-Transforms; Part III. Continuous Random Variables: 7. Continuous random variables: single distribution; 8. Continuous random variables: joint distributions; 9. Normal distribution; 10. Heavy tails: the distributions of computing; 11. Laplace transforms; Part IV. Computer Systems Modeling and Simulation: 12. The Poisson process; 13. Generating random variables for simulation; 14. Event-driven simulation; Part V. Statistical Inference; 15. Estimators for mean and variance; 16. Classical statistical inference; 17. Bayesian statistical inference; Part VI. Tail Bounds and Applications: 18. Tail bounds; 19. Applications of tail bounds: confidence intervals and balls-and-bins; 20. Hashing algorithms; Part VII. Randomized Algorithms: 21. Las Vegas randomized algorithms; 22. Monte Carlo randomized algorithms; 23. Primality testing; Part VIII. Discrete-time Markov Chains; 24. Discrete-time Markov chains: finite-state; 25. Ergodicity for finite-state discrete-time Markov chains; 26. Discrete-time Markov chains: infinite-state; 27. A little bit of queueing theory; References; Index.

    2 in stock

    £52.24

  • Basics of Programming and Algorithms Principles

    Springer Nature Switzerland Basics of Programming and Algorithms Principles

    Out of stock

    Book SynopsisThis textbook offers an introduction to topics in algorithms and programming with python.

    Out of stock

    £999.99

  • I K International Publishing House Pvt. Ltd Data Structures and Algorithms

    Out of stock

    Book SynopsisThis book is an outcome of long years of teaching experience for undergraduate as well as post graduate students, and is an attempt to put together all the essential topics of data structures and Algorithms for easy reference. The under-graduate students of computer science and engineering, post-graduate students of computer applications and computer science and engineering will find this book very useful. It contains several multiple choice questions under each chapter which will be useful for those who aspire to write the GATE examination. A brief course on C-programming language is given to help the students in implementing the algorithms. Salient Features: The data structures are explained with simple relevant examples. Algorithms are written in simple pseudo-code and are easy to convert to any programming language. Concepts are well supported with suitable examples and diagrams for the students to find it easy to follow. Includes review questions as well as MCQs with answers. Critical examples with stepwise explanation makes it a great instructor resource. Table of Contents Introduction Elementary Data Structures Divide and Conquer Technique Greedy Technique Dynamic Programming Backtracking Branch and Bound Technique NP-Hard and NP-Complete Problems Bibliography Index

    Out of stock

    £32.36

  • Springer International Publishing AG Convex Analysis and Monotone Operator Theory in

    Out of stock

    Book SynopsisThis reference text, now in its second edition, offers a modern unifying presentation of three basic areas of nonlinear analysis: convex analysis, monotone operator theory, and the fixed point theory of nonexpansive operators. Taking a unique comprehensive approach, the theory is developed from the ground up, with the rich connections and interactions between the areas as the central focus, and it is illustrated by a large number of examples. The Hilbert space setting of the material offers a wide range of applications while avoiding the technical difficulties of general Banach spaces. The authors have also drawn upon recent advances and modern tools to simplify the proofs of key results making the book more accessible to a broader range of scholars and users. Combining a strong emphasis on applications with exceptionally lucid writing and an abundance of exercises, this text is of great value to a large audience including pure and applied mathematicians as well as researchers in engineering, data science, machine learning, physics, decision sciences, economics, and inverse problems. The second edition of Convex Analysis and Monotone Operator Theory in Hilbert Spaces greatly expands on the first edition, containing over 140 pages of new material, over 270 new results, and more than 100 new exercises. It features a new chapter on proximity operators including two sections on proximity operators of matrix functions, in addition to several new sections distributed throughout the original chapters. Many existing results have been improved, and the list of references has been updated.Heinz H. Bauschke is a Full Professor of Mathematics at the Kelowna campus of the University of British Columbia, Canada.Patrick L. Combettes, IEEE Fellow, was on the faculty of the City University of New York and of Université Pierre et Marie Curie – Paris 6 before joining North Carolina State University as a Distinguished Professor of Mathematics in 2016.Table of Contents

    Out of stock

    £93.60

  • Springer Fachmedien Wiesbaden Data Analytics: Models and Algorithms for

    Out of stock

    Book SynopsisThis book is a comprehensive introduction to the methods and algorithms of modern data analytics. It provides a sound mathematical basis, discusses advantages and drawbacks of different approaches, and enables the reader to design and implement data analytics solutions for real-world applications. This book has been used for more than ten years in the Data Mining course at the Technical University of Munich. Much of the content is based on the results of industrial research and development projects at Siemens.Table of ContentsData Analytics - Data and Relations - Data Preprocessing - Data Visualization - Correlation - Regression - Forecasting - Classification - Clustering.

    Out of stock

    £999.99

  • Guide to Computer Processor Architecture: A

    Springer International Publishing AG Guide to Computer Processor Architecture: A

    1 in stock

    Book SynopsisThis unique, accessible textbook presents a succession of implementations of the open-source RISC-V processor. Implementations are offered in increasing difficulty (non-pipelined, pipelined, deeply pipelined, multi-threaded, multicore).Each implementation is shown as a High-Level Synthesis (HLS) code in C++. This facilitates synthesis and testing on an FPGA-based development board (Such a board can be freely obtained from the Xilinx University Program targeting university professors).The book can be useful for several reasons. First, it is a novel way to introduce computer architecture: The codes given can serve as labs for a processor architecture course. Second, the book content is based on the RISC-V Instruction Set Architecture, which is an open-source machine language promising to become the main machine language to be taught, replacing DLX and MIPS. Third, all the designs are implemented through the HLS tool, which is able to translate a C program into an intellectual property (IP). Lastly, HLS will become the new standard for IP implementations, replacing Verilog/VHDL; already there are job positions tied to HLS, with the argument of rapid IP development.Hence, in addition to offering undergraduates a firm introduction, the textbook/guide can also serve engineers willing to implement processors on FPGA, as well as researchers willing to develop RISC-V based hardware simulators.Bernard Goossens is Professor in the Faculty of Sciences at the Université de Perpignan, France. He is author of the French-language book from Springer, Architecture et microarchitecture des processeurs, 2002.Table of ContentsPart I. Single core processors.- 1. Getting Ready.- 2. Building a RISC-V Processor.- 3. Building a Pipelined RISC-V Processor.- 4. Building a RISC-V Processor with a Multi-cycle Pipeline.- 5. Building a RISC-V Processor with a Multiple Hart Pipeline.- Part II. Multiple core processors.- 6. Connecting IPs.- 7. A Multi-core RISC-V Processor.- 8. A Multi-core RISC-V Processor with Multi-hart Cores.

    1 in stock

    £47.92

  • Property Testing: Problems and Techniques

    Springer Verlag, Singapore Property Testing: Problems and Techniques

    Out of stock

    Book SynopsisThis book introduces important results and techniques in property testing, where the goal is to design algorithms that decide whether their input satisfies a predetermined property in sublinear time, or even in constant time – that is, time is independent of the input size. This book consists of three parts. The first part provides an introduction to the foundations of property testing. The second part studies the testing of specific properties on strings, graphs, functions, and constraint satisfaction problems. Vectors and matrices over real numbers are also covered. The third part is more advanced and explains general conditions, including full characterizations, under which properties are constant-query testable. The first and second parts of the book are intended for first-year graduate students in computer science. They should also be accessible to undergraduate students with the adequate background. The third part can be used by researchers or ambitious graduate students who want to gain a deeper theoretical understanding of property testing.Table of ContentsChapter 1: Introduction.- Chapter 2: Basic Techniques.- Chapter 3: Strings.- Chapter 4: Graphs in the Adjacency Metrix Model.- Chapter 5: Graphs in the Bounded-Degree Model.- Chapter 6: Functions over Hypercubes.- Chapter 7: Massively Parameterized Model.- Chapter 8: Vectors and Matrices over the Reals.- Chapter 9: Graphs in the Adjacency Matrix Model.- Chapter 10: Graphs in the Bounded-Degree Model.- Chapter 11: Affine-Invariant Properties of Functions.- Chapter 12: Linear Properties of Functions.- Chapter 13: Massively Parameterized Model.

    Out of stock

    £71.99

  • Network Algorithmics

    Elsevier Science & Technology Network Algorithmics

    Out of stock

    Book SynopsisTable of ContentsPart I: Rules of the Game 1. Introducing Network Algorithmics 2. Network Implementation Models 3. Fifteen Implementation Principles 4. Principles in Action Part II: Playing with Endnodes 5. Copying Data 6. Transferring Control 7. Maintaining Timers 8. Demultiplexing 9. Protocol Processing Part III: Playing with Routers 10. Exact-Match Lookups 11. Prefix-Match Lookups 12. Packet Classification 13. Switching 14. Scheduling Packets 15. Routers as Distributed Systems Part IV: Endgame 16. Measuring Network Traffic 17. Network Security 18. Conclusions Appendix: Detailed Models

    Out of stock

    £999.99

  • HumanCentered Data Science An Introduction

    MIT Press HumanCentered Data Science An Introduction

    10 in stock

    Book SynopsisBest practices for addressing the bias and inequality that may result from the automated collection, analysis, and distribution of large datasets.Human-centered data science is a new interdisciplinary field that draws from human-computer interaction, social science, statistics, and computational techniques. This book, written by founders of the field, introduces best practices for addressing the bias and inequality that may result from the automated collection, analysis, and distribution of very large datasets. It offers a brief and accessible overview of many common statistical and algorithmic data science techniques, explains human-centered approaches to data science problems, and presents practical guidelines and real-world case studies to help readers apply these methods. The authors explain how data scientists’ choices are involved at every stage of the data science workflow—and show how a human-centered approach can enhance each one, by mak

    10 in stock

    £33.00

  • Grammars and Automata for String Processing From

    Taylor & Francis Ltd Grammars and Automata for String Processing From

    1 in stock

    Book SynopsisThe conventional wisdom was that biology influenced mathematics and computer science. But a new approach has taken hold: that of transferring methods and tools from computer science to biology. The reverse trend is evident in Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology and Back. The contributors address the structural (syntactical) view of the domain. Mathematical linguistics and computer science can offer various tools for modeling complex macromolecules and for analyzing and simulating biological issues. This collection is valuable for students and researchers in biology, computer science, and applied mathematics.Table of ContentsLogistics, Languages and Combinatorics. Models of Molecular Computing.

    1 in stock

    £118.75

  • Googles PageRank and Beyond  The Science of

    Princeton University Press Googles PageRank and Beyond The Science of

    Out of stock

    Book SynopsisWhy 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? This book about the science of web page rankings supplies the answers to these and other questions.Trade ReviewHonorable Mention for the 2006 Award for Best Professional/Scholarly Book in Computer & Information Science, Association of American Publishers "[F]or anyone who wants to delve deeply into just how Google's PageRank works, I recommend Google's PageRank and Beyond."--Stephen H. Wildstrom, BusinessWeek "This is a worthwhile book. It offers a comprehensive and erudite presentation of PageRank and related search-engine algorithms, and it is written in an approachable way, given the mathematical foundations involved."--Jonathan Bowen, Times Higher Education Supplement "This book should be at the top of anyone's list as a must-read for those interested in how search engines work and, more specifically how Google is to meet the needs of so many people in so many ways."--Michael W. Berry, SIAM Review "Amy N. Langville and Carl D. Meyer examine the logic, mathematics, and sophistication behind Google's PageRank and other Internet search engine ranking programs... It is an excellent work."--Ian D. Gordon, Library Journal "If I were taking, or teaching, a course in linear algebra today, this book would be a godsend."--Ed Gerstner, Nature Physics "Langville and Meyer present the mathematics in all its detail... But they vary the math with discussions of the many issues involved in building search engines, the 'wars' between search engine developers and those trying to artificially inflate the position of their pages, and the future of search-engine development... Google's PageRank and Beyond makes good reading for anyone, student or professional, who wants to understand the details of search engines."--James Hendler, Physics Today "This book is written for people who are curious about new science and technology as well as for those with more advanced background in matrix theory... Much of the book can be easily followed by general readers, while understanding the remaining part requires only a good first course in linear algebra. It can be a reference book for people who want to know more about the ideas behind the currently popular search engines, and it provides an introductory text for beginning researchers in the area of information retrieval."--Jiu Ding, Mathemathical Reviews "The book is very attractively and clearly written. The authors succeed to manage in an optimal way the presentation of both basic and more sophisticated concepts involved in the analysis of Google's PageRank, such that the book serves both audiences: the general and the technical scientific public."--Constantin Popa, Zentralblatt MATH "The book under review is excellently written, with a fresh and engaging style. The reader will particularly enjoy the 'Asides' interspersed throughout the text. They contain all kind of entertaining stories, practical tips, and amusing quotes... The book also contains some useful resources for computation."--Pablo Fernandez, Mathematical Intelligencer "Google's PageRank and Beyond describes the link analysis tool called PageRank, puts it in the context of web search engines and information retrieval, and describes competing methods for ranking webpages. It is an utterly engaging book."--Bill Satzer, MathDL.maa.orgTable of ContentsPreface ix Chapter 1: Introduction to Web Search Engines 1 1.1 A Short History of Information Retrieval 1 1.2 An Overview of Traditional Information Retrieval 5 1.3 Web Information Retrieval 9 Chapter 2: Crawling, Indexing, and Query Processing 15 2.1 Crawling 15 2.2 The Content Index 19 2.3 Query Processing 21 Chapter 3: Ranking Webpages by Popularity 25 3.1 The Scene in 1998 25 3.2 Two Theses 26 3.3 Query-Independence 30 Chapter 4: The Mathematics of Google's PageRank 31 4.1 The Original Summation Formula for PageRank 32 4.2 Matrix Representation of the Summation Equations 33 4.3 Problems with the Iterative Process 34 4.4 A Little Markov Chain Theory 36 4.5 Early Adjustments to the Basic Model 36 4.6 Computation of the PageRank Vector 39 4.7 Theorem and Proof for Spectrum of the Google Matrix 45 Chapter 5: Parameters in the PageRank Model 47 5.1 The alpha Factor 47 5.2 The Hyperlink Matrix H 48 5.3 The Teleportation Matrix E 49 Chapter 6: The Sensitivity of PageRank 57 6.1 Sensitivity with respect to alpha 57 6.2 Sensitivity with respect to H 62 6.3 Sensitivity with respect to vT 63 6.4 Other Analyses of Sensitivity 63 6.5 Sensitivity Theorems and Proofs 66 Chapter 7: The PageRank Problem as a Linear System 71 7.1 Properties of (I -- alphaS) 71 7.2 Properties of (I -- alphaH) 72 7.3 Proof of the PageRank Sparse Linear System 73 Chapter 8: Issues in Large-Scale Implementation of PageRank 75 8.1 Storage Issues 75 8.2 Convergence Criterion 79 8.3 Accuracy 79 8.4 Dangling Nodes 80 8.5 Back Button Modeling 84 Chapter 9: Accelerating the Computation of PageRank 89 9.1 An Adaptive Power Method 89 9.2 Extrapolation 90 9.3 Aggregation 94 9.4 Other Numerical Methods 97 Chapter 10: Updating the PageRank Vector 99 10.1 The Two Updating Problems and their History 100 10.2 Restarting the Power Method 101 10.3 Approximate Updating Using Approximate Aggregation 102 10.4 Exact Aggregation 104 10.5 Exact vs. Approximate Aggregation 105 10.6 Updating with Iterative Aggregation 107 10.7 Determining the Partition 109 10.8 Conclusions 111 Chapter 11: The HITS Method for Ranking Webpages 115 11.1 The HITS Algorithm 115 11.2 HITS Implementation 117 11.3 HITS Convergence 119 11.4 HITS Example 120 11.5 Strengths and Weaknesses of HITS 122 11.6 HITS's Relationship to Bibliometrics 123 11.7 Query-Independent HITS 124 11.8 Accelerating HITS 126 11.9 HITS Sensitivity 126 Chapter 12: Other Link Methods for Ranking Webpages 131 12.1 SALSA 131 12.2 Hybrid Ranking Methods 135 12.3 Rankings based on Traffic Flow 136 Chapter 13: The Future of Web Information Retrieval 139 13.1 Spam 139 13.2 Personalization 142 13.3 Clustering 142 13.4 Intelligent Agents 143 13.5 Trends and Time-Sensitive Search 144 13.6 Privacy and Censorship 146 13.7 Library Classification Schemes 147 13.8 Data Fusion 148 Chapter 14: Resources for Web Information Retrieval 149 14.1 Resources for Getting Started 149 14.2 Resources for Serious Study 150 Chapter 15: The Mathematics Guide 153 15.1 Linear Algebra 153 15.2 Perron-Frobenius Theory 167 15.3 Markov Chains 175 15.4 Perron Complementation 186 15.5 Stochastic Complementation 192 15.6 Censoring 194 15.7 Aggregation 195 15.8 Disaggregation 198 Chapter 16: Glossary 201 Bibliography 207 Index 219

    Out of stock

    £999.99

  • Multidimensional Discrete Unitary Transforms

    Taylor & Francis Inc Multidimensional Discrete Unitary Transforms

    15 in stock

    Book SynopsisThis reference presents a more efficient, flexible, and manageable approach to unitary transform calculation and examines novel concepts in the design, classification, and management of fast algorithms for different transforms in one-, two-, and multidimensional cases. Illustrating methods to construct new unitary transforms for best algorithm selection and development in real-world applications, the book contains a wide range of examples to compare the efficacy of different algorithms in a variety of one-, two-, and three-dimensional cases. Multidimensional Discrete Unitary Transforms builds progressively from simple representative cases to higher levels of generalization.Table of ContentsSeries Introduction, Preface, 1: Basic Concepts and Notation, I: Tensor Representation of Multidimensional Signals, II: Analysis and effective computing procedures, III: Applications of Paired Transformations, Index

    15 in stock

    £354.13

  • Probability and Computing

    Cambridge University Press Probability and Computing

    2 in stock

    Book SynopsisGreatly expanded, this new edition requires only an elementary background in discrete mathematics and offers a comprehensive introduction to the role of randomization and probabilistic techniques in modern computer science. Newly added chapters and sections cover topics including normal distributions, sample complexity, VC dimension, Rademacher complexity, power laws and related distributions, cuckoo hashing, and the Lovasz Local Lemma. Material relevant to machine learning and big data analysis enables students to learn modern techniques and applications. Among the many new exercises and examples are programming-related exercises that provide students with excellent training in solving relevant problems. This book provides an indispensable teaching tool to accompany a one- or two-semester course for advanced undergraduate students in computer science and applied mathematics.Trade Review'As randomized methods continue to grow in importance, this textbook provides a rigorous yet accessible introduction to fundamental concepts that need to be widely known. The new chapters in this second edition, about sample size and power laws, make it especially valuable for today's applications.' Donald E. Knuth, Stanford University, California'Of all the courses I have taught at Berkeley, my favorite is the one based on the Mitzenmacher-Upfal book Probability and Computing. Students appreciate the clarity and crispness of the arguments and the relevance of the material to the study of algorithms. The new second edition adds much important material on continuous random variables, entropy, randomness and information, advanced data structures and topics of current interest related to machine learning and the analysis of large data sets.' Richard M. Karp, University of California, Berkeley'The new edition is great. I'm especially excited that the authors have added sections on the normal distribution, learning theory and power laws. This is just what the doctor ordered or, more precisely, what teachers such as myself ordered!' Anna Karlin, University of Washington'By assuming just an elementary introduction to discrete probability and some mathematical maturity, this book does an excellent job of introducing a great variety of topics to the reader. I especially liked the coverage of the Poisson, exponential, and (multi-variate) normal distributions and how they arise naturally, machine learning, Bayesian reasoning, Cuckoo hashing etc. There is a broad range of exercises, including helpful ones on programming to get a feel for the numerics … This connection to practice is unusual and very commendable … Overall, I would highly recommend this book to anyone interested in probabilistic and statistical foundations as applied to computer science, data science, etc. It can be taught at the senior undergraduate or graduate level to students in computer science, electrical engineering, operations research, mathematics, and other such disciplines.' Frederic Green , SIGACT NewsTable of Contents1. Events and probability; 2. Discrete random variables and expectations; 3. Moments and deviations; 4. Chernoff and Hoeffding bounds; 5. Balls, bins, and random graphs; 6. The probabilistic method; 7. Markov chains and random walks; 8. Continuous distributions and the Polsson process; 9. The normal distribution; 10. Entropy, randomness, and information; 11. The Monte Carlo method; 12. Coupling of Markov chains; 13. Martingales; 14. Sample complexity, VC dimension, and Rademacher complexity; 15. Pairwise independence and universal hash functions; 16. Power laws and related distributions; 17. Balanced allocations and cuckoo hashing.

    2 in stock

    £49.99

  • Algorithms and Networking for Computer Games

    John Wiley & Sons Inc Algorithms and Networking for Computer Games

    Out of stock

    Book SynopsisThe essential guide to solving algorithmic and networking problems in commercial computer games, revised and extended Algorithms and Networking for Computer Games, Second Editionis written from the perspective of the computer scientist. Combining algorithmic knowledge and game-related problems, it explores the most common problems encountered in game programing. The first part of the book presents practical algorithms for solving classical topics, such as random numbers, procedural generation, tournaments, group formations and game trees. The authors also focus on how to find a path in, create the terrain of, and make decisions in the game world. The second part introduces networking related problems in computer games, focusing on four key questions: how to hide the inherent communication delay, how to best exploit limited network resources, how to cope with cheating and how to measure the on-line game data. Thoroughly revised, updated, andTrade Review“More than 70 algorithms are presented, covering random numbers, noise in data (a realistic world is full of imperfections), procedural generation, tournaments, game trees, path finding, group movement, decision making, and modelling uncertainty – as well as networking problems, including dealing with cheating. The exercises at the end of each chapter range from simple thought exercises to studying Braben and Bell’s namegeneration algorithm from Elite (1984) … use of pseudocode throughout ensures the book works equally well for C, C++, Java, Python, or even C# programmers.” MagPi, Issue 64, December 2017 Table of ContentsPreface xiii 1 Introduction 1 1.1 Anatomy of Computer Games 4 1.2 Game Development 6 1.2.1 Phases of development 7 1.2.2 Documentation 8 1.2.3 Other considerations 11 1.3 Synthetic Players 12 1.3.1 Humanness 13 1.3.2 Stance 14 1.4 Multiplaying 14 1.5 Interactive Storytelling 15 1.5.1 Approaches 16 1.5.2 Storytelling in games 17 1.6 Outline of the Book 19 1.6.1 Algorithms 20 1.6.2 Networking 20 1.7 Summary 21 Exercises 21 I Algorithms 25 2 Random Numbers 26 2.1 Linear Congruential Method 27 2.1.1 Choice of parameters 30 2.1.2 Testing the randomness 32 2.1.3 Using the generators 33 2.2 Discrete Finite Distributions 36 2.3 Random Shuffling 40 2.4 Summary 44 Exercises 44 3 Noise 49 3.1 Applying Noise 50 3.2 Origin of Noise 51 3.3 Visualization 52 3.4 Interpolation 55 3.4.1 Utility routines for value conversions 56 3.4.2 Interpolation in a single parameter 58 3.4.3 Interpolation in two parameters 61 3.5 Composition of Noise 62 3.6 Periodic Noise 65 3.7 Perlin Noise 68 3.8 Worley Noise 73 3.9 Summary 83 Exercises 83 4 Procedural Generation 88 4.1 Terrain Generation 89 4.2 Maze Algorithms 96 4.2.1 Depth-first algorithm 98 4.2.2 Randomized Kruskal’s algorithm 99 4.2.3 Randomized Prim’s algorithm 101 4.3 L-Systems 101 4.3.1 Examples 103 4.3.2 City generation 105 4.4 Hierarchical Universe Generation 108 4.5 Summary 109 Exercises 111 5 Tournaments 115 5.1 Rank Adjustment Tournaments 118 5.2 Elimination Tournaments 123 5.3 Scoring Tournaments 131 5.4 Summary 135 Exercises 138 6 Game Trees 143 6.1 Minimax 144 6.1.1 Analysis 147 6.1.2 Partial minimax 148 6.2 Alpha-Beta Pruning 152 6.2.1 Analysis 156 6.2.2 Principal variation search 157 6.3 Monte Carlo Tree Search 157 6.4 Games of Chance 166 6.5 Summary 168 Exercises 170 7 Path Finding 177 7.1 Discretization of the Game World 178 7.1.1 Grid 179 7.1.2 Navigation mesh 180 7.2 Finding the Minimum Path 182 7.2.1 Evaluation function 183 7.2.2 Properties 184 7.2.3 Algorithm A* 185 7.3 Realizing the Movement 187 7.4 Summary 189 Exercises 190 8 Group Movement 194 8.1 Flocking 195 8.2 Formations 200 8.2.1 Coordinating formations 200 8.2.2 Behaviour-based steering 204 8.2.3 Fuzzy logic control 205 8.2.4 Mass-spring systems 207 8.3 Summary 208 Exercises 208 9 Decision-Making 211 9.1 Background 211 9.1.1 Levels of decision-making 212 9.1.2 Modelled knowledge 213 9.1.3 Methods 214 9.2 Finite State Machines 218 9.2.1 Computational FSM 221 9.2.2 Mealy and Moore machines 224 9.2.3 Implementation 227 9.2.4 Discussion 228 9.3 Influence Maps 231 9.4 Automated Planning 235 9.5 Summary 237 Exercises 240 10 Modelling Uncertainty 246 10.1 Statistical Reasoning 246 10.1.1 Bayes’ theorem 246 10.1.2 Bayesian networks 248 10.1.3 Dempster–Shafer theory 249 10.2 Fuzzy Sets 252 10.2.1 Membership function 253 10.2.2 Fuzzy operations 255 10.2.3 Defuzzification 255 10.3 Fuzzy Constraint Satisfaction Problem 257 10.3.1 Modelling the criteria as fuzzy sets 259 10.3.2 Weighting the criteria importances 262 10.3.3 Aggregating the criteria 262 10.3.4 Making a decision 263 10.4 Summary 263 Exercises 265 II Networking 268 11 Communication Layers 269 11.1 Physical Platform 270 11.1.1 Resource limitations 271 11.1.2 Transmission techniques and protocols 272 11.2 Logical Platform 274 11.2.1 Communication architecture 274 11.2.2 Data and control architecture 275 11.3 Networked Application 277 11.4 Summary 278 Exercises 278 12 Compensating Resource Limitations 283 12.1 Aspects of Compensation 284 12.1.1 Consistency and responsiveness 284 12.1.2 Scalability 287 12.2 Protocol Optimization 291 12.2.1 Message compression 291 12.2.2 Message aggregation 292 12.3 Dead Reckoning 293 12.3.1 Prediction 293 12.3.2 Convergence 295 12.4 Local Perception Filters 297 12.4.1 Linear temporal contour 301 12.4.2 Adding bullet time to the delays 305 12.5 Synchronized Simulation 307 12.6 Interest Management 308 12.6.1 Aura-based interest management 310 12.6.2 Zone-based interest management 310 12.6.3 Visibility-based interest management 312 12.6.4 Class-based interest management 312 12.7 Compensation by Game Design 314 12.7.1 Short active turns 314 12.7.2 Semi-autonomous avatars 315 12.7.3 Interaction via proxies 316 12.8 Summary 317 Exercises 318 13 Cheating Prevention 321 13.1 Technical Exploitations 322 13.1.1 Packet tampering 323 13.1.2 Look-ahead cheating 324 13.1.3 Cracking and other attacks 330 13.2 Collusion 331 13.2.1 Classification 333 13.2.2 Collusion detection 335 13.3 Rule Violations 337 13.4 Summary 338 Exercises 338 14 Online Metrics 341 14.1 Players 344 14.2 Monetization 345 14.3 Acquisition 347 14.4 Game Session 347 14.5 Summary 348 Exercises 348 A Pseudocode Conventions 351 A.1 Changing the Flow of Control 355 A.1.1 Expressions 355 A.1.2 Control structures 357 A.2 Data Structures 360 A.2.1 Values and entities 360 A.2.2 Data collections 360 A.3 Format of Algorithms 365 A.4 Conversion to Existing Programming Languages 367 B Practical Vectors and Matrices 371 B.1 Points and Vectors 372 B.2 Matrices 381 B.3 Conclusion 387 Bibliography 391 Ludography 408 Index 409

    Out of stock

    £999.99

  • Recent Advances in Hybrid Metaheuristics for Data

    John Wiley & Sons Inc Recent Advances in Hybrid Metaheuristics for Data

    10 in stock

    Book SynopsisAn authoritative guide to an in-depth analysis of various state-of-the-art data clustering approaches using a range of computational intelligence techniques Recent Advances in Hybrid Metaheuristics for Data Clustering offers a guide to the fundamentals of various metaheuristics and their application to data clustering. Metaheuristics are designed to tackle complex clustering problems where classical clustering algorithms have failed to be either effective or efficient. The authors?noted experts on the topic?provide a text that can aid in the design and development of hybrid metaheuristics to be applied to data clustering. The book includes performance analysis of the hybrid metaheuristics in relationship to their conventional counterparts. In addition to providing a review of data clustering, the authors include in-depth analysis of different optimization algorithms. The text offers a step-by-step guide in the build-up of hybrid metaheuristics and to enhance comprehension. In addition,Table of ContentsList of Contributors xiii Series Preface xv Preface xvii 1 Metaheuristic Algorithms in Fuzzy Clustering 1Sourav De, Sandip Dey, and Siddhartha Bhattacharyya 1.1 Introduction 1 1.2 Fuzzy Clustering 1 1.2.1 Fuzzy c-means (FCM) clustering 2 1.3 Algorithm 2 1.3.1 Selection of Cluster Centers 3 1.4 Genetic Algorithm 3 1.5 Particle Swarm Optimization 5 1.6 Ant Colony Optimization 6 1.7 Artificial Bee Colony Algorithm 7 1.8 Local Search-Based Metaheuristic Clustering Algorithms 7 1.9 Population-Based Metaheuristic Clustering Algorithms 8 1.9.1 GA-Based Fuzzy Clustering 8 1.9.2 PSO-Based Fuzzy Clustering 9 1.9.3 Ant Colony Optimization–Based Fuzzy Clustering 10 1.9.4 Artificial Bee Colony Optimization–Based Fuzzy Clustering 10 1.9.5 Differential Evolution–Based Fuzzy Clustering 11 1.9.6 Firefly Algorithm–Based Fuzzy Clustering 12 1.10 Conclusion 13 References 13 2 Hybrid Harmony Search Algorithm to Solve the Feature Selection for Data Mining Applications 19Laith Mohammad Abualigah, Mofleh Al-diabat, Mohammad Al Shinwan, Khaldoon Dhou, Bisan Alsalibi, Essam Said Hanandeh, and Mohammad Shehab 2.1 Introduction 19 2.2 Research Framework 21 2.3 Text Preprocessing 22 2.3.1 Tokenization 22 2.3.2 StopWords Removal 22 2.3.3 Stemming 23 2.3.4 Text Document Representation 23 2.3.5 TermWeight (TF-IDF) 23 2.4 Text Feature Selection 24 2.4.1 Mathematical Model of the Feature Selection Problem 24 2.4.2 Solution Representation 24 2.4.3 Fitness Function 24 2.5 Harmony Search Algorithm 25 2.5.1 Parameters Initialization 25 2.5.2 Harmony Memory Initialization 26 2.5.3 Generating a New Solution 26 2.5.4 Update Harmony Memory 27 2.5.5 Check the Stopping Criterion 27 2.6 Text Clustering 27 2.6.1 Mathematical Model of the Text Clustering 27 2.6.2 Find Clusters Centroid 27 2.6.3 Similarity Measure 28 2.7 k-means text clustering algorithm 28 2.8 Experimental Results 29 2.8.1 Evaluation Measures 29 2.8.1.1 F-measure Based on Clustering Evaluation 30 2.8.1.2 Accuracy Based on Clustering Evaluation 31 2.8.2 Results and Discussions 31 2.9 Conclusion 34 References 34 3 Adaptive Position–Based Crossover in the Genetic Algorithm for Data Clustering 39Arnab Gain and Prasenjit Dey 3.1 Introduction 39 3.2 Preliminaries 40 3.2.1 Clustering 40 3.2.1.1 k-means Clustering 40 3.2.2 Genetic Algorithm 41 3.3 RelatedWorks 42 3.3.1 GA-Based Data Clustering by Binary Encoding 42 3.3.2 GA-Based Data Clustering by Real Encoding 43 3.3.3 GA-Based Data Clustering for Imbalanced Datasets 44 3.4 Proposed Model 44 3.5 Experimentation 46 3.5.1 Experimental Settings 46 3.5.2 DB Index 47 3.5.3 Experimental Results 49 3.6 Conclusion 51 References 57 4 Application of Machine Learning in the Social Network 61Belfin R. V., E. Grace Mary Kanaga, and Suman Kundu 4.1 Introduction 61 4.1.1 Social Media 61 4.1.2 Big Data 62 4.1.3 Machine Learning 62 4.1.4 Natural Language Processing (NLP) 63 4.1.5 Social Network Analysis 64 4.2 Application of Classification Models in Social Networks 64 4.2.1 Spam Content Detection 65 4.2.2 Topic Modeling and Labeling 65 4.2.3 Human Behavior Analysis 67 4.2.4 Sentiment Analysis 68 4.3 Application of Clustering Models in Social Networks 68 4.3.1 Recommender Systems 69 4.3.2 Sentiment Analysis 70 4.3.3 Information Spreading or Promotion 70 4.3.4 Geolocation-Specific Applications 70 4.4 Application of Regression Models in Social Networks 71 4.4.1 Social Network and Human Behavior 71 4.4.2 Emotion Contagion through Social Networks 73 4.4.3 Recommender Systems in Social Networks 74 4.5 Application of Evolutionary Computing and Deep Learning in Social Networks 74 4.5.1 Evolutionary Computing and Social Network 75 4.5.2 Deep Learning and Social Networks 75 4.6 Summary 76 Acknowledgments 77 References 78 5 Predicting Students’ Grades Using CART, ID3, and Multiclass SVM Optimized by the Genetic Algorithm (GA): A Case Study 85Debanjan Konar, Ruchita Pradhan, Tania Dey, Tejaswini Sapkota, and Prativa Rai 5.1 Introduction 85 5.2 Literature Review 87 5.3 Decision Tree Algorithms: ID3 and CART 88 5.4 Multiclass Support Vector Machines (SVMs) Optimized by the Genetic Algorithm (GA) 90 5.4.1 Genetic Algorithms for SVM Model Selection 92 5.5 Preparation of Datasets 93 5.6 Experimental Results and Discussions 95 5.7 Conclusion 96 References 96 6 Cluster Analysis of Health Care Data Using Hybrid Nature-Inspired Algorithms 101Kauser Ahmed P, Rishabh Agrawal 6.1 Introduction 101 6.2 RelatedWork 102 6.2.1 Firefly Algorithm 102 6.2.2 k-means Algorithm 103 6.3 Proposed Methodology 104 6.4 Results and Discussion 106 6.5 Conclusion 110 References 111 7 Performance Analysis Through a Metaheuristic Knowledge Engine 113Indu Chhabra and Gunmala Suri 7.1 Introduction 113 7.2 Data Mining and Metaheuristics 114 7.3 Problem Description 115 7.4 Association Rule Learning 116 7.4.1 Association Mining Issues 116 7.4.2 Research Initiatives and Projects 116 7.5 Literature Review 117 7.6 Methodology 119 7.6.1 Phase 1: Pattern Search 120 7.6.2 Phase 2: Rule Mining 120 7.6.3 Phase 3: Knowledge Derivation 121 7.7 Implementation 121 7.7.1 Test Issues 121 7.7.2 System Evaluation 121 7.7.2.1 Indicator Matrix Formulation 122 7.7.2.2 Phase 1: Frequent Pattern Derivation 123 7.7.2.3 Phase 2: Association Rule Framing 123 7.7.2.4 Phase 3: Knowledge Discovery Through Metaheuristic Implementation 123 7.8 Performance Analysis 124 7.9 Research Contributions and Future Work 125 7.10 Conclusion 126 References 126 8 Magnetic Resonance Image Segmentation Using a Quantum-Inspired Modified Genetic Algorithm (QIANA) Based on FRCM 129Sunanda Das, Sourav De, Sandip Dey, and Siddhartha Bhattacharyya 8.1 Introduction 129 8.2 Literature Survey 131 8.3 Quantum Computing 133 8.3.1 Quoit-Quantum Bit 133 8.3.2 Entanglement 133 8.3.3 Measurement 133 8.3.4 Quantum Gate 134 8.4 Some Quality Evaluation Indices for Image Segmentation 134 8.4.1 F(I) 134 8.4.2 F’(I) 135 8.4.3 Q(I) 135 8.5 Quantum-Inspired Modified Genetic Algorithm (QIANA)–Based FRCM 135 8.5.1 Quantum-Inspired MEGA (QIANA)–Based FRCM 136 8.6 Experimental Results and Discussion 139 8.7 Conclusion 147 References 147 9 A Hybrid Approach Using the k-means and Genetic Algorithms for Image Color Quantization 151Marcos Roberto e Souza, Anderson Carlos Sousa e Santos, and Helio Pedrini 9.1 Introduction 151 9.2 Background 152 9.3 Color Quantization Methodology 154 9.3.1 Crossover Operators 157 9.3.2 Mutation Operators 158 9.3.3 Fitness Function 158 9.4 Results and Discussions 159 9.5 Conclusions and Future Work 168 Acknowledgments 168 References 168 Index 173

    10 in stock

    £99.70

© 2026 Book Curl

    • American Express
    • Apple Pay
    • Diners Club
    • Discover
    • Google Pay
    • Maestro
    • Mastercard
    • PayPal
    • Shop Pay
    • Union Pay
    • Visa

    Login

    Forgot your password?

    Don't have an account yet?
    Create account