Hi
user
Admin Login:
Username:
Password:
Name:
Hands On Realtime Text Analytics
--client
troy
--show
nodepdx2013
--room room_1 2313 --force
Next: 8 Implementing Git in JavaScript & the Browser
show more...
Marks
Author(s):
J Chris Anderson
Location
Room 1
Date
may Thu 16
Days Raw Files
Start
13:23
First Raw Start
13:16
Duration
00:20:00
Offset
0:06:34
End
13:43
Last Raw End
13:47
Chapters
00:00
Total cuts_time
23 min.
raw-playlist
raw-mp4-playlist
encoded-files-playlist
host
archive
public
mp4
svg
png
assets
release.pdf
Hands_On_Realtime_Text_Analytics.json
logs
Admin:
episode
episode list
cut list
raw files day
marks day
marks day
image_files
State:
---------
borked
edit
encode
push to queue
post
richard
review 1
email
review 2
make public
tweet
to-miror
conf
done
Locked:
clear this to unlock
Locked by:
user/process that locked.
Start:
initially scheduled time from master, adjusted to match reality
Duration:
length in hh:mm:ss
Name:
Video Title (shows in video search results)
Emails:
email(s) of the presenter(s)
Released:
has someone authorised pubication
Unknown
Yes
No
Normalise:
Channelcopy:
m=mono, 01=copy left to right, 10=right to left, 00=ignore.
Thumbnail:
filename.png
Description:
markdown
A common problem in large scale computing, is coordinating workers when they can be scattered across compute nodes. For workloads like this, atomic operators like increment and decrement reduce contention between distributed processes. In this talk I'll show a full text analysis tool which ranks words in the Twitter firehose. By storing each token in a key based on its characteristics, we can provide word rankings both globally, as well as over time and space. We'll show the running application, and take a tour through the code, as well as discuss cluster sizing and how it is impacted by variations in the input data stream. For instance a tweet in English from San Francisco might say "Go Giants" so counters for 2012:go and usa-sf:2012-07:giants (among a few dozen others) are incremented. Even using memory like this, the counts from a full corpus of English text would only take a few gigabytes to hold, making this architecture more efficient than a traditional index-and-rollup approach.
Comment:
production notes
2013-05-16/13_16_26.dv
Apply:
13:16:26 - 13:23:21 ( 00:06:55 )
S:
13:16:26 -
E:
13:23:21
D:
00:06:55
show more...
vlc ~/Videos/veyepar/troy/nodepdx2013/dv/room_1/2013-05-16/13_16_26.dv :start-time=00.0 --audio-desync=0
Raw File
Cut List
13:16:26
seconds: 0.0
Wall: 13:16:26
Duration
00:06:55
13:23:21
seconds: 0.0
Wall: 13:16:26
Comments:
mp4
mp4.m3u
dv.m3u
Split:
Sequence:
:
delete
2013-05-16/13_23_22.dv
Apply:
13:23:22 - 13:47:03 ( 00:23:41 )
S:
13:23:22 -
E:
13:47:03
D:
00:23:41
show more...
vlc ~/Videos/veyepar/troy/nodepdx2013/dv/room_1/2013-05-16/13_23_22.dv :start-time=00.0 --audio-desync=0
Raw File
Cut List
13:23:22
seconds: 0.0
Wall: 13:23:22
Duration
00:23:41
13:47:03
seconds: 0.0
Wall: 13:23:22
Comments:
mp4
mp4.m3u
dv.m3u
Split:
Sequence:
:
delete
Rf filename:
root is .../show/dv/location/, example: 2013-03-13/13:13:30.dv
Sequence:
get this:
check and save to add this
2013-05-16/13_16_26.dv
2013-05-16/13_23_22.dv
Veyepar
Video Eyeball Processor and Review
