University Sétif 1 FERHAT ABBAS Faculty of Sciences
Catégories
Ajouter le résultat dans votre panier Affiner la recherche
Titre : Algorithm and Design Complexity Type de document : document électronique Auteurs : Sherine Anli ; Jasmine Mary ; Peter Geno Editeur : Boca Raton : CRC Press Année de publication : 2023 Importance : 1 vol (181 p.) ISBN/ISSN/EAN : 978-1-00-086551-6 Langues : Français (fre) Catégories : Bibliothèque numérique:Informatique Mots-clés : Computer algorithms
Computational complexityIndex. décimale : 004 Informatique Résumé :
Computational complexity is critical in analysis of algorithms and is important to be able to select algorithms for efficiency and solvability. Algorithm and Design Complexity initiates with discussion of algorithm analysis, time-space trade-off, symptotic notations, and so forth. It further includes algorithms that are definite and effective, known as computational procedures. Further topics explored include divide-and-conquer, dynamic programming, and backtracking.Features: Includes complete coverage of basics and design of algorithms Discusses algorithm analysis techniques like divide-and-conquer, dynamic programming, and greedy heuristics Provides time and space complexity tutorials Reviews combinatorial optimization of Knapsack problem Simplifies recurrence relation for time complexity This book is aimed at graduate students and researchers in computers science, information technology, and electrical engineering.Note de contenu :
TABLE OF CONTENTS
chapter 1 Algorithm Analysis
chapter 2 Divide and Conquer
chapter 3 Dynamic Programming
chapter 4 Backtracking
chapter 5 GraphCôte titre : E-Fs/0038 En ligne : https://sciences-courses.univ-setif.dz/login/index.php Algorithm and Design Complexity [document électronique] / Sherine Anli ; Jasmine Mary ; Peter Geno . - Boca Raton : CRC Press, 2023 . - 1 vol (181 p.).
ISBN : 978-1-00-086551-6
Langues : Français (fre)
Catégories : Bibliothèque numérique:Informatique Mots-clés : Computer algorithms
Computational complexityIndex. décimale : 004 Informatique Résumé :
Computational complexity is critical in analysis of algorithms and is important to be able to select algorithms for efficiency and solvability. Algorithm and Design Complexity initiates with discussion of algorithm analysis, time-space trade-off, symptotic notations, and so forth. It further includes algorithms that are definite and effective, known as computational procedures. Further topics explored include divide-and-conquer, dynamic programming, and backtracking.Features: Includes complete coverage of basics and design of algorithms Discusses algorithm analysis techniques like divide-and-conquer, dynamic programming, and greedy heuristics Provides time and space complexity tutorials Reviews combinatorial optimization of Knapsack problem Simplifies recurrence relation for time complexity This book is aimed at graduate students and researchers in computers science, information technology, and electrical engineering.Note de contenu :
TABLE OF CONTENTS
chapter 1 Algorithm Analysis
chapter 2 Divide and Conquer
chapter 3 Dynamic Programming
chapter 4 Backtracking
chapter 5 GraphCôte titre : E-Fs/0038 En ligne : https://sciences-courses.univ-setif.dz/login/index.php Exemplaires (1)
Code-barres Cote Support Localisation Section Disponibilité E-Fs/0038 e-Fs/0038 E-Book Téléchargeable (PDF) Bibliothéque des sciences Anglais Téléchargeable
Disponible
Titre : Algorithm Design: A Methodological Approach - 150 Problems and Detailed Solutions Type de document : document électronique Auteurs : Bosc Patrick ; Guyom Marc ; Miclet Laurent Editeur : Boca Raton : CRC Press Année de publication : 2022 Importance : 1 vol (807 p.) ISBN/ISSN/EAN : 978-1-00-083479-6 Langues : Français (fre) Catégories : Bibliothèque numérique:Informatique Mots-clés : Algorithm Programming
Algorithms:Problems, exercises, etcIndex. décimale : 004 Informatique Résumé :
A bestseller in its French edition, this book is original in its construction and its success in the French market demonstrates its appeal. It is based on three principles: (1) An organization of the chapters by families of algorithms: exhaustive search, divide and conquer, etc. On the contrary, there is no chapter devoted only to a systematic exposure of, say, algorithms on strings. Some of these will be found in different chapters. (2) For each family of algorithms, an introduction is given to the mathematical principles and the issues of a rigorous design, with one or two pedagogical examples. (3) For the most part, the book details 150 problems, spanning seven families of algorithms. For each problem, a precise and progressive statement is given. More importantly, a complete solution is detailed, with respect to the design principles that have been presented; often, some classical errors are pointed out. Roughly speaking, two-thirds of the book is devoted to the detailed rational construction of the solutionsNote de contenu :
Table of Contents
Preface
- Mathematics and Computer Science: Some Useful Notions
- Complexity of an Algorithm
- Specifications, Invariants, Iteration
- Reduce and Conquer, Recursion
- Generate and Test
- Branch and Bound
- Greedy Algorithms
- Divide and Conquer
- Dynamic Programming
- Notations
-List of Problems
-Bibliography
-Index
Côte titre : E-Fs/0039 En ligne : https://sciences-courses.univ-setif.dz/login/index.php Algorithm Design: A Methodological Approach - 150 Problems and Detailed Solutions [document électronique] / Bosc Patrick ; Guyom Marc ; Miclet Laurent . - Boca Raton : CRC Press, 2022 . - 1 vol (807 p.).
ISBN : 978-1-00-083479-6
Langues : Français (fre)
Catégories : Bibliothèque numérique:Informatique Mots-clés : Algorithm Programming
Algorithms:Problems, exercises, etcIndex. décimale : 004 Informatique Résumé :
A bestseller in its French edition, this book is original in its construction and its success in the French market demonstrates its appeal. It is based on three principles: (1) An organization of the chapters by families of algorithms: exhaustive search, divide and conquer, etc. On the contrary, there is no chapter devoted only to a systematic exposure of, say, algorithms on strings. Some of these will be found in different chapters. (2) For each family of algorithms, an introduction is given to the mathematical principles and the issues of a rigorous design, with one or two pedagogical examples. (3) For the most part, the book details 150 problems, spanning seven families of algorithms. For each problem, a precise and progressive statement is given. More importantly, a complete solution is detailed, with respect to the design principles that have been presented; often, some classical errors are pointed out. Roughly speaking, two-thirds of the book is devoted to the detailed rational construction of the solutionsNote de contenu :
Table of Contents
Preface
- Mathematics and Computer Science: Some Useful Notions
- Complexity of an Algorithm
- Specifications, Invariants, Iteration
- Reduce and Conquer, Recursion
- Generate and Test
- Branch and Bound
- Greedy Algorithms
- Divide and Conquer
- Dynamic Programming
- Notations
-List of Problems
-Bibliography
-Index
Côte titre : E-Fs/0039 En ligne : https://sciences-courses.univ-setif.dz/login/index.php Exemplaires (1)
Code-barres Cote Support Localisation Section Disponibilité E-Fs/0039 e-Fs/0039 E-Book Téléchargeable (PDF) Bibliothéque des sciences Anglais Téléchargeable
Disponible
Titre : Artificial Intelligence for Intrusion Detection Systems Type de document : document électronique Auteurs : Swarnkar Mayank ; Singh Rajput Shyam Editeur : Boca Raton : CRC Press Année de publication : 2023 Importance : 1 vol (1 p.) ISBN/ISSN/EAN : 978-1-00-096755-5 Langues : Français (fre) Catégories : Bibliothèque numérique:Informatique Mots-clés : Intrusion detection systems (Computer security)
Artificial intelligenceIndex. décimale : 004 Informatique Résumé :
This book is associated with the cybersecurity issues and provides a wide view of the novel cyber attacks and the defense mechanisms, especially AI-based Intrusion Detection Systems (IDS).Features: A systematic overview of the state-of-the-art IDS Proper explanation of novel cyber attacks which are much different from classical cyber attacks Proper and in-depth discussion of AI in the field of cybersecurity Introduction to design and architecture of novel AI-based IDS with a trans- parent view of real-time implementations Covers a wide variety of AI-based cyber defense mechanisms, especially in the field of network-based attacks, IoT-based attacks, multimedia attacks, and blockchain attacks. This book serves as a reference book for scientific investigators who need to analyze IDS, as well as researchers developing methodologies in this field. It may also be used as a textbook for a graduate-level course on information security.Note de contenu :
TABLE OF CONTENTS
1. Intrusion Detection System Using Artificial Intelligence
Galiveeti Poornima, Deepak S Sakkari, Pallavi R, Sudha Y, Sukruth Gowda M
2. Robust, Efficient and Interpretable Adversarial AI Models for Intrusion Detection in Virtualization Environment
Arjun Singh, Avantika Gaur, Gaurav Kothari, Yutika Agarwal, Tejaswi, Preeti Mishra, Senthil Kumar Jagthessaperumal
3. Detection of Malicious Activities by Smart Signature-based IDS
Ramya Chinnasamy, Malliga Subramanian
4. Detection of Malicious Activities by AI-Supported Anomaly-based IDS
Akshaya Suresh and Dr. Arun Cyril Jose
5. An Artificial Intelligent Enabled Framework for Malware Detection
Mahendra Pratap Singh, Hrithik Bhat, Somesh Kartikeya, Shuddhatm Choudhary
6. IDS for Internet of Things (IoT) and Industrial IoT Network
Rashi Makwana
7. An Improved NIDS using RF Based Feature Selection Technique and Voting Classifier
Pankaj Kumar Keserwani, Mridul Mittal, Mahesh Chandra Govil
8. Enhanced AI-based Intrusion Detection and Response System for WSN
Dr. Kathirvel A, Dr. Maheswaran C. P.
9. Methodology for Programming of AI-based IDS
Dr. Parkavi K, Jeyavim Sherin R CCôte titre : E-Fs/0040 En ligne : https://sciences-courses.univ-setif.dz/login/index.php Artificial Intelligence for Intrusion Detection Systems [document électronique] / Swarnkar Mayank ; Singh Rajput Shyam . - Boca Raton : CRC Press, 2023 . - 1 vol (1 p.).
ISBN : 978-1-00-096755-5
Langues : Français (fre)
Catégories : Bibliothèque numérique:Informatique Mots-clés : Intrusion detection systems (Computer security)
Artificial intelligenceIndex. décimale : 004 Informatique Résumé :
This book is associated with the cybersecurity issues and provides a wide view of the novel cyber attacks and the defense mechanisms, especially AI-based Intrusion Detection Systems (IDS).Features: A systematic overview of the state-of-the-art IDS Proper explanation of novel cyber attacks which are much different from classical cyber attacks Proper and in-depth discussion of AI in the field of cybersecurity Introduction to design and architecture of novel AI-based IDS with a trans- parent view of real-time implementations Covers a wide variety of AI-based cyber defense mechanisms, especially in the field of network-based attacks, IoT-based attacks, multimedia attacks, and blockchain attacks. This book serves as a reference book for scientific investigators who need to analyze IDS, as well as researchers developing methodologies in this field. It may also be used as a textbook for a graduate-level course on information security.Note de contenu :
TABLE OF CONTENTS
1. Intrusion Detection System Using Artificial Intelligence
Galiveeti Poornima, Deepak S Sakkari, Pallavi R, Sudha Y, Sukruth Gowda M
2. Robust, Efficient and Interpretable Adversarial AI Models for Intrusion Detection in Virtualization Environment
Arjun Singh, Avantika Gaur, Gaurav Kothari, Yutika Agarwal, Tejaswi, Preeti Mishra, Senthil Kumar Jagthessaperumal
3. Detection of Malicious Activities by Smart Signature-based IDS
Ramya Chinnasamy, Malliga Subramanian
4. Detection of Malicious Activities by AI-Supported Anomaly-based IDS
Akshaya Suresh and Dr. Arun Cyril Jose
5. An Artificial Intelligent Enabled Framework for Malware Detection
Mahendra Pratap Singh, Hrithik Bhat, Somesh Kartikeya, Shuddhatm Choudhary
6. IDS for Internet of Things (IoT) and Industrial IoT Network
Rashi Makwana
7. An Improved NIDS using RF Based Feature Selection Technique and Voting Classifier
Pankaj Kumar Keserwani, Mridul Mittal, Mahesh Chandra Govil
8. Enhanced AI-based Intrusion Detection and Response System for WSN
Dr. Kathirvel A, Dr. Maheswaran C. P.
9. Methodology for Programming of AI-based IDS
Dr. Parkavi K, Jeyavim Sherin R CCôte titre : E-Fs/0040 En ligne : https://sciences-courses.univ-setif.dz/login/index.php Exemplaires (1)
Code-barres Cote Support Localisation Section Disponibilité E-Fs/0040 e-Fs/0040 E-Book Téléchargeable (PDF) Bibliothéque des sciences Anglais Téléchargeable
Disponible
Titre : Computer Arithmetic in Practice : Exercises and Programming Type de document : document électronique Auteurs : Gryś Sławomir Editeur : Boca Raton : CRC Press Année de publication : 2024 Importance : 1 vol (197 p.) ISBN/ISSN/EAN : 978-1-00-093489-2 Langues : Français (fre) Catégories : Bibliothèque numérique:Informatique Mots-clés : Computer arithmetic:Problems, exercises, etc
Computer programming:Problems, exercises, etcIndex. décimale : 004 Informatique Résumé :
Computer Arithmetic in Practice: Exercises and Programming is a simple, brief introductory volume for undergraduate and graduate students at university courses interested in understanding the foundation of computers. It is focused on numeric data formats and capabilities of computers to perform basic arithmetic operations. It discusses mainly such topics as: Basic concepts of computer architecture Assembly language programming skills Data formats used to express integer and real numbers Algorithms of basic arithmetic operations Short overview of nonlinear functions evaluation Discussion on limited number representation and computer arithmetic Exercises and programming tasks This book provides an accessible overview of common data formats used to write numbers in programming languages and how the computer performs four basic arithmetic operations from the point of view of the processor instruction set. The book is primarily didactic in nature, therefore the theoretical information is enriched with many numerical examples and exercises to be solved using a ‘sheet of paper and a pencil'. Answers are provided for most of the tasks. The theoretical discussed issues are illustrated by listings of algorithms presenting the way to implement arithmetic operations in low-level language. It allows development of the skills of optimal programming, taking into consideration the computer architecture and limitations. Creating software using low-level language programming, despite the initial difficulties, gives the ability to control the code and create efficient applications. This allows for effective consolidation of knowledge and acquisition of practical skills required at this stage of education, mainly a specialist in the field of information technology, electronics, telecommunications, other related disciplines, or at the level of general education with introduction to information technology. It may be also useful for engineers interested in their own professional development and teachers as well.Note de contenu :
Table of Contents
Chapter 1: Basic concepts of computer architecture.
Chapter 2: Numbers in fixed-point format.
Chapter 3: Basic arithmetic on fixed-point numbers.
Chapter 4: Numbers in floating-point format.
Chapter 5: Basic arithmetic operations on floating-point numbers.
Chapter 6: Limited quality of arithmetic operations.
Appendices.
Index.
Côte titre : E-Fs/0041 En ligne : https://sciences-courses.univ-setif.dz/login/index.php Computer Arithmetic in Practice : Exercises and Programming [document électronique] / GryÅ› SÅ‚awomir . - Boca Raton : CRC Press, 2024 . - 1 vol (197 p.).
ISBN : 978-1-00-093489-2
Langues : Français (fre)
Catégories : Bibliothèque numérique:Informatique Mots-clés : Computer arithmetic:Problems, exercises, etc
Computer programming:Problems, exercises, etcIndex. décimale : 004 Informatique Résumé :
Computer Arithmetic in Practice: Exercises and Programming is a simple, brief introductory volume for undergraduate and graduate students at university courses interested in understanding the foundation of computers. It is focused on numeric data formats and capabilities of computers to perform basic arithmetic operations. It discusses mainly such topics as: Basic concepts of computer architecture Assembly language programming skills Data formats used to express integer and real numbers Algorithms of basic arithmetic operations Short overview of nonlinear functions evaluation Discussion on limited number representation and computer arithmetic Exercises and programming tasks This book provides an accessible overview of common data formats used to write numbers in programming languages and how the computer performs four basic arithmetic operations from the point of view of the processor instruction set. The book is primarily didactic in nature, therefore the theoretical information is enriched with many numerical examples and exercises to be solved using a ‘sheet of paper and a pencil'. Answers are provided for most of the tasks. The theoretical discussed issues are illustrated by listings of algorithms presenting the way to implement arithmetic operations in low-level language. It allows development of the skills of optimal programming, taking into consideration the computer architecture and limitations. Creating software using low-level language programming, despite the initial difficulties, gives the ability to control the code and create efficient applications. This allows for effective consolidation of knowledge and acquisition of practical skills required at this stage of education, mainly a specialist in the field of information technology, electronics, telecommunications, other related disciplines, or at the level of general education with introduction to information technology. It may be also useful for engineers interested in their own professional development and teachers as well.Note de contenu :
Table of Contents
Chapter 1: Basic concepts of computer architecture.
Chapter 2: Numbers in fixed-point format.
Chapter 3: Basic arithmetic on fixed-point numbers.
Chapter 4: Numbers in floating-point format.
Chapter 5: Basic arithmetic operations on floating-point numbers.
Chapter 6: Limited quality of arithmetic operations.
Appendices.
Index.
Côte titre : E-Fs/0041 En ligne : https://sciences-courses.univ-setif.dz/login/index.php Exemplaires (1)
Code-barres Cote Support Localisation Section Disponibilité E-Fs/0041 e-Fs/0041 E-Book Téléchargeable (PDF) Bibliothéque des sciences Anglais Téléchargeable
Disponible
Titre : Data Structure Using C : Theory and Program Type de document : document électronique Auteurs : Ahmad Talha Siddiqui ; Shoeb Ahad Siddiqui Editeur : Boca Raton : CRC Press Année de publication : 2023 Importance : 1 vol (313 p.) ISBN/ISSN/EAN : 978-1-00-098547-4 Langues : Français (fre) Catégories : Bibliothèque numérique:Informatique Mots-clés : Data structures (Computer science)
C (Computer program language)Index. décimale : 005.1 Programmation Résumé :
Data Structures is a central module in the curriculum of almost every Computer Science programme. This book explains different concepts of data structures using C. The topics discuss the theoretical basis of data structures as well as their applied aspectsNote de contenu :
TABLE OF CONTENTS
1 Introduction to Data Structures
2 Introduction to Array
3 Linked List
4 Stack
5 Queues
6 Trees
7 Graphs
8 Searching and Sorting
9 Hashing Techniques
Côte titre : E-Fs/0042 En ligne : https://sciences-courses.univ-setif.dz/login/index.php Data Structure Using C : Theory and Program [document électronique] / Ahmad Talha Siddiqui ; Shoeb Ahad Siddiqui . - Boca Raton : CRC Press, 2023 . - 1 vol (313 p.).
ISBN : 978-1-00-098547-4
Langues : Français (fre)
Catégories : Bibliothèque numérique:Informatique Mots-clés : Data structures (Computer science)
C (Computer program language)Index. décimale : 005.1 Programmation Résumé :
Data Structures is a central module in the curriculum of almost every Computer Science programme. This book explains different concepts of data structures using C. The topics discuss the theoretical basis of data structures as well as their applied aspectsNote de contenu :
TABLE OF CONTENTS
1 Introduction to Data Structures
2 Introduction to Array
3 Linked List
4 Stack
5 Queues
6 Trees
7 Graphs
8 Searching and Sorting
9 Hashing Techniques
Côte titre : E-Fs/0042 En ligne : https://sciences-courses.univ-setif.dz/login/index.php Exemplaires (1)
Code-barres Cote Support Localisation Section Disponibilité E-Fs/0042 e-Fs/0042 E-Book Téléchargeable (PDF) Bibliothéque des sciences Anglais Téléchargeable
DisponiblePermalinkPermalinkPermalinkLearn Programming with C : An Easy Step-by-Step Self-Practice Book for Learning C / Sazzad M.S. Imran
PermalinkPermalinkPermalinkPermalinkPermalinkPermalinkPermalink
