11 results (0,12460 seconds)

Brand

Merchant

Price (EUR)

Reset filter

Products
From
Shops

Discrete Mathematics for Computer Science An Example-Based Introduction

Discrete Mathematics for Computer Science An Example-Based Introduction

Discrete Mathematics for Computer Science: An Example-Based Introduction is intended for a first- or second-year discrete mathematics course for computer science majors. It covers many important mathematical topics essential for future computer science majors such as algorithms number representations logic set theory Boolean algebra functions combinatorics algorithmic complexity graphs and trees. Features Designed to be especially useful for courses at the community-college level Ideal as a first- or second-year textbook for computer science majors or as a general introduction to discrete mathematics Written to be accessible to those with a limited mathematics background and to aid with the transition to abstract thinking Filled with over 200 worked examples boxed for easy reference and over 200 practice problems with answers Contains approximately 40 simple algorithms to aid students in becoming proficient with algorithm control structures and pseudocode Includes an appendix on basic circuit design which provides a real-world motivational example for computer science majors by drawing on multiple topics covered in the book to design a circuit that adds two eight-digit binary numbers Jon Pierre Fortney graduated from the University of Pennsylvania in 1996 with a BA in Mathematics and Actuarial Science and a BSE in Chemical Engineering. Prior to returning to graduate school he worked as both an environmental engineer and as an actuarial analyst. He graduated from Arizona State University in 2008 with a PhD in Mathematics specializing in Geometric Mechanics. Since 2012 he has worked at Zayed University in Dubai. This is his second mathematics textbook. | Discrete Mathematics for Computer Science An Example-Based Introduction

GBP 48.99
1

Galois Theory

Drug Development for Rare Diseases

Financial Mathematics A Comprehensive Treatment in Discrete Time

Finite Automata

Innovative Methods for Rare Disease Drug Development

Innovative Methods for Rare Disease Drug Development

In the United States a rare disease is defined by the Orphan Drug Act as a disorder or condition that affects fewer than 200 000 persons. For the approval of orphan drug products for rare diseases the traditional approach of power analysis for sample size calculation is not feasible because there are only limited number of subjects available for clinical trials. In this case innovative approaches are needed for providing substantial evidence meeting the same standards for statistical assurance as drugs used to treat common conditions. Innovative Methods for Rare Disease Drug Development focuses on biostatistical applications in terms of design and analysis in pharmaceutical research and development from both regulatory and scientific (statistical) perspectives. Key Features: Reviews critical issues (e. g. endpoint/margin selection sample size requirements and complex innovative design). Provides better understanding of statistical concepts and methods which may be used in regulatory review and approval. Clarifies controversial statistical issues in regulatory review and approval accurately and reliably. Makes recommendations to evaluate rare diseases regulatory submissions. Proposes innovative study designs and statistical methods for rare diseases drug development including n-of-1 trial design adaptive trial design and master protocols like platform trials. Provides insight regarding current regulatory guidance on rare diseases drug development like gene therapy.

GBP 44.99
1

Artificial Superintelligence A Futuristic Approach

Artificial Superintelligence A Futuristic Approach

A day does not go by without a news article reporting some amazing breakthrough in artificial intelligence (AI). Many philosophers futurists and AI researchers have conjectured that human-level AI will be developed in the next 20 to 200 years. If these predictions are correct it raises new and sinister issues related to our future in the age of intelligent machines. Artificial Superintelligence: A Futuristic Approach directly addresses these issues and consolidates research aimed at making sure that emerging superintelligence is beneficial to humanity. While specific predictions regarding the consequences of superintelligent AI vary from potential economic hardship to the complete extinction of humankind many researchers agree that the issue is of utmost importance and needs to be seriously addressed. Artificial Superintelligence: A Futuristic Approach discusses key topics such as: AI-Completeness theory and how it can be used to see if an artificial intelligent agent has attained human level intelligence Methods for safeguarding the invention of a superintelligent system that could theoretically be worth trillions of dollars Self-improving AI systems: definition types and limits The science of AI safety engineering including machine ethics and robot rights Solutions for ensuring safe and secure confinement of superintelligent systems The future of superintelligence and why long-term prospects for humanity to remain as the dominant species on Earth are not great Artificial Superintelligence: A Futuristic Approach is designed to become a foundational text for the new science of AI safety engineering. AI researchers and students computer security researchers futurists and philosophers should find this an invaluable resource. | Artificial Superintelligence A Futuristic Approach

GBP 180.00
1

C Programming Learn to Code

C Programming Learn to Code

