Автор: Chesterman Simon Название: We, the Robots?: Regulating Artificial Intelligence and the Limits of the Law ISBN: 1316517683 ISBN-13(EAN): 9781316517680 Издательство: Cambridge Academ Рейтинг: Цена: 38010.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Should we regulate artificial intelligence? Can we? From self-driving cars and high-speed trading to algorithmic decision-making, the way we live, work, and play is increasingly dependent on AI systems. This book examines how our laws are dealing with AI, as well as what additional rules and institutions are needed.
Автор: Li, Fanzhang / Zhang, Li / Zhang, Zhao Название: Dynamic Fuzzy Machine Learning ISBN: 3110518708 ISBN-13(EAN): 9783110518702 Издательство: Walter de Gruyter Рейтинг: Цена: 149590.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Machine learning is widely used for data analysis. Dynamic fuzzy data are one of the most difficult types of data to analyse in the field of big data, cloud computing, the Internet of Things, and quantum information. At present, the processing of this kind of data is not very mature. The authors carried out more than 20 years of research, and show in this book their most important results. The seven chapters of the book are devoted to key topics such as dynamic fuzzy machine learning models, dynamic fuzzy self-learning subspace algorithms, fuzzy decision tree learning, dynamic concepts based on dynamic fuzzy sets, semi-supervised multi-task learning based on dynamic fuzzy data, dynamic fuzzy hierarchy learning, examination of multi-agent learning model based on dynamic fuzzy logic. This book can be used as a reference book for senior college students and graduate students as well as college teachers and scientific and technical personnel involved in computer science, artificial intelligence, machine learning, automation, data analysis, mathematics, management, cognitive science, and finance. It can be also used as the basis for teaching the principles of dynamic fuzzy learning.
Автор: Galmiche Название: Automated Reasoning ISBN: 3319942042 ISBN-13(EAN): 9783319942049 Издательство: Springer Рейтинг: Цена: 46570.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: This book constitutes the refereed proceedings of the 9th International Joint Conference on Automated Reasoning, IJCAR 2018, held in Oxford, United Kingdom, in July 2018, as part of the Federated Logic Conference, FLoC 2018.
Автор: Jan Krajicek Название: Proof Complexity ISBN: 1108416845 ISBN-13(EAN): 9781108416849 Издательство: Cambridge Academ Рейтинг: Цена: 142560.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Proof complexity is a rich subject drawing on methods from logic, combinatorics, algebra and computer science. This self-contained book presents the basic concepts, classical results, current state of the art and possible future directions in the field. Suitable for doctoral students and researchers in mathematics and theoretical computer science.
Without mathematics no science would survive. This especially applies to the engineering sciences which highly depend on the applications of mathematics and mathematical tools such as optimization techniques, finite element methods, differential equations, fluid dynamics, mathematical modelling, and simulation. Neither optimization in engineering, nor the performance of safety-critical system and system security; nor high assurance software architecture and design would be possible without the development of mathematical applications.
De Gruyter Series on the Applications of Mathematics in Engineering and Information Sciences (AMEIS) focusses on the latest applications of engineering and information technology that are possible only with the use of mathematical methods. By identifying the gaps in knowledge of engineering applications the AMEIS series fosters the international interchange between the sciences and keeps the reader informed about the latest developments.
Автор: Meir Reshef Название: Strategic Voting ISBN: 1681733595 ISBN-13(EAN): 9781681733593 Издательство: Mare Nostrum (Eurospan) Рейтинг: Цена: 66530.00 T Наличие на складе: Невозможна поставка. Описание: Social choice theory deals with aggregating the preferences of multiple individuals regarding several available alternatives, a situation colloquially known as voting.There are many different voting rules in use and even more in the literature, owing to the various considerations such an aggregation method should take into account. The analysis of voting scenarios becomes particularly challenging in the presence of strategic voters, that is, voters that misreport their true preferences in an attempt to obtain a more favorable outcome. In a world that is tightly connected by the Internet, where multiple groups with complex incentives make frequent joint decisions, the interest in strategic voting exceeds the scope of political science and is a focus of research in economics, game theory, sociology, mathematics, and computer science.The book has two parts. The first part asks ""are there voting rules that are truthful?"" in the sense that all voters have an incentive to report their true preferences. The seminal Gibbard-Satterthwaite theorem excludes the existence of such voting rules under certain requirements. From this starting point, we survey both extensions of the theorem and various conditions under which truthful voting is made possible (such as restricted preference domains). We also explore the connections with other problems of mechanism design such as locating a facility that serves multiple users.In the second part, we ask ""what would be the outcome when voters do vote strategically?"" rather than trying to prevent such behavior. We overview various game-theoretic models and equilibrium concepts from the literature, demonstrate how they apply to voting games, and discuss their implications on social welfare.We conclude with a brief survey of empirical and experimental findings that could play a key role in future development of game theoretic voting models.
Автор: Constantin Papaodysseus Название: Pattern Recognition and Signal Processing in Archaeometry: Mathematical and Computational Solutions for Archaeology ISBN: 1609607864 ISBN-13(EAN): 9781609607869 Издательство: Mare Nostrum (Eurospan) Рейтинг: Цена: 189420.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Computer science-especially pattern recognition, signal processing and mathematical algorithms-can offer important information about archaeological finds, information that is otherwise undetectable by the human senses and traditional archaeological approaches. Pattern Recognition and Signal Processing in Archaeometry: Mathematical and Computational Solutions for Archaeology offers state of the art research in computational pattern recognition and digital archaeometry. Computer science researchers in pattern recognition and machine intelligence will find innovative research methodologies combined to create novel and efficient computational systems, offering robust, exact, and reliable performance and results. Archaeologists, conservators, and historians will discover reliable automated methods for quickly reconstructing archaeological materials and benefit from the application of non-destructive, automated processing of archaeological finds.
Автор: Gressling, Thorsten, Название: Data science in chemistry : ISBN: 3110629399 ISBN-13(EAN): 9783110629392 Издательство: Walter de Gruyter Рейтинг: Цена: 86720.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание:
The ever-growing wealth of information has led to the emergence of a fourth paradigm of science. This new field of activity – data science – includes computer science, mathematics and a given specialist domain. This book focuses on chemistry, explaining how to use data science for deep insights and take chemical research and engineering to the next level. It covers modern aspects like Big Data, Artificial Intelligence and Quantum computing.
Автор: J.-J. Ch. Meyer, W. van der Hoek Название: Epistemic Logic for AI and Computer Science ISBN: 0521602807 ISBN-13(EAN): 9780521602808 Издательство: Cambridge Academ Рейтинг: Цена: 63360.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: This book, based on courses taught at universities and summer schools, provides a broad introduction to the subject; many exercises are included with their solutions.
Автор: Manuel Bodirsky Название: Complexity of Infinite-Domain Constraint Satisfaction ISBN: 1107042844 ISBN-13(EAN): 9781107042841 Издательство: Cambridge Academ Рейтинг: Цена: 138330.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Introduces the universal-algebraic approach to the complexity classification of constraint satisfaction problems in the finite and infinite-domain cases. Including background material from logic, topology, and combinatorics, it is suitable for graduate students and researchers in theoretical computer science and adjacent areas of mathematics.
Автор: Reshef Meir Название: Strategic Voting ISBN: 1681733617 ISBN-13(EAN): 9781681733616 Издательство: Mare Nostrum (Eurospan) Рейтинг: Цена: 87780.00 T Наличие на складе: Невозможна поставка. Описание: Social choice theory deals with aggregating the preferences of multiple individuals regarding several available alternatives, a situation colloquially known as voting.There are many different voting rules in use and even more in the literature, owing to the various considerations such an aggregation method should take into account. The analysis of voting scenarios becomes particularly challenging in the presence of strategic voters, that is, voters that misreport their true preferences in an attempt to obtain a more favorable outcome. In a world that is tightly connected by the Internet, where multiple groups with complex incentives make frequent joint decisions, the interest in strategic voting exceeds the scope of political science and is a focus of research in economics, game theory, sociology, mathematics, and computer science.The book has two parts. The first part asks ""are there voting rules that are truthful?"" in the sense that all voters have an incentive to report their true preferences. The seminal Gibbard-Satterthwaite theorem excludes the existence of such voting rules under certain requirements. From this starting point, we survey both extensions of the theorem and various conditions under which truthful voting is made possible (such as restricted preference domains). We also explore the connections with other problems of mechanism design such as locating a facility that serves multiple users.In the second part, we ask ""what would be the outcome when voters do vote strategically?"" rather than trying to prevent such behavior. We overview various game-theoretic models and equilibrium concepts from the literature, demonstrate how they apply to voting games, and discuss their implications on social welfare.We conclude with a brief survey of empirical and experimental findings that could play a key role in future development of game theoretic voting models.
Казахстан, 010000 г. Астана, проспект Туран 43/5, НП2 (офис 2) ТОО "Логобук" Тел:+7 707 857-29-98 ,+7(7172) 65-23-70 www.logobook.kz
