Бібліотека БДМУ

Головна

Спрощенний режим

Опис

Бази даних

Доступ до повнотекстових книг Springer Nature (через IP-адреси БДМУ) - результати пошуку

Вид пошуку

К Н И Г И

Періодичні видання

Дисертації та автореферати

Фонд рідкісних видань

Електронна Навчальна література

Публікації засновників кафедр БДМУ

Нововведення у сфері охорони здоров'я

Календар пам'ятних дат

Доступ до повнотекстових книг Springer Nature (через IP-адреси БДМУ)

Зона пошуку

у знайденому

Формат представлення знайдених документів:
повний	інформаційний	короткий

Відсортувати знайдені документи за:
автором	назвою	роком видання	типом документа

Пошуковий запит: (<.>S=Computer science—Mathematics.<.>)

Загальна кiлькiсть документiв : 139
Показанi документи с 1 за 20

1-20 21-40 41-60 61-80 81-100 101-120

    Ayala-Rincon, Mauricio.
    Applied Logic for Computer Scientists [[electronic resource] :] : computational Deduction and Formal Proofs / / Mauricio. Ayala-Rincon, de Moura, Flavio L. C. ; . - 1st ed. 2017. - [S. l. : s. n.]. - XVIII, 150 p. 4 illus. - Б. ц.
    Зміст:
Foreword. - Preface --
Introduction --
Derivation and Proofs in the Propositional Logic --
Derivations and Proofs in the Predicate Logic --
Deductions in the Style of Gentzen's Sequent Calculus --
Derivations and Formalizations --
Algebraic and Computational Examples --
Suggested Readings --
Index.
Рубрики: Computer logic.
   Mathematical logic.
   Computer science—Mathematics.
   Logics and Meanings of Programs.
   Mathematical Logic and Formal Languages.
   Math Applications in Computer Science.
Анотація: This book provides an introduction to logic and mathematical induction which are the basis of any deductive computational framework. A strong mathematical foundation of the logical engines available in modern proof assistants, such as the PVS verification system, is essential for computer scientists, mathematicians and engineers to increment their capabilities to provide formal proofs of theorems and to certify the robustness of software and hardware systems. The authors present a concise overview of the necessary computational and mathematical aspects of ‘logic’, placing emphasis on both natural deduction and sequent calculus. Differences between constructive and classical logic are highlighted through several examples and exercises. Without neglecting classical aspects of computational logic, the authors also highlight the connections between logical deduction rules and proof commands in proof assistants, presenting simple examples of formalizations of the correctness of algebraic functions and algorithms in PVS.     Applied Logic for Computer Scientists will not only benefit students of computer science and mathematics but also software, hardware, automation, electrical and mechatronic engineers who are interested in the application of formal methods and the related computational tools to provide mathematical certificates of the quality and accuracy of their products and technologies. .

Перейти: https://doi.org/10.1007/978-3-319-51653-0

Дод.точки доступу:
de Moura, Flavio L. C.; Ayala-Rincon, Mauricio. \.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

    Mathematics and Computing [[electronic resource] :] : third International Conference, ICMC 2017, Haldia, India, January 17-21, 2017, Proceedings / / ed. Giri, Debasis. [et al.]. - 1st ed. 2017. - [S. l. : s. n.]. - XX, 424 p. 51 illus. - Б. ц.
    Зміст:
Security and privacy --
Design of a certicateless designated server based searchable public key encryption scheme --
On the Security of a Searchable Anonymous Attribute Based Encryption --
Security on "Secure Remote Login Scheme with Password and Smart Card Update Facilities” --
Design of Secure and Efficient Electronic Payment System for Mobile Users --
A Deep Learning Based Artificial Neural Network Approach for Intrusion Detection --
Computing --
A Note on the Optimal Immunity of Boolean Functions against Fast Algebraic Attacks --
Study of Five?Neighborhood Linear Hybrid Cellular Automata and their Synthesis --
Cache optimized solution for sparse linear system over large order finite field --
Connected Fair Domination in Graphs --
Coordinating Particle Swarm Optimization, Ant Colony Optimization and K?Opt algorithm for Traveling Salesman Problem --
FASER128 and its countermeasure --
Modelling of Aircraft’s Dynamics Using Least Square Support Vector Machine Regression --
Accommodative FAS?FMG multilevel based meshfree augmented RBF?FD method for Navier?Stokes equations in spherical geometry --
Applied Mathematics. Bessel sequences and Frames in Semi?inner product Spaces --
Finiteness of Criss?Cross Method in Complementarity Problem --
Imprecise Constrained Covering Solid Travelling Salesman Problem with Credibility --
Newton Like Line Search Method using q?Calculus --
Existence results of a generalized mixed exponential type vector variational?like inequalities. - On Approximate Solutions to One Class of Nonlinear Differential Equations --
A Davidon?Fletcher?Powell Type Quasi?Newton Method to Solve Fuzzy Optimization Problems --
Bifurcation analysis of a delayed modified Holling?Tanner predator?prey model with refuge --
Improvement of analytical solution to the inverse truly nonlinear oscillator by Extended Iterative method. - Constrained Data Visualization using Rational Bi?cubic Fractal Functions --
Electrokinetic flow in a surface corrugated microchannel --
Pure Mathematics --
Fundamental solutions to the Laplacian in plane domains bounded by ellipses --
A Nice Representation for a Link between Bernstein?Durrmeyer and Kantorovich Operators --
Construction of Fractal Bases for Spaces of Functions. – Infinite Matrices Bounded on Weighted $c_0$ Space --
Mapping properties of one class of quasielliptic operators --
$\mathcal{I}_\lambda$? Double Statistical Convergence In Topological Groups --
Superconvergence results for Volterra?Urysohn integral equations of second kind --
Derivations on Lie Ideals of Prime Gamma?Rings --
4.9 $\lambda_{d}$? Statistical convergence, $\lambda_{d}$? statistical boundedness and strong $\left( V,\lambda \right) _{d}?$summability\ in metric spaces --
On Gamma?rings with Permuting Skew Tri?derivations --
A Higher Order Implicit Method for Numerical Solution of Singular Initial Value Problems.
Рубрики: Data protection.
   Computer science—Mathematics.
   Security.
   Mathematics of Computing.
