TOP
紅利積點抵現金,消費購書更貼心
搜尋結果 /

Test Pattern Generation Using Boolean Proof Engines

6438
1 / 161
A History of Everyday Things ― The Birth of Consumption in France, 1600-1800
75 折
出版日:2000/03/28 作者:Daniel Roche  出版社:Cambridge Univ Pr  裝訂:平裝
Things which we regard as the everyday objects of consumption (and hence re-purchase), and essential to any decent, civilised lifestyle, have not always been so: in former times, everyday objects would have passed from one generation to another, without anyone dreaming of acquiring new ones. How, therefore, have people in the modern world become 'prisoners of objects', as Rousseau put it? The celebrated French cultural historian Daniel Roche answers this fundamental question using insights from economics, politics, demography and geography, as well as his own extensive historical knowledge. Professor Roche places familiar objects and commodities - houses, clothes, water - in their wider historical and anthropological contexts, and explores the origins of some of the daily furnishings of modern life. A History of Everyday Things is a pioneering essay that sheds light on the origins of the consumer society and its social and political repercussions, and thereby the birth of the modern w
優惠:Cambridge 書展 優惠價: 75 1218
庫存:1
Introduction to Plant Fossils
75 折
出版日:2019/06/30 作者:Christopher J. Cleal  出版社:Cambridge Univ Pr  裝訂:平裝
Plant remains can preserve a critical part of history of life on Earth. While telling the fascinating evolutionary story of plants and vegetation across the last 500 million years, this book also crucially offers non-specialists a practical guide to studying, dealing with and interpreting plant fossils. It shows how various techniques can be used to reveal the secrets of plant fossils and how to identify common types, such as compressions and impressions. Incorporating the concepts of evolutionary floras, this second edition includes revised data on all main plant groups, the latest approaches to naming plant fossils using fossil-taxa and techniques such as tomography. With extensive illustrations of plant fossils and living plants, the book encourages readers to think of fossils as once-living organisms. It is written for students on introductory or intermediate courses in palaeobotany, palaeontology, plant evolutionary biology and plant science, and for amateurs interested in studyin
優惠:Cambridge 書展 優惠價: 75 1979
庫存:1
A History of the Soviet Union from the Beginning to Its Legacy
75 折
出版日:2016/10/31 作者:Peter Kenez  出版社:Cambridge Univ Pr  裝訂:平裝
This concise yet comprehensive textbook examines political, social, and cultural developments in the Soviet Union and the post-Soviet period. It begins by identifying the social tensions and political inconsistencies that spurred radical change in Russia's government, from the turn of the century to the revolution of 1917. Peter Kenez presents this revolution as a crisis of authority that the creation of the Soviet Union resolved. The text traces the progress of the Soviet Union through the 1920s, the years of the New Economic Policies, and into the Stalinist order. It illustrates how post-Stalin Soviet leaders struggled to find ways to rule the country without using Stalin's methods - but also without openly repudiating the past - and to negotiate a peaceful but antipathetic coexistence with the capitalist West. This updated third edition includes substantial new material, discussing the challenges Russia currently faces in the era of Putin.
優惠:Cambridge 書展 優惠價: 75 1304
庫存:1
Waves in Oceanic and Coastal Waters
73 折
出版日:2010/02/04 作者:Leo H. Holthuijsen  出版社:Cambridge Univ Pr  裝訂:平裝
本書是一部系統性探討海洋與沿岸波浪的專業著作,兼顧物理意義與統計分析,適合研究所學生、研究人員與工程實務者閱讀。內容從觀測技術談起,介紹現地量測與遙測方法,並逐步建立描述波浪的參數與統計架構。書中詳述線性波理論在外海與近岸水域的應用,說明波浪在不同水深與地形條件下的行為差異,並深入介紹 SWAN 波浪模式,協助讀者理解現代數值模擬在工程與研究中的角色。全書結構嚴謹、插圖清楚,是理解風生波浪與海岸波動不可或缺的參考書。Waves in Oceanic and Coastal Waters describes the observation, analysis and prediction of wind-generated waves in the open ocean, in shelf seas, and in coastal regions with islands, channels, tidal flats and inlets, estuaries, fjords and lagoons. Most of this richly illustrated book is devoted to the physical aspects of waves. After introducing observation techniques for waves, both at sea and from space, the book defines the parameters that characterise waves. Using basic statistical and physical concepts, the author discusses the prediction of waves in oceanic and coastal waters, first in terms of generalised observations, and then in terms of the more theoretical framework of the spectral energy balance. He gives the results of established theories and also the direction in wh
優惠:匯讀中外曬書展 優惠價: 73 2229
庫存:1
The Honest Broker―Making Sense for Science in Policy and Politics
75 折
出版日:2007/04/19 作者:Roger A. Pielke; Jr  出版社:Cambridge Univ Pr  裝訂:平裝
Scientists have a choice concerning what role they should play in political debates and policy formation, particularly in terms of how they present their research. This book is about understanding this choice, what considerations are important to think about when deciding, and the consequences of such choices for the individual scientist and the broader scientific enterprise. Rather than prescribing what course of action each scientist ought to take, the book aims to identify a range of options for individual scientists to consider in making their own judgments about how they would like to position themselves in relation to policy and politics. Using examples from a range of scientific controversies and thought-provoking analogies from other walks of life, The Honest Broker challenges us all - scientists, politicians and citizens - to think carefully about how best science can contribute to policy-making and a healthy democracy.
優惠:Cambridge 書展 優惠價: 75 1656
庫存:1
Boolean Functions―Theory, Algorithms, and Applications
90 折
出版日:2011/05/16 作者:Yves Crama  出版社:Cambridge Univ Pr  裝訂:精裝
Written by prominent experts in the field, this monograph provides the first comprehensive, unified presentation of the structural, algorithmic and applied aspects of the theory of Boolean functions. The book focuses on algebraic representations of Boolean functions, especially disjunctive and conjunctive normal form representations. This framework looks at the fundamental elements of the theory (Boolean equations and satisfiability problems, prime implicants and associated short representations, dualization), an in-depth study of special classes of Boolean functions (quadratic, Horn, shellable, regular, threshold, read-once functions and their characterization by functional equations) and two fruitful generalizations of the concept of Boolean functions (partially defined functions and pseudo-Boolean functions). Several topics are presented here in book form for the first time. Because of the depth and breadth and its emphasis on algorithms and applications, this monograph will have sp
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
Boolean Function Complexity
90 折
出版日:1992/11/05 作者:M. S. Paterson  出版社:Cambridge Univ Pr  裝訂:平裝
By considering the size of the logical network needed to perform a given computational task, the intrinsic difficulty of that task can be examined. Boolean function complexity, the combinatorial study of such networks, is a subject that started back in the 1950s and has today become one of the most challenging and vigorous areas of theoretical computer science. The papers in this book stem from the London Mathematical Society Symposium on Boolean Function Complexity held at Durham University in July 1990. The range of topics covered will be of interest to the newcomer to the field as well as the expert, and overall the papers are representative of the research presented at the Symposium. Anyone with an interest in Boolean Function complexity will find that this book is a necessary purchase.
優惠價: 9 1754
無庫存
Boolean Functions for Cryptography and Coding Theory
90 折
出版日:2020/06/30 作者:Claude Carlet  出版社:Cambridge Univ Pr  裝訂:精裝
Boolean functions are essential to systems for secure and reliable communication. This comprehensive survey of Boolean functions for cryptography and coding covers the whole domain and all important results, building on the author's influential articles with additional topics and recent results. A useful resource for researchers and graduate students, the book balances detailed discussions of properties and parameters with examples of various types of cryptographic attacks that motivate the consideration of these parameters. It provides all the necessary background on mathematics, cryptography, and coding, and an overview on recent applications, such as side channel attacks on smart cards, cloud computing through fully homomorphic encryption, and local pseudo-random generators. The result is a complete and accessible text on the state of the art in single and multiple output Boolean functions that illustrates the interaction between mathematics, computer science, and telecommunications
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
Practical Design Verification
90 折
出版日:2009/07/20 作者:Dhiraj K. Pradhan  出版社:Cambridge Univ Pr  裝訂:精裝
Improve design efficiency and reduce costs with this practical guide to formal and simulation-based functional verification. Giving you a theoretical and practical understanding of the key issues involved, expert authors including Wayne Wolf and Dan Gajski explain both formal techniques (model checking, equivalence checking) and simulation-based techniques (coverage metrics, test generation). You get insights into practical issues including hardware verification languages (HVLs) and system-level debugging. The foundations of formal and simulation-based techniques are covered too, as are more recent research advances including transaction-level modeling and assertion-based verification, plus the theoretical underpinnings of verification, including the use of decision diagrams and Boolean satisfiability (SAT).
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
Proof Complexity
90 折
出版日:2019/06/30 作者:Jan Krajíček  出版社:Cambridge Univ Pr  裝訂:精裝
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. It stresses a view of proof complexity as a whole entity rather than a collection of various topics held together loosely by a few notions, and it favors more generalizable statements. Lower bounds for lengths of proofs, often regarded as the key issue in proof complexity, are of course covered in detail. However, upper bounds are not neglected: this book also explores the relations between bounded arithmetic theories and proof systems and how they can be used to prove upper bounds on lengths of proofs and simulations among proof systems. It goes on to discuss topics that transcend specific proof systems, allowing for deeper understanding of the fundamental problems of the subject.
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
Noise Sensitivity of Boolean Functions and Percolation
滿額折
出版日:2014/10/31 作者:Christophe Garban  出版社:Cambridge Univ Pr  裝訂:平裝
This is a graduate-level introduction to the theory of Boolean functions, an exciting area lying on the border of probability theory, discrete mathematics, analysis, and theoretical computer science. Certain functions are highly sensitive to noise; this can be seen via Fourier analysis on the hypercube. The key model analyzed in depth is critical percolation on the hexagonal lattice. For this model, the critical exponents, previously determined using the now-famous Schramm–Loewner evolution, appear here in the study of sensitivity behavior. Even for this relatively simple model, beyond the Fourier-analytic set-up, there are three crucially important but distinct approaches: hypercontractivity of operators, connections to randomized algorithms, and viewing the spectrum as a random Cantor set. This book assumes a basic background in probability theory and integration theory. Each chapter ends with exercises, some straightforward, some challenging.
優惠價: 9 994
無庫存
Noise Sensitivity of Boolean Functions and Percolation
90 折
出版日:2014/10/31 作者:Christophe Garban  出版社:Cambridge Univ Pr  裝訂:精裝
This is a graduate-level introduction to the theory of Boolean functions, an exciting area lying on the border of probability theory, discrete mathematics, analysis, and theoretical computer science. Certain functions are highly sensitive to noise; this can be seen via Fourier analysis on the hypercube. The key model analyzed in depth is critical percolation on the hexagonal lattice. For this model, the critical exponents, previously determined using the now-famous Schramm–Loewner evolution, appear here in the study of sensitivity behavior. Even for this relatively simple model, beyond the Fourier-analytic set-up, there are three crucially important but distinct approaches: hypercontractivity of operators, connections to randomized algorithms, and viewing the spectrum as a random Cantor set. This book assumes a basic background in probability theory and integration theory. Each chapter ends with exercises, some straightforward, some challenging.
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
Analysis of Boolean Functions
90 折
出版日:2014/05/31 作者:Ryan O'Donnell  出版社:Cambridge Univ Pr  裝訂:精裝
Boolean functions are perhaps the most basic objects of study in theoretical computer science. They also arise in other areas of mathematics, including combinatorics, statistical physics, and mathematical social choice. The field of analysis of Boolean functions seeks to understand them via their Fourier transform and other analytic methods. This text gives a thorough overview of the field, beginning with the most basic definitions and proceeding to advanced topics such as hypercontractivity and isoperimetry. Each chapter includes a 'highlight application' such as Arrow's theorem from economics, the Goldreich–Levin algorithm from cryptography/learning theory, Håstad's NP-hardness of approximation results, and 'sharp threshold' theorems for random graph properties. The book includes roughly 450 exercises and can be used as the basis of a one-semester graduate course. It should appeal to advanced undergraduates, graduate students and researchers in computer science theory and related mat
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
Mechanical Efficiency of Heat Engines
90 折
出版日:2010/09/09 作者:James R. Senft  出版社:Cambridge Univ Pr  裝訂:平裝
This 2007 book presents a developed general conceptual and basic quantitative analysis as well as the theory of mechanical efficiency of heat engines that a level of ideality and generality compatible with the treatment given to thermal efficiency in classical thermodynamics. This yields broad bearing results concerning the overall cyclic conversion of heat into usable mechanical energy. The work reveals intrinsic limits on the overall performance of reciprocating heat engines. The theory describes the general effects of parameters such as compression ratio and external or buffer pressure on engine output. It also provides rational explanations of certain operational characteristics such as how engines generally behave when supercharged or pressurized. The results also identify optimum geometric configurations for engines operating in various regimes from isothermal to adiabatic and are extended to cover multi-workspace engines and heat pumps. Limited heat transfer due to finite-time e
優惠價: 9 2398
無庫存
Mechanical Efficiency of Heat Engines
90 折
出版日:2007/08/13 作者:James R. Senft  出版社:Cambridge Univ Pr  裝訂:精裝
This 2007 book presents a developed general conceptual and basic quantitative analysis as well as the theory of mechanical efficiency of heat engines that a level of ideality and generality compatible with the treatment given to thermal efficiency in classical thermodynamics. This yields broad bearing results concerning the overall cyclic conversion of heat into usable mechanical energy. The work reveals intrinsic limits on the overall performance of reciprocating heat engines. The theory describes the general effects of parameters such as compression ratio and external or buffer pressure on engine output. It also provides rational explanations of certain operational characteristics such as how engines generally behave when supercharged or pressurized. The results also identify optimum geometric configurations for engines operating in various regimes from isothermal to adiabatic and are extended to cover multi-workspace engines and heat pumps. Limited heat transfer due to finite-time e
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
Metamathematics, Machines and Gödel's Proof
90 折
出版日:1997/01/30 作者:N. Shankar  出版社:Cambridge Univ Pr  裝訂:平裝
Mathematicians from Leibniz to Hilbert have sought to mechanise the verification of mathematical proofs. Developments arising out of Gödel's proof of his incompleteness theorem showed that no computer program could automatically prove true all the theorems of mathematics. In practice, however, there are a number of sophisticated automated reasoning programs that are quite effective at checking mathematical proofs. Now in paperback, this book describes the use of a computer program to check the proofs of several celebrated theorems in metamathematics including Gödel's incompleteness theorem and the Church–Rosser theorem. The computer verification using the Boyer–Moore theorem prover yields precise and rigorous proofs of these difficult theorems. It also demonstrates the range and power of automated proof checking technology. The mechanisation of metamathematics itself has important implications for automated reasoning since metatheorems can be applied by labour-saving devices to simpli
優惠價: 9 2281
無庫存
Bounded Arithmetic, Propositional Logic and Complexity Theory
90 折
出版日:1995/11/24 作者:Jan Krajicek  出版社:Cambridge Univ Pr  裝訂:精裝
This book presents an up-to-date, unified treatment of research in bounded arithmetic and complexity of propositional logic, with emphasis on independence proofs and lower bound proofs. The author discusses the deep connections between logic and complexity theory and lists a number of intriguing open problems. An introduction to the basics of logic and complexity theory is followed by discussion of important results in propositional proof systems and systems of bounded arithmetic. More advanced topics are then treated, including polynomial simulations and conservativity results, various witnessing theorems, the translation of bounded formulas (and their proofs) into propositional ones, the method of random partial restrictions and its applications, direct independence proofs, complete systems of partial relations, lower bounds to the size of constant-depth propositional proofs, the method of Boolean valuations, the issue of hard tautologies and optimal proof systems, combinatorics and
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
Exergy Analysis for Energy Conversion Systems
90 折
出版日:2020/11/30 作者:Efstathios Michaelides  出版社:Cambridge Univ Pr  裝訂:精裝
Discover a straightforward and holistic look at energy conversion and conservation processes using the exergy concept with this thorough text. Explains the fundamental energy conversion processes in numerous diverse systems, ranging from jet engines and nuclear reactors to human bodies. Provides examples for applications to practical energy conversion processes and systems that use our naturally occurring energy resources, such as fossil fuels, solar energy, wind, geothermal, and nuclear fuels. With more than one-hundred diverse cases and solved examples, readers will be able to perform optimizations for a cleaner environment, a sustainable energy future, and affordable energy generation. An essential tool for practicing scientists and engineers who work or do research in the area of energy and exergy, as well as graduate students and faculty in chemical engineering, mechanical engineering and physics.
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
Complexity Dichotomies for Counting Problems
90 折
出版日:2017/08/31 作者:Jin-Yi Cai  出版社:Cambridge Univ Pr  裝訂:精裝
Complexity theory aims to understand and classify computational problems, especially decision problems, according to their inherent complexity. This book uses new techniques to expand the theory for use with counting problems. The authors present dichotomy classifications for broad classes of counting problems in the realm of P and NP. Classifications are proved for partition functions of spin systems, graph homomorphisms, constraint satisfaction problems, and Holant problems. The book assumes minimal prior knowledge of computational complexity theory, developing proof techniques as needed and gradually increasing the generality and abstraction of the theory. This volume presents the theory on the Boolean domain, and includes a thorough presentation of holographic algorithms, culminating in classifications of computational problems studied in exactly solvable models from statistical mechanics.
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
Solar Power Generation Problems, Solutions and Monitoring
90 折
出版日:2016/01/31 作者:Peter Gevorkian  出版社:Cambridge Univ Pr  裝訂:精裝
Solar Power Generation Problems, Solutions, and Monitoring is a valuable resource for researchers, professionals and graduate students interested in solar power system design. Written to serve as a pragmatic resource for solar photovoltaic power systems financing, it outlines real-life, straightforward design methodology. Using numerous examples, illustrations and an easy to follow design methodology, Peter Gevorkian discusses some of the most significant issues that concern solar power generation including: power output; energy monitoring and energy output enhancement; fault detection; fire and life safety hazard mitigation; and detailed hardware, firmware and software analytic solutions required to resolve solar power technology shortcomings. This essential reference also highlights the significant issues associated with large scale solar photovoltaic and solar power generation technology covering design, construction, deployment and fault detection monitoring as well as life safety
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
Burden of Proof, Presumption and Argumentation
90 折
出版日:2014/06/30 作者:Douglas Walton  出版社:Cambridge Univ Pr  裝訂:精裝
The notion of burden of proof and its companion notion of presumption are central to argumentation studies. This book argues that we can learn a lot from how the courts have developed procedures over the years for allocating and reasoning with presumptions and burdens of proof, and from how artificial intelligence has built precise formal and computational systems to represent this kind of reasoning. The book provides a model of reasoning with burden of proof and presumption, based on analyses of many clearly explained legal and non-legal examples. The model is shown to fit cases of everyday conversational argumentation as well as argumentation in legal cases. Burden of proof determines (1) under what conditions an arguer is obliged to support a claim with an argument that backs it up and (2) how strong that argument needs to be to prove the claim in question.
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
Burden of Proof, Presumption and Argumentation
滿額折
出版日:2014/06/30 作者:Douglas Walton  出版社:Cambridge Univ Pr  裝訂:平裝
The notion of burden of proof and its companion notion of presumption are central to argumentation studies. This book argues that we can learn a lot from how the courts have developed procedures over the years for allocating and reasoning with presumptions and burdens of proof, and from how artificial intelligence has built precise formal and computational systems to represent this kind of reasoning. The book provides a model of reasoning with burden of proof and presumption, based on analyses of many clearly explained legal and non-legal examples. The model is shown to fit cases of everyday conversational argumentation as well as argumentation in legal cases. Burden of proof determines (1) under what conditions an arguer is obliged to support a claim with an argument that backs it up and (2) how strong that argument needs to be to prove the claim in question.
優惠價: 9 1228
無庫存
Logical Foundations of Proof Complexity
滿額折
出版日:2014/06/05 作者:Stephen Cook  出版社:Cambridge Univ Pr  裝訂:平裝
This book treats bounded arithmetic and propositional proof complexity from the point of view of computational complexity. The first seven chapters include the necessary logical background for the material and are suitable for a graduate course. Associated with each of many complexity classes are both a two-sorted predicate calculus theory, with induction restricted to concepts in the class, and a propositional proof system. The complexity classes range from AC0 for the weakest theory up to the polynomial hierarchy. Each bounded theorem in a theory translates into a family of (quantified) propositional tautologies with polynomial size proofs in the corresponding proof system. The theory proves the soundness of the associated proof system. The result is a uniform treatment of many systems in the literature, including Buss's theories for the polynomial hierarchy and many disparate systems for complexity classes such as AC0, AC0(m), TC0, NC1, L, NL, NC, and P.
優惠價: 9 3392
無庫存
Proof Analysis
90 折
出版日:2011/11/21 作者:Sara Negri  出版社:Cambridge Univ Pr  裝訂:精裝
This book continues from where the authors' previous book, Structural Proof Theory, ended. It presents an extension of the methods of analysis of proofs in pure logic to elementary axiomatic systems and to what is known as philosophical logic. A self-contained brief introduction to the proof theory of pure logic is included that serves both the mathematically and philosophically oriented reader. The method is built up gradually, with examples drawn from theories of order, lattice theory and elementary geometry. The aim is, in each of the examples, to help the reader grasp the combinatorial behaviour of an axiom system, which typically leads to decidability results. The last part presents, as an application and extension of all that precedes it, a proof-theoretical approach to the Kripke semantics of modal and related logics, with a great number of new results, providing essential reading for mathematical and philosophical logicians.
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
Forcing With Random Variables and Proof Complexity
90 折
出版日:2010/12/31 作者:Jan Krajíček  出版社:Cambridge Univ Pr  裝訂:平裝
This book introduces a new approach to building models of bounded arithmetic, with techniques drawn from recent results in computational complexity. Propositional proof systems and bounded arithmetics are closely related. In particular, proving lower bounds on the lengths of proofs in propositional proof systems is equivalent to constructing certain extensions of models of bounded arithmetic. This offers a clean and coherent framework for thinking about lower bounds for proof lengths, and it has proved quite successful in the past. This book outlines a brand new method for constructing models of bounded arithmetic, thus for proving independence results and establishing lower bounds for proof lengths. The models are built from random variables defined on a sample space which is a non-standard finite set and sampled by functions of some restricted computational complexity. It will appeal to anyone interested in logical approaches to fundamental problems in complexity theory.
優惠價: 9 2807
無庫存
Boolean Models and Methods in Mathematics, Computer Science, and Engineering
90 折
出版日:2010/06/28 作者:Yves Crama  出版社:Cambridge Univ Pr  裝訂:精裝
This collection of papers presents a series of in-depth examinations of a variety of advanced topics related to Boolean functions and expressions. The chapters are written by some of the most prominent experts in their respective fields and cover topics ranging from algebra and propositional logic to learning theory, cryptography, computational complexity, electrical engineering, and reliability theory. Beyond the diversity of the questions raised and investigated in different chapters, a remarkable feature of the collection is the common thread created by the fundamental language, concepts, models, and tools provided by Boolean theory. Many readers will be surprised to discover the countless links between seemingly remote topics discussed in various chapters of the book. This text will help them draw on such connections to further their understanding of their own scientific discipline and to explore new avenues for research.
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
Correlation Pattern Recognition
90 折
出版日:2010/06/10 作者:B. V. K. Vijaya Kumar  出版社:Cambridge Univ Pr  裝訂:平裝
Correlation is a robust and general technique for pattern recognition and is used in many applications, such as automatic target recognition, biometric recognition and optical character recognition. The design, analysis and use of correlation pattern recognition algorithms requires background information, including linear systems theory, random variables and processes, matrix/vector methods, detection and estimation theory, digital signal processing and optical processing. This book provides a needed review of this diverse background material and develops the signal processing theory, the pattern recognition metrics, and the practical application know-how from basic premises. It shows both digital and optical implementations. It also contains technology presented by the team that developed it and includes case studies of significant interest, such as face and fingerprint recognition. Suitable for graduate students taking courses in pattern recognition theory, whilst reaching technical
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
Logical Foundations of Proof Complexity
90 折
出版日:2010/01/25 作者:Stephen Cook  出版社:Cambridge Univ Pr  裝訂:精裝
This book treats bounded arithmetic and propositional proof complexity from the point of view of computational complexity. The first seven chapters include the necessary logical background for the material and are suitable for a graduate course. Associated with each of many complexity classes are both a two-sorted predicate calculus theory, with induction restricted to concepts in the class, and a propositional proof system. The complexity classes range from AC0 for the weakest theory up to the polynomial hierarchy. Each bounded theorem in a theory translates into a family of (quantified) propositional tautologies with polynomial size proofs in the corresponding proof system. The theory proves the soundness of the associated proof system. The result is a uniform treatment of many systems in the literature, including Buss's theories for the polynomial hierarchy and many disparate systems for complexity classes such as AC0, AC0(m), TC0, NC1, L, NL, NC, and P.
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
Templets and the Explanation of Complex Patterns
90 折
出版日:2009/01/11 作者:Michael J. Katz  出版社:Cambridge Univ Pr  裝訂:平裝
Where does the particular form or configuration of a pattern come from, and how is it propagated from pattern to pattern? Templets and the Explanation of Complex Patterns provides a natural language for analysing such questions. Using it, the organisational forces that underlie the fabrication of any pattern can be divided into two classes. First, there are the 'universal laws' of pattern assembly, the configurational rules and constraints inherent within the fabric of the pattern elements themselves. Second, there are the 'templets' - external, situational constraints imposed on the pattern elements. From the perspective of templeting, simple patterns can be directly contrasted with complex patterns: the former are completely determined by their universal laws, whereas the latter also require extensive templets. Natural patterns range along the entire spectrum from simple to complex, and the most complex of these include both random patterns and many biological patterns.
優惠價: 9 1696
無庫存
Structural Proof Theory
90 折
出版日:2008/07/10 作者:Sara Negri  出版社:Cambridge Univ Pr  裝訂:平裝
Structural proof theory is a branch of logic that studies the general structure and properties of logical and mathematical proofs. This book is both a concise introduction to the central results and methods of structural proof theory, and a work of research that will be of interest to specialists. The book is designed to be used by students of philosophy, mathematics and computer science. The book contains a wealth of results on proof-theoretical systems, including extensions of such systems from logic to mathematics, and on the connection between the two main forms of structural proof theory - natural deduction and sequent calculus. The authors emphasize the computational content of logical results. A special feature of the volume is a computerized system for developing proofs interactively, downloadable from the web and regularly updated.
優惠價: 9 2105
無庫存
Proof Theory:A selection of papers from the Leeds Proof Theory Programme 1990
90 折
出版日:2008/01/21 作者:Peter Aczel  出版社:Cambridge Univ Pr  裝訂:平裝
The lecture courses in this work are derived from the SERC 'Logic for IT' Summer School and Conference on Proof Theory held at Leeds University. The contributions come from acknowledged experts and comprise expository and research articles; put together in this book they form an invaluable introduction to proof theory that is aimed at both mathematicians and computer scientists.
優惠價: 9 1754
無庫存
Correlation Pattern Recognition
90 折
出版日:2005/11/24 作者:B. V. K. Vijaya Kumar  出版社:Cambridge Univ Pr  裝訂:精裝
Correlation is a robust and general technique for pattern recognition and is used in many applications, such as automatic target recognition, biometric recognition and optical character recognition. The design, analysis and use of correlation pattern recognition algorithms requires background information, including linear systems theory, random variables and processes, matrix/vector methods, detection and estimation theory, digital signal processing and optical processing. This book provides a needed review of this diverse background material and develops the signal processing theory, the pattern recognition metrics, and the practical application know-how from basic premises. It shows both digital and optical implementations. It also contains technology presented by the team that developed it and includes case studies of significant interest, such as face and fingerprint recognition. Suitable for graduate students taking courses in pattern recognition theory, whilst reaching technical
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
Structural Proof Theory
90 折
出版日:2001/06/18 作者:Sara Negri  出版社:Cambridge Univ Pr  裝訂:精裝
Structural proof theory is a branch of logic that studies the general structure and properties of logical and mathematical proofs. This book is both a concise introduction to the central results and methods of structural proof theory, and a work of research that will be of interest to specialists. The book is designed to be used by students of philosophy, mathematics and computer science. The book contains a wealth of results on proof-theoretical systems, including extensions of such systems from logic to mathematics, and on the connection between the two main forms of structural proof theory - natural deduction and sequent calculus. The authors emphasize the computational content of logical results. A special feature of the volume is a computerized system for developing proofs interactively, downloadable from the web and regularly updated.
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
Proof Theory:A selection of papers from the Leeds Proof Theory Programme 1990
90 折
出版日:1993/02/11 作者:Peter Aczel  出版社:Cambridge Univ Pr  裝訂:精裝
The lecture courses in this work are derived from the SERC 'Logic for IT' Summer School and Conference on Proof Theory held at Leeds University. The contributions come from acknowledged experts and comprise expository and research articles; put together in this book they form an invaluable introduction to proof theory that is aimed at both mathematicians and computer scientists.
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
Stone Spaces
90 折
出版日:1986/08/14 作者:Peter T. Johnstone  出版社:Cambridge Univ Pr  裝訂:平裝
Over the last 45 years, Boolean theorem has been generalized and extended in several different directions and its applications have reached into almost every area of modern mathematics; but since it lies on the frontiers of algebra, geometry, general topology and functional analysis, the corpus of mathematics which has arisen in this way is seldom seen as a whole. In order to give a unified treatment of this rather diverse body of material, Dr Johnstone begins by developing the theory of locales (a lattice-theoretic approach to 'general topology without points' which has achieved some notable results in the past ten years but which has not previously been treated in book form). This development culminates in the proof of Stone's Representation Theorem.
優惠價: 9 2456
無庫存
Proof and Falsity:A Logical Investigation
90 折
出版日:2021/09/02 作者:Nils Kürbis  出版社:Cambridge Univ Pr  裝訂:平裝
This book argues that the meaning of negation, perhaps the most important logical constant, cannot be defined within the framework of the most comprehensive theory of proof-theoretic semantics, as formulated in the influential work of Michael Dummett and Dag Prawitz. Nils Kürbis examines three approaches that have attempted to solve the problem - defining negation in terms of metaphysical incompatibility; treating negation as an undefinable primitive; and defining negation in terms of a speech act of denial - and concludes that they cannot adequately do so. He argues that whereas proof-theoretic semantics usually only appeals to a notion of truth, it also needs to appeal to a notion of falsity, and proposes a system of natural deduction in which both are incorporated. Offering new perspectives on negation, denial and falsity, his book will be important for readers working on logic, metaphysics and the philosophy of language.
優惠價: 9 1673
無庫存
Equivariant Stable Homotopy Theory and the Kervaire Invariant Problem
90 折
出版日:2021/04/30 作者:Michael A. Hill  出版社:Cambridge Univ Pr  裝訂:精裝
The long-standing Kervaire invariant problem in homotopy theory arose from geometric and differential topology in the 1960s and was quickly recognised as one of the most important problems in the field. In 2009 the authors of this book announced a solution to the problem, which was published to wide acclaim in a landmark Annals of Mathematics paper. The proof is long and involved, using many sophisticated tools of modern (equivariant) stable homotopy theory that are unfamiliar to non-experts. This book presents the proof together with a full development of all the background material to make it accessible to a graduate student with an elementary algebraic topology knowledge. There are explicit examples of constructions used in solving the problem. Also featuring a motivating history of the problem and numerous conceptual and expository improvements on the proof, this is the definitive account of the resolution of the Kervaire invariant problem.
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
Essentials of Pattern Recognition:An Accessible Approach
90 折
出版日:2020/11/30 作者:Jianxin Wu  出版社:Cambridge Univ Pr  裝訂:精裝
This textbook introduces fundamental concepts, major models, and popular applications of pattern recognition for a one-semester undergraduate course. To ensure student understanding, the text focuses on a relatively small number of core concepts with an abundance of illustrations and examples. Concepts are reinforced with hands-on exercises to nurture the student's skill in problem solving. New concepts and algorithms are framed by real-world context and established as part of the big picture introduced in an early chapter. A problem-solving strategy is employed in several chapters to equip students with an approach for new problems in pattern recognition. This text also points out common errors that a new player in pattern recognition may encounter, and fosters the ability for readers to find useful resources and independently solve a new pattern recognition task through various working examples. Students with an undergraduate understanding of mathematical analysis, linear algebra, an
優惠價: 9 2969
無庫存
Proof & Falsity: a Logical Investigation
90 折
出版日:2019/07/31 作者:Nils Kürbis  出版社:Cambridge Univ Pr  裝訂:精裝
This book argues that the meaning of negation, perhaps the most important logical constant, cannot be defined within the framework of the most comprehensive theory of proof-theoretic semantics, as formulated in the influential work of Michael Dummett and Dag Prawitz. Nils Kürbis examines three approaches that have attempted to solve the problem - defining negation in terms of metaphysical incompatibility; treating negation as an undefinable primitive; and defining negation in terms of a speech act of denial - and concludes that they cannot adequately do so. He argues that whereas proof-theoretic semantics usually only appeals to a notion of truth, it also needs to appeal to a notion of falsity, and proposes a system of natural deduction in which both are incorporated. Offering new perspectives on negation, denial and falsity, his book will be important for readers working on logic, metaphysics and the philosophy of language.
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
Defocusing Nonlinear Schrodinger Equations
90 折
出版日:2019/05/31 作者:Benjamin Dodson  出版社:Cambridge Univ Pr  裝訂:精裝
This study of Schrödinger equations with power-type nonlinearity provides a great deal of insight into other dispersive partial differential equations and geometric partial differential equations. It presents important proofs, using tools from harmonic analysis, microlocal analysis, functional analysis, and topology. This includes a new proof of Keel–Tao endpoint Strichartz estimates, and a new proof of Bourgain's result for radial, energy-critical NLS. It also provides a detailed presentation of scattering results for energy-critical and mass-critical equations. This book is suitable as the basis for a one-semester course, and serves as a useful introduction to nonlinear Schrödinger equations for those with a background in harmonic analysis, functional analysis, and partial differential equations.
若需訂購本書,請電洽客服 02-25006600[分機130、131]。
  • 6438
    161
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 7
  • 8
  • 9
  • 161

暢銷榜

客服中心

收藏

會員專區