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

Головна

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

Опис

Бази даних

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

Вид пошуку

К Н И Г И

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

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

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

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

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

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

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

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

Зона пошуку

у знайденому

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

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

Пошуковий запит: (<.>S=Numerical analysis.<.>)

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

1-20 21-40 41-60 61-80 81-87

    Modeling Coastal Hypoxia [[electronic resource] :] : numerical Simulations of Patterns, Controls and Effects of Dissolved Oxygen Dynamics / / ed. Justic, Dubravko. [et al.]. - 1st ed. 2017. - [S. l. : s. n.]. - XII, 433 p. 139 illus., 73 illus. in color. - Б. ц.
    Зміст:
Preface --
1. Numerical experiment of stratification induced by diurnal solar heating over the Louisiana shelf --
2. Physical Drivers of the Circulation and Thermal Regime Impacting Seasonal Hypoxia in Green Bay, Lake Michigan --
3. Interannual variation in stratification over the Texas-Louisiana Continental Shelf and Effects on Seasonal Hypoxia --
4. A Reduced Complexity, Hybrid Empirical-Mechanistic Model of Eutrophication and Hypoxia in Shallow Marine Ecosystems --
5. Modeling Physical and Biogeochemical Controls on Dissolved Oxygen in Chesapeake Bay: Lessons Learned from Simple and Complex Approaches --
6. Modeling Hypoxia and its Ecological Consequences in Chesapeake Bay --
7. Modeling River-Induced Phosphorus Limitation in the Context of Coastal Hypoxia --
8. Predicted Effects of Climate Change on Northern Gulf of Mexico Hypoxia --
9. Oregon Shelf Hypoxia Modeling --
10. Comparing Default Movement Algorithms for Individual Fish Avoidance of Hypoxia in the Gulf of Mexico --
11. Hypoxia Effects Within an Intraguild Predation Food Web of Mnemiopsis leidyi ctenophores, larval fish, and copepods --
12. Simulating the Effects of Hypoxia on Bay Anchovy in the Chesapeake Bay Using Coupled Hydrodynamic, Water Quality, and Individual-Based Fish Models --
13. Simulation of the Population-Level Responses of Fish to Hypoxia: Should We Expect Sampling to Detect Responses?- 14. Using Ecosystem Modeling to Determine Hypoxia Effect on Fish and Fisheries --
15. Numerical Modeling of Hypoxia and its Effects: Synthesis and Going Forward.
Рубрики: Ecology .
   Coasts.
   Statistics .
   Numerical analysis.
   Wildlife.
   Fish.
   Oceanography.
   Ecology.
   Coastal Sciences.
   Statistics for Life Sciences, Medicine, Health Sciences.
   Numerical Analysis.
   Fish & Wildlife Biology & Management.
   Oceanography.
Анотація: This book provides a snapshot of representative modeling analyses of coastal hypoxia and its effects. Hypoxia refers to conditions in the water column where dissolved oxygen falls below levels that can support most metazoan marine life (i.e., 2 mg O2 l-1). The number of hypoxic zones has been increasing at an exponential rate since the 1960s; there are currently more than 600 documented hypoxic zones in the estuarine and coastal waters worldwide. Hypoxia develops as a synergistic product of many physical and biological factors that affect the balance of dissolved oxygen in seawater, including temperature, solar radiation, wind, freshwater discharge, nutrient supply, and the production and decay of organic matter. A number of modeling approaches have been increasingly used in hypoxia research, along with the more traditional observational and experimental studies. Modeling is necessary because of rapidly changing coastal circulation and stratification patterns that affect hypoxia, the large spatial extent over which hypoxia develops, and limitations on our capabilities to directly measure hypoxia over large spatial and temporal scales. This book consists of 15 chapters that are broadly organized around three main topics: (1) Modeling of the physical controls on hypoxia, (2) Modeling of biogeochemical controls and feedbacks, and, (3) Modeling of the ecological effects of hypoxia. The final chapter is a synthesis chapter that draws generalities from the earlier chapters, highlights strengths and weaknesses of the current state-of-the-art modeling, and offers recommendations on future directions.

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

Дод.точки доступу:
Justic, Dubravko. \ed.\; Rose, Kenneth A. \ed.\; Hetland, Robert D. \ed.\; Fennel, Katja. \ed.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

    Game Theory for Networks [[electronic resource] :] : 6th International Conference, GameNets 2016, Kelowna, BC, Canada, May 11-12, 2016, Revised Selected Papers / / ed. Cheng, Julian. [et al.]. - 1st ed. 2017. - [S. l. : s. n.]. - X, 147 p. 40 illus. - Б. ц.
    Зміст:
