Ditemukan 10 dokumen yang sesuai dengan query
Iva Maria
Abstrak :
Tugas akhir ini menyajikan penurunan pengujian deteksi
kesalahan bagi kesalahan logika permanen tunggal maupun
berganda (yaitu uji kesalahan s-a-0 atau s-a-1) pada
rangkaian kombinasional. Metoda yang digunakan adalah
penggunaan turunan Boole, yang ididefinisikan sebagai operasi
EXCLUSIVE-OR antara dua buah fungsi Boole.
Depok: Fakultas Matematika dan Ilmu Pengetahuan Alam Universitas Indonesia, 1992
S-pdf
UI - Skripsi Membership Universitas Indonesia Library
Pfeiffer, Paul E.
New York: McGraw-Hill, 1964
512.817 PFE s
Buku Teks Universitas Indonesia Library
Siswo Prayitno
Abstrak :
Tugas Akhir ini rnenyajikan salah satu bentuk fault (kesalahan) - yaitu Bridging Fault - pada rangkaian kombinasional. Berikut teknik-teknik yang sistematis untuk melacak (mendeteksi dan menemukan letak) bridging fault pada rangkaian kombinasional dengan rmenggunakan barisan (sequence) pola-pola test khusus yang menghasilkan respon-respon output yang berbeda.
Depok: Fakultas Matematika dan Ilmu Pengetahuan Alam Universitas Indonesia, 1993
S-pdf
UI - Skripsi Membership Universitas Indonesia Library
Abstrak :
Binary Decision Diagram (BDD) merupakan representasi dari fungsi Boolean
secara simbolik yang dikembangkan dan dipopulerkan oleh Randal E. Bryant.
Selain mengembangkan BDD, Bryant juga memberikan algoritma untuk
melakukan manipulasi pada BDD. Dengan menerapkan suatu kondisi tertentu
terhadap BDD, yaitu dengan menentukan urutan variabel, akan didapat BDD yang
terurut atau disebut juga Ordered Binary Decision Diagram (OBDD). Lalu
dengan menyederhanakan OBDD maka akan didapatkan Reduced Binary
Decision Diagram (ROBDD). ROBDD akan memberikan representasi yang unik
untuk suatu fungsi Boolean. Jadi, jika terdapat dua ROBDD yang
merepresentasikan suatu fungsi Boolean f, maka kedua ROBDD tersebut adalah
sama. Operasi pada fungsi Boolean dapat dilakukan dengan menggunakan operasi
pada ROBDD. Operasi – operasi yang ada pada ROBDD antara lain operasi
Apply, operasi Restrict, operasi SatCount, operasi AnySat, dan operasi AllSat.
Universitas Indonesia, 2010
S-Pdf
UI - Skripsi Membership Universitas Indonesia Library
Annisa Puspitasari
Depok: Universitas Indonesia, 2010
S27832
UI - Skripsi Open Universitas Indonesia Library
Eggersgluß, Stephan
Abstrak :
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.
New York: [, Springer], 2012
e20418663
eBooks Universitas Indonesia Library
Knoebel, Arthur
Abstrak :
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.
New York: Springer Science, 2012
e20418932
eBooks Universitas Indonesia Library
Creignou, Nadia
Abstrak :
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.
Philadelphia : Society for Industrial and Applied Mathematics, 2001
e20442783
eBooks Universitas Indonesia Library
Houghton, Janaye M.
Englewood: Libraries Unlimited, Inc., 1999
025.04 HOU d
Buku Teks Universitas Indonesia Library
Liou, James J.H
Abstrak :
This study differs from previous studies by applying multivariate statistical analysis and multi-criterion decision-making methods to the improvement of service quality. We use the rough set theory (RST) with a flow graph approach to determine customer attitudes regarding service quality, which can assist managers in developing strategies to improve service quality and thus satisfy the needs of customers. A set of rules is derived from a large sample of airline customers, and its predictive ability is evaluated. The flow graph and the cause-and-effect relationship of the decision rules are heavily exploited in service quality characteristics. As compared with the results of other data-mining analyses, our results are encouraging. This study demonstrates that the combination of the RST model and flow graphs assists in identifying the needs of customers, determining their characteristics, and facilitating the development of an improvement strategy.
Taylor and Francis, 2016
658 JIPE 33:2 (2016)
Artikel Jurnal Universitas Indonesia Library