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

Головна

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

Опис

Бази даних

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

Вид пошуку

К Н И Г И

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

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

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

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

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

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

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

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

Зона пошуку

у знайденому

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

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

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

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

1-20 21-40 41-46

    Cottam, Ron.
    Bridging the Gap between Life and Physics [[electronic resource] /] : монография / Ron. Cottam, Ranson, Willy. ; . - 1st ed. 2017. - [S. l. : s. n.]. - XVIII, 338 p. 134 illus., 3 illus. in color. - Б. ц.
    Зміст:
000 Preface --
00 Foreword --
0 Contents --
1 Setting the Stage --
2 Opening the Curtains --
3 Partial Everything --
4 Just In Time --
5 A Fishy Business --
6 And Yet It Moves --
7 Seeing the Wood --
8 Two’s Company --
9 Really Reality --
10 Under the Hood --
11 Thinking Things --
12 Making a Difference --
13 Two into One --
14 Mind Matters --
15 Bridging the Gap --
16 Closing the Curtains --
References --
Acknowledgements --
Index.
Рубрики: Ecosystems.
   Science.
   Epistemology.
   Computers.
   Solid state physics.
   Ecosystems.
   Science, multidisciplinary.
   Epistemology.
   Theory of Computation.
   Solid State Physics.
Анотація: This is the only book which deals with the correlatory comparison between hierarchical living systems and inorganic physical ones. The culmination of the book is the proposition of research to discover and understand the natural underlying level of organization which produces the descriptive commonality of life and physics. Traditional science eliminates life from its purview by its rejection of interrelationships as a primary content of systems. The conventional procedure of science is that of reductionism, whereby complex systems are dismantled to characterize lower level components, but virtually no attention is given to how to rebuild those systems—the underlying assumption is that analysis and synthesis are symmetrical. This book fulfills two main coupled functions. Firstly, it details hierarchy as the major formulation of natural complex systems and investigates the fundamental character of natural hierarchy as a widely transferable ‘container’ of structure and/or function – and this in the case of the new development of a representational or model hierarchy. Secondly, it couples this hierarchical description to that of the electronic properties of semiconductors, as a well-modeled canonical example of physical properties. The central thesis is that these two descriptions are comparable, if care is taken to treat logical and epistemological aspects with prudence: a large part of the book is composed of just this aspect of care for grounding consistency. As such great attention is given to correct assessment of argumentative features which are otherwise presumed ‘known’ but which are usually left uncertain. Development of the ideas is always based on a relationship between entity or phenomenon and their associated ecosystems, and this applies equally well to the consequent derivations of consciousness and information.

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

Дод.точки доступу:
Ranson, Willy.; Cottam, Ron. \.\; 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)
Свободных экз. нет
Знайти схожі

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

    Draheim, Dirk.
    Semantics of the Probabilistic Typed Lambda Calculus [[electronic resource] :] : markov Chain Semantics, Termination Behavior, and Denotational Semantics / / Dirk. Draheim ; . - 1st ed. 2017. - [S. l. : s. n.]. - VIII, 218 p. 6 illus. - Б. ц.
    Зміст:
Part I: The Probabilistic Lambda-Calculus and its Semantics --
Introduction --
Syntax and Operational Semantics --
The Working Probabilistic Lambda Calculus --
Properties of the Markov Chain Semantics --
Denotational Semantics --
Semantical Correspondences --
Categorical Treatment --
Probabilism and Non-Determinism --
Part II: Natural Probabilistic Reasoning --
On Natural Two-Tier Semantics for Propositional Logics --
Natural Semantics of Propositions --
Finite Discrete Stochastics Reconsidered --
Lambda-Calculus Definitions --
Markov Chains --
Basic Logic Language and Semantics Definitions --
References --
Index.
Рубрики: Computers.
   Programming languages (Electronic computers).
   Mathematical statistics.
   Theory of Computation.
   Programming Languages, Compilers, Interpreters.
   Probability and Statistics in Computer Science.
