Pandu Rizky's Blog

Wednesday, April 28, 2021

Pandu_IT Solution Forum 1

BIG DATA & DATA SCIENCE UNTUK KEMAJUAN ASTRONOMI DAN PENATAPAN KALENDER ISLAM

Big Data adalah limpahan data berukuran sangat besar, kompleks, dan melebihi proses daya tampung dari konvensi sistem database yang ada yang mana tidak bisa diproses menggunakan perangkat pengelola biasa.

Data science adalah studi tentang data mentah dan unstructured data yang diolah melalui keterampilan analitis, programming dan bisnis.bidang ini menggunakan metode, proses, alogoritma, dan sistem ilmiah untuk menghasilkan wawasan pola dan trend.

Berbagai project astronomi yang banyak dilakukan adalah monitoring benda kecil disana, dark energy bekerja, pemantauan  transient sky, pemetaan galaxy dll, project tersebut membutuhkan data yang yang cukup banyak dalam berbagai survey yang dilakukan dalam astronomi pertumbuhan data yang terjadi bermaam-macam. Dibutuhkan insfrastruktur yang cukup besar dan memadai dalam melakukan memproses data-data tersebut sehingga dapat dilakukan analisis.

Arsitektur Big Data Drone Emprit

Drone emprit menyimpan dan memproses data besar lebih efektif dan murah jika menggunakan server sendiri (dedicated, bare metal) dibandingkan menggunakan cloud computing.

Media kerenls architecture diagram





 

 

Contoh Project LOFAR (Low Frequency Array)

Contoh Project LOFAR di Belanda membutuhkan high performance computing dengan server IBM blue gene yang disimpan di Universitas Gronigen, Belanda.


Narasumber ke 2 Prof. Dr. Tono Saknoso

Akurasi Penentu Waktu Fajar

saat ini waktu-waktu shalat lebih banyak ditentukan berdasarkan jam, perlu diketahui kriteria astronomisnya yang menjelaskan fenomena fajar dalam dalil syar’i tersebut.








Fajar astronomi muncul cahaya kemerah-merahan diarah timur secara horizontal. Galaksi Bima Sakti di atas kepala masih terlihat dan kita belum bisa mengenali orang di sekitar kita. ditandai dengan meredupnya bintang-bintang di ufuk timur karena mulai munculnya cahaya akibat hamburan cahaya matahari oleh atmosfer. Itulah awal waktu shubuh.















Sumber : https://bpti.uhamka.ac.id/kegiatan/webinar-it-solutions-forum

at April 28, 2021 No comments:
Email ThisBlogThis!Share to XShare to FacebookShare to Pinterest

2003015198_Pandu Rizky Wicaksana_Jawaban Sistem Digital Gelombang TI 2F


 

 
 
 
Sumber : https://onlinelearning.uhamka.ac.id/

 

at April 28, 2021 No comments:
Email ThisBlogThis!Share to XShare to FacebookShare to Pinterest

Wednesday, April 21, 2021

Contoh Penerapan Fuzzy Logic

PENERAPAN FUZZY LOGIC


1. FUZZY LOGIC

Fuzzy Logic adalah metodologi "berhitung"dengan variabel kata-kata (linguistic variabel),sebagai pengganti berhitung dengan bilangan.

Ada beberapa Alasan mengapa menggunakan fuzzy logic yaitu :

1.konsep fuzzy logic mudah dimengerti.

2.fuzzy logic sangat fleksibel.

3.fuzzy logic memiliki toleransi terhadap ketidakpresisian data.

4.pemodelan/pemetaan untuk mencari hubungan data input output dari sembarang sistem black box bisa dilakukan memakai sistem fuzzy.

5.pengetahuan dan pengalaman para pakar dapat dengan mudah dipakai untuk membangun fuzzy logic.

6.fuzzy logic dapat diterapkan dalam desain sistem control tanpa harus menghilangkan teknik desain sistem kontrol konvensional yang sudah terlebbih dahulu ada.

7.fuzzy logic berdasar pada bahasa manusia.

Ada Bebebrapa hal yang perlu diketahui dalam memahami sistem fuzzy,yaitu:

1.Variabel fuzzy

2.Himpunan Fuzzy

3.Semesta Pembicaraan

4.Domain

