Interaksi Manusia Komputer : Definisi

Manusia : fleksibel & mampu beradaptasi, dapat belajar bagaimana bekerja di lingkungan yang baru

Komputer : tidak fleksibel / tidak mampu beradaptasi, input harus dalam format yang jelas & output harus didefinisikan sebelumnya, tidak dapat belajar, dapat di desain ulang

Prinsip-prinsip umum Perancangan UI

User Compatibility

Product Compatibility

Task Compatibility

Work Flow Compatibility

Consistency

Familiarity

Simplicity

Direct Manipulation

Control

WYSIWYG

Flexibility

Responsiveness

Invisible Technology

Robustness

“WIKIPEDIA”:

WYSIWYG (pronounced /ˈwɪziwɪɡ/^[1]), is an acronym for What You See Is What You Get, used in computing to describe a system in which content displayed during editing appears very similar to the final output,^[2] which might be a printed document, web page, slide presentation or even the lighting for a theatrical event.

The phrase was originally a catch phrase popularized by Flip Wilson‘s drag persona “Geraldine” (from Rowan & Martin’s Laugh-In in the late 60s and then on The Flip Wilson Show until 1974), who would often say “What you see is what you get” to excuse her quirky behavior.

Analisis penggunaan UI:

1.User Compability,sudah ada,,jika user orang buta medianya yaitu sound dan alat bantu ketikan(huruf braille).

2.control:ada alat pengontrolnya, misal jika orang buta mengKlik menu home maka akan ada Sound yng berbunyi “Menu HOME”

3. WYSIWYG:adanya informasi..misal user menginput

kalimat maka sound akan berbunyi seperti apa yang di inputkan

4.Task Compability:sudah ada,diaplikasi website terdapat halaman depan seprti:Katalog,Daftar,materi

5.Work flow compability:ada, yaitu adanya menu sign up yang terdapat menu Home,profil..dan terdapat juga sign out.

6.consitensi:menu2nya udah menarik dan jika orang buta suara soundnya udah bagus.

7.simplicity:aplikasi ini dibuat mudah dipahami dalam membaca.

8.Roubsteness:ketika salah menginput sytem tidak berjalan..misal orang buta disuruh untuk menulis,sound akan memberikan ejaan dan user/org buta tersebut disuruh untuk memasukkan kalimat dari sound tersebut,jika salah sound akan mengulang ejaan tersebut.

9.Protection:aplikasi ini udah ada proteksinya ketika user menginput login dan jika salah maka aplikasi akan menolak.

Intel Core

The Core brand refers to Intel‘s 32-bit mobile dual-core x86 CPUs that derived from the Pentium M branded processors. The processor family used a more advanced version of the Intel P6 microarchitecture. It emerged in parallel with the NetBurst (Intel P68) microarchitecture of the Pentium 4 brand, and was a precursor of the 64-bit Core microarchitecture of Core 2 branded CPUs. The Core brand comprised two branches: the Duo (dual-core) and Solo (Duo with one disabled core, which replaced the Pentium M brand of single-core mobile processor).

The Core brand was launched on January 5, 2006 by the release of the 32-bit Yonah CPU – Intel’s first dual-core mobile (low-power) processor. Its dual-core layout closely resembled two interconnected Pentium M branded CPUs packaged as a single die (piece) silicon chip (IC). Hence, the 32-bit microarchitecture of Core branded CPUs – contrary to its name – had more in common with Pentium M branded CPUs than with the subsequent 64-bit Core microarchitecture of Core 2 branded CPUs. Despite a major rebranding effort by Intel starting January 2006, some computers with the Yonah core continued to be marked as Pentium M.

The Core Duo is also famous for being the first Intel processor to ever be used in Apple Macintosh computers. Core Duo signified the beginning of Apple’s shift to Intel processors across their entire line.

In 2007, Intel began branding the Yonah core CPUs intended for mainstream mobile computers as Pentium Dual-Core. These are not to be confused with the desktop 64-bit Core microarchitecture CPUs also branded as Pentium Dual-Core.

September 2006 and January 4, 2008 mark a discontinuation of many Core branded CPUs

The Bellman–Ford algorithm, a label correcting algorithm^[1], computes single-source shortest paths in a weighted digraph (where some of the edge weights may be negative). Dijkstra’s algorithm solves the same problem with a lower running time, but requires edge weights to be non-negative. Thus, Bellman–Ford is usually used only when there are negative edge weights. The algorithm was developed by Richard Bellman and Lester Ford, Jr..

According to Robert Sedgewick, “Negative weights are not merely a mathematical curiosity; [...] [they] arise in a natural way when we reduce other problems to shortest-paths problems”^[2], and he gives the specific example of a reduction from the NP-complete Hamilton path problem to the shortest paths problem with general weights. If a graph contains a cycle of total negative weight then arbitrarily low weights are achievable and so there’s no solution; Bellman-Ford detects this case.

If the graph does contain a cycle of negative weights, Bellman-Ford can only detect this; Bellman-Ford cannot find the shortest path that does not repeat any vertex in such a graph. This problem is at least as hard as the NP-complete longest path problem.

“Floyd’s algorithm” redirects here. For cycle detection, see Floyd’s cycle-finding algorithm

In computer science, the Floyd–Warshall algorithm (sometimes known as the WFI Algorithm or Roy–Floyd algorithm, since Bernard Roy described this algorithm in 1959) is a graph analysis algorithm for finding shortest paths in a weighted, directed graph. A single execution of the algorithm will find the shortest paths between all pairs of vertices. The Floyd–Warshall algorithm is an example of dynamic programming.