{"version":"1.0","provider_name":"Camdemy1.0","provider_url":"http:\/\/media.usc.edu.tw","title":"Algorithm_huffman","description":"","author_name":null,"author_url":"http:\/\/media.usc.edu.tw\/user\/","thumbnail_url":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/4\/49e3ca86d0b7f1f6\/thumb_l.jpg","thumbnail_height":360,"thumbnail_width":640,"html":"<iframe width='720' height='405' id='ccShare954' frameborder='0'  src='http:\/\/media.usc.edu.tw\/media\/e\/954' allowfullscreen><\/iframe>","type":"video","width":720,"height":405,"duration":"10:08","index":{"item_1":{"title":"Huffman codes","time":"0","indent":"0","sn":"1"},"item_2":{"title":"Huffman Code","time":"1020","indent":"0","sn":"2"},"item_3":{"title":"Huffman codes","time":"10870","indent":"0","sn":"3"},"item_4":{"title":"An example of Huffman algorithm","time":"306970","indent":"0","sn":"4"},"item_5":{"title":"Huffman codes","time":"362320","indent":"0","sn":"5"},"item_6":{"title":"Huffman Code","time":"362320","indent":"0","sn":"6"},"item_7":{"title":"Huffman codes","time":"364570","indent":"0","sn":"7"},"item_8":{"title":"An example of Huffman algorithm","time":"365070","indent":"0","sn":"8"},"item_9":{"title":"The minimal cycle basis problem","time":"466420","indent":"0","sn":"9"},"item_10":{"title":"An example of Huffman algorithm","time":"471670","indent":"0","sn":"10"}},"resolution":{"playtype":"fs","subtype":"","src":"1280x720","mp4":"720x404","mp4_hd":"1280x720","mp4_4k":"","mp4_1920":"","mp4_src":"","mp4_base":""},"base_image":{"thumb":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/4\/49e3ca86d0b7f1f6\/thumb.jpg","cover":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/4\/49e3ca86d0b7f1f6\/cover.jpg","storyboard":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/4\/49e3ca86d0b7f1f6\/video\/thumbs\/storyboard.jpg"},"srcFrom":"","base_url":"http:\/\/media.usc.edu.tw\/sysdata\/doc\/4\/49e3ca86d0b7f1f6","status":true}