1. 程式人生 > >Hey Alexa, Can You Enhance Education?

Hey Alexa, Can You Enhance Education?

A guest post by Daniel Shuart, University of Oklahoma

At the University of Oklahoma, we asked ourselves: Can Amazon Alexa help engage college students and enhance their educational experience? How will students utilize voice technology as they graduate and move into their careers?

Within the University of Oklahoma IT department, we aim to affect the student experience on campus in more ways than just delivering technology. We have found that the more a student is engaged on campus, the more likely they are to graduate. Technology innovation, like Alexa, will play a major role in that mission.

To help us inspire our students and enhance their experience on campus, we reached out to Amazon’s Alexa team and discussed the types of Alexa Skills that would be most beneficial to the students. In addition to relying on the Alexa team, we went straight to the source – the students. Since part of our mission is to not only provide students with cutting-edge technology, but also to teach them how to use the technology, we wanted students to help us develop the skills.

Becoming one of the first universities to venture into Alexa Skill development directly with our students, we held a student hackathon. Over 100 students expressed interest in the hackathon, and 55 students showed up to get support from Amazon Alexa experts, who provided hands-on support and training.

The four winning teams created skills focused on enhancing the student experience on campus:

  • yOU Travel: The skill aggregates all transportation methods on campus to make it easier for students to commute across the university.
  • VITA: The skill helps students learn more about the campus and even where to find free food.
  • EatQuick: The skill finds the closest food providers along with restaurant reviews and delivery times.
  • SoonerGuide: The skill helps new students navigate their way around campus.

Using the Alexa Skills Kit, the students were able to build in a matter of weeks with little prior knowledge of the Alexa environment. They felt the challenge was creating the right kind of customer experience for their particular skill.

It’s interesting to note that, given broad guidelines on what to develop, the students focused on their physical experience on campus and not on their academic experience. Students felt that they had the academic part handled; it’s the smaller day-to-day tasks that cause them the most irritation and delays. These include things like getting around campus, finding out about events that are important to them, and access to food – things that affect their overall educational experience. That’s why they developed these kinds of skills and why we started by putting Alexa in the residence halls. Their dorm room is the most common starting point for a student in their daily life. The second most common location is in the classroom, which is what we are working on now.

The hackathon was only the beginning of our journey to bring voice technology to our campus. With each event, our mission grew – the Governor’s office got involved, the Amazon Alexa Roadshow visited our campus, and we attended the AWS Institute’s Voice and Text Computing roundtable at AWS re:Invent to share with other universities how we brought AI to OU to improve student access to information.

After introducing Alexa to OU, the students are all-in when it comes to using voice-enabled technology. Technology-minded students want to learn how to develop Alexa skills and believe it is a marketable skill as they look to their future after OU. While the students spend their days as full-time “Sooners,” they feel that Alexa can significantly enhance their campus experience.

相關推薦

Hey Alexa, Can You Enhance Education?

A guest post by Daniel Shuart, University of Oklahoma At the University of Oklahoma, we asked ourselves: Can Amazon Alexa help en

Hey Siri, Can You Make Me Think?

Everything started from a conversation with a friend who one day during lunch told me "How stupid and limited Siri is. I ask her a question, and she gave m

Future Tense Newsletter: When Alexa Can't Hear You

While voice-enabled assistants like Siri and Alexa have made the lives of millions of Americans a little easier, the software systems they run on are not g

HDU 2141 Can you find it?(二分)

clas i++ clu div cpp style [] href ++ 題目鏈接:clicl here~~ 【題目大意】: Give you three sequences of numbers A, B, C, then we give you a number

HDOJ1796 How many integers can you find(dfs+容斥)

article nor man small 接下來 long long line cas example How many integers can you find Time Limit: 12000/5000 MS (Java/Others) Memory

HDU 4027 Can you answer these queries?(線段樹區間開方)

sizeof sqrt .cn swap %d nes nts following clr Can you answer these queries? Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 6576

[容斥原理] hdu 1796 How many integers can you find