Strategic Seeding of Rival Opinions --
Data Preservation in Base Station-less Sensor Networks: A Game Theoretic Approach --
Energy Efficient Clustering and Beamforming for Cooperative Multicell Networks --
Cross-Monotonic Game for Self-Organized Context-Aware Placement of Services with Information Producers and Consumers --
Tracking areas planning with cooperative game in heterogeneous and small cell networks --
A Mechanism Design Approach for Influence Maximization --
Energy Efficient Channel Sharing and Power Optimization for Device-to-Device Networks Game Theory in Wireless Networks --
Distributed Sharing Base Stations for Greening: A Population Game Approach --
Weighted Voting Game Based Relay Node Managemnet In VANETs --
The Study and Field Trial of Coordinated Multi-Point Design and Analysis of Economic Games --
Revenue Sharing of ISP and CP in a Competitive Environment --
An Incentive Mechanism for P2P Network Using Accumulated-Payoff Based Snowdrift Game Model --
Joint Power Control and Subchannel Allocation for D2D Communications Underlaying Cellular Networks: A Coalitional Game Perspective.
Рубрики: Computer communication systems.
   Artificial intelligence.
   Numerical analysis.
   E-commerce.
   Application software.
   Computer Communication Networks.
   Artificial Intelligence.
   Numeric Computing.
   e-Commerce/e-business.
   Information Systems Applications (incl. Internet).
Анотація: This book constitutes the refereed proceedings of the 6th International Conference on Game Theory for Networks, GameNets 2016, held in Kelowna, Canada, in May 2016. The 13 papers were carefully selected from 26 submissions and cover topics such as algorithmic game theory, game models and theories, game theories in wireless networks, design and analysis of economic games. .

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

Дод.точки доступу:
Cheng, Julian. \ed.\; Hossain, Ekram. \ed.\; Zhang, Haijun. \ed.\; Saad, Walid. \ed.\; Chatterjee, Mainak. \ed.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

    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)
Свободных экз. нет
Знайти схожі

    Raza, Muhammad Summair.
    Understanding and Using Rough Set Based Feature Selection: Concepts, Techniques and Applications [[electronic resource] /] : монография / Muhammad Summair. Raza, Qamar, Usman. ; . - 1st ed. 2017. - [S. l. : s. n.]. - XIII, 194 p. 75 illus. - Б. ц.
    Зміст:
Introduction to Feature Selection --
Background --
Rough Set Theory --
Advance Concepts in RST --
Rough Set Based Feature Selection Techniques --
Unsupervised Feature Selection using RST --
Critical Analysis of Feature Selection Algorithms --
RST Source Code.
Рубрики: Artificial intelligence.
   Application software.
   Database management.
   Data mining.
   Numerical analysis.
   Artificial Intelligence.
   Information Systems Applications (incl. Internet).
   Database Management.
   Data Mining and Knowledge Discovery.
   Numeric Computing.
Анотація: This book provides a comprehensive introduction to Rough Set-based feature selection. It enables the reader to systematically study all topics of Rough Set Theory (RST) including the preliminaries, advanced concepts and feature selection using RST. In addition, the book is supplemented with an RST-based API library that can be used to implement several RST concepts and RST-based feature selection algorithms. Rough Set Theory, proposed in 1982 by Zdzislaw Pawlak, is an area in constant development. Focusing on the classification and analysis of imprecise or uncertain information and knowledge, it has become a prominent tool for data analysis. Feature selection is one of the important applications of RST, and helps us select the features that provide us with the largest amount of useful information. The book offers a valuable reference guide for all students, researchers, and developers working in the areas of feature selection, knowledge discovery and reasoning with uncertainty, especially those involved in RST and granular computing.

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

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

    Parallel Architecture, Algorithm and Programming [[electronic resource] :] : 8th International Symposium, PAAP 2017, Haikou, China, June 17–18, 2017, Proceedings / / ed.: Chen, Guoliang., Shen, Hong., Chen, Mingrui. - 1st ed. 2017. - [S. l. : s. n.]. - XV, 629 p. 299 illus. - Б. ц.
