株式会社ミライタスの社内発表会でG(インフラグループ:サーバー)チームが発表した「Linux Server 冗長化~リアルタイム同期でラクラク運用~」ののスライドです(個人名を含む部分等、一部変更を加えています)。専門的な内容ですが、実際にメンバーの1人が作業を行い検証したため、手順書としても使用できるものとなっています。
A Sensing Coverage Analysis of a Route Control Method for Vehicular Crowd Sen...Osamu Masutani
Simulated evaluation of crowd sensing with vehicles for a Smart City. Route cordination of sensing vehicles is a key to enhance sensing coverage of participatory crowd sensing system. We provide a simple methodology to realize suitable cordinated traffic control method by means of shortest cost finding with dedicated cost function aware of sensing demand in a city.
株式会社ミライタスの社内発表会でG(インフラグループ:サーバー)チームが発表した「Linux Server 冗長化~リアルタイム同期でラクラク運用~」ののスライドです(個人名を含む部分等、一部変更を加えています)。専門的な内容ですが、実際にメンバーの1人が作業を行い検証したため、手順書としても使用できるものとなっています。
A Sensing Coverage Analysis of a Route Control Method for Vehicular Crowd Sen...Osamu Masutani
Simulated evaluation of crowd sensing with vehicles for a Smart City. Route cordination of sensing vehicles is a key to enhance sensing coverage of participatory crowd sensing system. We provide a simple methodology to realize suitable cordinated traffic control method by means of shortest cost finding with dedicated cost function aware of sensing demand in a city.
Wakame-vnet / Open Source Project for Virtual Network & SDNaxsh co., LTD.
Wakame-vnet is a toolkit for Virtual Networking based on the Edge Networking Architecture. The user can freely design own L2/L3 network on top of physical network using Wakame-vnet.
A Multiple Pairs Shortest Path Algorithm 解説Osamu Masutani
National Cheng Kung UniversityのWang氏の多点間最短経路探索(MPSP)に関する論文の解説。
Wang, I-Lin, Ellis L. Johnson, and Joel S. Sokol. "A multiple pairs shortest path algorithm." Transportation science 39.4 (2005): 465-476.
Clustering of time series subsequences is meaningless 解説Osamu Masutani
UCRのKeoghらの時系列クラスタリングに関する論文の解説。Keogh, Eamonn, and Jessica Lin. "Clustering of time-series subsequences is meaningless: implications for previous and future research." Knowledge and information systems 8.2 (2005): 154-177.
Toward a resilient prediction system for non-uniform traffic data Osamu Masutani
We developed a traffic prediction system which enhances a traffic information service. The prediction method is based on time series analysis and is applicable to short to long term prediction. Traffic information system are real-time and real-world system therefore it suffers various kind of disturbance from environment. To preserve traffic prediction quality, we need fundamental treatment on overall system so that the prediction engine be tolerant toward incomplete traffic data feed or non-stationary traffic data. A solution for incomplete data feed is a combination of data for multiple links. A solution for non-stationary traffic is a traffic simulation dedicated to traffic accidents. With these enhancements toward cyber disturbance and physical disturbance, the system resiliency can be higher.
An event detection method using floating car dataOsamu Masutani
This paper presents a method which detects events from floating car data (FCD). In traffic prediction, an event is one of unexpected factors which deteriorates the prediction performance. If occurrences of events are provided to prediction system beforehand, the prediction will be improved. Firstly, we confirmed contribution of event information to a traffic prediction accuracy. Then the paper will show that spatio-temporal pattern of zonal traffic attraction and generation is an intelligible trail of an event. Finally, the paper will propose an event detection and prediction method using PCA and HMM. The result shows feasibility of event prediction in high accuracy in certain condition.
Feasible study of a light weight prediction system in ChinaOsamu Masutani
Traffic prediction is a key technology of recent traffic information systems. We introduce combination of 3 light-weight and precise prediction methods. We confirmed their predication accuracy outperforms baseline prediction methods, using Chinese FCD based traffic data. And our prototype prediction engine can process data for Beijing 150K links in short time by a reasonable server.
9. parfor
• Parforはforと全く同じではない
• http://jp.mathworks.com/help/distcomp/parfor.html
• 外部から参照できる変数
• スイープパラメータ (i)に影響を受ける変数
• コード1では Cだけが結果に影響
• 適切に選択された演算子で計算された変数
• コード2ではsが正しく計算される
• 順番に依存しない演算
コード1
parfor i = 1:n
t = f(A(i));
u = g(B(i));
C(i) = h(t, u);
end
コード2
s = 0;
parfor i = 1:n
if p(i) % assume p is a function
s = s + 1;
end
end
初級編