Анотація: This book takes a foundational approach to the semantics of probabilistic programming. It elaborates a rigorous Markov chain semantics for the probabilistic typed lambda calculus, which is the typed lambda calculus with recursion plus probabilistic choice. The book starts with a recapitulation of the basic mathematical tools needed throughout the book, in particular Markov chains, graph theory and domain theory, and also explores the topic of inductive definitions. It then defines the syntax and establishes the Markov chain semantics of the probabilistic lambda calculus and, furthermore, both a graph and a tree semantics. Based on that, it investigates the termination behavior of probabilistic programs. It introduces the notions of termination degree, bounded termination and path stoppability and investigates their mutual relationships. Lastly, it defines a denotational semantics of the probabilistic lambda calculus, based on continuous functions over probability distributions as domains. The work mostly appeals to researchers in theoretical computer science focusing on probabilistic programming, randomized algorithms, or programming language theory.

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

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

    Tutorials on the Foundations of Cryptography [[electronic resource] :] : dedicated to Oded Goldreich / / ed. Lindell, Yehuda. - 1st ed. 2017. - [S. l. : s. n.]. - XV, 450 p. 26 illus., 5 illus. in color. - Б. ц.
    Зміст:
Garbled Circuits as Randomized Encodings of Functions: A Primer --
The Complexity of Public-Key Cryptography --
Pseudorandom Functions: Three Decades Later --
The Many Entropies in One-Way Functions --
Homomorphic Encryption --
How to Simulate It: A Tutorial on the Simulation Proof Technique --
The Complexity of Differential Privacy.
Рубрики: Data structures (Computer science).
   Computers.
   Data Structures and Information Theory.
   Theory of Computation.
Анотація: This is a graduate textbook of advanced tutorials on the theory of cryptography and computational complexity. In particular, the chapters explain aspects of garbled circuits, public-key cryptography, pseudorandom functions, one-way functions, homomorphic encryption, the simulation proof technique, and the complexity of differential privacy. Most chapters progress methodically through motivations, foundations, definitions, major results, issues surrounding feasibility, surveys of recent developments, and suggestions for further study. This book honors Professor Oded Goldreich, a pioneering scientist, educator, and mentor. Oded was instrumental in laying down the foundations of cryptography, and he inspired the contributing authors, Benny Applebaum, Boaz Barak, Andrej Bogdanov, Iftach Haitner, Shai Halevi, Yehuda Lindell, Alon Rosen, and Salil Vadhan, themselves leading researchers on the theory of cryptography and computational complexity. The book is appropriate for graduate tutorials and seminars, and for self-study by experienced researchers, assuming prior knowledge of the theory of cryptography.

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

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

    Gorrieri, Roberto.
    Process Algebras for Petri Nets [[electronic resource] :] : the Alphabetization of Distributed Systems / / Roberto. Gorrieri ; . - 1st ed. 2017. - [S. l. : s. n.]. - XIII, 302 p. 64 illus., 4 illus. in color. - Б. ц.
    Зміст:
Introduction --
Transition Systems --
Petri Nets --
The Basic Calculus: SFM --
Adding Asynchronous Parallel Composition: CFM and BPP --
Adding Communication and Restriction: FNC --
Adding Multi-party Communication: FNM --
Adding Atomic Tests for Absence: NPL --
Generalizations and Conclusions.
Рубрики: Computers.
   Mathematical logic.
   Software engineering.
   Theory of Computation.
   Mathematical Logic and Foundations.
   Software Engineering/Programming and Operating Systems.
Анотація: This book deals with the problem of finding suitable languages that can represent specific classes of Petri nets, the most studied and widely accepted model for distributed systems. Hence, the contribution of this book amounts to the alphabetization of some classes of distributed systems. The book also suggests the need for a generalization of Turing computability theory. It is important for graduate students and researchers engaged with the concurrent semantics of distributed communicating systems. The author assumes some prior knowledge of formal languages and theoretical computer science.

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

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

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

    Urbanowicz, Ryan J.
    Introduction to Learning Classifier Systems [[electronic resource] /] : монография / Ryan J. Urbanowicz, Browne, Will N. ; . - 1st ed. 2017. - [S. l. : s. n.]. - XIII, 123 p. 27 illus., 4 illus. in color. - Б. ц.
    Зміст:
LCSs in a Nutshell --
LCS Concepts --
Functional Cycle Components --
LCS Adaptability --
Applying LCSs.
Рубрики: Artificial intelligence.
   Computational intelligence.
   Mathematical optimization.
   Bioinformatics.
   Control engineering.
   Robotics.
   Mechatronics.
   Computers.
   Artificial Intelligence.
   Computational Intelligence.
   Optimization.
   Computational Biology/Bioinformatics.
   Control, Robotics, Mechatronics.
   Theory of Computation.
