Recitation 10 - Reductions and P vs. N P
|
|
- Ridwan Budiman
- 5 tahun lalu
- Tontonan:
Transkripsi
1 Recitation 10 - Reductions and P vs. N P Orit Moskovich Gal Rotem Tel Aviv University December 23, 2015 Orit Moskovich and Gal Rotem (TAU) Recitation 10 - Reductions and P vs. NP December 23, / 31
2 Overview 1 More Reductions... 2 P and N P 3 N P and verifiability Orit Moskovich and Gal Rotem (TAU) Recitation 10 - Reductions and P vs. NP December 23, / 31
3 Example Example 1 { Every n-state machine M either: } B = (n, m) (1) halts on ε in less than m steps or (2) doesn t halt on ε Prove that B / R. Proof. ( ) Note: Given n, there exists some m such that (n, m ) B (why?) We show a reduction H TM,ε B. Orit Moskovich and Gal Rotem (TAU) Recitation 10 - Reductions and P vs. NP December 23, / 31
4 Example Proof (Cont.) Assume by contradiction that B R and let M B be a TM that decides it. Pseudocode M deciding H TM,ε On input M 1 m = 1, n = Q M 2 While(True): 3 Run M B on (n, m): If M B accepts, break 4 else, m = m Run M on ε for m steps 6 If M halts, accept; Otherwise, reject Orit Moskovich and Gal Rotem (TAU) Recitation 10 - Reductions and P vs. NP December 23, / 31
5 Example Correctness By ( ), the loops ends, and finds m such that (n, m) B Since M is an n-states TM, and (n, m) B, either: (1) M halts on ε in less than m steps or (2) M doesn t halt on ε Orit Moskovich and Gal Rotem (TAU) Recitation 10 - Reductions and P vs. NP December 23, / 31
6 Computational Histories Definition 2 Let M be a TM and w an input string. An accepting (rejecting) computation history for M on w is a sequence of configurations: Where: # } {{} # C 1 }{{} 1 C 1 is the start configuration for M on w C R 2 #... # } {{ } C l 2 Each C i+1 legally follows from C i according to the rules of M 3 C l is an accepting (rejecting) configuation for M Orit Moskovich and Gal Rotem (TAU) Recitation 10 - Reductions and P vs. NP December 23, / 31
7 Example - Computational Histories Example 3 Let WW = {ww w Σ }. Let P WW = { P P is a PDA that accepts some string w WW }. Use computational histories to prove that P WW / R. Proof. We show a reduction A TM m P WW. How? Given M, w we build a PDA P such that: P accepts some string of the form h$h$ M accepts w. Orit Moskovich and Gal Rotem (TAU) Recitation 10 - Reductions and P vs. NP December 23, / 31
8 Example - Computational Histories Mapping Reduction f from A TM to P WW On input M, w 1 Construct the following PDA P: P = On input #C 1 #C R 2 #... #C l $ #C 1 #C R 2 #... #C l $: 1. Push C 1 to stack while confirming that it is the initial configuration for M(w) 2. For each configuration C 2i, until first $ sign: 3. Pop C 2i 1 from stack and verify that C 2i legally follows from C 2i 1 4. Skip C 1, Push C 2 to stack 5. For each configuration C 2i+1, until second $ sign: 6. Pop C 2i from stack and verify that C 2i+1 legally follows from C 2i 7. Verify that C l is an accepting configuration for M(w) 8. If all tests passed, accept Orit Moskovich and Gal Rotem (TAU) Recitation 10 - Reductions and P vs. NP December 23, / 31
9 Example - Computational Histories Correctness If M, w A TM, then there exists an accepting computation history h of M on w. Therefore, P accepts h$h$, and thus, P P WW. If P P WW, i.e., P accepts h$h$ for some string h. Then, h must be an accepting computation history of M on w (why?). Therefore, M, w A TM. Orit Moskovich and Gal Rotem (TAU) Recitation 10 - Reductions and P vs. NP December 23, / 31
10 Collatz Conjecture Example 4 Let f (n) = { 3n + 1 if n 1 (mod 2) n/2 if n 0 (mod 2) If you start with an integer n and iterate f, you obtain a sequence n, f (n), f (f (n)),... Stop if you ever hit 1. For example, if n = 17, you get the sequence 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1. Extensive computer tests have shown that every starting point between 1 and a large integer gives a sequence that ends in 1. Collatz Conjecture: all positive starting points end up at 1. Suppose that A TM was decidable by a TM H. Use H to describe a TM that prints the answer to the Collatz conjecture. In other words, show CC A TM. Orit Moskovich and Gal Rotem (TAU) Recitation 10 - Reductions and P vs. NP December 23, / 31
11 Collatz Conjecture Pseudocode M deciding CC 1 Construct the TM M 1 (calculates the series): M 1 = On input n: 1. c = n 2. While(True): 3. If c == 1, accept 4. c = f (c) 2 Construct the TM M 2 (finds n that contradicts the conjecture): M 2 = On input x: 1. For n = 2, 3,...: 2. If H(M 1, n) rejects, accept 3 Run H on M 2, ε 4 If H accepts, the conjecture is wrong; If H rejects, the conjecture is correct Orit Moskovich and Gal Rotem (TAU) Recitation 10 - Reductions and P vs. NP December 23, / 31
12 P vs. N P Orit Moskovich and Gal Rotem (TAU) Recitation 10 - Reductions and P vs. NP December 23, / 31
13 P vs. N P Definition 5 P is the set of languages decidable in polynomial time on deterministic TMs: P = c>0 DTIME(n c ) Definition 6 N P is the set of languages decidable in polynomial time on non-deterministic TMs: N P = c>0 NDTIME(n c ) Orit Moskovich and Gal Rotem (TAU) Recitation 10 - Reductions and P vs. NP December 23, / 31
14 Verifiability and N P Definition 7 Algorithm V is a verifier for a language L, if x L c {0, 1}. V (x, c) = 1 x / L c {0, 1}. V (x, c) = 1 Theorem 8 A language L N P it has a polynomial time verifier (! ) We measure the time of the verifier only in terms of x, not c. Orit Moskovich and Gal Rotem (TAU) Recitation 10 - Reductions and P vs. NP December 23, / 31
15 Boolean Formulas Definition 9 A Boolean formula is an expression built from: Boolean variables, having one of two values: True 1 False 0 Boolean operations: and or not Examples: 1 0 = = = 1 φ = (x y) (y z) Orit Moskovich and Gal Rotem (TAU) Recitation 10 - Reductions and P vs. NP December 23, / 31
16 Satisfiability Definition 10 A Boolean assignment, V, for a formula φ, is a function from the set of variables of φ to {0, 1}. Example: V (x) = 1, V (y) = 0, V (z) = 0 Definition 11 A formula is satisfiable, if some Boolean assignment to its variables, makes the formula evaluate to 1. Example: φ = (x y) (y z) V (φ) = (V (x) V (y)) (V (y) V (z)) = (1 0) (0 0) = = (1 0) (1 1) = 1 }{{}}{{} 0 1 Orit Moskovich and Gal Rotem (TAU) Recitation 10 - Reductions and P vs. NP December 23, / 31
17 Satisfiability Example: φ = (x y) (x y) (x y) (x y) Is φ satisfiable? Let s try V (x) = 1, V (y) = 1. V (φ) = (1 1) (1 1) (1 1) (1 1) = = (1 1) (1 1) (1 1) (0 0) = 0 }{{} 0 For any assignment V (x) = v x, V (y) = v y V (φ) = 0. Question How many possible assignments exist for a Boolean formula φ with n variables? Orit Moskovich and Gal Rotem (TAU) Recitation 10 - Reductions and P vs. NP December 23, / 31
18 SAT Definition 12 SAT = { φ φ is a satisfiable Boolean formula} Theorem 13 SAT N P Proof. A polynomial time verifier, where the witness is the assignment: Verifier V SAT for SAT On input φ, V 1 Replace each variable in φ according to V 2 Evaluate V (φ) 3 If V (φ) = 1, accept; Otherwise, reject Orit Moskovich and Gal Rotem (TAU) Recitation 10 - Reductions and P vs. NP December 23, / 31
19 SAT Correctness Verifiability: If φ is satisfiable, then there exists a witness V = (1, 0, 0,...) that satisfies φ If φ is not satisfiable, then no assignment V can satisfy φ Polynomial time: Denote by m the number of clauses in φ Denote by n the number of variables in φ V SAT runs in O(n m) time Orit Moskovich and Gal Rotem (TAU) Recitation 10 - Reductions and P vs. NP December 23, / 31
20 CNF Definition 14 A literal is a variable or negated variable: x or x A clause is several literals joined by s: (x 1 x 2 x 3 ) Definition 15 A Boolean formula is in conjunctive normal form (CNF) if it consists of clauses, connected with s. Example: (x 1 x 2 ) (x 2 x 3 x 4 x 7 ) Definition 16 A Boolean formula is in k-cnf form, if it is a CNF formula, and all clauses have k literals. Orit Moskovich and Gal Rotem (TAU) Recitation 10 - Reductions and P vs. NP December 23, / 31
21 3SAT Definition 17 3SAT = { φ φ is a satisfiable 3CNF formula} Theorem 18 3SAT N P Proof. A polynomial time verifier, where the witness is the assignment: Verifier V 3SAT for 3SAT On input φ, V 1 Replace each variable in φ according to V 2 Evaluate V (φ) 3 If V (φ) = 1, accept; Otherwise, reject Orit Moskovich and Gal Rotem (TAU) Recitation 10 - Reductions and P vs. NP December 23, / 31
22 3SAT Questions 3SAT P? What about 3SAT = { φ φ is not satisfiable} Orit Moskovich and Gal Rotem (TAU) Recitation 10 - Reductions and P vs. NP December 23, / 31
23 Clique Definition 19 A clique in an undirected graph G = (V, E) is a subgraph, where every two nodes are connected by an edge. Formally, A V is a clique if v 1 v 2 A. (v 1, v 2 ) E. Definition 20 A k-clique is a clique of size k. Orit Moskovich and Gal Rotem (TAU) Recitation 10 - Reductions and P vs. NP December 23, / 31
24 Clique Definition 19 A clique in an undirected graph G = (V, E) is a subgraph, where every two nodes are connected by an edge. Formally, A V is a clique if v 1 v 2 A. (v 1, v 2 ) E. Definition 20 A k-clique is a clique of size k. Orit Moskovich and Gal Rotem (TAU) Recitation 10 - Reductions and P vs. NP December 23, / 31
25 Clique Definition 19 A clique in an undirected graph G = (V, E) is a subgraph, where every two nodes are connected by an edge. Formally, A V is a clique if v 1 v 2 A. (v 1, v 2 ) E. Definition 20 A k-clique is a clique of size k. Orit Moskovich and Gal Rotem (TAU) Recitation 10 - Reductions and P vs. NP December 23, / 31
26 Clique Definition 19 A clique in an undirected graph G = (V, E) is a subgraph, where every two nodes are connected by an edge. Formally, A V is a clique if v 1 v 2 A. (v 1, v 2 ) E. Definition 20 A k-clique is a clique of size k. Orit Moskovich and Gal Rotem (TAU) Recitation 10 - Reductions and P vs. NP December 23, / 31
27 Clique Definition 21 CLIQUE = { G, k G is an undirected graph with a k-clique} Theorem 22 CLIQUE N P Proof. A polynomial time verifier, where the witness is the clique: Verifier V CLIQUE for CLIQUE On input G, k, c 1 Verify that c is a set of k nodes in G 2 Verify that G contains all edges between nodes in c 3 If both tests pass, accept; Otherwise, reject Orit Moskovich and Gal Rotem (TAU) Recitation 10 - Reductions and P vs. NP December 23, / 31
28 Independent Set Definition 23 An independent set (IS) in a graph is a set of nodes, no two of which are linked by an edge. Formally, A V is an IS if v 1 v 2 A. (v 1, v 2 ) / E. Definition 24 A k-is is an independent set of size k. Orit Moskovich and Gal Rotem (TAU) Recitation 10 - Reductions and P vs. NP December 23, / 31
29 Independent Set Definition 23 An independent set (IS) in a graph is a set of nodes, no two of which are linked by an edge. Formally, A V is an IS if v 1 v 2 A. (v 1, v 2 ) / E. Definition 24 A k-is is an independent set of size k. Orit Moskovich and Gal Rotem (TAU) Recitation 10 - Reductions and P vs. NP December 23, / 31
30 Independent Set Definition 23 An independent set (IS) in a graph is a set of nodes, no two of which are linked by an edge. Formally, A V is an IS if v 1 v 2 A. (v 1, v 2 ) / E. Definition 24 A k-is is an independent set of size k. Orit Moskovich and Gal Rotem (TAU) Recitation 10 - Reductions and P vs. NP December 23, / 31
31 Independent Set Definition 23 An independent set (IS) in a graph is a set of nodes, no two of which are linked by an edge. Formally, A V is an IS if v 1 v 2 A. (v 1, v 2 ) / E. Definition 24 A k-is is an independent set of size k. Orit Moskovich and Gal Rotem (TAU) Recitation 10 - Reductions and P vs. NP December 23, / 31
32 Independent Set Definition 25 IS = { G, k G is an undirected graph with a k-is} Theorem 26 IS N P Proof. A polynomial time verifier, where the witness is the independent set... Orit Moskovich and Gal Rotem (TAU) Recitation 10 - Reductions and P vs. NP December 23, / 31
33 Vertex Cover Definition 27 A vertex cover (VC) in a graph is a set of nodes, where every edge of G touches one of those nodes. Formally, A V is a VC if (v 1, v 2 ) E. v 1 A or v 2 A. Definition 28 A k-vc is a vertex cover of size k. Orit Moskovich and Gal Rotem (TAU) Recitation 10 - Reductions and P vs. NP December 23, / 31
34 Vertex Cover Definition 27 A vertex cover (VC) in a graph is a set of nodes, where every edge of G touches one of those nodes. Formally, A V is a VC if (v 1, v 2 ) E. v 1 A or v 2 A. Definition 28 A k-vc is a vertex cover of size k. Orit Moskovich and Gal Rotem (TAU) Recitation 10 - Reductions and P vs. NP December 23, / 31
35 Vertex Cover Definition 27 A vertex cover (VC) in a graph is a set of nodes, where every edge of G touches one of those nodes. Formally, A V is a VC if (v 1, v 2 ) E. v 1 A or v 2 A. Definition 28 A k-vc is a vertex cover of size k. Orit Moskovich and Gal Rotem (TAU) Recitation 10 - Reductions and P vs. NP December 23, / 31
36 Vertex Cover Definition 27 A vertex cover (VC) in a graph is a set of nodes, where every edge of G touches one of those nodes. Formally, A V is a VC if (v 1, v 2 ) E. v 1 A or v 2 A. Definition 28 A k-vc is a vertex cover of size k. Orit Moskovich and Gal Rotem (TAU) Recitation 10 - Reductions and P vs. NP December 23, / 31
37 Vertex Cover Definition 29 VC = { G, k G is an undirected graph with a k-vc} Theorem 30 VC N P Proof. A polynomial time verifier, where the witness is the set of vertices covering G... Orit Moskovich and Gal Rotem (TAU) Recitation 10 - Reductions and P vs. NP December 23, / 31
38 VC vs. IS Theorem 31 Let G = (V, E) be an undirected graph. Let A V. Then, A is a VC V \ A is an IS. Proof. Let A be a VC. Assume by contradiction that V \ A is not an IS. Therefore, v 1, v 2 V \ A. (v 1, v 2 ) E. But v 1, v 2 / A, and therefore (v 1, v 2 ) is not covered. Contradiction for A being a VC. Let V \ A be an IS. Assume by contradiction that A is not a VC. Therefore, v 1, v 2 / A. (v 1, v 2 ) E. But v 1, v 2 V \ A, and (v 1, v 2 ) E. Contradiction for V \ A being an IS. Orit Moskovich and Gal Rotem (TAU) Recitation 10 - Reductions and P vs. NP December 23, / 31
39 Clique vs. IS Theorem 32 Let G = (V, E) be an undirected graph. Define H = (V, E ) to be the complement of G iff E = {(u, v) u, v V and (u, v) / E}. Let A V. Then, A is a Clique in G A is an IS in H. Proof. A is a Clique in G v 1 v 2 A. (v 1, v 2 ) E v 1 v 2 A. (v 1, v 2 ) / E A is an IS in H Orit Moskovich and Gal Rotem (TAU) Recitation 10 - Reductions and P vs. NP December 23, / 31
40 The End Courtesy of Orit Moskovich and Gal Rotem (TAU) Recitation 10 - Reductions and P vs. NP December 23, / 31
1/5. while and do Loops The remaining types of loops are while and do. As with for loops, while and do loops Praktikum Alpro Modul 3.
Judul TIU TIK Materi Modul Perulangan Ganjil 204/205 Mahasiswa memahami Konsep Perulangan. Mahasiswa mampu menggunakan perintah perulangan For, While do, do While 2. Mahasiswa mampu menggunakan perintah
Lebih terperinciTIF APPLIED MATH 1 (MATEMATIKA TERAPAN 1) Week 3 SET THEORY (Continued)
TIF 21101 APPLIED MATH 1 (MATEMATIKA TERAPAN 1) Week 3 SET THEORY (Continued) OBJECTIVES: 1. Subset and superset relation 2. Cardinality & Power of Set 3. Algebra Law of Sets 4. Inclusion 5. Cartesian
Lebih terperinciData Structures. Class 5 Pointer. Copyright 2006 by The McGraw-Hill Companies, Inc. All rights reserved.
Data Structures Class 5 Pointer McGraw-Hill Technology Education Copyright 2006 by The McGraw-Hill Companies, Inc. All rights reserved. What is a variable? 1. Each variable must be defined before you can
Lebih terperinciPAM 271 PENGANTAR TEORI GRAF
PAM 271 PENGANTAR TEORI GRAF SEMESTER GANJIL 2016-2017 Lyra Yulianti Jurusan Matematika FMIPA Universitas Andalas LYRA (MA-UNAND) 1 / 15 Outline Outline 1 Kontrak Kuliah LYRA (MA-UNAND) 2 / 15 Outline
Lebih terperinciNama Soal Pembagian Ring Road Batas Waktu 1 detik Nama Berkas Ringroad[1..10].out Batas Memori 32 MB Tipe [output only] Sumber Brian Marshal
Nama Soal Pembagian Ring Road Batas Waktu 1 detik Nama Berkas Ringroad[1..10].out Batas Memori 32 MB Tipe [output only] Sumber Brian Marshal Deskripsi Soal Dalam rangka mensukseskan program Visit Indonesia,
Lebih terperinciPemrograman Lanjut. Interface
Pemrograman Lanjut Interface PTIIK - 2014 2 Objectives Interfaces Defining an Interface How a class implements an interface Public interfaces Implementing multiple interfaces Extending an interface 3 Introduction
Lebih terperinciOFVSBM!OFUXPSL. Latar Belakang
OFVSBM!OFUXPSL Sumber: Tim Machine Learning PENS ITS Latar Belakang Kemampuan manusia dalam memproses informasi, mengenal wajah, tulisan, dsb. Kemampuan manusia dalam mengidentifikasi wajah dari sudut
Lebih terperinciStatistik Bisnis 1. Week 9 Discrete Probability
Statistik Bisnis 1 Week 9 Discrete Probability Random Variables Random Variables Discrete Random Variable Continuous Random Variable Wk. 9 Wk. 10 Probability Distributions Probability Distributions Wk.
Lebih terperinci1-x. dimana dan dihubungkan oleh teorema Pythagoras.
`2. Menyelesaikan persamaan dengan satu variabel Contoh: Berdasarkan Hukum Archimedes, suatu benda padat yang lebih ringan daripada air dimasukkan ke dalam air, maka benda tersebut akan mengapung. Berat
Lebih terperinciKeseimbangan Torsi Coulomb
Hukum Coulomb Keseimbangan Torsi Coulomb Perputaran ini untuk mencocokan dan mengukur torsi dalam serat dan sekaligus gaya yang menahan muatan Skala dipergunakan untuk membaca besarnya pemisahan muatan
Lebih terperinciSistem Informasi. Soal Dengan 2 Bahasa: Bahasa Indonesia Dan Bahasa Inggris
Sistem Informasi Soal Dengan 2 Bahasa: Bahasa Indonesia Dan Bahasa Inggris 1. Kita mengetahui bahwa perkembangan teknologi di zaman sekarang sangat pesat dan banyak hal yang berubah dalam kehidupan kita.
Lebih terperinciEkspresi Reguler Definisi. Notasi Ekspresi Regular. Contoh Ekspresi Reguler [2]
Ekspresi Reguler Definisi Pertemuan : 3 Dosen Pembina : Danang Junaedi IF-UTAMA 1 Suatu cara untuk merepresentasikan bahasa regular [4] Pola (pattern) atau template untuk string dari suatu bahasa [3] Cara
Lebih terperinciSequences & Series. Naufal Elang Ciptadi
Sequences & Series Naufal Elang Ciptadi Topics that will be discussed Concepts of Sequence and Series Sequences Series Binomial Expansion Mathematical Induction Concepts of Sequences & Series A. Sequences
Lebih terperinciT DAR INTEGRAL TAK MUTLAK
INTEGRAL TAK MUTLAK T 515.43 DAR INTEGRAL TAK MUTLAK A B S T R A K Setiap teori integral selalu memuat masalah sebagai berikut. Jika untuk setiap n berlaku fungsi f» terintegral dan barisan fungsi {f n
Lebih terperinciAdam Mukharil Bachtiar English Class Informatics Engineering Algorithms and Programming Searching
Adam Mukharil Bachtiar English Class Informatics Engineering 2011 Algorithms and Programming Searching Steps of the Day Definition of Searching Sequential Search Binary Search Let s Start Definition of
Lebih terperinciLine VS Bezier Curve. Kurva Bezier. Other Curves. Drawing the Curve (1) Pertemuan: 06. Dosen Pembina Danang Junaedi Sriyani Violina IF-UTAMA 2
Line VS Bezier Curve Kurva Bezier Pertemuan: 06 Dosen Pembina Danang Junaedi Sriyani Violina IF-UTAMA 1 IF-UTAMA 2 Other Curves Drawing the Curve (1) IF-UTAMA 3 IF-UTAMA 4 1 Drawing the Curve (2) Algoritma
Lebih terperinciArsitektur Komputer. Pertemuan ke-2 - Aritmatika Komputer >>> Sistem bilangan & Format Data - Perkembangan Perangkat Keras Komputer
Arsitektur Komputer Pertemuan ke-2 - Aritmatika Komputer >>> Sistem bilangan & Format Data - Perkembangan Perangkat Keras Komputer ARITMATIKA KOMPUTER Materi : Englander, bab 2 dan 3 Stallings, bab 8 IEEE
Lebih terperinciTuring and State Machines. Mesin Turing. Turing Machine. Turing Machines 4/14/2011 IF_UTAMA 1
4/4/2 Turing and State Machines Mesin Turing Dosen Pembina : Danang Junaedi State Machines Called non-writing machines Have no control on their external input Cannot write or change their inputs Turing
Lebih terperinciDependent VS independent variable
Kuswanto-2012 !" #!! $!! %! & '% Dependent VS independent variable Indep. Var. (X) Dep. Var (Y) Regression Equation Fertilizer doses Yield y = b0 + b1x Evaporation Rain fall y = b0+b1x+b2x 2 Sum of Leave
Lebih terperinciTIP 163. Game Engine. Topik 5 (Pert 6) Graf, Representasi Dunia, dan Algoritma Pencari Jalur (Pathfinding) Dosen: Aditya Wikan Mahastama
TIP 163 Game Engine Topik 5 (Pert 6) Graf, Representasi Dunia, dan Algoritma Pencari Jalur (Pathfinding) Dosen: Aditya Wikan Mahastama Last Week Review Adakah permasalahan dalam tugas terakhir yang diberikan
Lebih terperinciElectrostatics. Wenny Maulina
Electrostatics Wenny Maulina Electric charge Protons have positive charge Electrons have negative charge Opposite signs attract Similar signs repel Electric field used to calculate force between charges
Lebih terperinciDIG1G3 Implementasi Struktur Data
DIG1G3 Implementasi Struktur Data Program Studi Diploma III Teknik Informatika Fakultas Ilmu Terapan Telkom University Dosen: Cahyana, S.T., M.Kom. Indra Azimi, S.T., M.T. 2 Stack (Tumpukan) Stack is a
Lebih terperinciJARINGAN KOMPUTER. 2. What is the IP address and port number used by gaia.cs.umass.edu to receive the file. gaia.cs.umass.edu :
JARINGAN KOMPUTER Buka wireshark tcp-ethereal-trace-1 TCP Basics Answer the following questions for the TCP segments: 1. What is the IP address and TCP port number used by your client computer source)
Lebih terperinciIsyarat. Oleh Risanuri Hidayat. Isyarat. Bernilai real, skalar Fungsi dari variabel waktu Nilai suatu isyarat pada waktu t harus real
Isyarat Oleh Risanuri Hidayat Isyarat adalah Isyarat Bernilai real, skalar Fungsi dari variabel waktu Nilai suatu isyarat pada waktu t harus real Contoh isyarat: Tegangan atau arus listrik dalam suatu
Lebih terperinciStatistik Farmasi Probabilitas
Statistik Farmasi 2016 Probabilitas TUJUAN PERKULIAHAN Setelah mengikuti perkuliahan, diharapkan mahasiswa mampu: 1 Menentukan ruang sampel dan probabilitas dari suatu peristiwa, dengan menggunakan probabilitas
Lebih terperinciMinimum Spanning Trees algorithm
Minimum Spanning Trees algorithm Algoritma Minimum Spanning Trees algoritma Kruskal and algoritma Prim. Kedua algoritma ini berbeda dalam metodologinya, tetapi keduanya mempunyai tujuan menemukan minimum
Lebih terperinciand if AB contains a point of, we say that A and B are on opposite
Incidence Geometry We are now ready to begin our study of geometries in earnest. We will study neutral geometry, based on the axioms of Hilbert. This means that we will study all that we can, almost, without
Lebih terperinciJARINGAN KOMPUTER : ANALISA TCP MENGGUNAKAN WIRESHARK
NAMA : MUHAMMAD AN IM FALAHUDDIN KELAS : 1 D4 LJ IT NRP : 2110165026 JARINGAN KOMPUTER : ANALISA TCP MENGGUNAKAN WIRESHARK 1. Analisa TCP pada Wireshark Hasil Capture dari tcp-ethereal trace 1.pcap TCP
Lebih terperinciReview Teori P dan NP
IF5110 Teori Komputasi Review Teori P dan NP Oleh: Rinaldi Munir Program Studi Magister Informatika STEI-ITB 1 2 Pendahuluan Kebutuhan waktu algoritma yang mangkus bervariasi, mulai dari O(1), O(log log
Lebih terperinciPelabelan Pseudo Edge-Magic dan Pseudo Vertex-Magic pada Graf Sebarang
Pelabelan Pseudo Edge-Magic dan Pseudo Vertex-Magic pada Graf Sebarang TUGAS AKHIR Diajukan untuk Memenuhi Persyaratan Sidang Sarjana Program Studi Matematika ITB Oleh : Julius 101 02 071 Program Studi
Lebih terperinciDIMENSI PARTISI DARI GRAF LOLLIPOP, GRAF GENERALIZED JAHANGIR, DAN GRAF C n 2 K m
DIMENSI PARTISI DARI GRAF LOLLIPOP, GRAF GENERALIZED JAHANGIR, DAN GRAF C n 2 K m oleh MAYLINDA PURNA KARTIKA DEWI M0112054 SKRIPSI ditulis dan diajukan untuk memenuhi sebagian persyaratan memperoleh gelar
Lebih terperinciDesign and Analysis of Algorithm
Design and Analysis of Algorithm Week 1: Introduction Dr. Putu Harry Gunawan 1 1 Department of Computational Science School of Computing Telkom University Dr. Putu Harry Gunawan (Telkom University) Design
Lebih terperinciPENELITIAN OPERASIONAL I (TIN 4109)
PENELITIAN OPERASIONAL I (TIN 4109) Lecture 4 LINEAR PROGRAMMING Lecture 4 Outline: Simplex Method References: Frederick Hillier and Gerald J. Lieberman. Introduction to Operations Research. 7th ed. The
Lebih terperinciABSTRACT. Keyword: Algorithm, Depth First Search, Breadth First Search, backtracking, Maze, Rat Race, Web Peta. Universitas Kristen Maranatha
ABSTRACT In a Rat Race game, there is only one way in and one way out. The objective of this game is to find the shortest way to reach the finish. We use a rat character in this game, so the rat must walk
Lebih terperinciBAB 4. TEOREMA FERMAT DAN WILSON
BAB 4. TEOREMA FERMAT DAN WILSON 1 Program Studi Pendidikan Matematika Universitas Muhammadiyah, Ponorogo June 24, 2012 Metoda Faktorisasi Fermat (1643) Biasanya pemfaktoran n melalui tester, yaitu faktor
Lebih terperinciJava Operators. Nurochman
Java Operators Nurochman Java Operators Unary operator Arithmetic operator Shift operator: , dan >>> Comparison operator Bitwise operators : &, ^, dan. Binary operators : &, ^, dan. Short Circuit
Lebih terperinciRahasia Cermat & Mahir Menguasai Akuntansi Keuangan Menengah (Indonesian Edition)
Rahasia Cermat & Mahir Menguasai Akuntansi Keuangan Menengah (Indonesian Edition) Hery Hery Click here if your download doesn"t start automatically Rahasia Cermat & Mahir Menguasai Akuntansi Keuangan Menengah
Lebih terperinciModul I MENGGABUNGKAN SCRIPT PHP DAN HTML
Modul I MENGGABUNGKAN SCRIPT PHP DAN HTML MATA KULIAH PENGENALAN PERANCANGAN WEB DAN INTERNET MODUL I TUJUAN - Mahasiswa memahami cara menggabungkan antara script PHP dan HMTL - Fungsi Echo - Register
Lebih terperinciPENELITIAN OPERASIONAL I (TIN 4109)
PENELITIAN OPERASIONAL I (TIN 4109) Lecture 3 LINEAR PROGRAMMING Lecture 3 Outline: Simplex Method References: Frederick Hillier and Gerald J. Lieberman. Introduction to Operations Research. 7th ed. The
Lebih terperinciPertemuan 3: Struktur Kontrol Pemrograman
Pertemuan 3: Struktur Kontrol Pemrograman Pendahuluan Salah satu aspek terpenting dalam pemrograman adalah mengatur pernyataan/statement mana yang akan dieksekusi berikutnya Struktur kontrol memungkinkan
Lebih terperinciRangkaian Pembagi Tegangan dan Arus Voltage and Current Divider Circuit
angkaian Pembagi Tegangan dan Arus Voltage and Current Divider Circuit Lecture # By Yohandri Kompetensi Dasar Mahasiswa dapat menganalisis rangkaian pembagi tegangan dan pembebanan, rangkaian pembagi arus
Lebih terperinciAdam Mukharil Bachtiar English Class Informatics Engineering Algorithms and Programming Branching Structure
Adam Mukharil Bachtiar English Class Informatics Engineering 2011 Algorithms and Programming Branching Structure Steps of the Day Definition Types of Branching Case Structure Let s Start Definition Definition
Lebih terperinciLogical Agents. Chastine Fatichah. Teknik Informatika Institut Teknologi Sepuluh Nopember November 2012
Kecerdasan Buatan (KI092301) Logical Agents Chastine Fatichah Teknik Informatika Institut Teknologi Sepuluh Nopember November 2012 1 / 62 Pokok Bahasan Knowledge-based agents Contoh: Wumpus world Logic
Lebih terperinciMANAJEMEN PROYEK LANJUT
MANAJEMEN PROYEK LANJUT Advance Project Management Dr. Ir. Budi Susetyo, MT Fakultas TEKNIK Program Magister SIPIL - MK www.mercubuana.ac.id 1 Bagian Isi 1. PM and Project financial management 2. Money
Lebih terperinciSuper (a,d)-h- Antimagic Total Covering of Chain Graph
Super (a,d)-h- Antimagic Total Covering of Chain Graph Dina Rizki Anggraini 1,, Dafik 1,, Susi Setiawani 1 CGANT - University of Jember Mathematics Education Department - University of Jember dinarizki11.dr@gmail.com,
Lebih terperinciInferensia Statistik parametrik VALID?? darimana sampel diambil
Inferensia Statistik parametrik VALID?? Tergantung dari bentuk populasi Tergantung dari bentuk populasi darimana sampel diambil Uji kesesuaian (goodness of fit) ) untuk tabel frekuensi Goodness-of-fit
Lebih terperinciAnswer: (Buku Ajar Kimia Umum,hal 9)
1. Which of Dalton s postulates about atoms are inconsistent with later observations? Do these inconsistencies mean that Dalton was wrong? Is Dalton s model still useful? Explain clearly. Teori Atom Dalton
Lebih terperinciFIRE CLAIM FORM SURAT KLAIM KEBAKARAN
FIRE CLAIM FORM SURAT KLAIM KEBAKARAN This is to notify you that a fire broke out which resulted a loss to my / our property, the particulars of which are indicated as follows : Bersama ini kami beritahukan
Lebih terperinciUJI HIPOTESIS STATISTIK NON PARAMETRIK.
UJI HIPOTESIS STATISTIK NON PARAMETRIK ekopujiyanto@ft.uns.ac.id Pendahuluan Statistik Non Parametrik Umumnya digunakan pada jenis data nominal dan ordinal Dapat digunakan pada populasi yang bebas distribusi
Lebih terperinciMODULE 1 GRADE XI VARIATION OF EXPRESSIONS
MODULE 1 GRADE XI VARIATION OF EXPRESSIONS Compiled by: Theresia Riya Vernalita H., S.Pd. Kompetensi Dasar 3.1 Menganalisis fungsi sosial, struktur teks, dan unsur kebahasaan pada ungkapan memberi saran
Lebih terperinciInformatics Class A UISI CALCULUS I WEEK 2 DAY 2
Informatics Class A UISI CALCULUS I WEEK 2 DAY 2 SLIDE AND ASSIGNMENT teachingnation.wordpress.com OUTLINE Recap Equalities Functions Domain and Range Graph Operations on Functions Inverse Trigonometry
Lebih terperinciHypothesis Testing SUNU WIBIRAMA
Hypothesis Testing SUNU WIBIRAMA Basic Probability and Statistics Department of Electrical Engineering and Information Technology Faculty of Engineering, Universitas Gadjah Mada CONTENTS 8.1 Introduc-on
Lebih terperinciOBJECT ORIENTED PROGRAMMING. Day 3 : Operator dan Assignment
OBJECT ORIENTED PROGRAMMING Day 3 : Operator dan Assignment TOPIK Membedakan antara instance dan local l variabel. Urutan pemrosesan Unary operator Arithmetic operator Shift operator: , dan >>> Comparison
Lebih terperinciTipe Boolean. Oleh : Fiftin Noviyanto
Oleh : Fiftin Noviyanto Tipe Boolean Operator aritmatika menghasilkan angka. Sedangkan operator relational dan operator logika menghasilkan nilai TRUE/FALSE. Tipe boolean, diambil dari nama seorang ahli
Lebih terperinciTipe Boolean 20/01/2012. Oleh : Fiftin Noviyanto
Tipe Boolean Oleh : Fiftin Noviyanto Operator aritmatika menghasilkan angka. Sedangkan operator relational dan operator logika menghasilkan nilai TRUE/FALSE. Tipe boolean, diambil dari nama seorang ahli
Lebih terperinciSIMULASI MONTE CARLO RISK MANAGEMENT DEPARTMENT OF INDUSTRIAL ENGINEERING
SIMULASI MONTE CARLO RISK MANAGEMENT DEPARTMENT OF INDUSTRIAL ENGINEERING PENGANTAR Simulasi Monte Carlo didefinisikan sebagai semua teknik sampling statistik yang digunakan untuk memperkirakan solusi
Lebih terperinciStatistik Bisnis 2. Week 4 Fundamental of Hypothesis Testing Methodology
Statistik Bisnis 2 Week 4 Fundamental of Hypothesis Testing Methodology ONE-TAIL TESTS One-Tail Tests In many cases, the alternative hypothesis focuses on a particular direction H 0 : μ 3 H 1 : μ < 3 H
Lebih terperinciDeadlock. Pada kasus ini juga bisa terjadi kelaparan, yaitu ada proses yang tidak terlayani
Deadlock Jika proses 1 sedang menggunakan sumber daya 1 dan menunggu sumber daya 2 yang ia butuhkan, sedangkan proses 2 sedang menggunakan sumber daya 2 dan menunggu sumber daya 1 Atau dengan kata lain
Lebih terperinciOperator dan Assignment. Pertemuan 3 Pemrograman Berbasis Obyek
Operator dan Assignment Pertemuan 3 Pemrograman Berbasis Obyek Topik Unary operator Arithmetic operator Shift operator: , dan >>> Comparison operator Bitwise operator: &, ^, dan. Short Circuit operator
Lebih terperinciUML USE CASE DIAGRAM
UML USE CASE DIAGRAM "Get your team up to speed on these requirements so that you can all start designing the system." Happy Monday READING DOCUMENT REQUIREMENT The requirements are still a little fuzzy,
Lebih terperinciFormula Penyederhanaan Penjumlahan Angka Berurutan (Formula Simplification of Sequential Numbers Addition)
01 Formula Simplification of Sequential Numbers Addition Formula Penyederhanaan Penjumlahan Anga Berurutan (Formula Simplification of Sequential Numbers Addition) Oleh (By): Yudi Wahyudin ABSTRAK Penjumlahan
Lebih terperinciNiklaus Wirth Eidgenossische Technische Hochschule Zurich, Switzerland ALGORITMA adalah langkah-langkah yang diambil dalam menyelesaikan suatu tugas Diselesaikan Oleh KOMPUTER Langkah-langkah harus tersusun
Lebih terperinciTEKNIK KOMPUTASI TEI 116/A. Jurusan Teknik Elektro dan Teknologi Informasi Universitas Gadjah Mada 2011
TEKNIK KOMPUTASI TEI 116/A Jurusan Teknik Elektro dan Teknologi Informasi Universitas Gadjah Mada 2011 Why teknik komputasi? Komputasi or computation comes from the word compute that is make a mathematical
Lebih terperinciLinear Discrimant Model
(update 1 Februari 01) Lecture 3 Linear Discrimant Model Learning a Class from Examples (Alpaydin 009) Class C of a family car Prediction: Is car x a family car? Knowledge extraction: What do people expect
Lebih terperinciData Time Series. Time series merupakan data yang diperoleh dan disusun berdasarkan urutan waktu atau
Peramalan Data Time Series Data Time Series Time series merupakan data yang diperoleh dan disusun berdasarkan urutan waktu atau data yang dikumpulkan dari waktu ke waktu. Waktu yang digunakan dapat berupa
Lebih terperinciSubnetting & CIDR. Fakultas Rekayasa Industri Institut Teknologi Telkom
Subnetting & CIDR Fakultas Rekayasa Industri Institut Teknologi Telkom Soal 1 Diketahui IP Address 172.128.127.24 dengan netmask 255.255.255.240. tentukanlah network address dengan broadcast address yang
Lebih terperinciPELABELAN ANTIPODAL PADA GRAF SIKEL
PELABELAN ANTIPODAL PADA GRAF SIKEL Puspa Novita Sari 1, Bambang Irawanto, Bayu Surarso 3 1,,3 Jurusan Matematika FS M Universitas Diponegoro Jl. Prof. H. Soedarto, S.H. Tembalang Semarang puspa.novita91@gmail.com
Lebih terperinciKonsep Dasar Peluang (1) Metode Statistika (STK 211) Pertemuan 4
Konsep Dasar Peluang (1) Metode Statistika (STK 211) Pertemuan 4 rahmaanisa@apps.ipb.acid Outline Mencacah ruang contoh (memahami definisi kejadian dan operasi-operasi pada kejadian) Menghitung dengan
Lebih terperinciTeddy Mantoro.
Teddy Mantoro teddy@ieee.org No Jabatan Dosen Dosen Tetap 2014 Dosen Tetap 2015 Dosen Tetap 2016 Jumlah % Jumlah % Jumlah % 1 GURU BESAR 369 2 371 1,8 250 1,3 2 LEKTOR KEPALA 1736 9,4 1783 8,5 1375 6,9
Lebih terperinciFINITE STATE AUTOMATA
Otomata & Teori Bahasa FINITE STATE AUTOMATA www.themegallery.com Contents 2 3 4 Finite State Automata Implementasi FSA Deterministic Finite Automata (DFA) Non-deterministic Finite Automata (NFA) Finite
Lebih terperinciLINEAR PROGRAMMING-1
/5/ LINEAR PROGRAMMING- DR.MOHAMMAD ABDUL MUKHYI, SE., MM METODE KUANTITATIF Perumusan PL Ada tiga unsur dasar dari PL, ialah:. Fungsi Tujuan. Fungsi Pembatas (set ketidak samaan/pembatas strukturis) 3.
Lebih terperinciMelakukan Operasi Logika
Melakukan Operasi Logika Hampir semua statemen C++ adalah ekspresi. Operator C++ selain +, -, /, * yakni operator logika. Pada dasarnya orang2 menghitung menggunakan operasi AND dan OR Mengapa Menggunakan
Lebih terperinciDIMENSI PARTISI PADA GRAF ANTIPRISMA, GRAF MONGOLIAN TENT, DAN GRAF STACKED BOOK
DIMENSI PARTISI PADA GRAF ANTIPRISMA, GRAF MONGOLIAN TENT, DAN GRAF STACKED BOOK oleh TIA APRILIANI M0112086 SKRIPSI ditulis dan diajukan untuk memenuhi sebagian persyaratan memperoleh gelar Sarjana Sains
Lebih terperinciSimulation. Prepared by Akhid Yulianto, SE, MSC (Log) Based on Anderson, Sweeney, and Williams Thomson ΤΜ /South-Western Slide
Simulation Prepared by Akhid Yulianto, SE, MSC (Log) Based on Anderson, Sweeney, and Williams 1 Simulation Kebaikan dan kelemahan menggunakan simulation Modeling Random Variables and Pseudo-Random Numbers
Lebih terperinciKEBEBASAN LINEAR GONDRAN-MINOUX DAN REGULARITAS DALAM ALJABAR MAKS-PLUS
KEBEBASAN LINEAR GONDRAN-MINOUX DAN REGULARITAS DALAM ALJABAR MAKS-PLUS oleh ANNISA RAHMAWATI M0112010 SKRIPSI ditulis dan diajukan untuk memenuhi sebagian persyaratan memperoleh gelar Sarjana Sains Matematika
Lebih terperinciPROGRAM PASCASARJANA UNIVERSITAS NEGERI MEDAN 2005
HUBUNGAN SIKAP MAHASISWA TERHADAP MATA KULIAH PENDIDIKAN AGAMA ISLAM DAN KEMANDIRIAN BELAJAR DENGAN HASIL BELAJAR PENDIDIKAN AGAMA ISLAM PADA MAHASISWA UNIVERSITAS SUMATERA UTARA TAHUN AKADEMIK 2004/2005
Lebih terperinciThe r-dynamic Chromatic Number of Special Graph Operations
The r-dynamic Chromatic Number of Special Graph Operations Nindya Laksmita 2, Dafik 1,2, A.I. Kristiana 1,2 1 CGANT- University of Jember 2 Department of Mathematics Education - University of Jember nindyalaksmita@yahoo.com;
Lebih terperinciIntegrity, Professionalism, & Entrepreneurship. Mata Kuliah : Statika & Mekanika Bahan Kode : CIV 102. Garis Pengaruh.
Mata Kuliah : Statika & Mekanika Bahan Kode : CIV 02 SKS : 4 SKS Garis Pengaruh Pertemuan 0& Kemampuan akhir yang diharapkan Mahasiswa dapat menjelaskan konsep garis pengaruh Bahan Kajian (Materi Ajar)
Lebih terperinciStatistik Bisnis 1. Week 9 Discrete Probability Binomial and Poisson Distribution
Statistik Bisnis 1 Week 9 Discrete Probability Binomial and Poisson Distribution Agenda 15 minutes 45 minutes 30 minutes Attendance check Discussion Exercise Learning Objectives In this chapter, you learn:
Lebih terperinciORGANISASI DAN ARSITEKTUR KOMPUTER
1 ORGANISASI DAN ARSITEKTUR KOMPUTER Wisnu Djatmiko TM 2 Daftar Pustaka 2 1. Bab 1 Wisnu Djatmiko Daftar Pustaka 3 2. Bab 2 Wisnu Djatmiko TIK 4 Peserta MK Arsikom dapat menjelaskan definisi CPU Time dengan
Lebih terperinciTEORI BAHASA DAN AUTOMATA
MODUL II TEORI BAHASA DAN AUTOMATA Tujuan : Mahasiswa memahami Finite State Automata (FSA) dan dapat mengeksekusi suatu mesin otomata Materi : FSA dan Implemetasi FSA Deterministic Finite Automata (DFA)
Lebih terperinciPEMANFAATAN TRANSFORMASI WAVELET SEBAGAI EKSTRAKSI CIRI PADA KLASIFIKASI BERTINGKAT SINYAL EKG
PEMANFAATAN TRANSFORMASI WAVELET SEBAGAI EKSTRAKSI CIRI PADA KLASIFIKASI BERTINGKAT SINYAL EKG T 610.28 PUT Abstrak Penelitian ini bertujuan untuk memperlihatkan suatu metoda pengenalan multi pola dari
Lebih terperinci32-bit and 64-bit Windows: Frequently asked questions
32-bit and 64-bit Windows: Frequently asked questions // // Here are answers to some common questions about the 32-bit and 64-bit versions of Windows. Frequently asked questions Collapse all What is the
Lebih terperinciSOAL DAN SOLUSI OLIMPIADE SAINS NASIONAL 2007 SURABAYA OLEH : RONALD WIDJOJO SMAK ST. Louis 1 Surabaya
SOAL DAN SOLUSI OLIMPIADE SAINS NASIONAL 007 SURABAYA OLEH : RONALD WIDJOJO SMAK ST. Louis 1 Surabaya Soal 1. Misalkan ABC segitiga dengan ABC = ACB = 70. Misalkan titik D pada sisi BC sehingga AD garis
Lebih terperinciBAB 4. TEOREMA FERMAT DAN WILSON
BAB 4. TEOREMA FERMAT DAN WILSON 1 Program Studi Pendidikan Matematika Universitas Muhammadiyah, Ponorogo May 25, 2014 Metoda Faktorisasi Fermat (1643) Biasanya pemfaktoran n melalui tester, yaitu faktor
Lebih terperinciPengantar Teknologi Informasi. Komunikasi Data dan Jaringan Komputer
Pengantar Teknologi Informasi Komunikasi Data dan Jaringan Komputer Sistem Komunikasi Data Melibatkan minimal 2 simpul Simpul bisa berupa komputer maupun peralatan lain Simpul berperan sebagai pengirim
Lebih terperinciTUGAS KIMIA UMUM. yang identik dan berbeda untuk unsur yang berbeda
TUGAS KIMIA UMUM Nama : Grandy Anantha Sakti NIM : 21030110141055 http://grandyanantha.wordpress.com/ 1. Which of Dalton s postulates about atoms are inconsistent with later observations? Do these inconsistencies
Lebih terperinciANALISIS CAPAIAN OPTIMASI NILAI SUKU BUNGA BANK SENTRAL INDONESIA: SUATU PENGENALAN METODE BARU DALAM MENGANALISIS 47 VARIABEL EKONOMI UNTU
ANALISIS CAPAIAN OPTIMASI NILAI SUKU BUNGA BANK SENTRAL INDONESIA: SUATU PENGENALAN METODE BARU DALAM MENGANALISIS 47 VARIABEL EKONOMI UNTU READ ONLINE AND DOWNLOAD EBOOK : ANALISIS CAPAIAN OPTIMASI NILAI
Lebih terperinciTujuan (Objektives) Testing adalah proses eksekusi program yang bertujuan untuk menemukan error Sebuah test yang baik adalah yang mempunyai kemungkina
Software Testing Tujuan (Objektives) Testing adalah proses eksekusi program yang bertujuan untuk menemukan error Sebuah test yang baik adalah yang mempunyai kemungkinan besar menemukan error yang sebelumnya
Lebih terperinciPendahuluan. Push Down Atomata. Perbedaan FA dan PDA [7] 4/25/2012 IF-UTAMA 1. Grammar-machine equivalence [3] Latar belakang munculnya konsep PDA
Push Down Automata Pendahuluan Latar belakang munculnya konsep PDA [1 & 3] Terdapat context-free languages yang tidak regular, contoh {0 n 1 n 0=
Lebih terperinciROOTS OF NON LINIER EQUATIONS
ROOTS OF NON LINIER EQUATIONS ROOTS OF NON LINIER EQUATIONS Metode Bagi dua (Bisection Method) Metode Regula Falsi (False Position Method) Metode Grafik Iterasi Titik-Tetap (Fi Point Iteration) Metode
Lebih terperinciTIN205 - Ekonomi Teknik Materi #8 Genap 2015/2016 TIN205 EKONOMI TEKNIK
TIN205 - Ekonomi Teknik Materi #8 TIN205 EKONOMI TEKNIK Definition 2 Synonym: IRR (Internal Rate of Return). Popular measurement on investment worth. Which one represent the correct interpretation of ROR?
Lebih terperinciABSTRAK PERBANDINGAN EFEKTIVITAS PENGGUNAAN ABATE (TEMEFOS) PADA LARVA NYAMUK CULEX DI DALAM DAN DI LUAR RUANGAN
ABSTRAK PERBANDINGAN EFEKTIVITAS PENGGUNAAN ABATE (TEMEFOS) PADA LARVA NYAMUK CULEX DI DALAM DAN DI LUAR RUANGAN Fanny Wiliana, 2006. Pembimbing : Susy Tjahjani, dr., M.Kes Meilinah Hidayat, dr., M.Kes
Lebih terperinciTUJUAN. Memahami Koneksi dan Pemrosesan Basis Data di Java Memahami JDBC Menggunakan MySQL pada program Java
TUJUAN Memahami Koneksi dan Pemrosesan Basis Data di Java Memahami JDBC Menggunakan MySQL pada program Java 2 TODAY S MENU Pengenalan library JDBC Diagram pengaksesan database melalui JDBC Step-by-step
Lebih terperinciIKI 30320: Sistem Cerdas Kuliah 11: Logical Inference & Wumpus Agent
IKI 30320: Sistem Cerdas : Logical Inference & Wumpus Agent Fakultas Ilmu Komputer Universitas Indonesia 24 Oktober 2007 Outline 1 2 3 Knowledge-based Jenis-jenis metode pembuktian Secara umum, ada 2 jenis:
Lebih terperinciSIFAT-SIFAT GRAF SIKEL DENGAN PELABELAN FUZZY
SIFAT-SIFAT GRAF SIKEL DENGAN PELABELAN FUZZY Nurul Umamah 1 dan Lucia Ratnasari 2 1,2 Jurusan Matematika FSM UNDIP Jl. Prof. H. Soedarto, S. H, Tembalang, Semarang. Abstract. Fuzzy labeling is a bijection
Lebih terperinciDAFTAR ISI. LEMBAR PENGESAHAN...ii. ABSTRAK...iii. ABSTRACT...iv. KATA PENGANTAR...v. DAFTAR ISI...viii. DAFTAR TABEL...xiii. DAFTAR BAGAN..
Abstrak Working memory sangat diperlukan dalam pembelajaran bagi mahasiswa Fakultas Psikologi Universitas X, baik teori maupun praktik. Namun, terdapat distraksi dapat menghambat proses recall informasi
Lebih terperinciADLN Perpustakaan Universitas Airlangga
PERBANDINGAN METODE GENERALIZED CROSS VALIDATION DAN GENERALIZED MAXIMUM LIKELIHOOD DALAM REGRESI NONPARAMETRIK SPLINE UNTUK MEMPERKIRAKAN JUMLAH LEUKOSIT PADA TERSANGKA FLU BURUNG DI JAWA TIMUR RINGKASAN
Lebih terperinciE-Commerce. Lesson 2. Nizar Rabbi Radliya PHP : Variable, Constant, Data Type, Operator. 2 SKS Semester 7 UNIKOM
E-Commerce 2 SKS Semester 7 UNIKOM Nizar Rabbi Radliya nizar@email.unikom.ac.id Lesson 2 PHP : Variable, Constant, Data Type, Operator PHP Variables A variable can have a short name (like x and y) or a
Lebih terperinci