5.Fungsi keanggotaan


2. Metode Mamdani

metode ini sering dikenal sebagai metode max-min untuk mendapatkan output yang diperlukan ada 4 tahapan yaitu:

1.Pembetukan himpunan fuzzy

2.Aplikasi fungsi implikasi

3.Komposisi aturan

4.Penegasan(Defuzzyfikasi)


3. Kerangka Konsep

pada penelitian ini untuk menentukan kinerja dosen berdasarkan 4 kriteria yaitu;

1.Kompetensi Pedagogik

2.Kompetensi Profesional

3.Kompetensi Kepribadian 

4.Kompetensi Sosial 

dan ada 25 sub kriteria fuzzy bisa dilihat didalam laman web  https://journal.uhamka.ac.id/index.php/rektek/article/view/1322 

nantinya setiap variabel dibagi menjadi 3 himpunan fuzzy yaitu :

Kurang 

Cukup

Baik

Himpunan fuzzy kurang akan meiliki domain[0.3],dimana derajat keanggotaan KURANG tertinggi (=1) terletak pada angka 0-2.Himpunan fuzzy  Cukup Memiliki domain [2.5,3.5]dimana derajat keanggotaan Cukup tertinggi (=1)terletak pada nilai 3.Himpunan Fuzzy Baik akan memiliki domain [3.5] dimana derajat keanggotaanya BAIK tertinggi(=1)terletak pada angka >4.


4. Proses Mamdani

A.Fuzzyfikasi

    fungsi derajat keanggotaan yang digunakan adlah fungsi linier turun,fungsi segitiga dan fungsi linier naik


Fungsi Linier Naik

Fungsi Linier Turun 

Fungsi Segitiga 



Dari hasil kuisioner sebanyak 32 responden yang sudah di inputkan pada prototipe sistem keputusan penilaian kinerja dosen fisip mamdani dengan tool matlan R2010a,maka didapat nilai inputan score rata-rata untuk 4 kriteria  penentuan kinerja dosen sebagai berikut:

Kompetensi pendagogik = 3.348

Kompetensi Profesional=3.476

Kompetensi Kepribadian=3.322

Kompetensi Sosial          =3.344

Berikut adalah menentukan fungsi derajat keanggotaan dari nilai masing-masing variabel tersebut sebagai input:



sumber : https://onlinelearning.uhamka.ac.id/

at April 21, 2021 No comments:
Email ThisBlogThis!Share to XShare to FacebookShare to Pinterest

Tugas 5 Rangkuman Teorema De Morgan's

TEOREMA DE MORGAN'S
 

Teorema 

komplemen 2 atau lebih variabel-variabel gerbang AND sama dengan komplemen variabel khusus gerbang OR.


komplemen 2 atau lebih variabel gerbang OR sama dengan komplemen variabel khusus gerbang AND



Kesetaraan gerbang dan hubungan tabel kebenaran yang digambarkan oleh Teorema DeMorgan










TABEL KEBENARAN



Penyederhanaan menggunakan Aljabar Boolean 

Exercise :

1.X=????
2.simplify the boolean expression found in 1

X=(A + B)BC= A + B + BC = A + B+ B+C=A+B+C

sumber : https://onlinelearning.uhamka.ac.id/
at April 21, 2021 No comments:
Email ThisBlogThis!Share to XShare to FacebookShare to Pinterest

Wednesday, April 14, 2021

Tugas 4 Rangkuman Materi Aljabar Boolean

LAWS & RULES OF BOOLEAN ALGEBRA 





Communitative law of addition

A + B = B+A

The order of or does not matter 


Communitative law of multiplication 

AB = BA 

Associative law of addition 

 A + (B + C) = (A + B) + C

The grouping ORed variabels does not matter 



Associative law of multiplication 

A(BC) = (AB)C

The grouping ANDed variabels does not matter 


DISTRIBUTIVE LAW 

A(B+C) = AB + AC

(A+B)(C+B) = AC + AD + BC + BD


Boolean Rules 

A + 0 =A

*in math if you adda 0 you have changed nothing 
*in boolean algebra ORing tih 0 changes nothing




A + 1 =1

*ORing with 1 must give a 1 since if any input is 1 an OR gate will give a 1




A . 0  = 0