Анотація: This accessible introduction shows the reader how to understand, implement, adapt, and apply Learning Classifier Systems (LCSs) to interesting and difficult problems. The text builds an understanding from basic ideas and concepts. The authors first explore learning through environment interaction, and then walk through the components of LCS that form this rule-based evolutionary algorithm. The applicability and adaptability of these methods is highlighted by providing descriptions of common methodological alternatives for different components that are suited to different types of problems from data mining to autonomous robotics. The authors have also paired exercises and a simple educational LCS (eLCS) algorithm (implemented in Python) with this book. It is suitable for courses or self-study by advanced undergraduate and postgraduate students in subjects such as Computer Science, Engineering, Bioinformatics, and Cybernetics, and by researchers, data analysts, and machine learning practitioners.

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

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

    Gong, Maoguo.
    Computational Intelligence for Network Structure Analytics [[electronic resource] /] : монография / Maoguo. Gong, Cai, Qing. [et al.] ; . - 1st ed. 2017. - [S. l. : s. n.]. - XI, 283 p. 159 illus., 140 illus. in color. - Б. ц.
    Зміст:
Introduction --
Network Community Discovery with Evolutionary Single-objective Optimization --
Network Community Discovery with Evolutionary Multi-objective Optimization --
Network Structure Balance Analytics with Evolutionary Optimization --
Network Robustness Analytics with Optimization --
Real-world Cases of Network Structure Analytics --
Concluding Remarks.
Рубрики: Artificial intelligence.
   Mathematical optimization.
   System theory.
   Computers.
   Data mining.
   Artificial Intelligence.
   Optimization.
   Complex Systems.
   Theory of Computation.
   Data Mining and Knowledge Discovery.
Анотація: This book presents the latest research advances in complex network structure analytics based on computational intelligence (CI) approaches, particularly evolutionary optimization. Most if not all network issues are actually optimization problems, which are mostly NP-hard and challenge conventional optimization techniques. To effectively and efficiently solve these hard optimization problems, CI based network structure analytics offer significant advantages over conventional network analytics techniques. Meanwhile, using CI techniques may facilitate smart decision making by providing multiple options to choose from, while conventional methods can only offer a decision maker a single suggestion. In addition, CI based network structure analytics can greatly facilitate network modeling and analysis. And employing CI techniques to resolve network issues is likely to inspire other fields of study such as recommender systems, system biology, etc., which will in turn expand CI’s scope and applications. As a comprehensive text, the book covers a range of key topics, including network community discovery, evolutionary optimization, network structure balance analytics, network robustness analytics, community-based personalized recommendation, influence maximization, and biological network alignment. Offering a rich blend of theory and practice, the book is suitable for students, researchers and practitioners interested in network analytics and computational intelligence, both as a textbook and as a reference work.

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

Дод.точки доступу:
Cai, Qing.; Ma, Lijia.; Wang, Shanfeng.; Lei, Yu.; Gong, Maoguo. \.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

10.

    Meduna, Alexander.
    Modern Language Models and Computation [[electronic resource] :] : theory with Applications / / Alexander. Meduna, Soukup, Ondrej. ; . - 1st ed. 2017. - [S. l. : s. n.]. - XIX, 548 p. 20 illus. - Б. ц.
    Зміст:
Abstract --
Acknowledgments --
Preface --
Mathematical Background --
Classical Rewriting in Language Theory: Basics --
Regulated Generation --
Parallel Generation --
Jumping Generation --
Alternative Generation Based on Algebraic Restrictions --
Regulated Acceptance --
Jumping Acceptance --
Acceptance with Deep Pushdowns --
Alternative Acceptance Based on Algebraic Restrictions --
Generation of Languages by Automata --
Language Multigeneration by Grammar Systems --
Applications and Their Perspectives in General --
Applications in Linguistics --
Applications in Biology --
Concluding and Bibliographical Remarks --
Bibliography --
Index to Special Symbols --
Index to Language Famiolies and Their Models --
Subject Index.
Рубрики: Computers.
   Computer science—Mathematics.
   Computational linguistics.
   Theory of Computation.
   Mathematics of Computing.
   Computational Linguistics.