Рубрики: Microprocessors.
   Numerical analysis.
   Data protection.
   Computer software.
   Computer engineering.
   Processor Architectures.
   Numeric Computing.
   Security.
   Professional Computing.
   Computer Engineering.
Анотація: This book constitutes the refereed proceedings of the 8th International Symposium on Parallel Architecture, Algorithm and Programming, PAAP 2017, held in Haikou, China, in June 2017. The 50 revised full papers and 7 revised short papers presented were carefully reviewed and selected from 192 submissions. The papers deal with research results and development activities in all aspects of parallel architectures, algorithms and programming techniques.

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

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

    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)
Свободных экз. нет
Знайти схожі

    Game Theory for Networks [[electronic resource] :] : 7th International EAI Conference, GameNets 2017 Knoxville, TN, USA, May 9, 2017, Proceedings / / ed. Duan, Lingjie. [et al.]. - 1st ed. 2017. - [S. l. : s. n.]. - X, 173 p. 35 illus. - Б. ц.
    Зміст:
Nash Equilibrium Seeking with Non-doubly Stochastic Communication Weight Matrix --
A multitype Hawk and Dove game --
Assortative Mixing Equilibria in Social Network Games --
Nash Equilibrium and Stability in Network Selection Games --
On the Finite Population Evolutionary Stable Strategy Equilibrium for Perfect Information Extensive Form Games Application of Network Games --
Designing Cyber Insurance Policies: Mitigating Moral Hazard Through Security Pre-Screening --
A Game-Theoretic Model for Analysis and Design of Self-Organization Mechanisms in IoT --
A Dynamic Incentive Mechanism for Security in Networks of Interdependent Agents --
Rules for Computing Resistance of Transitions of Learning Algorithms in Games --
Optimal Control of Multi-Strain Epidemic Processes in Complex Networks --
Better Late than Never: Efficient Transmission of Wide Area Measurements in Smart Grids --
Energy Trading Game for Microgrids Using Reinforcement Learning --
Comparing Customer Taste Distributions in Vertically Differentiated Mobile Service Markets --
Risk Management using Cyber-Threat Information Sharing and Cyber-Insurance --
Paradoxes in a Multi-criteria Routing Game.
Рубрики: Computer communication systems.
   Artificial intelligence.
   Numerical analysis.
   Application software.
   Computer Communication Networks.
   Artificial Intelligence.
   Numeric Computing.
   Information Systems Applications (incl. Internet).
Анотація: This book constitutes the refereed proceedings of the 7th EAI International Conference on Game Theory for Networks, GameNets 2017, held in Knoxville, Tennessee, USA, in May 2017. The 10 conference papers and 5 invited papers presented cover topics such as smart electric grid, Internet of Things (IoT), social networks, networks security, mobile service markets, and epidemic control.

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

Дод.точки доступу:
Duan, Lingjie. \ed.\; Sanjab, Anibal. \ed.\; Li, Husheng. \ed.\; Chen, Xu. \ed.\; Materassi, Donatello. \ed.\; Elazouzi, Rachid. \ed.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

    Parallel Computational Technologies [[electronic resource] :] : 11th International Conference, PCT 2017, Kazan, Russia, April 3–7, 2017, Revised Selected Papers / / ed.: Sokolinsky, Leonid., Zymbler, Mikhail. - 1st ed. 2017. - [S. l. : s. n.]. - XIII, 348 p. 126 illus. - Б. ц.
    Зміст:
High performance architectures, tools and technologies --
Parallel numerical algorithms --
Supercomputer simulation.
Рубрики: Architecture, Computer.
   Computer simulation.
   Numerical analysis.
   Computer hardware.
   Computer programming.
   Algorithms.
   Computer System Implementation.
   Simulation and Modeling.
   Numeric Computing.
   Computer Hardware.
   Programming Techniques.
   Algorithm Analysis and Problem Complexity.
Анотація: This book constitutes the refereed proceedings of the 11th International Conference on Parallel Computational Technologies, PCT 2017, held in Kazan, Russia, in April 2017. The 24 revised full papers presented were carefully reviewed and selected from 167 submissions. The papers are organized in topical sections on high performance architectures, tools and technologies; parallel numerical algorithms; supercomputer simulation.

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

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

    Kneusel, Ronald T.
    Numbers and Computers [[electronic resource] /] : монография / Ronald T. Kneusel ; . - 2nd ed. 2017. - [S. l. : s. n.]. - XIII, 346 p. 68 illus., 12 illus. in color. - Б. ц.
    Зміст:
Number Systems --
Integers --
Floating Point --
Pitfalls of Floating-Point Numbers (and How to Avoid Them) --
Big Integers and Rational Arithmetic --
Fixed-Point Numbers --
Decimal Floating Point --
Interval Arithmetic --
Arbitrary Precision Floating-Point --
Other Number Systems.
Рубрики: Arithmetic and logic units, Computer.
   Numerical analysis.
   Arithmetic and Logic Structures.
   Numeric Computing.
Анотація: This is a book about numbers and how those numbers are represented in and operated on by computers. It is crucial that developers understand this area because the numerical operations allowed by computers, and the limitations of those operations, especially in the area of floating point math, affect virtually everything people try to do with computers. This book aims to fill this gap by exploring, in sufficient but not overwhelming detail, just what it is that computers do with numbers. Divided into two parts, the first deals with standard representations of integers and floating point numbers, while the second examines several other number representations. Details are explained thoroughly, with clarity and specificity. Each chapter ends with a summary, recommendations, carefully selected references, and exercises to review the key points. Topics covered include interval arithmetic, fixed-point numbers, big integers and rational arithmetic. This new edition has three new chapters: Pitfalls of Floating-Point Numbers (and How to Avoid Them), Arbitrary Precision Floating Point, and Other Number Systems. This book is for anyone who develops software including software engineers, scientists, computer science students, engineering students and anyone who programs for fun.

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

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

10.

    Algorithms and Data Structures [[electronic resource] :] : 15th International Symposium, WADS 2017, St. John’s, NL, Canada, July 31 – August 2, 2017, Proceedings / / ed.: Ellen, Faith., Kolokolova, Antonina., Sack, Jorg-Rudiger. - 1st ed. 2017. - [S. l. : s. n.]. - XX, 594 p. 129 illus. - Б. ц.
    Зміст:
Combinatorics --
Computational geometry --
Databases --
Graphics --
Parallel and distributed computing.
Рубрики: Algorithms.
   Data structures (Computer science).
   Computer science—Mathematics.
   Computer graphics.
   Numerical analysis.
   Computer communication systems.
   Algorithm Analysis and Problem Complexity.
   Data Structures.
   Discrete Mathematics in Computer Science.
   Computer Graphics.
   Numeric Computing.
   Computer Communication Networks.
Анотація: This book constitutes the refereed proceedings of the 15th Algorithms and Data Structures Symposium, WADS 2017, held in St. John's, NL, Canada, in July/August 2017. The 49 full papers presented together with 3 abstracts of invited talks were carefully reviewed and selected from 109 submissions. They present original research on the theory and application of algorithms and data structures in many areas, including combinatorics, computational geometry, databases, graphics, and parallel and distributed computing. The WADS Symposium, which alternates with the Scandinavian Symposium and Workshops on Algorithm Theory, SWAT, is intended as a forum for researchers in the area of design and analysis of algorithms and data structures. Papers presenting original research on the theory and application of algorithms and data structures .

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

Дод.точки доступу:
Ellen, Faith. \ed.\; Kolokolova, Antonina. \ed.\; Sack, Jorg-Rudiger. \ed.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

11.

    Codes, Cryptology and Information Security [[electronic resource] :] : second International Conference, C2SI 2017, Rabat, Morocco, April 10–12, 2017, Proceedings - In Honor of Claude Carlet / / ed.: El Hajji, Said., Nitaj, Abderrahmane., Souidi, El Mamoun. - 1st ed. 2017. - [S. l. : s. n.]. - XII, 384 p. 46 illus. - Б. ц.
Рубрики: Computer security.
   Data encryption (Computer science).
   Coding theory.
   Information theory.
   Computer communication systems.
   Numerical analysis.
   Systems and Data Security.
   Cryptology.
   Coding and Information Theory.
   Computer Communication Networks.
   Numeric Computing.
Анотація: This book constitutes the proceedings of the Second International Conference on Codes, Cryptology and Information Security, C2SI 2017, held in Rabat, Morocco, in April 2017. The 19 regular papers presented together with 5 invited talks were carefully reviewed and selected from 72 submissions. The first aim of this conference is to pay homage to Claude Carlet for his valuable contribution in teaching and disseminating knowledge in coding theory and cryptography worldwide, especially in Africa. The second aim of the conference is to provide an international forum for researchers from academia and practitioners from industry from all over the world for discussion of all forms of cryptology, coding theory and information security.

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

