Hasil Pencarian  ::  Simpan CSV :: Kembali

"Sheaves of algebras over boolean spaces comprehensively covers sheaf theory as applied to universal algebra. The text presents intuitive ideas from topology such as the notion of metric space and the concept of central idempotent from ring theory. These lead to the abstract notions of complex and factor element, respectively. Factor elements are defined by identities, discovered for shells for the first time, explaining why central elements in rings and lattices have their particular form. Categorical formulations of the many representations by sheaves begin with adjunctions and move to equivalences as the book progresses, generalizing stone’s theorem for boolean algebras."

"This work is a concise introduction to spectral theory of Hilbert space operators. Its emphasis is on recent aspects of theory and detailed proofs, with the primary goal of offering a modern introductory textbook for a first graduate course in the subject. The coverage of topics is thorough, as the book explores various delicate points and hidden features often left untreated."

"This book provides an overview of automatic test pattern generation (ATPG) and introduces novel techniques to complement classical ATPG, based on Boolean Satisfiability (SAT). A fast and highly fault efficient SAT-based ATPG framework is presented which is also able to generate high-quality delay tests such as robust path delay tests, as well as tests with long propagation paths to detect small delay defects."

"Many fundamental combinatorial problems, arising in such diverse fields as artificial intelligence, logic, graph theory, and linear algebra, can be formulated as Boolean constraint satisfaction problems (CSP). This book is devoted to the study of the complexity of such problems. The authors' goal is to develop a framework for classifying the complexity of Boolean CSP in a uniform way. In doing so, they bring out common themes underlying many concepts and results in both algorithms and complexity theory. The results and techniques presented here show that Boolean CSP provide an excellent framework for discovering and formally validating "global" inferences about the nature of computation."

"Special numerical techniques are already needed to deal with nxn matrices for large n.Tensor data are of size nxnx...xn=n^d, where n^d exceeds the computer memory by far. They appear for problems of high spatial dimensions. Since standard methods fail, a particular tensor calculus is needed to treat such problems. The monograph describes the methods how tensors can be practically treated and how numerical operations can be performed. Applications are problems from quantum chemistry, approximation of multivariate functions, solution of pde, e.g., with stochastic coefficients, etc. ​"

"Binary Decision Diagram (BDD) merupakan representasi dari fungsi Booleansecara simbolik yang dikembangkan dan dipopulerkan oleh Randal E. Bryant.Selain mengembangkan BDD, Bryant juga memberikan algoritma untukmelakukan manipulasi pada BDD. Dengan menerapkan suatu kondisi tertentuterhadap BDD, yaitu dengan menentukan urutan variabel, akan didapat BDD yangterurut atau disebut juga Ordered Binary Decision Diagram (OBDD). Laludengan menyederhanakan OBDD maka akan didapatkan Reduced BinaryDecision Diagram (ROBDD). ROBDD akan memberikan representasi yang unikuntuk suatu fungsi Boolean. Jadi, jika terdapat dua ROBDD yangmerepresentasikan suatu fungsi Boolean f, maka kedua ROBDD tersebut adalahsama. Operasi pada fungsi Boolean dapat dilakukan dengan menggunakan operasipada ROBDD. Operasi – operasi yang ada pada ROBDD antara lain operasiApply, operasi Restrict, operasi SatCount, operasi AnySat, dan operasi AllSat."