Анотація: This book constitutes the proceedings of the Third International Conference on Mathematics and Computing, ICMC 2017, held in Haldia, India, in January 2017. The 35 papers presented in this volume were carefully reviewed and selected from 129 submissions. They were organized in topical sections named: security and privacy; computing; applied mathematics; and pure mathematics. .

Перейти: https://doi.org/10.1007/978-981-10-4642-1

Дод.точки доступу:
Giri, Debasis. \ed.\; Mohapatra, Ram N. \ed.\; Begehr, Heinrich. \ed.\; Obaidat, Mohammad S. \ed.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

    The Incomputable [[electronic resource] :] : journeys Beyond the Turing Barrier / / ed.: Cooper, S. Barry., Soskova, Mariya I. - 1st ed. 2017. - [S. l. : s. n.]. - X, 292 p. 10 illus. in color. - Б. ц.
    Зміст:
Part I, Challenging Turing: Extended Models of Computation --
Ivan Soskov: A Life in Computability --
Physical Logic --
From Quantum Foundations via Natural Language Meaning to a Theory of Everything --
Part II, The Search for "Natural" Examples of Incomputable Objects --
Some Recent Research Directions in the Computably Enumerable Sets --
Uncomputability and Physical Law --
Algorithmic Economics: Incomputability, Undecidability and Unsolvability in Economics --
Part III, Mind, Matter and Computation --
Is Quantum Physics Relevant for Life? --
Trouble with Computation: A Refutation of Digital Ontology --
Part IV, The Nature of Information: Complexity and Randomness --
Complexity Barriers as Independence --
Quantum Randomness: From Practice to Theory and Back --
Calculus of Cost Functions --
Part V --
The Mathematics of Emergence and Morphogenesis --
Turing’s Theory of Morphogenesis: Where We Started, Where We Are and Where We Want to Go --
Construction Kits for Biological Evolution.
Рубрики: Computers.
   Computer science—Mathematics.
   Mathematical logic.
   Theory of Computation.
   Mathematics of Computing.
   Mathematical Logic and Foundations.
Анотація: This book questions the relevance of computation to the physical universe. Our theories deliver computational descriptions, but the gaps and discontinuities in our grasp suggest a need for continued discourse between researchers from different disciplines, and this book is unique in its focus on the mathematical theory of incomputability and its relevance for the real world. The core of the book consists of thirteen chapters in five parts on extended models of computation; the search for natural examples of incomputable objects; mind, matter, and computation; the nature of information, complexity, and randomness; and the mathematics of emergence and morphogenesis. This book will be of interest to researchers in the areas of theoretical computer science, mathematical logic, and philosophy.

Перейти: https://doi.org/10.1007/978-3-319-43669-2

Дод.точки доступу:
Cooper, S. Barry. \ed.\; Soskova, Mariya I. \ed.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

    Operations Research and Enterprise Systems [[electronic resource] :] : 5th International Conference, ICORES 2016, Rome, Italy, February 23-25, 2016, Revised Selected Papers / / ed.: Vitoriano, Begona., Parlier, Greg H. - 1st ed. 2017. - [S. l. : s. n.]. - XII, 261 p. 77 illus. - Б. ц.
Рубрики: Computer science—Mathematics.
   Application software.
   Production management.
   Operations research.
   Management science.
   Information technology.
   Business—Data processing.
   Mathematics of Computing.
   Information Systems Applications (incl. Internet).
   Computer Applications.
   Operations Management.
   Operations Research, Management Science.
   IT in Business.
Анотація: This book constitutes revised selected papers from the 5th International Conference on Operations Research and Enterprise Systems, ICORES 2016, held in Rome, Italy, in February 2016. The 14 papers presented in this volume were carefully reviewed and selection from a total of 75 submissions. They are organized in topical sections named: methodologies and technologies; and applications. .

Перейти: https://doi.org/10.1007/978-3-319-53982-9

Дод.точки доступу:
Vitoriano, Begona. \ed.\; Parlier, Greg H. \ed.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

    Bultan, Tevfik.
    String Analysis for Software Verification and Security [[electronic resource] /] : монография / Tevfik. Bultan, Yu, Fang., Alkhalaf, Muath., Aydin, Abdulbaki. ; . - 1st ed. 2017. - [S. l. : s. n.]. - IX, 174 p. 74 illus., 6 illus. in color. - Б. ц.
    Зміст:
1 Introduction: String Manipulating Programs and Difficulty of Their Analysis --
2 String Manipulating Programs and Difficulty of Their Analysis --
3 State Space Exploration --
4 Automata Based String Analysis --
5 Relational String Analysis --
6 Abstraction and Approximation --
7 Constraint-based String Analysis --
8 Vulnerability Detection and Sanitization Synthesis --
9 Differential String Analysis and Repair --
10 Tools --
11 A Brief Survey of Related Work --
12 Conclusions.
Рубрики: Computer security.
   Programming languages (Electronic computers).
   Software engineering.
   Computer logic.
   Mathematical logic.
   Computer science—Mathematics.
   Systems and Data Security.
   Programming Languages, Compilers, Interpreters.
   Software Engineering.
   Logics and Meanings of Programs.
   Mathematical Logic and Formal Languages.
   Symbolic and Algebraic Manipulation.