Дод.точки доступу:
El Hajji, Said. \ed.\; Nitaj, Abderrahmane. \ed.\; Souidi, El Mamoun. \ed.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

12.

    WALCOM: Algorithms and Computation [[electronic resource] :] : 11th International Conference and Workshops, WALCOM 2017, Hsinchu, Taiwan, March 29–31, 2017, Proceedings / / ed.: Poon, Sheung-Hung., Rahman, Md. Saidur., Yen, Hsu-Chun. - 1st ed. 2017. - [S. l. : s. n.]. - XXII, 474 p. 109 illus. - Б. ц.
    Зміст:
Invited talks --
Computational geometry --
Combinatorial optimization --
Graph drawing --
Graph algorithms --
Space-efficient algorithms --
Computational complexity --
Approximation algorithms.
Рубрики: Algorithms.
   Computer science—Mathematics.
   Numerical analysis.
   Computer graphics.
   Algorithm Analysis and Problem Complexity.
   Discrete Mathematics in Computer Science.
   Numeric Computing.
   Math Applications in Computer Science.
   Computer Graphics.
   Algorithms.
Анотація: This book constitutes the proceedings of the 11th International Workshop on Algorithms and Computation, WALCOM 2017, held in Hsinchu, Taiwan, in March 2017. The 35 full papers presented together with three invited talks were carefully reviewed and selected from 83 submissions. The papers are organized in topical sections on invited talks; computational geometry; combinatorial optimization; graph drawing; graph algorithms; space-efficient algorithms; computational complexity; approximation algorithms. .

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

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

13.

    Modeling Decisions for Artificial Intelligence [[electronic resource] :] : 14th International Conference, MDAI 2017, Kitakyushu, Japan, October 18-20, 2017, Proceedings / / ed. Torra, Vicenc. [et al.]. - 1st ed. 2017. - [S. l. : s. n.]. - XVIII, 235 p. 57 illus. - Б. ц.
    Зміст:
Aggregation operators, fuzzy measures and integrals --
Clustering and classication --
Data privacy and security --
Data mining and applications.
Рубрики: Artificial intelligence.
   Pattern recognition.
   Data mining.
   Application software.
   Information storage and retrieval.
   Numerical analysis.
   Artificial Intelligence.
   Pattern Recognition.
   Data Mining and Knowledge Discovery.
   Information Systems Applications (incl. Internet).
   Information Storage and Retrieval.
   Numeric Computing.
Анотація: This book constitutes the proceedings of the 14th International Conference on Modeling Decisions for Artificial Intelligence, MDAI 2017, held in Kitakyushu, Japan, in October 2017. The 18 revised full papers presented together with one invited paper and three abstracts of invited talks were carefully reviewed and selected from 30 submissions. Providing a forum for researchers to discuss models for decision and information fusion (aggregation operators) and their applications to AI, the papers are organized in topical sections on aggregation operators, fuzzy measures and integrals; clustering and classication; data privacy and security; data mining and applications.

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

Дод.точки доступу:
Torra, Vicenc. \ed.\; Narukawa, Yasuo. \ed.\; Honda, Aoi. \ed.\; Inoue, Sozo. \ed.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

14.

    Progress in Cryptology - AFRICACRYPT 2017 [[electronic resource] :] : 9th International Conference on Cryptology in Africa, Dakar, Senegal, May 24-26, 2017, Proceedings / / ed.: Joye, Marc., Nitaj, Abderrahmane. - 1st ed. 2017. - [S. l. : s. n.]. - X, 231 p. 42 illus. - Б. ц.
Рубрики: Computer security.
   Data encryption (Computer science).
   Coding theory.
   Information theory.
   Numerical analysis.
   Computers.
   Management information systems.
   Computer science.
   Systems and Data Security.
   Cryptology.
   Coding and Information Theory.
   Numeric Computing.
   Computation by Abstract Devices.
   Management of Computing and Information Systems.
Анотація: This book constitutes the refereed proceedings of the 9th International Conference on the Theory and Application of Cryptographic Techniques in Africa, AFRICACRYPT 2017, held in Dakar, Senegal, in May 2017. The 13 papers presented in this book were carefully reviewed and selected from 40 submissions. The papers are organized in topical sections on cryptographic schemes, side-channel analysis, differential cryptanalysis, applications, and number theory.

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

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

