Tony Lin
Tony Lin
環境:OSX 10.10.4 ruby版本:Ruby 2.2.2p95 rails版本:Rails 4.2.3 執行bundle install的時候 跑到 Installing curb 0.8.5 with native extensions 會失敗 錯誤訊息:https://gist.github.com/tnlin/fb1085a118fd0db29c72 之後我跑了幾個測試 gem install curb -v '0.8.5' 也是失敗的 gem install curb 成功 請問要改哪邊才能解決這個問題?
https://user-images.githubusercontent.com/5557403/164623637-bce616bc-99ab-4776-a62d-52912d70c9a1.mp4 As the attachment, the train_splits/dia125_utt3.mp4 is corrupted, and could not be used to extract features. I put it here in case someone has a similar problem.
In case of anyone who bump into this problem. ``` /Users/tnlin/anaconda3/lib/python3.6/site-packages/notebook/base/zmqhandlers.py:284: RuntimeWarning: coroutine 'WebSocketHandler.get' was never awaited super(AuthenticatedZMQStreamHandler, self).get(*args, **kwargs) [W 11:53:18.115 NotebookApp] Replacing stale connection: e1c43480-dd1f-4837-b57d-197e2e20fdb9:24e703ae04c9484c896ecbd5c506b419 ``` My jupyter...
因為是經典的TSP問題,有好多的論文與演算法可以用 需要一個有系統性的說明文件 希望大家在看code之外,也能夠在wiki得到更多詳細的說明
可以透過[Google Map API](https://developers.google.com/maps/documentation/distance-matrix/intro)來建立Distance Matrix 但API 每天接受2500次P2P的位置查詢 目前主要是參考[Queen of College Tours](http://www.math.uwaterloo.ca/tsp/college/index.html)的作法 每個點建立Delaunay triangulation 每個點在每個點取 10 條最短直線 每個點在每個點的四個象限取 2 條最短直線 最後再去Union of 10 near-optimal tours (Geometric TSP) 但實際做起來,還沒有什麼頭緒...
考慮人走路速度平均4.5km/hr, 5min 大約為 400m 就變成了一個背包問題,在400公尺內塞入盡可能多的路徑點 但如果用distance matrix來算的話,就會有路徑必須頭尾相連的問題