*in math if 0 is multiplied with anything you get 0. if you AND anything with 0 you get 0




A . 1 =1

*ANDing wnything with 1 will yield the anything



A + A = A

*ORing with itself will give the same result 




A . A = A

*ANDing with itself will give the same result



A . A = 0
*in digital logic 1 = 0 and 0 =1 AA=0 since one of the inputs must be 0 
 
 
A = A
*If you not something twice you are back to the beginning 
 
 
A + AB = A

proof :

A + AB  = A(1+B)  DISTRIBUTIVE LAW 
              = A.1         RULE 2 : (1+B)=1
              = A            RULE 4: A.1=A


11. A + AB = A+B

if A is 1 the outputs is 1 ,If A is 0 the output is B 

proof:
A + AB = (A + AB ) + AB              RULE 10
             = (AA + AB ) + AB            RULE 7
             = AA + AB + AA + AB      RULE 8
             = (A+ A)(A+B)                    FACTORING
             = 1(A+B)                             RULE 6
               =A+ B                                RULE 4
(A + B)(A + C ) = A + BC 











sumber : https://onlinelearning.uhamka.ac.id/
at April 14, 2021 No comments:
Email ThisBlogThis!Share to XShare to FacebookShare to Pinterest

Wednesday, April 7, 2021

Tugas 3 Rangkuman Gerbang Logika dan Aljabar Boolean

Gerbang Logika dan Aljabar Boolean

*Sekarang kita telah mengetahui konsep bilangan biner, dan kita akan mempelajari cara menggambarkan bagaimana sistem menggunakan menggunakan level logika biner dalam membuat keputusan. 

* Aljabar Boolean adalah alat yang penting dalam menggambarkan, menganalisa, merancang, dan mengimplementasikan rangkaian digital.


Konstanta Boolean dan Variabel.

Aljabar Boolean dibawah ini hanya mempunyai dua nilai : 0 dan 1.

  Logika 0 dapat dikatakan : false, off, low, no, saklar terbuka.

  Logika 1 dapat dikatakan: true, on, high, yes, saklar tertutup. 

 Tiga operasi logika dasar: OR, AND, dan NOT.


Tabel Kebenaran

 Sebuah tabel kebenaran menggambarkan hubungan antara input dan ouput sebuah rangkaian logika.

 Jumlah The number of entries corresponds to the number of inputs. For example a 2 input table would have 2 2 = 4 entries. A 3 input table would have 2 3 = 8 entries.

 Contoh tabel kebenaran dengan masukan 2, 3 dan 4 buah.




Operasional OR dengan gerbang OR

Ÿ  The Boolean expression for the OR operation is

         X = A + B

      Ÿ  This is read as “x equals A or B.”

      Ÿ  X = 1 when A = 1 or B = 1.

Ÿ  Truth table and circuit symbol for a two input OR  gate:

OR Operation With OR Gates

Ÿ  The OR operation is similar to addition but  when A = 1 and B = 1, the OR operation  produces 1 + 1 = 1.

Ÿ  In the Boolean expression

         x=1+1+1=1

We could say in English that x is true (1) when A is true

(1)    OR B is true (1) OR C is true (1).

Ÿ  There are many examples of applications  where an output function is desired when  one of multiple inputs is activated.

AND Operations with AND gates

Ÿ  The Boolean expression for the AND operation is

          X = A • B

      Ÿ  This is read as “x equals A and B.”

      Ÿ  x = 1 when A = 1 and B = 1.

Truth table and circuit symbol for a two input AND gate are  shown. Notice the difference between OR and AND gates

Ÿ  The AND operation is similar to multiplication.

Ÿ  In the Boolean expression

          X = A • B • C

          X  = 1 only when A = 1, B = 1, and C = 1.


NOT Operation

Ÿ  The Boolean expression for the NOT  operation is

                           X = A

Ÿ  This is read as:

Ÿ  x equals NOT A, or

Ÿ  x equals the inverse of A, or

Ÿ  x equals the complement of A

Ÿ  Truth table, symbol, and sample waveform  for the NOT circuit.

Describing Logic Circuits  Algebraically

Ÿ  The three basic Boolean operations (OR,  AND, NOT) can describe any logic circuit.