15.

    Theory and Applications of Satisfiability Testing – SAT 2017 [[electronic resource] :] : 20th International Conference, Melbourne, VIC, Australia, August 28 – September 1, 2017, Proceedings / / ed.: Gaspers, Serge., Walsh, Toby. - 1st ed. 2017. - [S. l. : s. n.]. - XIII, 476 p. 68 illus. - Б. ц.
Рубрики: Computers.
   Artificial intelligence.
   Software engineering.
   Operating systems (Computers).
   Computer organization.
   Numerical analysis.
   Theory of Computation.
   Artificial Intelligence.
   Software Engineering.
   Operating Systems.
   Computer Systems Organization and Communication Networks.
   Numeric Computing.
Анотація: This book constitutes the refereed proceedings of the 20th International Conference on Theory and Applications of Satisfiability Testing, SAT 2017, held in Melbourne, Australia, in August/September 2017. The 22 revised full papers, 5 short papers, and 3 tool papers were carefully reviewed and selected from 64 submissions. The papers are organized in the following topical sections: algorithms, complexity, and lower bounds; clause learning and symmetry handling; maximum satisfiability and minimal correction sets; parallel SAT solving; quantified Boolean formulas; satisfiability modulo theories; and SAT encodings.

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

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

16.

    Combinatorial Optimization and Applications [[electronic resource] :] : 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I / / ed.: Gao, Xiaofeng., Du, Hongwei., Han, Meng. - 1st ed. 2017. - [S. l. : s. n.]. - XVIII, 483 p. 125 illus. - Б. ц.
Рубрики: Algorithms.
   Computer science—Mathematics.
   Numerical analysis.
   Data structures (Computer science).
   Computer communication systems.
   Software engineering.
   Algorithm Analysis and Problem Complexity.
   Discrete Mathematics in Computer Science.
   Numeric Computing.
   Data Structures.
   Computer Communication Networks.
   Software Engineering.
Анотація: The two-volume set LNCS 10627 and 10628 constitutes the refereed proceedings of the 11th International Conference on Combinatorial Optimization and Applications, COCOA 2017, held in Shanghai, China, in December 2017. The 59 full papers and 19 short papers presented were carefully reviewed and selected from 145 submissions. The papers cover most aspects of theoretical computer science and combinatorics related to computing, including classic combinatorial optimization, geometric optimization, complexity and data structures, and graph theory. They are organized in topical sections on network, approximation algorithm and graph theory, combinatorial optimization, game theory, and applications.

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

Дод.точки доступу:
Gao, Xiaofeng. \ed.\; Du, Hongwei. \ed.\; Han, Meng. \ed.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

17.

    Frontiers in Algorithmics [[electronic resource] :] : 11th International Workshop, FAW 2017, Chengdu, China, June 23-25, 2017, Proceedings / / ed.: Xiao, Mingyu., Rosamond, Frances. - 1st ed. 2017. - [S. l. : s. n.]. - X, 281 p. 50 illus. - Б. ц.
    Зміст:
On the Complexity of Minimizing the Total Calibration Cost --
On the Fixed-Parameter Tractability of Some Matching Problems Under the Color-Spanning Model. - The complexity of finding (approximate sized) distance d dominating sets in tournaments --
On Computational Aspects of Greedy Partitioning of Graphs --
Maximum Edge Bicliques in Tree Convex Bipartite Graphs --
Complete Submodularity Characterization in the Comparative Independent Cascade Model --
A Risk-reward Model for On-line Financial Leasing Problem with an Interest Rate --
Designing and Implementing Algorithms for the Closest String Problem --
The Broken-Triangle Property with Adjoint Values --
Online Knapsack Problem under Concave Functions --
Fluctuated Fitting under the L1-metric --
Optimal Partitioning Which Maximizes the Weighted Sum of Products --
Modular-width: An Auxiliary Parameter for Parameterized Parallel Complexity --
Online Strategies for Evacuating from a Convex Region in the Plane --
A further analysis of the dynamic dominant resource fairness mechanism --
A 42k Kernel for the Complementary Maximal Strip Recovery Problem --
On-line Scheduling with a Monotonous Subsequence Constraint --
A 1.4-Approximation Algorithm For Two-sided Scaffold Filling --
FPT algorithms for FVS parameterized by split and cluster vertex deletion sets and other parameters --
A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order --
Geodectic Contraction Games on Trees --
On Approximation Algorithms for Two-Stage Scheduling Problems --
A New Lower Bound for Positive Zero Forcing --
Phase Transition for Maximum Not-All-Equal Satisfiability. .
Рубрики: Algorithms.
   Computer science—Mathematics.
   Numerical analysis.
   Data structures (Computer science).
   Algorithm Analysis and Problem Complexity.
   Discrete Mathematics in Computer Science.
   Numeric Computing.
   Data Structures.