Анотація: This textbook gives a systematized and compact summary, providing the most essential types of modern models for languages and computation together with their properties and applications. Most of these models properly reflect and formalize current computational methods, based on parallelism, distribution and cooperation covered in this book. As a result, it allows the user to develop, study, and improve these methods very effectively. This textbook also represents the first systematic treatment of modern language models for computation. It covers all essential theoretical topics concerning them. From a practical viewpoint, it describes various concepts, methods, algorithms, techniques, and software units based upon these models. Based upon them, it describes several applications in biology, linguistics, and computer science. Advanced-level students studying computer science, mathematics, linguistics and biology will find this textbook a valuable resource. Theoreticians, practitioners and researchers working in today’s theory of computation and its applications will also find this book essential as a reference.

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

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

11.

    Moret-Bonillo, Vicente.
    Adventures in Computer Science [[electronic resource] :] : from Classical Bits to Quantum Bits / / Vicente. Moret-Bonillo ; . - 1st ed. 2017. - [S. l. : s. n.]. - XIII, 198 p. 55 illus., 21 illus. in color. - Б. ц.
    Зміст:
The Universe of Binary Numbers --
Back and Forth Computing --
Reversible Architectures --
The Principles of Quantum Mechanics --
Introducing Quantum Computing --
Feynman's Quantum Computer Machine --
Some Quantum Algorithms --
Concluding Remarks --
App. A: Mathematical Background --
App. B: Glossary of Terms Used in the Book.
Рубрики: Computers.
   Quantum computers.
   Quantum physics.
   Artificial intelligence.
   Theory of Computation.
   Quantum Computing.
   Quantum Physics.
   Artificial Intelligence.
Анотація: The main focus of this textbook is the basic unit of information and the way in which our understanding of this has evolved over time. In particular the author covers concepts related to information, classical computing, logic, reversible computing, quantum mechanics, quantum computing, thermodynamics and some artificial intelligence and biology, all approached from the viewpoint of computer sciences. The book begins by asking the following nontrivial question: what is a bit? The author then discusses logic, logic gates, reversible computing and reversible architectures, and the concept of disorder. He then tries to establish the relationship between three essential questions that justify quantum approaches in computer sciences: the energy required to perform a real-life computation, the size of current processors, and the reversibility of quantum operations. Based on these concepts, the author establishes the conditions that justify the use of quantum techniques for certain kinds of computational tasks, and he uses formal descriptions and formal argumentations to introduce key quantum mechanical concepts and approaches. The rest of the book is formally different, focusing on practical issues, including a discussion of remarkable quantum algorithms in a treatment based on quantum circuit theory. The book is valuable for graduate students in computer science, and students of other disciplines who are engaged with physical models of information and computing.

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

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

12.

    Morita, Kenichi.
    Theory of Reversible Computing [[electronic resource] /] : монография / Kenichi. Morita ; . - 1st ed. 2017. - [S. l. : s. n.]. - XVII, 457 p. - Б. ц.
    Зміст:
1. Introduction --
2. Reversible Logic Elements with Memory --
3. Classification of Reversible Logic Elements with Memory and Their Universality --
4. Reversible Logic Gates --
5. Reversible Turing Machines --
6. Making Reversible Turing Machines from Reversible Primitives --
7. Universal Reversible Turing Machines --
8. Space-Bounded Reversible Turing Machines.-9. Other Models of Reversible Machines --
10. Reversible Cellular Automata --
11. One-Dimensional Universal Reversible Cellular Automata --
12. Two-Dimensional Universal Reversible Cellular Automata --
13. Reversible Elementary Triangular Partitioned Cellular Automata --
14. Self-reproduction in Reversible Cellular Automata.
Рубрики: Computers.
   Computer engineering.
   Theory of Computation.
   Computer Engineering.
Анотація: This book describes reversible computing from the standpoint of the theory of automata and computing. It investigates how reversibility can be effectively utilized in computing. A reversible computing system is a “backward deterministic” system such that every state of the system has at most one predecessor. Although its definition is very simple, it is closely related to physical reversibility, one of the fundamental microscopic laws of Nature. Authored by the leading scientist on the subject, this book serves as a valuable reference work for anyone working in reversible computation or in automata theory in general. This work deals with various reversible computing models at several different levels, which range from the microscopic to the macroscopic, and aims to clarify how computation can be carried out efficiently and elegantly in these reversible computing models. Because the construction methods are often unique and different from those in the traditional methods, these computing models as well as the design methods provide new insights for future computing systems. Organized bottom-up, the book starts with the lowest scale of reversible logic elements and circuits made from them. This is followed by reversible Turing machines, the most basic computationally universal machines, and some other types of reversible automata such as reversible multi-head automata and reversible counter machines. The text concludes with reversible cellular automata for massively parallel spatiotemporal computation. In order to help the reader have a clear understanding of each model, the presentations of all different models follow a similar pattern: the model is given in full detail, a short informal discussion is held on the role of different elements of the model, and an example with illustrations follows each model. .