Ÿ  If an expression contains both AND and OR  gates the AND operation will be performed  first, unless there is a parenthesis in the  expression.

Ÿ  Examples of Boolean expressions for logic  circuits:





Ÿ  The output of an inverter is equivalent to the  input with a bar over it.    Input A through an  inverter equals A.

Ÿ  Examples using inverters.


Evaluating Logic Circuit Outputs

Ÿ  Rules for evaluating a Boolean expression:

Ÿ  Perform all inversions of single terms.

Ÿ  Perform all operations within parenthesis.

Ÿ  Perform AND operation before an OR operation  unless parenthesis indicate otherwise.

Ÿ  If an expression has a bar over it, perform the  operations inside the expression and then invert  the result.

Ÿ  Evaluate Boolean expressions by substituting  values and performing the indicated  operations:

A = 0, B = 1, C = 1, and D = 1  x = ABC(A + D)

= 0 ×1×1× (0 +1)

= 1×1×1× (0 +1)

= 1×1×1× (1)

= 1×1×1× 0

= 0

Ÿ  Output logic levels can be determined directly  from a circuit diagram.

Ÿ  The output of each gate is noted until a final  output is found.


Implementing Circuits From  Boolean Expressions

Ÿ  It is important to be able to draw a logic circuit from a  Boolean expression.

Ÿ  The expression

                   x = A ×B×C

could be drawn as a three input AND gate.

Ÿ  A more complex example such as

                y = AC + BC + ABC

could be drawn as two 2-input AND gates and one 3-input  AND gate feeding into a 3-input OR gate. Two of the AND  gates have inverted inputs.


NOR Gates and NAND Gates

Ÿ  Combine basic AND, OR, and NOT  operations.

Ÿ  The NOR gate is an inverted OR gate.     An  inversion “bubble” is placed at the output  of the OR gate.

The Boolean expression is,

Ÿ  The NAND gate is an inverted AND gate.  An inversion “bubble” is placed at the  output of the AND gate.

Ÿ  The Boolean expression is

        x = AB

Ÿ  The output of NAND and NOR gates may be  found by simply determining the output of an  AND or OR gate and inverting it.

Ÿ  The truth tables for NOR and NAND gates  show the complement of truth tables for OR  and AND gates.

Universality of NAND and NOR Gates

Ÿ  NAND or NOR gates can be used to create  the three basic logic expressions (OR, AND,  and INVERT)

Ÿ  This characteristic provides flexibility and is  very useful in logic circuit design.



IEEE/ANSI Standard Logic  Symbols

Ÿ  Compare the  IEEE/ANSI symbols  to traditional symbols.

Ÿ  These symbols are  not widely accepted  but may appear in  some schematics.




Application





Summary of Methods to Describe Logic Circuits

Ÿ  The three basic logic functions are AND, OR,  and NOT.

Ÿ  Logic functions allow us to represent a  decision process.

Ÿ  If it is raining OR it looks like rain I will take an  umbrella.

Ÿ  If I get paid AND I go to the bank I will have  money to spend.

 

sumber : https://onlinelearning.uhamka.ac.id

at April 07, 2021 No comments:
Email ThisBlogThis!Share to XShare to FacebookShare to Pinterest

Wednesday, March 31, 2021

Tugas 2 Rangkuman Materi Sistem Bilangan

Sistem – Sistem Bilangan, Operasi dan kode 


Tujuan Topik Bahasan

  • Mengulas kembali sistem bilangan desimal.
  • Menghitung dalam bentuk bilangan biner.
  • Memindahkan dari bentuk bilangan desimal ke biner dan dalam biner ke dalam desimal.
  • Penggunaan operasi aritmatika pada bilangan biner.
  • Menentukan komplemen 1 dan 2 dari sebuah bilangan biner. 
  • Dan lain – lainnya……..

Sistem Bilangan

Sistem Biner dan Kode – kode digital merupakan dasar untuk komputer dan elektronika digital secara umum. Sistem bilangan biner seperti desimal, hexadesimal dan oktal juga dibahas pada bagian ini. Operasi aritmatika dengan bilangan biner akan dibahas untuk memberikan dasar pengertian bagaimana komputer dan jenis – jenis perangkat digital lain bekerja. 