Анотація: This book constitutes the proceedings of the 11th International Workshop on Frontiers in Algorithmics, FAW 2017, held in Chengdu, China, in June 2017. The 24 papers presented in this volume were carefully reviewed and selected from 61 submissions. They deal with all aspects of theoretical computer science and algorithms.

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

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

18.

    Numerical Analysis and Its Applications [[electronic resource] :] : 6th International Conference, NAA 2016, Lozenetz, Bulgaria, June 15-22, 2016, Revised Selected Papers / / ed.: Dimov, Ivan., Farago, Istvan., Vulkov, Lubin. - 1st ed. 2017. - [S. l. : s. n.]. - XIV, 785 p. 208 illus. - Б. ц.
    Зміст:
Numerical Modeling --
Numerical Stochastics; Numerical Approximation and Computational Geometry --
Numerical Linear Algebra and Numerical Solution of Transcendental Equations- --
Numerical Methods for Di?erential Equations --
High Performance Scienti?c Computing.
Рубрики: Numerical analysis.
   Algorithms.
   Computer science—Mathematics.
   Artificial intelligence.
   Numeric Computing.
   Algorithm Analysis and Problem Complexity.
   Math Applications in Computer Science.
   Artificial Intelligence.
   Numerical Analysis.
Анотація: This book constitutes thoroughly revised selected papers of the 6th International Conference on Numerical Analysis and Its Applications, NAA 2016, held in Lozenetz, Bulgaria, in June 2016. The 90 revised papers presented were carefully reviewed and selected from 98 submissions. The conference offers a wide range of the following topics: Numerical Modeling; Numerical Stochastics; Numerical Approx-imation and Computational Geometry; Numerical Linear Algebra and Numer-ical Solution of Transcendental Equations; Numerical Methods for Di?erential Equations; High Performance Scienti?c Computing; and also special topics such as Novel methods in computational ?nance based on the FP7 Marie Curie Action,Project Multi-ITN STRIKE - Novel Methods in Compu-tational Finance, Grant Agreement Number 304617; Advanced numerical and applied studies of fractional di?erential equations.

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

Дод.точки доступу:
Dimov, Ivan. \ed.\; Farago, Istvan. \ed.\; Vulkov, Lubin. \ed.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

19.

    Combinatorics on Words [[electronic resource] :] : 11th International Conference, WORDS 2017, Montreal, QC, Canada, September 11-15, 2017, Proceedings / / ed. Brlek, Srecko. [et al.]. - 1st ed. 2017. - [S. l. : s. n.]. - XX, 263 p. 55 illus. - Б. ц.
    Зміст:
Commutation and Beyond --
Church-Rosser Systems, Codes with Bounded Synchronization Delay and Local Rees Extensions --
Overpals, Underlaps, and Underpals --
On Some Interesting Trnary Formulas --
Minimal Forbidden Factors of Circular Words --
A de Brujin Sequence Construction by Concatenating Cycles of the Complemented Cycling Register --
On Words with the Zero Palindromic Defect --
Equations Enforcing Repetitions under Permutations --
Matching Lexicographic and Conjugation Orders on the Conjugation Class of a Special Sturmian Morphism --
More on the Dynamics of the Symbolic Square Root Map --
Study of Christoffel Classes: Normal Form and Periodicity --
On Arithmetic Index in the Generalized Thue-Morse Word --
Complexite abelienne du mot de Thue-Morse sur un alphabet ternaire --
A Set of Sequences of Complexity 2n + 1 --
The Word Entropy and How to Compute It --
First Steps in the Algorithmic Reconstruction of Digital Convex Sets --
. Variants around the Bresenham Method --
Combinatorics of Cyclic Shifts in Plactic, Hypoplactic, Sylvester, and Related Monoids --
Palindromic Length in Free Monoids and Free Groups --
Invariance: a Theoretical Approach for Coding Sets of Words Modulo Literal (Anti)Morphisms --
Burrows-Wheeler Transform and Run-Length Enconding --
A Permutation on Words in a Two Letter Alphabet --
Symmetric Dyck paths and Hooley's Delta-function.
Рубрики: Mathematical logic.
   Computer science—Mathematics.
   Artificial intelligence.
   Numerical analysis.
   Computers.
   Mathematical Logic and Formal Languages.
   Math Applications in Computer Science.
   Artificial Intelligence.
   Numeric Computing.
   Information Systems and Communication Service.
