Mathematics for Digital Science 3
Home > Computing and Information Technology > Computer science > Mathematics for Digital Science 3: Data Analysis and Optimization(ISTE Invoiced)
Mathematics for Digital Science 3: Data Analysis and Optimization(ISTE Invoiced)

Mathematics for Digital Science 3: Data Analysis and Optimization(ISTE Invoiced)


     0     
5
4
3
2
1



International Edition


X
About the Book

Over the past century, advancements in computer science have consistently resulted from extensive mathematical work. Even today, innovations in the digital domain continue to be grounded in a strong mathematical foundation. To succeed in this profession, both today's students and tomorrow’s computer engineers need a solid mathematical background. The goal of this book series is to offer a solid foundation of the knowledge essential to working in the digital sector. Across three volumes, it explores fundamental principles, digital information, data analysis, and optimization. Whether the reader is pursuing initial training or looking to deepen their expertise, the Mathematics for Digital Science series revisits familiar concepts, helping them refresh and expand their knowledge while also introducing equally essential, newer topics.

Table of Contents:
Preface ix Chapter 1. Linear Modeling for Two-Dimensional Data 1 1.1. Basic statistics 1 1.2. Linear adjustment 3 1.3. Linear correlation 7 Chapter 2. Multidimensional Data Analysis 13 2.1. Multidimensional tables 14 2.2. Analysis of a point cloud 24 2.2.1. Spatial analysis of individuals 24 2.2.2. Analysis in variable space 30 2.2.3. Link between the two spaces 32 2.3. Principal component factor analysis 35 2.3.1. Principles 35 2.3.2. Principal component factor analysis in practice 41 2.4. Appendix: useful software 48 2.5. Tanagra software 48 2.6. R software 56 Chapter 3. Introduction to Automatic Classification 65 3.1. Similarity and distance 66 3.1.1. Similarity, dissimilarity 66 3.1.2. Distance 67 3.2. Basics of information theory 69 3.3. Classification methods 78 3.4. Classification by partitioning 80 3.4.1. Partitioning principle 80 3.4.2. Inertia 81 3.4.3. Mobile center algorithm 82 3.5. Hierarchical classification 89 3.5.1. Principle 89 3.5.2. Aggregation strategies 90 3.5.3. Ward's aggregation strategy 98 3.6. Appendices 101 3.6.1. Huygens–König theorem 101 3.6.2. Classification software 103 Chapter 4. Linear Programming 109 4.1. An introductory example 110 4.2. General formulation 113 4.3. Geometry of a linear program 116 4.4. Simplex algorithm 118 4.5. Two-phase method. 129 4.6. Duality 135 4.7. Degeneracy 139 4.8. Introduction to integer linear programming 140 4.8.1. Gomory cuts 140 4.8.2. Branch and Bound algorithm 151 Chapter 5. Elements of Graph Theory 159 5.1. Definition and representations of a graph 160 5.1.1. Graphical representation 160 5.1.2. Tables associated with a graph 161 5.2. Main concepts and technology 162 5.2.1. Elements of a graph 163 5.2.2. Analysis of graph structure 168 5.3. Transitive closure of a graph's vertices 172 5.4. Decomposition of a directed graph into strongly connected components 173 5.5. Trees 175 5.5.1. Introduction 175 5.5.2. Trees in a graph 175 5.5.3. Spanning tree in a graph 177 5.6. Finding a fundamental system of independent cycles of a connected graph 179 5.7. Extremum spanning tree 180 5.7.1. General information 180 5.7.2. Extremum spanning tree search algorithms 180 Chapter 6. Path Optimization 187 6.1. Extremal-length paths 188 6.1.1. General information 188 6.1.2. Solving algorithms 189 6.1.3. Searching for ε -extremal paths 204 6.2. Hamiltonian path search 205 6.2.1. Decomposition into strongly connected components 205 6.2.2. Branch and Bound algorithm 207 Chapter 7. Transportation Problems 219 7.1. Maximum flow 220 7.1.1. General 220 7.1.2. Ford–Fulkerson theorem 223 7.1.3. Ford–Fulkerson algorithm 224 7.1.4. Practical solution method 230 7.2. Least cost transportation 236 7.2.1. Issues 236 7.2.2. Northwest Corner algorithm 238 7.2.3. Least cost method 240 7.2.4. Balas-Hammer or Vogel's algorithm 243 7.2.5. Stepping stone algorithm 246 7.2.6. Inequality of supply and demand 256 7.2.7. Unconnected graph and degeneration 257 7.2.8. Potentials and dual program 261 7.3. Assignment problems 263 7.3.1. Issues 263 7.3.2. Hungarian algorithm 269 Chapter 8. Scheduling Problems 279 8.1. Planning a project 280 8.1.1. Introduction 280 8.1.2. Earliest and latest date method 283 8.1.3. Gantt chart 289 8.2. Flow-shop problem 291 8.2.1. Johnson's algorithm for two machines 293 8.2.2. Case of three machines 297 8.3. The job-shop problem 306 References 311 List of Authors 313 Index 315

About the Author :
Gérard-Michel Cochard is Professor Emeritus at Université de Picardie Jules Verne, France, where he has held various senior positions. He has also served at the French Ministry of Education and the CNAM (Conservatoire National des Arts et Métiers). His research is conducted at the Eco-PRocédés, Optimisation et Aide à la Décision (EPROAD) laboratory, France. Mhand Hifi is Professor of Computer Science at Université de Picardie Jules Verne, France, where he heads the EPROAD UR 4669 laboratory and manages the ROD team. As an expert in operations research and NP-hard problem-solving, he actively contributes to numerous international conferences and journals in the field.


Best Sellers


Product Details
  • ISBN-13: 9781789451962
  • Publisher: ISTE Ltd
  • Publisher Imprint: ISTE Ltd
  • Language: English
  • Returnable: N
  • Returnable: N
  • Sub Title: Data Analysis and Optimization
  • ISBN-10: 1789451965
  • Publisher Date: 26 Jun 2025
  • Binding: Hardback
  • No of Pages: 336
  • Returnable: N
  • Series Title: ISTE Invoiced
  • Weight: 698 gr


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Mathematics for Digital Science 3: Data Analysis and Optimization(ISTE Invoiced)
ISTE Ltd -
Mathematics for Digital Science 3: Data Analysis and Optimization(ISTE Invoiced)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Mathematics for Digital Science 3: Data Analysis and Optimization(ISTE Invoiced)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!