Bilangan Desimal 

    Dalam setiap bilangan desimal terdiri dari 10 digit, 0 sampai dengan 9 

    Contoh:

  • Ungkapkan bilangan desimal 2745.214 sebagai penjumlahan nilai setiap digit.


Bilangan Biner
  • Sistem Bilangan biner merupakan cara lain untuk melambangkan kuantitas, dimana 1 (HIGH) dan 0 (LOW). 
  • Sistem bilangan biner mempunyai nilai basis 2 dengan nilai setiap posisi dibagi dengan faktor 2:

Contoh :

Konversikan seluruh bilangan biner 1101101 ke desimal





Aplikasi Digital

Ilustrasi sebuah penggunaan hitungan biner sederhana.

Konversi Desimal ke Biner

  • Metode Sum-of-Weight.


  • Pengulangan pembagian dengan Metode bilangan 2 (Repeated Division by 2 Method)
    • A systematic method of converting whole numbers from decimal to binary is the repeated division-by-2 process.  

  • Konversi fraksi desimal ke biner.


Binary Arithmetic

  • Binary arithmetic is essential in all digital computers and in many other types of digital systems.
  • Addition,Subtraction, Multiplication, and Division 


Binary Addition

The four basic rules for adding binary digits (bits) are as follows:
0 + 0 = 0 sum of 0 with a carry of 0
0 + 1 = 1 sum of 1 with a carry 0f 0
1 + 0 = 1 sum of 1 with a carry of 0
1+ 1 = 10 sum of 0 with a carry 0f 1


Binary Subtraction

The four basic rules for subtracting bits are as follows:
0 – 0 = 0
1 – 1 = 0
1 – 0 = 1
10 – 1 = 1 0 – 1 with a borrow of 1


Binary Multiplication

The four basic rules for multiplying bits are as follows:
0 X 0 = 0
0 X 1 = 0
1 X 0 = 0
1 X 1 = 1


Binary Division

Division in binary follows the same procedure as division in decimal.


1’s and 2’s Complements of Binary Numbers

  • The 1’s and 2’s Complements of Binary Numbers are very important because they permit the representation of negative numbers. 
  • The method of 2’s compliment arithmetic is commonly used in computers to handle negative numbers

Finding the 1’s Complement

The 1’s complement of a binary number is found by changing all 1s to 0s and all 0s to 1s.

Example:
1 0 1 1 0 0 1 0 (Binary Number)
0 1 0 0 1 1 0 1 (1’s Complement)


Finding the 2’s Complement

The 2’s complement of a binary number is found by adding 1 to the LSB of the 1’s complement
 


Alternative Method to find 2’s Complement

  • Start at the right with the LSB and write the bits as they are up and including the first 1
  • Take the 1’s complements of the remaining bits 

Signed Numbers

Digital systems, such as the computer, must be able to handle both positive and negative numbers. A signed binary number consists of both sign and magnitude information. The sign indicates whether a number is positive or negative and the magnitude is the value of the number. There three forms in which signed integer (whole) numbers can be represented in binary:
⦁ Sign-Magnitude
⦁ 1’s Complement
⦁ 2’s Complement

The Sign Bit

The left-most bit in a signed binary number is the sign bit, which tells you whether the number is positive or negative.


Sign-Magnitude Form

When a signed binary number is represented in sign-magnitude, the left-most bit is the sign bit and the remaining bits are the magnitude bits. The magnitude bits are in true (uncomplemented) binary for both positive and negative numbers.



1’s Complement Form

Positive numbers in 1’s complement form are represented the same way as the positive sign-magnitude numbers. Negative numbers, however, are the 1’s complements of the corresponding positive numbers. Example: The decimal number -25 is expressed as the 1’s complement of +25 (00011001) as (11100110)

2’s Complement Form

In the 2’s complement form, a negative number is the 2’s complement of the corresponding positive number


The Decimal Value of Signed Numbers

Sign-Magnitude:

Decimal Value of positive and negative numbers in the sign-magnitude form are determined by summing the weights in all the magnitude bit positions where there are 1s and ignoring those positions where there are zeros. 
    

1’s Complement:

Decimal values of negative numbers are determined by assigning a negative value to the weight of the sign bit, summing all the weight where there are 1s and adding 1 to the result


2’s Complement:

The weight of the sign bit in a negative number is given a negative value


