On-Demand Routing Design - Based on Big Data Relation Requirement
碩士 === 國立勤益科技大學 === 資訊工程系 === 102 === About the locations of the targets, there have many clearly expressed methods with the popularity of mobile devices supporting GPS (Global Positioning System), the latitudes and longitudes of the Location-based of the objects can be obtained easily, quickly and...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2014
|
Online Access: | http://ndltd.ncl.edu.tw/handle/89436609416493655533 |
id |
ndltd-TW-102NCIT5392013 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-102NCIT53920132015-10-14T00:18:19Z http://ndltd.ncl.edu.tw/handle/89436609416493655533 On-Demand Routing Design - Based on Big Data Relation Requirement 需求導向路徑繞境設計-以巨量數據關聯需求為基礎 De-Ting Lee 李德庭 碩士 國立勤益科技大學 資訊工程系 102 About the locations of the targets, there have many clearly expressed methods with the popularity of mobile devices supporting GPS (Global Positioning System), the latitudes and longitudes of the Location-based of the objects can be obtained easily, quickly and accurately. Unfortunately, such Location-based data, which can only be one-way information when searched, can neither bring out the effectiveness of connection nor be the analyzed object, which inevitably need additional processing to be meaningful information to be used. How to gain the analysis of significant and knowledgeable information from unstructured database has already been concern of those who use big data. From the development of postal address observation we know that it is easier to user Location-based information than geographic coordinate expressed. This dissertation is on studies of the development of a set of vector geographical systems based on Raster, which means each area unit is corresponding to a unique index number. When server and user reach the Service Area agreement, the system will effectively build a connective bridge for the area and geography. The research developing the service area standard, between the user and server. The standard protocol for the regional department of space, based on the path problems between points, to the extension to routing and area problems. In addition to "the path optimization", "the service blocks to go through", and "the process of going through service area" are also factors to be considered. In thesis study, which is based on the cutting model of service block, users can draw the outline of the blocks which must be gone through (On Demand), and apply the path analysis model on Google map to gain the extension of path planning system to go through under demand. This means on-demand routing system, that help users have reference tools of pre-feasibility assessment on the path planning and improve the efficiency of planning. Dr. Tsung-Hung Lin 林宗宏 博士 2014 學位論文 ; thesis 48 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立勤益科技大學 === 資訊工程系 === 102 === About the locations of the targets, there have many clearly expressed methods with the popularity of mobile devices supporting GPS (Global Positioning System), the latitudes and longitudes of the Location-based of the objects can be obtained easily, quickly and accurately. Unfortunately, such Location-based data, which can only be one-way information when searched, can neither bring out the effectiveness of connection nor be the analyzed object, which inevitably need additional processing to be meaningful information to be used. How to gain the analysis of significant and knowledgeable information from unstructured database has already been concern of those who use big data.
From the development of postal address observation we know that it is easier to user Location-based information than geographic coordinate expressed. This dissertation is on studies of the development of a set of vector geographical systems based on Raster, which means each area unit is corresponding to a unique index number. When server and user reach the Service Area agreement, the system will effectively build a connective bridge for the area and geography.
The research developing the service area standard, between the user and server. The standard protocol for the regional department of space, based on the path problems between points, to the extension to routing and area problems. In addition to "the path optimization", "the service blocks to go through", and "the process of going through service area" are also factors to be considered. In thesis study, which is based on the cutting model of service block, users can draw the outline of the blocks which must be gone through (On Demand), and apply the path analysis model on Google map to gain the extension of path planning system to go through under demand. This means on-demand routing system, that help users have reference tools of pre-feasibility assessment on the path planning and improve the efficiency of planning.
|
author2 |
Dr. Tsung-Hung Lin |
author_facet |
Dr. Tsung-Hung Lin De-Ting Lee 李德庭 |
author |
De-Ting Lee 李德庭 |
spellingShingle |
De-Ting Lee 李德庭 On-Demand Routing Design - Based on Big Data Relation Requirement |
author_sort |
De-Ting Lee |
title |
On-Demand Routing Design - Based on Big Data Relation Requirement |
title_short |
On-Demand Routing Design - Based on Big Data Relation Requirement |
title_full |
On-Demand Routing Design - Based on Big Data Relation Requirement |
title_fullStr |
On-Demand Routing Design - Based on Big Data Relation Requirement |
title_full_unstemmed |
On-Demand Routing Design - Based on Big Data Relation Requirement |
title_sort |
on-demand routing design - based on big data relation requirement |
publishDate |
2014 |
url |
http://ndltd.ncl.edu.tw/handle/89436609416493655533 |
work_keys_str_mv |
AT detinglee ondemandroutingdesignbasedonbigdatarelationrequirement AT lǐdétíng ondemandroutingdesignbasedonbigdatarelationrequirement AT detinglee xūqiúdǎoxiànglùjìngràojìngshèjìyǐjùliàngshùjùguānliánxūqiúwèijīchǔ AT lǐdétíng xūqiúdǎoxiànglùjìngràojìngshèjìyǐjùliàngshùjùguānliánxūqiúwèijīchǔ |
_version_ |
1718088560995729408 |