Анотація: This book discusses automated string-analysis techniques, focusing particularly on automata-based static string analysis. It covers the following topics: automata-bases string analysis, computing pre and post-conditions of basic string operations using automata, symbolic representation of automata, forward and backward string analysis using symbolic automata representation, constraint-based string analysis, string constraint solvers, relational string analysis, vulnerability detection using string analysis, string abstractions, differential string analysis, and automated sanitization synthesis using string analysis. String manipulation is a crucial part of modern software systems; for example, it is used extensively in input validation and sanitization and in dynamic code and query generation. The goal of string-analysis techniques and this book is to determine the set of values that string expressions can take during program execution. String analysis can be used to solve many problems in modern software systems that relate to string manipulation, such as: (1) Identifying security vulnerabilities by checking if a security sensitive function can receive an input string that contains an exploit; (2) Identifying possible behaviors of a program by identifying possible values for dynamically generated code; (3) Identifying html generation errors by computing the html code generated by web applications; (4) Identifying the set of queries that are sent to back-end database by analyzing the code that generates the SQL queries; (5) Patching input validation and sanitization functions by automatically synthesizing repairs illustrated in this book. Like many other program-analysis problems, it is not possible to solve the string analysis problem precisely (i.e., it is not possible to precisely determine the set of string values that can reach a program point). However, one can compute over- or under-approximations of possible string values. If the approximations are precise enough, they can enable developers to demonstrate existence or absence of bugs in string manipulating code. String analysis has been an active research area in the last decade, resulting in a wide variety of string-analysis techniques. This book will primarily target researchers and professionals working in computer security, software verification, formal methods, software engineering and program analysis. Advanced level students or instructors teaching or studying courses in computer security, software verification or program analysis will find this book useful as a secondary text. .

Перейти: https://doi.org/10.1007/978-3-319-68670-7

Дод.точки доступу:
Yu, Fang.; Alkhalaf, Muath.; Aydin, Abdulbaki.; Bultan, Tevfik. \.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

    Krasil'shchik, Joseph.
    The Symbolic Computation of Integrability Structures for Partial Differential Equations [[electronic resource] /] : монография / Joseph. Krasil'shchik, Verbovetsky, Alexander., Vitolo, Raffaele. ; . - 1st ed. 2017. - [S. l. : s. n.]. - XV, 263 p. 28 illus. - Б. ц.
    Зміст:
Introduction --
Computational problems in the geometry of PDEs --
Old and new Reduce software for integrability of PDEs --
Internal coordinates and total derivatives --
Conservation laws and nonlocal variables --
Cosymmetries --
Symmetries --
The tangent covering --
Recursion operators for symmetries --
Variational symplectic structures --
Cotangent covering --
Variational Poisson structures --
Recursion operators for cosymmetries --
The Plebanski equation --
Discussion.
Рубрики: Difference equations.
   Functional equations.
   Computer science—Mathematics.
   Difference and Functional Equations.
   Math Applications in Computer Science.
   Symbolic and Algebraic Manipulation.
Анотація: This is the first book devoted to the task of computing integrability structures by computer. The symbolic computation of integrability operator is a computationally hard problem and the book covers a huge number of situations through tutorials. The mathematical part of the book is a new approach to integrability structures that allows to treat all of them in a unified way. The software is an official package of Reduce. Reduce is free software, so everybody can download it and make experiments using the programs available at our website.

Перейти: https://doi.org/10.1007/978-3-319-71655-8

Дод.точки доступу:
Verbovetsky, Alexander.; Vitolo, Raffaele.; Krasil'shchik, Joseph. \.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

    Vince, John.
    Mathematics for Computer Graphics [[electronic resource] /] : монография / John. Vince ; . - 5th ed. 2017. - [S. l. : s. n.]. - XIX, 505 p. 292 illus. in color. - Б. ц.
    Зміст:
Introduction --
Numbers --
Algebra --
Trigonometry --
Coordinate Systems --
Determinants --
Vectors --
Matrix Algebra --
Geometric Transforms --
Interpolation --
Curves and Patches --
Analytic Geometry --
Barycentric Coordinates --
Geometric Algebra --
Calculus: Derivatives --
Calculus: Integration --
Worked Examples --
Conclusion.
Рубрики: Computer graphics.
   Computer science—Mathematics.
   Computer mathematics.
   Computer Graphics.
   Mathematical Applications in Computer Science.
Анотація: John Vince explains a wide range of mathematical techniques and problem-solving strategies associated with computer games, computer animation, virtual reality, CAD and other areas of computer graphics in this completely revised and expanded fifth edition. The first five chapters cover a general introduction, number sets, algebra, trigonometry and coordinate systems, which are employed in the following chapters on vectors, matrix algebra, transforms, interpolation, curves and patches, analytic geometry and barycentric coordinates. Following this, the reader is introduced to the relatively new topic of geometric algebra, followed by two chapters that introduce differential and integral calculus. Finally, there is a chapter on worked examples. Mathematics for Computer Graphics covers all of the key areas of the subject, including: · Number sets · Algebra · Trigonometry · Coordinate systems · Determinants · Vectors · Quaternions · Matrix algebra · Geometric transforms · Interpolation · Curves and surfaces · Analytic geometry · Barycentric coordinates · Geometric algebra · Differential calculus · Integral calculus This fifth edition contains over 120 worked examples and over 320 colour illustrations, which are central to the author’s descriptive writing style. Mathematics for Computer Graphics provides a sound understanding of the mathematics required for computer graphics, giving a fascinating insight into the design of computer graphics software and setting the scene for further reading of more advanced books and technical research papers.

Перейти: https://doi.org/10.1007/978-1-4471-7336-6

Дод.точки доступу:
Vince, John. \.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

    Computer Games [[electronic resource] :] : 5th Workshop on Computer Games, CGW 2016, and 5th Workshop on General Intelligence in Game-Playing Agents, GIGA 2016, Held in Conjunction with the 25th International Conference on Artificial Intelligence, IJCAI 2016, New York, USA, July 9-10, 2016, Revised Selected Papers / / ed. Cazenave, Tristan. [et al.]. - 1st ed. 2017. - [S. l. : s. n.]. - XII, 179 p. 59 illus. - Б. ц.
Рубрики: Artificial intelligence.
   Personal computers.
   Computer science—Mathematics.
   Computers.
   Artificial Intelligence.
   Personal Computing.
   Mathematics of Computing.
   Theory of Computation.
Анотація: This book constitutes the refereed proceedings of the 5th Computer Games Workshop, CGW 2016, and the 5th Workshop on General Intelligence in Game-Playing Agents, GIGA 2016, held in conjunction with the 25th International Conference on Artificial Intelligence, IJCAI 2016, in New York, USA, in July 2016. The 12 revised full papers presented were carefully reviewed and selected from 25 submissions. The papers address all aspects of artificial intelligence and computer game playing. They discuss topics such as Monte-Carlo methods; heuristic search; board games; card games; video games; perfect and imperfect information games; puzzles and single player games; multi-player games; combinatorial game theory; applications; computational creativity; computational game theory; evaluation and analysis; game design; knowledge representation; machine learning; multi-agent systems; opponent modeling; planning. .