Перейти: https://doi.org/10.1007/978-4-431-56606-9

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

13.

    Bonacina, Ilario.
    Space in Weak Propositional Proof Systems [[electronic resource] /] : монография / Ilario. Bonacina ; . - 1st ed. 2017. - [S. l. : s. n.]. - XVII, 130 p. 15 illus., 8 illus. in color. - Б. ц.
    Зміст:
Introduction --
Total Space in Resolution --
Space in Polynomial Calculus --
Space Lower Bounds: Applications --
A Postlude: SETH and Resolution Size.
Рубрики: Computers.
   Computer science—Mathematics.
   Theory of Computation.
   Mathematics of Computing.
Анотація: This book considers logical proof systems from the point of view of their space complexity. After an introduction to propositional proof complexity the author structures the book into three main parts. Part I contains two chapters on resolution, one containing results already known in the literature before this work and one focused on space in resolution, and the author then moves on to polynomial calculus and its space complexity with a focus on the combinatorial technique to prove monomial space lower bounds. The first chapter in Part II addresses the proof complexity and space complexity of the pigeon principles. Then there is an interlude on a new type of game, defined on bipartite graphs, essentially independent from the rest of the book, collecting some results on graph theory. Finally Part III analyzes the size of resolution proofs in connection with the Strong Exponential Time Hypothesis (SETH) in complexity theory. The book is appropriate for researchers in theoretical computer science, in particular computational complexity.

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

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

14.

    Bruni, Roberto.
    Models of Computation [[electronic resource] /] : монография / Roberto. Bruni, Montanari, Ugo. ; . - 1st ed. 2017. - [S. l. : s. n.]. - XXII, 395 p. 34 illus., 1 illus. in color. - Б. ц.
    Зміст:
Preliminaries --
Operational Semantics of IMP --
Induction and Recursion --
Partial Orders and Fixpoints --
Denotational Semantics of IMP --
Operational Semantics of HOFL --
Domain Theory --
HOFL Denotational Semantics --
Equivalence Between HOFL Denotational and Operational Semantics --
Calculus for Communicating Systems (CCS) --
Temporal Logic and mu-Calculus --
Pi-Calculus --
Measure Theory and Markov Chains --
Markov Chains with Actions and Non-determinism --
Performance Evaluation Process Algebra (PEPA).
Рубрики: Computers.
   Software engineering.
   Theory of Computation.
   Software Engineering/Programming and Operating Systems.
Анотація: This book presents in their basic form the most important models of computation, their basic programming paradigms, and their mathematical descriptions, both concrete and abstract. Each model is accompanied by relevant formal techniques for reasoning on it and for proving some properties. After preliminary chapters that introduce the notions of structure and meaning, semantic methods, inference rules, and logic programming, the authors arrange their chapters into parts on IMP, a simple imperative language; HOFL, a higher-order functional language; concurrent, nondeterministic and interactive models; and probabilistic/stochastic models. The authors have class-tested the book content over many years, and it will be valuable for graduate and advanced undergraduate students of theoretical computer science and distributed systems, and for researchers in this domain. Each chapter of the book concludes with a list of exercises addressing the key techniques introduced, solutions to selected exercises are offered at the end of the book.

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

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

15.

    Creativity in Intelligent Technologies and Data Science [[electronic resource] :] : second Conference, CIT&DS 2017, Volgograd, Russia, September 12-14, 2017, Proceedings / / ed. Kravets, Alla. [et al.]. - 1st ed. 2017. - [S. l. : s. n.]. - XVII, 887 p. 335 illus. - Б. ц.
Рубрики: Computers.
   Artificial intelligence.
   Application software.
   Information Systems and Communication Service.
   Artificial Intelligence.
   Computer Appl. in Administrative Data Processing.
   Theory of Computation.