pos lcm 一個 每一個 fin memset 而不是 std != 題意: 給一個N。然後給M個數,問1~N-1裏面有多少個數能被這M個數中一個或多個數整除。 思路: 首先要N-- 然後對於每一個數M 事實上1~N-1內能被其整除的 就是有(N-1)/

HDU 1796 How many integers can you find (容斥)

ace return algo 整除 ctype hdu scanf ++ main 題意:給定一個數 n,和一個集合 m,問你小於的 n的所有正數能整除 m的任意一個的數目。 析:簡單容斥,就是 1 個數的倍數 - 2個數的最小公倍數 + 3個數的最小公倍數 + ...(

HDU - 2141 : Can you find it?

sizeof sin case uniq utf first ted 整數 代碼 Give you three sequences of numbers A, B, C, then we give you a number X. Now you need to calcul

HDU 2141 can you find it 二分

cnblogs algorithm main 依次 樸素 合數 ret void style 1.題意:給出三組數,給出一個數X,試問是否能從三個數組中各選一個數,A,B,C使得X=A+B+C 2.分析:題設的輸入數據為先是依次給出三組數的長度L、N、M,下面三行給出三組數

HDU 4027 Can you answer these queries?

date 全部 swe shanghai man nts less mina query 題目鏈接:http://acm.hdu.edu.cn/showproblem.php?pid=4027 解題思路:線段樹區間更新,查詢。主要問題在於如何解決快速對一個區間所有數據開根號

HDU 4027 Can you answer these queries?(線段樹/區間不等更新)

push battle mark put action light blog acc lang 傳送門 Can you answer these queries? Time Limit: 4000/2000 MS (Java/Others) Memory Limi

hdoj-2141-Can you find it?

style spa sin ble AS ace () href binary 題目鏈接 1 /* 2 Name:HDU-2141-Can you find it? 3 Copyright: 4 Author: 5 D

HDU 2141 Can you find it? (二分)

input int you time chm source tis 去掉 註意 題目鏈接: Can you find it? Time Limit: 10000/3000 MS (Java/Others) Memory Limit: 32768/10000 K (Ja

GSS3 - Can you answer these queries III

#define RM () lse eset gin ++ hup tps 題意翻譯 nnn 個數, qqq 次操作 操作0 x y把 AxA_xAx? 修改為 yyy 操作1 l r詢問區間 [l,r][l, r][l,r] 的最大子段和 感謝 @Edgra

Can you answer these queries? HDU - 4027(線段樹+技巧)

fin 題意 ios fff PE sqrt += 長度 scan 題意:給一個數組序列, 數組長度為100000 兩種操作: 一種操作是將某一個固定區間所有數開方(向下取整) 另一種操作是詢問某個區間的所有數字之和。 由於數不超過263,因此開個七八次就變成1,由於只有

[SP1043]GSS1 - Can you answer these queries I

struct answer str == 線段 return shu lib n) 求區間內最大非空子段和,沒什麽可說的吧。 線段樹,每個區間維護從左端開始的最大非空子段和,區間內的最大非空子段和,以右端結束的最大非空子段和,還有區間和。 pushup()的寫法要註意,不要

[SP1557]GSS2 - Can you answer these queries II

常用 最大子段和 bool 修改 == 意義 一次 合並 ans 題意不過只是比GSS1多了幾個字而已,難度卻把GSS1甩得望塵莫及。 給出n個數,q次詢問,求最大子段和(可為空),相同的數只算一次。 說到相同的只算一次這一條件,有點像[SDOI2009]HH的項鏈,但是本

SP1043 GSS1 - Can you answer these queries I(線段樹,區間最大子段和(靜態))

有一種 nbsp 不用 端點 合並 表示 格式 space iostream 題目描述 給出了序列A[1],A[2],…,A[N]。 (a[i]≤15007,1≤N≤50000)。查詢定義如下: 查詢(x,y)=max{a[i]+a[i+1

HDU 2143 Can you find it?(基礎二分)

i++ php http miss then represent ise for stream Can you find it? Time Limit: 10000/3000 MS (Java/Others) Memory Limit: 32768/10000 K (