Arithmetic Operations with Signed Number

In this section we will learn how signed numbers are added, subtracted, multiplied and divided. This section will cover only on the 2’s complement arithmetic, because, it widely used in computers and microprocessor-based system .

Addition



Subtraction

Multiplication


Division

The division operation in computers is accomplished using subtraction. Since subtraction is done with an adder, division can also be accomplished with an adder. The result of a division is called the quotient.
Step 1: 
Determine the SIGN BIT for both DIVIDEND and DIVISOR

Step 2: 
Subtract the DIVISOR from the DIVIDEND using 2’s Complement addition to get the first partial remainder and ADD 1 to quotient. If ZERO or NEGATIVE the division is complete.

Step 3: 
Subtract the divisor from the partial remainder and ADD 1 to the quotient.  If the result is POSITIVE repeat Step 2 or If ZERO or NEGATIVE the division is complete. 

Hexadecimal Numbers

  • Most digital systems deal with groups of bits in even powers of 2 such as 8, 16, 32, and 64 bits.
  • Hexadecimal uses groups of 4 bits.
  • Base 16
    • 16 possible symbols
    • 0-9 and A-F
  • Allows for convenient handling of long binary strings.

  • Convert from hex to decimal by multiplying each hex digit by its positional weight.
    • Example:
  • Convert from decimal to hex by using the repeated division method used for decimal to binary and decimal to octal conversion.
  • Divide the decimal number by 16
  • The first remainder is the LSB and the last is the MSB.
    • Note, when done on a calculator a decimal remainder can be multiplied by 16 to get the result.  If the remainder is greater than 9, the letters A through F are used.

  •     Example of hex to binary conversion:
  • Hexadecimal is useful for representing long strings of bits.
  • Understanding the conversion process and memorizing the 4 bit patterns for each hexadecimal digit will prove valuable later.

Binary Code Decimal (BCD)

  • Binary Coded Decimal (BCD) is another way to present decimal numbers in binary form.
  • BCD is widely used and combines features of both decimal and binary systems.
  • Each digit is converted to a binary equivalent.
  • To convert the number 87410 to BCD:
  • Each decimal digit is represented using 4 bits.
  • Each 4-bit group can never be greater than 9.
  • Reverse the process to convert BCD to decimal.

  • BCD is not a number system.
  • BCD is a decimal number with each digit encoded to its binary equivalent.
  • A BCD number is not the same as a straight binary number.
  • The primary advantage of BCD is the relative ease of converting to and from decimal.

Alphanumeric Codes

  • Represents characters and functions found on a computer keyboard.
  • ASCII – American Standard Code for Information Interchange.
    • Seven bit code: 27 = 128 possible code groups
    • Table 2-4 lists the standard ASCII codes
    • Examples of use are:  to transfer information between computers, between computers and printers, and for internal storage.
 sumber : https://onlinelearning.uhamka.ac.id/
at March 31, 2021 No comments:
Email ThisBlogThis!Share to XShare to FacebookShare to Pinterest
Newer Posts Older Posts Home
Subscribe to: Posts (Atom)

Fasilitas Online Learning UHAMKA Mempermudah Mahasiswa Belajar Virtual

Online Learning UHAMKA (OLU) adalah sebuah terobosan yang krusial demi memenuhi kebutuhan mahasiswa UHAMKA dalam menuntut ilmu tanpa harus ...

  • Tugas 2 Rangkuman Materi Sistem Bilangan
    Sistem – Sistem Bilangan, Operasi dan kode  Tujuan Topik Bahasan Mengulas kembali sistem bilangan desimal. Menghitung dalam bentuk bilangan ...
  • Latches, Flip-Flop and Timer
    Latches Definition : The output of a latch depends on its current inputs and on its previous output and its change of state can happen at an...
  • Rangkaian Register
    Register adalah rangkaian logika yang digunakan untuk menyimpan data. Dengan kata lain, register adalah rangkaian yang tersusun dari satu at...

Search This Blog

  • Home

About Me

Pandu Rizky Wicaksana
View my complete profile

Report Abuse

Blog Archive

  • July 2021 (1)
  • June 2021 (8)
  • May 2021 (1)
  • April 2021 (6)
  • March 2021 (2)
Simple theme. Powered by Blogger.