Анотація: This book constitutes the refereed proceedings of the Second Conference on Creativity in Intelligent Technologies and Data Science, CIT&DS 2017, held in Volgograd, Russia, in September 2017. The 58 revised full papers and two keynote papers presented were carefully reviewed and selected from 194 submissions. The papers are organized in topical sections on Knowledge Discovery in Patent and Open Sources for Creative Tasks; Open Science Semantic Technologies; Computer Vision and Knowledge-Based Control; Pro-Active Modeling in Intelligent Decision Making Support; Data Science in Energy Management and Urban Computing; Design Creativity in CASE/CAI/CAD/PDM; Intelligent Internet of Services and Internet of Things; Data Science in Social Networks Analysis; Creativity and Game-Based Learning; Intelligent Assistive Technologies: Software Design and Application.

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

Дод.точки доступу:
Kravets, Alla. \ed.\; Shcherbakov, Maxim. \ed.\; Kultsova, Marina. \ed.\; Groumpos, Peter. \ed.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

16.

    Software Engineering and Formal Methods [[electronic resource] :] : 15th International Conference, SEFM 2017, Trento, Italy, September 4–8, 2017, Proceedings / / ed.: Cimatti, Alessandro., Sirjani, Marjan. - 1st ed. 2017. - [S. l. : s. n.]. - XIX, 410 p. 94 illus. - Б. ц.
Рубрики: Software engineering.
   Programming languages (Electronic computers).
   Computer programming.
   Computers.
   Computer system failures.
   Artificial intelligence.
   Software Engineering.
   Programming Languages, Compilers, Interpreters.
   Programming Techniques.
   Theory of Computation.
   System Performance and Evaluation.
   Artificial Intelligence.
Анотація: This book constitutes the refereed proceedings of the 15th International Conference on Software Engineering and Formal Methods, SEFM 2017, held in Trento, Italy, in September 2017. The 17 full papers and 6 short papers presented were carefully reviewed and selected from 102 submissions. The papers deal with a large range of topics in the following research areas: new frontiers in software architecture; software verification and testing; software development methods; application and technology transfer; security and safety; an d design principles. .

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

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

17.

    Biomimetic and Biohybrid Systems [[electronic resource] :] : 6th International Conference, Living Machines 2017, Stanford, CA, USA, July 26–28, 2017, Proceedings / / ed. Mangan, Michael. [et al.]. - 1st ed. 2017. - [S. l. : s. n.]. - XVIII, 645 p. 328 illus. - Б. ц.
    Зміст:
Neuromorphic computing --
Comparative biomechanics and physiology --
Use of robots to explain adaptive intelligence of biological systems --
Bioinspired manufacturing, materials and robotics --
Soft robotics, humanoid robotics, and neurodevelopmental engineering --
Advances in soft robotics --
3D-printed bio-machines --
Robots and society --
Biomimetic vision and control --
Utility and limites of deep learning for biorobotics --
Collective and emergents behaviours in animals and robots --
Bioinspired flight.
Рубрики: Artificial intelligence.
   Optical data processing.
   Computers.
   Data mining.
   Control engineering.
   Robotics.
   Mechatronics.
   Artificial Intelligence.
   Computer Imaging, Vision, Pattern Recognition and Graphics.
   Theory of Computation.
   Data Mining and Knowledge Discovery.
   Control, Robotics, Mechatronics.
Анотація: This book constitutes the proceedings of the 6th International Conference on Biomimetic and Biohybrid Systems, Living Machines 2017, held in Stanford, CA, USA, in July 2017. The 42 full and 19 short papers presented in this volume were carefully reviewed and selected from 63 submissions. The theme of the conference encompasses biomimetic methods for manufacture, repair and recycling inspired by natural processes such as reproduction, digestion, morphogenesis and metamorphosis.

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

Дод.точки доступу:
Mangan, Michael. \ed.\; Cutkosky, Mark. \ed.\; Mura, Anna. \ed.\; Verschure, Paul F.M.J. \ed.\; Prescott, Tony. \ed.\; Lepora, Nathan. \ed.\; SpringerLink (Online service)
Свободных экз. нет
Знайти схожі

18.

    Programming Languages and Systems [[electronic resource] :] : 15th Asian Symposium, APLAS 2017, Suzhou, China, November 27-29, 2017, Proceedings / / ed. Chang, Bor-Yuh Evan. - 1st ed. 2017. - [S. l. : s. n.]. - XIX, 555 p. 116 illus. - Б. ц.
    Зміст:
Invited Contributions --
Programming by Examples: PL meets ML --
Synthesizing SystemC Code from Delay Hybrid CSP --
Security --
Taming Message-passing Communication in Compositional Reasoning about Confidentiality --
Capabilities for Java: Secure Access to Resources --
Enforcing Programming Guidelines with Region-Types and Effects --
Automatically generating secure wrappers for SGX enclaves from separation logic specifications --
Heap and Equivalence Reasoning --
Black-box equivalence checking across compiler optimizations --
Weakly Sensitive Analysis for Unbounded Iteration over JavaScript Objects --
Decision Procedure for Entailment of Symbolic Heaps with Arrays --
Bringing order to the separation logic jungle --
Concurrency and Verification --
Programming and proving with classical types --
Static Analysis of Multithreaded Recursive Programs Communicating via Rendez-vous --
Verified Root-Balanced Trees --
Safety and Liveness of MCS Lock - Layer by Layer --
Domain-Specific Languages --
Palgol: A High-Level DSL for Vertex-Centric Graph Processing with Remote Data Access --
Efficient Functional Reactive Programming through Incremental Behaviors --
Implementing Algebraic Effects in C - Monads for Free in C --
Sound and Efficient Language-Integrated Query: Maintaining the ORDER --
Semantics --
A Computational Interpretation of Context-Free Expressions --
Partiality and container monads --
The Negligible and Yet Subtle Cost of Pattern Matching --
A lambda calculus for density matrices wth classical and probabilistic controls --
Numerical Reasoning --
Compact Difference Bound Matrices --
Sharper and Simpler Nonlinear Interpolants for Program Verification --
A Nonstandard Functional Programming Language --
Counterexample-Guided Bit-Precision Selection.
Рубрики: Programming languages (Electronic computers).
   Computer programming.
   Computers.
   Computer system failures.
   Computer hardware.
   Programming Languages, Compilers, Interpreters.
   Programming Techniques.
   Theory of Computation.
   The Computing Profession.
   System Performance and Evaluation.
   Computer Hardware.
Анотація: This book constitutes the proceedings of the 15th Asian Symposium on Programming Languages and Systems, APLAS 2017, held in Suzhou, China, in November 2017. The 24 papers presented in this volume were carefully reviewed and selected from 56 submissions. They were organized in topical sections named: security; heap and equivalence reasoning; concurrency and verification; domain-specific languages; semantics; and numerical reasoning. The volume also contains two invited talks in full-paper length. .

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

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

19.

    Advances in Cryptology – ASIACRYPT 2017 [[electronic resource] :] : 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Hong Kong, China, December 3-7, 2017, Proceedings, Part II / / ed.: Takagi, Tsuyoshi., Peyrin, Thomas. - 1st ed. 2017. - [S. l. : s. n.]. - XIX, 701 p. 98 illus. - Б. ц.
    Зміст:
Pairing-based Protocols --
Quantum Algorithms --
Elliptic Curves --
Block Chains --
Multi-Party Protocols.-Operating Modes Security Proofs.
Рубрики: Data encryption (Computer science).
   Computer security.
   Coding theory.
   Information theory.
   Management information systems.
   Computer science.
   Computers.
   Computer science—Mathematics.
   Cryptology.
   Systems and Data Security.
   Coding and Information Theory.
   Management of Computing and Information Systems.
   Theory of Computation.
   Mathematics of Computing.
Анотація: The three-volume set LNCS 10624, 10625, 10626 constitutes the refereed proceedings of the 23rd International Conference on the Theory and Applications of Cryptology and Information Security, ASIACRYPT 2017, held in Hong Kong, China, in December 2017. The 65 revised full papers were carefully selected from 243 submissions. They are organized in topical sections on Post-Quantum Cryptography; Symmetric Key Cryptanalysis; Lattices; Homomorphic Encryptions; Access Control; Oblivious Protocols; Side Channel Analysis; Pairing-based Protocols; Quantum Algorithms; Elliptic Curves; Block Chains; Multi-Party Protocols; Operating Modes Security Proofs; Cryptographic Protocols; Foundations; Zero-Knowledge Proofs; and Symmetric Key Designs.

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

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

20.

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

1-20 21-40 41-46

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