Анотація: This book constitutes the refereed proceedings of the 11th International Conference on Combinatorics on Words, WORDS 2017, held in Montreal, QC, Canada, in September 2017. The 21 revised full papers presented together with 5invoted talks were carefully reviewed and selected from 26 submissions. Discrete geometry plays an expanding role in the fields of shape modeling, image synthesis, and image analysis. It deals with topological and geometrical definitions of digitized objects or digitized images and provides both a theoretical and computational framework for computer imaging.

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

Дод.точки доступу:
Brlek, Srecko. \ed.\; Dolce, Francesco. \ed.\; Reutenauer, Christophe. \ed.\; Vandomme, Elise. \ed.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

20.

    Evolutionary Computation in Combinatorial Optimization [[electronic resource] :] : 17th European Conference, EvoCOP 2017, Amsterdam, The Netherlands, April 19-21, 2017, Proceedings / / ed.: Hu, Bin., Lopez-Ibanez, Manuel. - 1st ed. 2017. - [S. l. : s. n.]. - XII, 249 p. 46 illus. - Б. ц.
    Зміст:
A Computational Study of Neighborhood Operators for Job-shop Scheduling Problems with Regular Objectives --
A Genetic Algorithm for Multi-Component Optimization Problems: the Case of the Travelling Thief Problem --
A Hybrid Feature Selection Algorithm Based on Large Neighborhood Search --
A Memetic Algorithm to Maximise the Employee Substitutability in Personnel Shift Scheduling --
Construct, Merge, Solve and Adapt versus Large Neighborhood Search for Solving the Multi-Dimensional Knapsack Problem: Which One Works Better When --
Decomposing SAT Instances with Pseudo Backbones --
Efficient Consideration of Soft Time Windows in a Large Neighborhood Search for the Districting and Routing Problem for Security Control --
Estimation of Distribution Algorithms for the Firefighter Problem --
LCS-Based Selective Route Exchange Crossover for the Pickup and Delivery Problem with Time Windows --
Multi-rendezvous Spacecraft Trajectory Optimization with Beam P-ACO --
Optimizing Charging Station Locations for Electric Car-Sharing Systems --
Selection of Auxiliary Objectives Using Landscape Features and Offline Learned Classifier --
Sparse, Continuous Policy Representations for Uniform Online Bin Packing via Regression of Interpolants --
The Weighted Independent Domination Problem: ILP Model and Algorithmic .
Рубрики: Numerical analysis.
   Algorithms.
   Computer science—Mathematics.
   Computers.
   Artificial intelligence.
   Numeric Computing.
   Algorithm Analysis and Problem Complexity.
   Discrete Mathematics in Computer Science.
   Computation by Abstract Devices.
   Artificial Intelligence.
Анотація: This book constitutes the refereed proceedings of the 17th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2017, held in Amsterdam, The Netherlands, in April 2017, co-located with the Evo*2017 events EuroGP, EvoMUSART and EvoApplications. The 16 revised full papers presented were carefully reviewed and selected from 39 submissions. The papers cover both empirical and theoretical studies on a wide range of academic and real-world applications. The methods include evolutionary and memetic algorithms, large neighborhood search, estimation of distribution algorithms, beam search, ant colony optimization, hyper-heuristics and matheuristics. Applications include both traditional domains, such as knapsack problem, vehicle routing, scheduling problems and SAT; and newer domains such as the traveling thief problem, location planning for car-sharing systems and spacecraft trajectory optimization. Papers also study important concepts such as pseudo-backbones, phase transitions in local optima networks, and the analysis of operators. This wide range of topics makes the EvoCOP proceedings an important source for current research trends in combinatorial optimization.

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

Дод.точки доступу:
Hu, Bin. \ed.\; Lopez-Ibanez, Manuel. \ed.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

1-20 21-40 41-60 61-80 81-87

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