Перейти: https://doi.org/10.1007/978-3-319-57969-6

Дод.точки доступу:
Cazenave, Tristan. \ed.\; Winands, Mark H.M. \ed.\; Edelkamp, Stefan. \ed.\; Schiffel, Stephan. \ed.\; Thielscher, Michael. \ed.\; Togelius, Julian. \ed.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

    Distributed Computer and Communication Networks [[electronic resource] :] : 20th International Conference, DCCN 2017, Moscow, Russia, September 25–29, 2017, Proceedings / / ed.: Vishnevskiy, Vladimir M., Samouylov, Konstantin E., Kozyrev, Dmitry V. - 1st ed. 2017. - [S. l. : s. n.]. - XIV, 478 p. 181 illus. - Б. ц.
    Зміст:
Computer and communication networks architecture optimization --
Control in computer and communication networks --
Performance and QoS/QoE evaluation in wireless networks --
Analytical modeling and simulation of next-generation communications systems --
Queuing theory and reliability theory applications in computer networks --
Wireless 4G/5G networks, cm- and mm-wave radio technologies --
RFID technology and its application in intellectual transportation networks --
Internet of things, wearables, and applications of distributed information systems --
Probabilistic and statistical models in information systems --
Mathematical modeling of high-tech systems --
Mathematical modeling and control problems --
Distributed and cloud computing systems, big data analytics.
Рубрики: Computer communication systems.
   Mathematical statistics.
   Computer system failures.
   Computer simulation.
   Computer science—Mathematics.
   Application software.
   Computer Communication Networks.
   Probability and Statistics in Computer Science.
   System Performance and Evaluation.
   Simulation and Modeling.
   Math Applications in Computer Science.
   Information Systems Applications (incl. Internet).
Анотація: This book constitutes the refereed proceedings of the 20th International Conference on Distributed and Computer and Communication Networks, DCCN 2017, held in Moscow, Russia, in September 2017. The 39 full papers and the two short papers were carefully reviewed and selected from 176 submissions. The papers cover the following topics: computer and communication networks architecture optimization; control in computer and communication networks; performance and QoS/QoE evaluation in wireless networks; analytical modeling and simulation of next-generation communications systems; queueing theory and reliability theory applications in computer networks; wireless 4G/5G networks, cm- and mm-wave radio technologies; RFID technology and its application in intellectual transportation networks; Internet of Things, wearables, and applications of distributed information systems; probabilistic and statistical models in information systems; mathematical modeling of high-tech systems; mathematical modeling and control problems; distributed and cloud computing systems, big data analytics.

Перейти: https://doi.org/10.1007/978-3-319-66836-9

Дод.точки доступу:
Vishnevskiy, Vladimir M. \ed.\; Samouylov, Konstantin E. \ed.\; Kozyrev, Dmitry V. \ed.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

10.

    Lavor, Carlile.
    An Introduction to Distance Geometry applied to Molecular Geometry [[electronic resource] /] : монография / Carlile. Lavor, Liberti, Leo., A. Lodwick, Weldon., Mendonca da Costa, Tiago. ; . - 1st ed. 2017. - [S. l. : s. n.]. - IX, 54 p. 27 illus. in color. - Б. ц.
    Зміст:
Introduction --
The Distance Geometry Problem --
From Continuous to Discrete --
The Discretizable Distance Geometry Problem --
The Discretizable Molecular Distance Geometry Problem --
Distance Geometry and Molecular Geometry.
Рубрики: Application software.
   Bioinformatics.
   Applied mathematics.
   Engineering mathematics.
   Computer science—Mathematics.
   Computer Applications.
   Bioinformatics.
   Applications of Mathematics.
   Math Applications in Computer Science.
Анотація: This book is a pedagogical presentation aimed at advanced undergraduate students, beginning graduate students and professionals who are looking for an introductory text to the field of Distance Geometry, and some of its applications. This versions profits from feedback acquired at undergraduate/graduate courses in seminars and a number of workshops. .

Перейти: https://doi.org/10.1007/978-3-319-57183-6

Дод.точки доступу:
Liberti, Leo.; A. Lodwick, Weldon.; Mendonca da Costa, Tiago.; Lavor, Carlile. \.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

11.

    Deep Learning for Biometrics [[electronic resource] /] : монография / ed.: Bhanu, Bir., Kumar, Ajay. - 1st ed. 2017. - [S. l. : s. n.]. - XXXI, 312 p. 117 illus., 96 illus. in color. - Б. ц.
    Зміст:
Part I: Deep Learning for Face Biometrics --
The Functional Neuroanatomy of Face Processing: Insights from Neuroimaging and Implications for Deep Learning --
Real-Time Face Identification via Multi-Convolutional Neural Network and Boosted Hashing Forest --
CMS-RCNN: Contextual Multi-Scale Region-Based CNN for Unconstrained Face Detection --
Part II: Deep Learning for Fingerprint, Fingervein and Iris Recognition --
Latent Fingerprint Image Segmentation Using Deep Neural Networks --
Finger Vein Identification Using Convolutional Neural Network and Supervised Discrete Hashing --
Iris Segmentation Using Fully Convolutional Encoder-Decoder Networks --
Part III: Deep Learning for Soft Biometrics --
Two-Stream CNNs for Gesture-Based Verification and Identification: Learning User Style --
DeepGender2: A Generative Approach Toward Occlusion and Low Resolution Robust Facial Gender Classification via Progressively Trained Attention Shift Convolutional Neural Networks (PTAS-CNN) and Deep Convolutional Generative Adversarial Networks (DCGAN) --
Gender Classification from NIR Iris Images Using Deep Learning --
Deep Learning for Tattoo Recognition --
Part IV: Deep Learning for Biometric Security and Protection --
Learning Representations for Cryptographic Hash Based Face Template Protection --
Deep Triplet Embedding Representations for Liveness Detection.
Рубрики: Artificial intelligence.
   Biometrics (Biology).
   Computer science—Mathematics.
   Computer mathematics.
   Signal processing.
   Image processing.
   Speech processing systems.
   Artificial Intelligence.
   Biometrics.
   Mathematical Applications in Computer Science.
   Signal, Image and Speech Processing.
