Refine Results
Sort By
From
To
Page 1
Page 1
Brown and Mulholland’s drug calculations
A realistic practice problems and unique "proof" step in the answer key that allows you to double-check your answers to avoid medication errors. This edition continues to promote critical thinking, clinical judgment, and patient safety with respect to accurate drug dosages. Helpful worksheets, assessment tests, and Clinical Alerts call attention to situations in actual practice that have resulted in drug errors — giving you extensive hands-on practice for the Next Generation NCLEX® and beyond.
Appropriate Dose Selection - How to Optimize Clinical Drug Development
Optimal dose individualization has become more important in improving clinical efficacy and safety, given the variability in drug response, e.g., due to concurrent illnesses or co-medications. Therefore, the role of optimal dose finding in early clinical drug development so as to maximize successful clinical use is emphasized. The continued use of biomarkers – based on the (known) pharmacology of the drug and/or biology of the underlying disease – along with exposure–response evaluation throughout all phases of drug development can quantitatively integrate clinical pharmacology knowledge, provide early proof of concept, and help in rational dose selection and rational drug product labeling for clinical use.
Logics of Specification Languages
Dedicated chapters address : the use of ASM (Abstract State Machines) in the classroom; the Event-B modelling method; a methodological guide to CafeOBJ logic; CASL, the Common Algebraic Specification Language; the Duration Calculus; the logic of the RAISE specification language (RSL); the specification language TLA+; the typed logic of partial functions and the Vienna Development Method (VDM); and Z logic and its applications. Each chapter is self-contained, with references, and symbol and concept indexes. Finally, in a unique feature, the book closes with short commentaries on the specification languages written by researchers closely associated with their original development.
Complexity Theory and Cryptology : An Introduction to Cryptocomplexity
Modern cryptology employs mathematically rigorous concepts and methods from complexity theory. Conversely, current research in complexity theory often is motivated by questions and problems arising in cryptology. This book takes account of this trend, and therefore its subject is what may be dubbed "cryptocomplexity,'' some sort of symbiosis of these two areas. This textbook is suitable for undergraduate and graduate students of computer science, mathematics, and engineering, and can be used for courses on complexity theory and cryptology, preferably by stressing their interrelation. Starting from scratch, it is an accessible introduction to cryptocomplexity and works its way to the frontiers of current research. It provides the necessary mathematical background, has numerous figures, exercises, and examples, and presents some central, up-to-date research topics and challenges. Due to its comprehensive bibliography and subject index, it is also a valuable source for researchers, teachers, and practitioners working in these fields.
Complexity Theory : Exploring the Limits of Efficient Algorithms
Complexity theory is the theory of determining the necessary resources for the solution of algorithmic problems and, therefore, the limits of what is possible with the available resources. An understanding of these limits prevents the search for non-existing efficient algorithms. This textbook considers randomization as a key concept and emphasizes the interplay between theory and practice: New branches of complexity theory continue to arise in response to new algorithmic concepts, and its results - such as the theory of NP-completeness - have influenced the development of all areas of computer science. The topics selected have implications for concrete applications, and the significance of complexity theory for today's computer science is stressed throughout.
Beginning DotNetNuke 4.0 Website Creation in C# 2005 with Visual Web Developer 2005 Express : From novice to professional
The book takes you through the steps necessary to get an internal web portal running for employee use. If you have some programming experience and creativity, this book will help you expand your business presence in a short amount of time. It features simple explanations and proof-of-concept examples throughout. The book concludes with the creation of a web portlet that you can plug into an external website for a web presence.
Arakelov Geometry and Diophantine Applications
Bridging the gap between novice and expert, the aim of this book is to present in a self-contained way a number of striking examples of current diophantine problems to which Arakelov geometry has been or may be applied. Arakelov geometry can be seen as a link between algebraic geometry and diophantine geometry.The first chapters provide some background and introduction to the subject. These are followed by a presentation of different applications to arithmetic geometry. The final part describes the recent application of Arakelov geometry to Shimura varieties and the proof of an averaged version of Colmez's conjecture. This book thus blends initiation to fundamental tools of Arakelov geometry with original material corresponding to current research.
An Undergraduate Primer in Algebraic Geometry
This book consists of two parts. The first is devoted to an introduction to basic concepts in algebraic geometry: affine and projective varieties, some of their main attributes and examples. The second part is devoted to the theory of curves: local properties, affine and projective plane curves, resolution of singularities, linear equivalence of divisors and linear series, Riemann–Roch and Riemann–Hurwitz Theorems.The approach in this book is purely algebraic. The main tool is commutative algebra, from which the needed results are recalled, in most cases with proofs. The prerequisites consist of the knowledge of basics in affine and projective geometry, basic algebraic concepts regarding rings, modules, fields, linear algebra, basic notions in the theory of categories, and some elementary point–set topology.
Algorithms on Trees and Graphs : With Python Code
Introduces graph algorithms on an intuitive basis followed by a detailed exposition using structured pseudocode, with correctness proofs as well as worst-case analyses. Centered around the fundamental issue of graph isomorphism, the content goes beyond classical graph problems of shortest paths, spanning trees, flows in networks, and matchings in bipartite graphs. Advanced algorithmic results and techniques of practical relevance are presented in a coherent and consolidated way. Numerous illustrations, examples, problems, exercises, and a comprehensive bibliography support students and professionals in using the book as a text and source of reference. Furthermore, Python code for all algorithms presented is given in an appendix. Topics and features: Algorithms are first presented on an intuitive basis, followed by a detailed exposition using structured pseudocode / Correctness proofs are given, together with a worst-case analysis of the algorithms / Full implementation of all the algorithms in Python / An extensive chapter is devoted to the algorithmic techniques used in the book / Solutions to all the problems
Algorithms and data structures for massive datasets
Learn: Probabilistic sketching data structures for practical problems Choosing the right database engine for your application Evaluating and designing efficient on-disk data structures and algorithms Understanding the algorithmic trade-offs involved in massive-scale systems Deriving basic statistics from streaming data Correctly sampling streaming data Computing percentiles with limited space resources Algorithms and Data Structures for Massive Datasets reveals a toolbox of new methods that are perfect for handling modern big data applications. You'll explore the novel data structures and algorithms that underpin Google, Facebook, and other enterprise applications that work with truly massive amounts of data. These effective techniques can be applied to any discipline, from finance to text analysis. Graphics, illustrations, and hands-on industry examples make complex ideas practical to implement in your projects--and there's no mathematical proofs to puzzle over. Work through this one-of-a-kind guide, and you'll find the sweet spot of saving space without sacrificing your data's accuracy. About the Technology Standard algorithms and data structures may become slow--or fail altogether--when applied to large distributed datasets. Choosing algorithms designed for big data saves time, increases accuracy, and reduces processing cost.
Advances in proof-theoretic semantics
This volume is the first ever collection devoted to the field of proof-theoretic semantics. Contributions address topics including the systematics of introduction and elimination rules and proofs of normalization, the categorial characterization of deductions, the relation between Heyting's and Gentzen's approaches to meaning, knowability paradoxes, proof-theoretic foundations of set theory, Dummett's justification of logical laws, Kreisel's theory of constructions, paradoxical reasoning, and the defence of model theory.
Adapting Proofs-as-Programs : The Curry--Howard Protocol
This book nuds new things to do with an old idea. The proofs-as-programs paradigm constitutes a set of approaches to developing programs from proofs in constructive logic. there is increasingly active research in applying constructive techniques to industrial-scale, complex software engineering problems. Thismonographdetailsseveralimportantadvancesinthisdirectionofpr- tical proofs-as-programs. One of the central themes of the book is a general, abstract framework for developing new systems of program synthesis by adapting proofs-as-programs to new contexts. Framework-oriented approaches that facilitate analogous - proaches to building systems for solving particular problems have been popular and successful. Thesemethodsarehelpful asthey providea formal toolbox that enablesa“roll-your-own”approachtodevelopingsolutions.Itishopedthatour framework will have a similar impact. The framework is demonstrated by example. We will give two novel - plications of proofs-as-programs to large-scale, coarse-grain software engine- ing problems: contractual imperative program synthesis and structured p- gram synthesis.
Abstraction, refinement and proof for probabilistic systems
Probabilistic techniques are increasingly being employed in computer programs and systems because they can increase efficiency in sequential algorithms, enable otherwise nonfunctional distribution applications, and allow quantification of risk and safety in general. This makes operational models of how they work, and logics for reasoning about them, extremely important. Abstraction, Refinement and Proof for Probabilistic Systems presents a rigorous approach to modeling and reasoning about computer systems that incorporate probability. Its foundations lie in traditional Boolean sequential-program logic—but its extension to numeric rather than merely true-or-false judgments takes it much further, into areas such as randomized algorithms, fault tolerance, and, in distributed systems, almost-certain symmetry breaking. The presentation begins with the familiar "assertional" style of program development and continues with increasing specialization: Part I treats probabilistic program logic, including many examples and case studies; Part II sets out the detailed semantics; and Part III applies the approach to advanced material on temporal calculi and two-player games.
A Classical Introduction to Cryptography : Applications for Communications Security
This advanced-level textbook covers conventional cryptographic primitives and cryptanalysis of these primitives; basic algebra and number theory for cryptologists; public key cryptography and cryptanalysis of these schemes; and other cryptographic protocols, e.g. secret sharing, zero-knowledge proofs and undeniable signature schemes.
Big Data Science in Finance
Explains the mathematics, theory, and methods of Big Data as applied to finance and investing Examines the mathematics, theory, and practical use of the revolutionary techniques that are transforming the industry. Designed for mathematically-advanced students and discerning financial practitioners alike, this energizing book presents new, cutting-edge content based on world-class research taught in the leading Financial Mathematics and Engineering programs in the world. Marco Avellaneda, a leader in quantitative finance, and quantitative methodology author Irene Aldridge help readers harness the power of Big Data. Provides a complete account of Big Data that includes proofs, step-by-step applications, and code samples Explains the difference between Principal Component Analysis (PCA) and Singular Value Decomposition (SVD) Covers vital topics in the field in a clear, straightforward manner Compares, contrasts, and discusses Big Data and Small Data Includes Cornell University-tested educational materials such as lesson plans, end-of-chapter questions, and downloadable lecture slides
Acoustics and Sound Insulation : Principles, Planning, Examples
Provides expert planners and architects but also interested developers with practical knowledge on the subject of acoustics in high-rise architecture, beginning with standards on methods of planning and prognosis and moving on to the areas of acoustics of rooms and architecture and noise protection in urban planning. Presents typologically specific acoustic and soundproofing measures Practical knowledge about acoustics in architecture, and noise protection in urban planning, as well as methods for planning and prognosis Examples of built projects
Matematica e cultura in Europa
Non è vero che la matematica susciti sempre poco interesse. Questa almeno è l'impressione che si ricava quando lo spunto per parlarne viene non solo dalla scienza e dalla tecnologia, ma anche dall'arte, dalla letteratura, dal cinema e dal teatro. Ce lo ha insegnato Michele Emmer con i suoi convegni Matematica e Cultura e lo abbiamo sperimentato a Bologna con le iniziative del 2000 per l'Anno Mondiale della Matematica e per Bologna Città Europea della Cultura. D’altra parte, negli ultimi anni abbiamo finalmente visto sullo schermo come protagonisti di film di successo dei matematici, non rappresentati come individui strani, ma come professionisti che svolgono il proprio lavoro, non necessariamente di insegnanti. Anche alcune opere teatrali di risonanza internazionale hanno parlato di matematici e questo ci ha spinto a organizzare per la prima volta in Italia, a Bologna, la rassegna Matematica e Teatro, che ha dato occasione non solo di assistere a spettacoli molto piacevoli, ma anche di parlare dei rapporti tra scienza, matematica e potere al tempo di Napoleone, di numeri primi, di teoria di Galois.
Map-based Mobile Services : Design, Interaction and Usability
It addresses methods and techniques for topics that range from design and rendering, context modelling, personalisation, multimodal interaction to usability test. Instead of striving for a seamless coverage of all essential theoretical and technical issues with an equal depth and extent, we attempt to pinpoint a number of research highlights and representative development activities at universities, research institutions and so- ware industry. The operational prototypes and platforms reported in the book are on the one hand outcome and feasibility proof of various approaches. On the other hand, they serve as a new starting point for the refinement of user interfaces and iterative usability tests.
Local and Semi-Local Bifurcations in Hamiltonian Dynamical Systems : Results and Examples
Once again KAM theory is committed in the context of nearly integrable Hamiltonian systems. While elliptic and hyperbolic tori determine the distribution of maximal invariant tori, they themselves form n-parameter families. Hence, without the need for untypical conditions or external parameters, torus bifurcations of high co-dimension may be found in a single given Hamiltonian system. The text moves gradually from the integrable case, in which symmetries allow for reduction to bifurcating equilibria, to non-integrability, where smooth parametrisations have to be replaced by Cantor sets. Planar singularities and their versal unfoldings are an important ingredient that helps to explain the underlying dynamics in a transparent way.
Lie theory ; Vol.230 : Harmonic analysis on symmetric spaces, general Plancherel theorems
Van den Ban’s introductory chapter explains the basic setup of a reductive symmetric space along with a careful study of the structure theory, particularly for the ring of invariant differential operators for the relevant class of parabolic subgroups. Advanced topics for the formulation and understanding of the proof are covered, including Eisenstein integrals, regularity theorems, Maass–Selberg relations, and residue calculus for root systems. Schlichtkrull provides a cogent account of the basic ingredients in the harmonic analysis on a symmetric space through the explanation and definition of the Paley–Wiener theorem. Approaching the Plancherel theorem through an alternative viewpoint, the Schwartz space, Delorme bases his discussion and proof on asymptotic expansions of eigenfunctions and the theory of intertwining integrals.