The C programming language is a popular language in industries as well as academics. Since its invention and standardized as ANSI C several other standards known as C99 C11 and C17 were published with new features in subsequent years. This book covers all the traits of ANSI C and includes new features present in other standards. The content of this book helps a beginner to learn the fundamental concept of the C language. The book contains a step-by-step explanation of every program that allows a learner to understand the syntax and builds a foundation to write similar programs. The explanation clarity exercises and illustrations present in this book make it a complete textbook in all aspects. Features: Other than ANSI C the book explains the new C standards like C99 C11 and C17. Most basic and easy-to-follow programs are chosen to explain the concepts and their syntax. More emphasis is given to the topics like Functions Pointers and Structures. Recursion is emphasized with numerous programming examples and diagrams. A separate chapter on the command-line argument and preprocessors is included that concisely explains their usage. Several real-life figures are taken to explain the concepts of dynamic memory allocation file handling and the difference between structure and union. The book contains more than 260 illustrations more than 200 programs and exercises at the end of each chapter. This book serves as a textbook for UG/PG courses in science and engineering. The researcher postgraduate engineers and embedded software developers can also keep this book as reference material for their fundamental learning. | C Programming Learn to Code

GBP 105.00
1

Sampling Design and Analysis

Sampling Design and Analysis

The level is appropriate for an upper-level undergraduate or graduate-level statistics major. Sampling: Design and Analysis (SDA) will also benefit a non-statistics major with a desire to understand the concepts of sampling from a finite population. A student with patience to delve into the rigor of survey statistics will gain even more from the content that SDA offers. The updates to SDA have potential to enrich traditional survey sampling classes at both the undergraduate and graduate levels. The new discussions of low response rates non-probability surveys and internet as a data collection mode hold particular value as these statistical issues have become increasingly important in survey practice in recent years… I would eagerly adopt the new edition of SDA as the required textbook. (Emily Berg Iowa State University) What is the unemployment rate? What is the total area of land planted with soybeans? How many persons have antibodies to the virus causing COVID-19? Sampling: Design and Analysis Third Edition shows you how to design and analyze surveys to answer these and other questions. This authoritative text used as a standard reference by numerous survey organizations teaches the principles of sampling with examples from social sciences public opinion research public health business agriculture and ecology. Readers should be familiar with concepts from an introductory statistics class including probability and linear regression; optional sections contain statistical theory for readers familiar with mathematical statistics. Key Features: Has been thoroughly revised to incorporate recent research and applications. Includes a new chapter on nonprobability samples and more than 200 new examples and exercises have been added. Teaches the principles of sampling with examples from social sciences public opinion research public health business agriculture and ecology. SDA’s companion website contains data sets computer code and links to two free downloadable supplementary books (also available in paperback) that provide step-by-step guides—with code annotated output and helpful tips—for working through the SDA examples. Instructors can use either R or SAS® software. SAS® Software Companion for Sampling: Design and Analysis Third Edition by Sharon L. Lohr (2022 CRC Press) R Companion for Sampling: Design and Analysis Third Edition by Yan Lu and Sharon L. Lohr (2022 CRC Press) | Sampling Design and Analysis

GBP 66.99
1

Financial Mathematics Two Volume Set

Financial Mathematics Two Volume Set

This textbook provides complete coverage of discrete-time financial models that form the cornerstones of financial derivative pricing theory. Unlike similar texts in the field this one presents multiple problem-solving approaches linking related comprehensive techniques for pricing different types of financial derivatives. Key features: In-depth coverage of discrete-time theory and methodology. Numerous fully worked out examples and exercises in every chapter. Mathematically rigorous and consistent yet bridging various basic and more advanced concepts. Judicious balance of financial theory mathematical and computational methods. Guide to Material. This revision contains: Almost 200 pages worth of new material in all chapters. A new chapter on elementary probability theory. An expanded the set of solved problems and additional exercises. Answers to all exercises. This book is a comprehensive self-contained and unified treatment of the main theory and application of mathematical methods behind modern-day financial mathematics. Table of Contents List of Figures and Tables Preface I Introduction to Pricing and Management of Financial Securities 1 Mathematics of Compounding 2 Primer on Pricing Risky Securities 3 Portfolio Management 4 Primer on Derivative Securities II Discrete-Time Modelling 5 Single-Period Arrow–Debreu Models 6 Introduction to Discrete-Time Stochastic Calculus 7 Replication and Pricing in the Binomial Tree Model 8 General Multi-Asset Multi-Period Model Appendices A Elementary Probability Theory B Glossary of Symbols and Abbreviations C Answers and Hints to Exercises References Index Biographies Giuseppe Campolieti is Professor of Mathematics at Wilfrid Laurier University in Waterloo Canada. He has been Natural Sciences and Engineering Research Council postdoctoral research fellow and university research fellow at the University of Toronto. In 1998 he joined the Masters in Mathematical Finance as an instructor and later as an adjunct professor in financial mathematics until 2002. Dr. Campolieti also founded a financial software and consulting company in 1998. He joined Laurier in 2002 as Associate Professor of Mathematics and as SHARCNET Chair in Financial Mathematics. Roman N. Makarov is Associate Professor and Chair of Mathematics at Wilfrid Laurier University. Prior to joining Laurier in 2003 he was an Assistant Professor of Mathematics at Siberian State University of Telecommunications and Informatics and a senior research fellow at the Laboratory of Monte Carlo Methods at the Institute of Computational Mathematics and Mathematical Geophysics in Novosibirsk Russia. | Financial Mathematics Two Volume Set

GBP 130.00
1