Анотація: This timely text/reference presents a broad overview of advanced deep learning architectures for learning effective feature representation for perceptual and biometrics-related tasks. The text offers a showcase of cutting-edge research on the use of convolutional neural networks (CNN) in face, iris, fingerprint, and vascular biometric systems, in addition to surveillance systems that use soft biometrics. Issues of biometrics security are also examined. Topics and features: Addresses the application of deep learning to enhance the performance of biometrics identification across a wide range of different biometrics modalities Revisits deep learning for face biometrics, offering insights from neuroimaging, and provides comparison with popular CNN-based architectures for face recognition Examines deep learning for state-of-the-art latent fingerprint and finger-vein recognition, as well as iris recognition Discusses deep learning for soft biometrics, including approaches for gesture-based identification, gender classification, and tattoo recognition Investigates deep learning for biometrics security, covering biometrics template protection methods, and liveness detection to protect against fake biometrics samples Presents contributions from a global selection of pre-eminent experts in the field representing academia, industry and government laboratories Providing both an accessible introduction to the practical applications of deep learning in biometrics, and a comprehensive coverage of the entire spectrum of biometric modalities, this authoritative volume will be of great interest to all researchers, practitioners and students involved in related areas of computer vision, pattern recognition and machine learning. Dr. Bir Bhanu is Bourns Presidential Chair, Distinguished Professor of Electrical and Computer Engineering and the Director of the Center for Research in Intelligent Systems at the University of California at Riverside, USA. Some of his other Springer publications include the titles Video Bioinformatics, Distributed Video Sensor Networks, and Human Recognition at a Distance in Video. Dr. Ajay Kumar is an Associate Professor in the Department of Computing at the Hong Kong Polytechnic University.

Перейти: https://doi.org/10.1007/978-3-319-61657-5

Дод.точки доступу:
Bhanu, Bir. \ed.\; Kumar, Ajay. \ed.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

12.

    Muresan, Marian.
    Introduction to Mathematica® with Applications [[electronic resource] /] : монография / Marian. Muresan ; . - 1st ed. 2017. - [S. l. : s. n.]. - XIV, 265 p. 187 illus., 186 illus. in color. - Б. ц.
    Зміст:
Foreword --
Preface --
About Mathematica --
First Steps to Mathematica --
Basic Steps to Mathematica --
Sorting Algorithms --
Functions --
Ordinary Differential Equations --
Pi Formulas --
Optimization of Trajectories --
Miscellany --
References --
Index.
Рубрики: Computer science—Mathematics.
   Mathematical logic.
   Computer mathematics.
   Mathematics of Computing.
   Mathematical Logic and Formal Languages.
   Mathematical Applications in Computer Science.
Анотація: Starting with an introduction to the numerous features of Mathematica®, this book continues with more complex material. It provides the reader with lots of examples and illustrations of how the benefits of Mathematica® can be used. Composed of eleven chapters, it includes the following: A chapter on several sorting algorithms Functions (planar and solid) with many interesting examples Ordinary differential equations Advantages of Mathematica® dealing with the Pi number The power of Mathematica® working with optimal control problems Introduction to Mathematica® with Applications will appeal to researchers, professors and students requiring a computational tool. .

Перейти: https://doi.org/10.1007/978-3-319-52003-2

Дод.точки доступу:
Muresan, Marian. \.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

13.

    Tyagi, Vipin.
    Content-Based Image Retrieval [[electronic resource] :] : ideas, Influences, and Current Trends / / Vipin. Tyagi ; . - 1st ed. 2017. - [S. l. : s. n.]. - XXXIV, 378 p. 134 illus., 73 illus. in color. - Б. ц.
    Зміст:
Chapter 1. Introduction to Image Retrieval --
Chapter 2. Image Features --
Chapter 3. Content-based Multimedia Information Retrieval: State-of-the-art and Challenges --
Chapter 4. Images Matching through Region-based Similarity Technique --
Chapter 5. Visual Features In Image Retrieval Through CBIR --
Chapter 6. Content based Image Retrieval --
Chapter 7. Mathematical Tools for Image Retrieval --
Chapter 8. Text based Image Retrieval --
Chapter 9. Content based Image Retrieval of Texture Images --
Chapter 10. Content based Image Retrieval of Natural Images --
Chapter 11. Color based Image Retrieval --
Chapter 12. Shape based Image Retrieval --
Chapter 13. Geographical image Based Retrieval --
Chapter 14. Query Processing Issues in Region-based Image Retrieval --
Chapter 15. Research Topics for Next Generation Content based Image Retrieval --
Bibliography --
Appendix A: Image Databases.
Рубрики: Optical data processing.
   Data structures (Computer science).
   Pattern recognition.
   Signal processing.
   Image processing.
   Speech processing systems.
   Computer science—Mathematics.
   Computer mathematics.
   Applied mathematics.
   Engineering mathematics.
   Image Processing and Computer Vision.
   Data Structures and Information Theory.
   Pattern Recognition.
   Signal, Image and Speech Processing.
   Mathematical Applications in Computer Science.
   Mathematical and Computational Engineering.
Анотація: The book describes several techniques used to bridge the semantic gap and reflects on recent advancements in content-based image retrieval (CBIR). It presents insights into and the theoretical foundation of various essential concepts related to image searches, together with examples of natural and texture image types. The book discusses key challenges and research topics in the context of image retrieval, and provides descriptions of various image databases used in research studies. The area of image retrieval, and especially content-based image retrieval (CBIR), is a very exciting one, both for research and for commercial applications. The book explains the low-level features that can be extracted from an image (such as color, texture, shape) and several techniques used to successfully bridge the semantic gap in image retrieval, making it a valuable resource for students and researchers interested in the area of CBIR alike.

Перейти: https://doi.org/10.1007/978-981-10-6759-4

