• 沒有找到結果。

NTU Peers

N/A
N/A
Protected

Academic year: 2022

Share "NTU Peers"

Copied!
14
0
0

加載中.... (立即查看全文)

全文

(1)

NTU Peers

Members:

Yanina . Calvin . Lisa . Kevin

(2)

Overview

Team mission

Selected Interface & Rationale Low-fi prototype structure

3 tasks w/ low-fi

Experimental method Experimental results Suggested UI changes Summary of talk

(3)

Team mission

Help NTU students to deal with all the difficulties in college life.







(4)

Selected Interface

https://goo.gl/ZBp3WM More intuitive

Less complexity

(5)
(6)

3 Tasks w/ low-fi

Receive help in studying








(7)

3 Tasks w/ low-fi

International communication








(8)

3 Tasks w/ low-fi

Finding someone who is able to help and support








(9)

Experimental Method

Paper Prototype POP APP

https://goo.gl/ZBp3WM







(10)

Experimental Result

(11)

Feedback 1

Forum: Prototype 1 is better.

Psychologist: Available online is better.

Map is kind of useless.

The structure is clear.


(12)

Feedback 2

Forum: Prototype 1 is more clear.

My angel will be better with image.

Main menu is clear.






(13)

Feedback 3

Forum: Prototype 2 is beautiful but complex.

Message can be combined into angel.

Too many functions: a little bit chaotic Icons in My Angel is intuitive and cool.


(14)

Summary of Talk

Can combine some functions together.

Map seems not much related to our tasks.

Some icons are clear and intuitive to use.

參考文獻

相關文件

Remark: All the sequences are sequence of real numbers.. Formula that might be useful: Let θ

Too good security is trumping deployment Practical security isn’ t glamorous... USENIX Security

We also think that Naïve Bayes is good method to filt spam when traing set is small, and because the word ap- pearing in ham isn’t too many, we can compute probabili- ties of words

Why nuclear power isn't a good way to make power.. Students in my school spend too much time

Prove that H p is closed under usual addition and scalar multiplication of functions.. the one given in Exercise 10 in Rudin, is a

[r]

The idea of the above proof can be applied to the proof of Stoke’s Theorem for general cases... One can show that the Stoke’s theorem holds for any k-form and for any k-chains on R

Here is