Дод.точки доступу:
Tyagi, Vipin. \.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

14.

    Pitt-Francis, Joe.
    Guide to Scientific Computing in C++ [[electronic resource] /] : монография / Joe. Pitt-Francis, Whiteley, Jonathan. ; . - 2nd ed. 2017. - [S. l. : s. n.]. - XIV, 287 p. 11 illus. - Б. ц.
    Зміст:
Getting Started --
Flow of Control --
File Input and Output --
Pointers --
Blocks, Functions and Reference Variables --
An Introduction to Classes --
Inheritance and Derived Classes --
Templates --
Errors, Exceptions and Testing --
Developing Classes for Linear Algebra Calculations --
An Introduction to Parallel Programming Using MPI --
Designing Object-Oriented Numerical Libraries --
Linear Algebra --
Other Programming Constructs You Might Meet --
Solutions to Exercises.
Рубрики: Computer programming.
   Numerical analysis.
   Computer simulation.
   Programming languages (Electronic computers).
   Computer science—Mathematics.
   Software engineering.
   Programming Techniques.
   Numeric Computing.
   Simulation and Modeling.
   Programming Languages, Compilers, Interpreters.
   Math Applications in Computer Science.
   Software Engineering.
Анотація: This simple-to-follow textbook/reference provides an invaluable guide to object-oriented C++ programming for scientific computing. Through a series of clear and concise discussions, the key features most useful to the novice programmer are explored, enabling the reader to quickly master the basics and build the confidence to investigate less well-used features when needed. The text presents a hands-on approach that emphasizes the benefits of learning by example, stressing the importance of a clear programming style to minimise the introduction of errors into the code, and offering an extensive selection of practice exercises. This updated and enhanced new edition includes additional material on software testing, and on some new features introduced in modern C++ standards such as C++11. Topics and features: Presents a practical treatment of the C++ programming language for applications in scientific computing Reviews the essentials of procedural programming in C++, covering variables, flow of control, input and output, pointers, functions and reference variables Introduces the concept of classes, showcasing the main features of object-orientation, and discusses such advanced C++ features as templates and exceptions Examines the development of a collection of classes for linear algebra calculations, and presents an introduction to parallel computing using MPI Describes how to construct an object-oriented library for solving second order differential equations Contains appendices reviewing linear algebra and useful programming constructs, together with solutions to selected exercises Provides exercises and programming tips at the end of every chapter, and supporting code at an associated website This accessible textbook is a “must-read” for programmers of all levels of expertise. Basic familiarity with concepts such as operations between vectors and matrices, and the Newton-Raphson method for finding the roots of non-linear equations, would be an advantage, but extensive knowledge of the underlying mathematics is not assumed. Dr. Joe Pitt-Francis is a Departmental Lecturer at the Department of Computer Science and teaches Computer Science at Exeter College, the University of Oxford, UK. Prof. Jonathan Whiteley is Associate Professor at the Department of Computer Science and Governing Body Fellow of Linacre College, the University of Oxford, UK.

Перейти: https://doi.org/10.1007/978-3-319-73132-2

Дод.точки доступу:
Whiteley, Jonathan.; Pitt-Francis, Joe. \.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

15.

    Gu, Zhaoquan.
    Rendezvous in Distributed Systems [[electronic resource] :] : theory, Algorithms and Applications / / Zhaoquan. Gu, Wang, Yuexuan., Hua, Qiang-Sheng., Lau, Francis C.M. ; . - 1st ed. 2017. - [S. l. : s. n.]. - XIX, 262 p. 99 illus., 22 illus. in color. - Б. ц.
    Зміст:
Part I: Distributed Rendezvous Theory --
Chapter 1 Distributed Systems --
Chapter 2 Rendezvous Theory and Its Applications --
Part II: Blind Rendezvous in Distributed Systems --
Chapter 3 The Blind Rendezvous Problem --
Chapter 4 Global Sequence Based Rendezvous Algorithms --
Chapter 5 Local Sequence Based Rendezvous Algorithms --
Part III: Oblivious Blind Rendezvous in Distributed Systems --
Chapter 6 The Oblivious Blind Rendezvous Problem --
Chapter 7 Randomized Algorithms for Anonymous Users --
Chapter 8 Deterministic Algorithms for Non-anonymous Users --
Chapter 9 Fully Distributed Rendezvous Algorithms --
Part IV: Distributed Rendezvous Applications --
Chapter 10 Rendezvous in Cognitive Radio Networks --
Chapter 11 Rendezvous Search in Graphs --
Chapter 12 Rendezvous Games --
Part V: Conclusions and Future Works --
Chapter 13 Conclusions and Future Works.
Рубрики: Computer organization.
   Algorithms.
   Computer science—Mathematics.
   Computer mathematics.
   Computer science.
   Computer Systems Organization and Communication Networks.
   Algorithm Analysis and Problem Complexity.
   Mathematical Applications in Computer Science.
   Computational Mathematics and Numerical Analysis.
   Popular Computer Science.
Анотація: This book introduces novel solutions to the rendezvous problem in distributed systems, a fundamental problem that underpins the construction of many important functions in distributed systems and networks. The book covers rendezvous theories, distributed rendezvous algorithms, and rendezvous applications in practical systems, presents state-of-the-art rendezvous results and highlights the latest methods of rendezvous in distributed systems. It provides in particular an in-depth treatment of the blind rendezvous and oblivious blind rendezvous problems and their solutions. Further, it sheds new light on rendezvous applications in cognitive radio networks and rendezvous search in graphs. As such, it will also be of interest to readers from other research fields such as robotics, wireless sensor networks, and game theory. .

Перейти: https://doi.org/10.1007/978-981-10-3680-4

Дод.точки доступу:
Wang, Yuexuan.; Hua, Qiang-Sheng.; Lau, Francis C.M.; Gu, Zhaoquan. \.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

16.

    Advances in Artificial Life, Evolutionary Computation, and Systems Chemistry [[electronic resource] :] : 11th Italian Workshop, WIVACE 2016, Fisciano, Italy, October 4-6, 2016, Revised Selected Papers / / ed.: Rossi, Federico., Piotto, Stefano., Concilio, Simona. - 1st ed. 2017. - [S. l. : s. n.]. - XII, 199 p. 53 illus. - Б. ц.
    Зміст:
Evolutionary Computation --
Genetic Algorithms and Applications. - Modeling and Simulation of Artificial and Biological Systems --
Systems Chemistry and Biology.
Рубрики: Computer science—Mathematics.
   Artificial intelligence.
   System theory.
   Computer organization.
   Computers.
   Mathematics of Computing.
   Artificial Intelligence.
   Complex Systems.
   Computer Systems Organization and Communication Networks.
   Theory of Computation.
Анотація: This book constitutes the revised selected papers of the 11th Italian Workshop on Advances in Artificial Life, Evolutionary Computation and Systems Chemistry, WIVACE 2016, held at Fisciano, Italy, in October 2016. The 16 full papers together with 1 short papers presented have been thoroughly reviewed and selected from 54 submissions. They cover the following topics: evolutionary computation, bioinspired algorithms, genetic algorithms, bioinformatics and computational biology, modelling and simulation of artificial and biological systems, complex systems, synthetic and systems biology, systems chemistry.

Перейти: https://doi.org/10.1007/978-3-319-57711-1

Дод.точки доступу:
Rossi, Federico. \ed.\; Piotto, Stefano. \ed.\; Concilio, Simona. \ed.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

17.

    O'Regan, Gerard.
    Concise Guide to Formal Methods [[electronic resource] :] : theory, Fundamentals and Industry Applications / / Gerard. O'Regan ; . - 1st ed. 2017. - [S. l. : s. n.]. - XXVI, 322 p. 81 illus., 56 illus. in color. - Б. ц.
    Зміст:
Software Engineering --
Software Reliability and Dependability --
Overview of Formal Methods --
Sets, Relations and Functions --
A Short History of Logic --
Propositional and Predicate Logic --
Advanced Topics in Logic --
Z Formal Specification Language --
Vienna Development Method --
Irish School of VDM --
Unified Modelling Language --
Dijkstra, Hoare and Parnas --
Automata Theory --
Model Checking --
The Nature of Theorem Proving --
Probability and Statistics --
Industrial Tools for Formal Methods --
Technology Transfer to Industry --
Epilogue.
Рубрики: Mathematical logic.
   Software engineering.
   Computer software—Reusability.
   Computer science—Mathematics.
   Computer mathematics.
   Mathematical Logic and Formal Languages.
   Software Engineering.
   Performance and Reliability.
   Mathematical Applications in Computer Science.
Анотація: This invaluable textbook/reference provides an easy-to-read guide to the fundamentals of formal methods, highlighting the rich applications of formal methods across a diverse range of areas of computing. Topics and features: Introduces the key concepts in software engineering, software reliability and dependability, formal methods, and discrete mathematics Presents a short history of logic, from Aristotle’s syllogistic logic and the logic of the Stoics, through Boole’s symbolic logic, to Frege’s work on predicate logic Covers propositional and predicate logic, as well as more advanced topics such as fuzzy logic, temporal logic, intuitionistic logic, undefined values, and the applications of logic to AI Examines the Z specification language, the Vienna Development Method (VDM) and Irish School of VDM, and the unified modelling language (UML) Discusses Dijkstra’s calculus of weakest preconditions, Hoare’s axiomatic semantics of programming languages, and the classical approach of Parnas and his tabular expressions Provides coverage of automata theory, probability and statistics, model checking, and the nature of proof and theorem proving Reviews a selection of tools available to support the formal methodist, and considers the transfer of formal methods to industry Includes review questions and highlights key topics in every chapter, and supplies a helpful glossary at the end of the book This stimulating guide provides a broad and accessible overview of formal methods for students of computer science and mathematics curious as to how formal methods are applied to the field of computing. Dr. Gerard O'Regan is a CMMI software process improvement consultant with research interests including software quality and software process improvement, mathematical approaches to software quality, and the history of computing. He is the author of such Springer titles as Concise Guide to Software Engineering, Guide to Discrete Mathematics, Introduction to the History of Computing, Pillars of Computing, Introduction to Software Quality, Giants of Computing, and Mathematics in Computing.

Перейти: https://doi.org/10.1007/978-3-319-64021-1

Дод.точки доступу:
O'Regan, Gerard. \.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

18.

    Nachef, Valerie.
    Feistel Ciphers [[electronic resource] :] : security Proofs and Cryptanalysis / / Valerie. Nachef, Patarin, Jacques., Volte, Emmanuel. ; . - 1st ed. 2017. - [S. l. : s. n.]. - XV, 309 p. 39 illus., 6 illus. in color. - Б. ц.
    Зміст:
Part 1 Definitions and first security results --
Chapter 1 Classical Feistel ciphers, first properties --
Chapter 2 Generalized Feistel ciphers, first properties --
Chapter 3 Luby-Rackoff Theorems --
Chapter 4 The coefficient H method --
Part 2 Generic Attacks --
Chapter 5 Introduction to cryptanalysis --
Chapter 6 Classical Feistel ciphers --
Chapter 7 Contracting Feistel ciphers --
Chapter 8 Expanding Feistel ciphers --
Chapter 9 Generalized Feistel ciphers --
Chapter 10 Classical Feistel ciphers with internal permutations --
Part 3: DES and other specific Feistel ciphers --
Chapter 11 DES (Definition, differential and linear cryptanalysis of DES) --
Chapter 12 3DES with 2 keys --
Chapter 13: XDES, 3DES with 3 keys --
Chapter 14 Bear-Lion, Cast, RC6, MARS, Coconut, Simon, Lucifer --
Part 4 Improved security results --
Chapter 15 Proofs beyond the birthday bound with the coupling method --
Chapter 16 Proofs beyond the birthday bound with the coefficient H method --
Chapter 17 Proofs based on games --
Chapter 18 Indifferentiability.
Рубрики: Data encryption (Computer science).
   Mathematical statistics.
   Computer science—Mathematics.
   Computer mathematics.
   Cryptology.
   Probability and Statistics in Computer Science.
   Mathematical Applications in Computer Science.
Анотація: This book provides a comprehensive survey of different kinds of Feistel ciphers, including their definition and mathematical/computational properties. Feistel Networks form the base design of the Data Encryption Standard algorithm, a former US NIST standard block cipher, originally released in 1977, and the framework used by several other symmetric ciphers ever since. The results consolidated in this volume provide an overview of this important cipher design to researchers and practitioners willing to understand the design and security analysis of Feistel ciphers.

Перейти: https://doi.org/10.1007/978-3-319-49530-9

Дод.точки доступу:
Patarin, Jacques.; Volte, Emmanuel.; Nachef, Valerie. \.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

19.

    Beebe, Nelson H. F.
    The Mathematical-Function Computation Handbook [[electronic resource] :] : programming Using the MathCW Portable Software Library / / Nelson H. F. Beebe ; . - 1st ed. 2017. - [S. l. : s. n.]. - XXXVI, 1115 p. - Б. ц.
    Зміст:
Introduction --
Iterative Solutions and Other Tools --
Polynomial Approximations --
Implementation Issues --
The Floating-Point Environment --
Converting Floating-Point Values to Integers --
Random Numbers --
Roots --
Argument Reduction --
Exponential and Logarithm --
Trigonometric Functions --
Hyperbolic Functions --
Pair-Precision Arithmetic --
Power Function --
Complex Arithmetic Primitives --
Quadratic Equations --
Elementary Functions in Complex Arithmetic --
The Greek Functions: Gamma, Psi, and Zeta --
Error and Probability Functions --
Elliptic Integral Functions --
Bessel Functions --
Testing the Library --
Pair-Precision Elementary Functions --
Accuracy of the Cody/Waite Algorithms --
Improving Upon the Cody/Waite Algorithms --
Floating-Point Output --
Floating-Point Input --
Appendix A: Ada Interface --
Appendix B: C# Interface --
Appendix C: C++ Interface --
Appendix D: Decimal Arithmetic --
Appendix E: Errata in the Cody/Waite Book --
Appendix F: Fortran Interface --
Appendix H: Historical Floating-Point Architectures --
Appendix I: Integer Arithmetic --
Appendix J: Java Interface --
Appendix L: Letter Notation --
Appendix P: Pascal Interface.
Рубрики: Computer science—Mathematics.
   Applied mathematics.
   Engineering mathematics.
   Physics.
   Chemoinformatics.
   Numerical analysis.
   Mathematics of Computing.
   Mathematical and Computational Engineering.
   Numerical and Computational Physics, Simulation.
   Computer Applications in Chemistry.
   Numerical Analysis.
Анотація: All major computer programming languages—as well as the disciplines of science and engineering more broadly—require computation of elementary and special functions of mathematics. The MathCW Software Library emphasizes portability, precisely because the code needs to capable of use on a wide variety of platforms. This highly comprehensive handbook provides a substantial advance in such computation, extending the function coverage of major programming languages well beyond their international standards, including full support for decimal floating-point arithmetic. Written with clarity and focusing on the C language, the work pays extensive attention to little-understood aspects of floating-point and integer arithmetic, and to software portability, as well as to important historical architectures. It extends support to a future 256-bit, floating-point format offering 70 decimal digits of precision. Select Topics and Features: references an exceptionally useful, author-maintained MathCW website, containing source code for the book’s software, compiled libraries for numerous systems, pre-built C compilers, and other related materials offers a unique approach to covering mathematical-function computation using decimal arithmetic provides extremely versatile appendices for interfaces to numerous other languages: Ada, C#, C++, Fortran, Java, and Pascal presupposes only basic familiarity with computer programming in a common language, as well as early level algebra supplies a library that readily adapts for existing scripting languages, with minimal effort supports both binary and decimal arithmetic, in up to 10 different floating-point formats covers a significant portion (with highly accurate implementations) of the U.S National Institute of Standards and Technology’s 10-year project to codify mathematical functions This highly practical text/reference is an invaluable tool for advanced undergraduates, recording many lessons of the intermingled history of computer hardware and software, numerical algorithms, and mathematics. In addition, professional numerical analysts and others will find the handbook of real interest and utility because it builds on research by the mathematical software community over the last four decades.

Перейти: https://doi.org/10.1007/978-3-319-64110-2

Дод.точки доступу:
Beebe, Nelson H.F. \.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

20.

    Rahman, Md. Saidur.
    Basic Graph Theory [[electronic resource] /] : монография / Md. Saidur. Rahman ; . - 1st ed. 2017. - [S. l. : s. n.]. - X, 169 p. 147 illus. - Б. ц.
    Зміст:
Preface --
Graphs and Their Applications --
Basic Graph Terminologies --
Paths, Cycles and Connectivity’s --
Trees --
Matching and Covering --
Planar Graphs --
Graph Coloring --
Digraphs --
Special Classes of Graphs --
Some Research Topics --
Index.
Рубрики: Computer science—Mathematics.
   Graph theory.
   Applied mathematics.
   Engineering mathematics.
   Discrete Mathematics in Computer Science.
   Graph Theory.
   Mathematical and Computational Engineering.
Анотація: This undergraduate textbook provides an introduction to graph theory, which has numerous applications in modeling problems in science and technology, and has become a vital component to computer science, computer science and engineering, and mathematics curricula of universities all over the world. The author follows a methodical and easy to understand approach. Beginning with the historical background, motivation and applications of graph theory, the author first explains basic graph theoretic terminologies. From this firm foundation, the author goes on to present paths, cycles, connectivity, trees, matchings, coverings, planar graphs, graph coloring and digraphs as well as some special classes of graphs together with some research topics for advanced study. Filled with exercises and illustrations, Basic Graph Theory is a valuable resource for any undergraduate student to understand and gain confidence in graph theory and its applications to scientific research, algorithms and problem solving.

Перейти: https://doi.org/10.1007/978-3-319-49475-3

Дод.точки доступу:
Rahman, Md. Saidur. \.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

1-20 21-40 41-60 61-80 81-100 101-120

© Міжнародна Асоціація користувачів і розробників електронних бібліотек і нових інформаційних технологій
(Асоціація ЕБНІТ)