Tesis sobre el tema "Route based"
Siga este enlace para ver otros tipos de publicaciones sobre el tema: Route based.
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte los 50 mejores tesis para su investigación sobre el tema "Route based".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Explore tesis sobre una amplia variedad de disciplinas y organice su bibliografía correctamente.
1
Dahl, Valerie y Mikael Davidsson. "Route flow estimation based on time-dependent route choice sets and historical travel times". Thesis, Linköpings universitet, Kommunikations- och transportsystem, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-130007.
Texto completoResumen
Since congestion leads to variations in travel time which gives a variation in the traffic flow, it is interesting to estimate the traffic flow in larger cities where cars drive in a limited space. In order to estimate the traffic flow, different traffic models are usually used. These models often use volume-delay functions which calculate the travel times for each link depending on the current traffic flow. However, in these models, the process for reaching equilibrium can be time consuming and it is hard to calibrate the volume-delay functions for a road network with a large set of links. Instead, we assume that it is relatively simply to measure or collect historical time-dependent travel times on a large set of links. With this assumption, a method that uses time-dependent route choice sets and time-dependent travel times in order to estimate time-dependent route flows, is developed. In this thesis, the method was applied to Stockholm County where it is interesting to study the route choice since congestion occurs in the area which generate variations in travel time. In order to estimate time-dependent route flows, a time-sliced OD-matrix was created by dividing the matrix for the peak hour using two different time-slicing distributions. The time-dependent route choice set with time-dependent travel times was created by using an existing route planning tool. These routes were mapped to the links in a road network in order to estimate link flows. The mapping was done by using map matching and a shortest path algorithm. Route shares were decided by using a method that splits the demand equally among the routes in the route choice set for an OD-pair, and with a logit model that takes travel time into account with the assumption that the travel time can affect a traveler’s route choice. The evaluation of the resulting link flows was done by comparing these link flows with observed link flows using different time-slicing distributions and route share models. Furthermore, the method’s resulting link flows was evaluated against the resulting link flows from a scenario where all travelers are assumed to choose the shortest path, in terms of free flow travel time, between each OD-pair. The developed method can estimate link flows so that 27.9 % of the links have a GEH value less than 5, which can be compared to the commonly used acceptance criteria of 85 %. This shows that the method needs to be developed further in order to achieve link flow estimations that fulfills the acceptance criteria. Even though the overall result show that the developed method does not fulfill the acceptance criteria, the method works well on some individual links. Furthermore, the resulting link flows from the developed method match the observed link flows better than the resulting link flows from the scenario where all travelers are assumed to choose the shortest path.
2
Hamad, Sofian. "Efficient route discovery for reactive routing". Thesis, Brunel University, 2013. http://bura.brunel.ac.uk/handle/2438/7634.
Texto completoResumen
Information on the location of mobile nodes in Mobile Ad-hoc Networks (MANETs) has the potential to significantly improve network performance. This thesis uses node location information to develop new techniques for route discovery in on-demand routing protocols such as the Ad-hoc On-Demand Distance Vector (AODV), thus making an important contribution to enhancing the experience of using mobile networks. A Candidate Neighbours to Rebroadcast the Route Request (CNRR) approach has been proposed to reduce the deleterious impact, known as the broadcast storm, of RREQ packets flooding in traditional on-demand routing protocols. The main concept behind CNRR is specifying a set of neighbours which will rebroadcast the received RREQ. This is a departure from the traditional approach of all receiving nodes rebroadcasting RREQs and has the effect of reducing the problem of redundancy from which mobile networks suffer. The proposed protocol has been developed in two phases: Closest-CNRR and Furthest-CNRR. The simulation results show that the proposed algorithms have a significant effect as they reduce the routing overhead of the AODV protocol by up to 28% compared to the C-CNRR, and by up to 17.5% compared to the F-CNRR. Notably, the proposed algorithms simultaneously achieve better throughput and less data dropping. The Link Stability and Energy Aware protocol (LSEA) has been developed to reduce the overhead while increasing network lifetimes. The LSEA helps to control the global dissemination of RREQs in the network by eliminating those nodes that have a residual energy level below a specific threshold value from participation in end-to-end routes. The proposed LSEA protocol significantly increases network lifetimes by up to 19% compared with other on-demand routing protocols while still managing to obtain the same packet delivery ratio and network throughput levels. Furthermore, merging the LSEA and CNRR concepts has the great advantage of reducing the dissemination of RREQs in the network without loss of reachability among the nodes. This increases network lifetimes, reduces the overhead and increases the amount of data sent and received. Accordingly, a Position-based Selective Neighbour (PSN) approach has been proposed which combines the advantages of zoning and link stability. The results show that the proposed technique has notable advantages over both the AODV and MAAODV as it improves delivery ratios by 24.6% and 18.8%, respectively.
3
Nåfält, Gustav y Mattias Tunholm. "Road Network Analysis based on Route Set Generation". Thesis, Linköpings universitet, Kommunikations- och transportsystem, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-168101.
Texto completoResumen
This thesis proposes an analysing tool that makes use of route set generation to perform road network analysis that can be used in both transport planning and traffic management analysis. The input to the tool is a routable road network and a geographical zoning system and the route set generation is performed on all Origin-Destination (OD) -pairs of the zoning system. The tool was implemented using a simplification of Stockholms road network and a zoning system defined by the Swedish Transport Administration. The result shows that a route set generation-based tool can provide support in both transport planning and traffic management, and that the procedure provides results within a reasonable amount of time. The tool provides both a general analysis of the road network, and a link capacity reduction analysis. In the latter, the proportion of affected destinations and mean travel time deterioration for each OD-zone work as metrics of how the zones are affected by the capacity reduction. Transport planners can use the tool to present the betweenness centrality, the proportion of affected destinations and the mean travel time deterioration, all of which are metrics that can be used to evaluate the potential need for new infrastructure. Traffic managers can use the proportion of affected destinations and the mean travel time deterioration as metrics that can be used to identify zones that are affected by a road capacity reduction. The betweenness centrality of the best alternative route can be used to support traffic diversion for a specific zone.
4
Edwards, S. J., C. Emmerson, A. Namdeo, P. T. Blythe y W. Guo. "Optimising landmark-based route guidance for older drivers". Elsevier, 2016. https://publish.fid-move.qucosa.de/id/qucosa%3A72821.
Texto completoResumen
In-vehicle navigation systems (IVNS) have the potential to benefit older drivers, reducing stress associated with way-finding and providing on-trip support, especially in unfamiliar locations. However, existing IVNS present challenges to usability, resulting in lack of uptake and over-reliance on pre-trip planning.
This paper presents research aimed at identifying features that make IVNS user-friendly and appropriate for older drivers. Studying navigational performance within a simulated driving environment, it focuses on the use of landmarks with route guidance information, and the most appropriate method of information provision (audio only, visual only or a combination of audio and visual). It also assesses potential gender differences that might arise with landmark-based navigational information.
Solutions include use of appropriate roadside landmarks, and information delivered through a combination of audio and icon-based visual format. These features result in lower workload and fewer navigational errors. The audio/visual modality reduces the hazard of distraction by landmarks resulting in fewer visual glances and lower glance duration to the roadside compared to other modalities.
Design and provision of IVNS tailored to older drivers’ needs can make a considerable contribution to maintaining individual mobility for longer.
5
Deaver, Guinevere J. "The Effects of Frequency on Dual-Route Versus Single-Route Processing of Morphologically Complex Terms: A Usage-Based Experiment". BYU ScholarsArchive, 2013. https://scholarsarchive.byu.edu/etd/4282.
Texto completoResumen
With the availability of frequency dictionaries, such as Alameda and Cuetos (1995) or the Corpus del Español (2002), it is now possible to explore the effects of frequency on linguistic items. The following is a study exploring the effects of frequency on Spanish affixed words. While the debate of dual-route versus single-route processing continues, the results of this study suggest that L2 Spanish speakers use a dual-route model and decompose morphologically complex words when the base frequency is higher than the surface frequency. L2 Spanish speakers perceive derived words with a higher base frequency as more complex than derived words with a lower base frequency. The results of this study do not suggest the same process occurs for native Spanish speakers. When asked to identify the more complex word of a pair, native Spanish speakers are just as likely to select the derived word with a lower base frequency as they are to select the derived word with a higher base frequency suggesting a single-route model.
6
Cappetto, Peter Michael. "History-based route selection for reactive ad hoc routing protocols". Online access for everyone, 2007. http://www.dissertations.wsu.edu/Thesis/Spring2007/p_cappetto_042207.pdf.
Texto completo
7
Mukai, Naoto y Toyohide Watanabe. "Proactive Route Planning Based on Expected Rewards for Transport Systems". IEEE, 2005. http://hdl.handle.net/2237/6918.
Texto completo
8
Hammond, David Stuart. "The validation and improvement of route-based road weather forecasts". Thesis, University of Birmingham, 2011. http://etheses.bham.ac.uk//id/eprint/1299/.
Texto completoResumen
This thesis aims to develop the foundations for a new validation strategy for route-based road weather forecasts that will enable validation of route-based models at a vastly improved spatial and temporal resolution, and in doing so provide a tool for rapid appraisal of new model parameterisations. A validation strategy that uses clustering techniques to create clusters of forecast points with similar geographical and infrastructure characteristics is presented, as well as two methodologies for de-parameterising key geographical and infrastructure parameters in the ENTICE route-based model that are currently not measured at the spatial scale demanded by a route-based forecast. The proposed validation strategy facilitates the analysis of forecast statistics at the cluster level, which is shown to provide a more representative measure of the model’s spatial forecasting ability. The majority of thermal variations around the study route are well represented by the clustering solutions, presenting the opportunity for new sampling strategies with the potential to validate forecasts at a vastly improved spatial and temporal resolution. De-parameterisation of the road construction and surface roughness parameters within the ENTICE model using Ground Penetrating Radar and airborne LIDAR data has been shown to significantly improve the spatial forecasting ability of ENTICE, with the model changes leading to refinement of the clustering solution which enables it to better capture the physical relationship between road surface temperature and the geographical and infrastructure parameters around the study route. Suggestions for future research are provided along with a blueprint for the future of route-based road weather forecasts.
9
Johan, Eliasson. "Detecting Crime Series Based on Route Estimation and Behavioral Similarity". Thesis, Blekinge Tekniska Högskola, Institutionen för datalogi och datorsystemteknik, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-12833.
Texto completo
10
Berntsson, Simon y Mattias Andreasson. "Efficient Route-based Optimal Energy Management for Hybrid Electric Vehicles". Thesis, Linköpings universitet, Fordonssystem, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-148565.
Texto completoResumen
The requirements on fuel consumption and emissions for passenger cars are getting stricter every year. This has forced the vehicle industry to look for ways to improve the performance of the driveline. With the increasing focus on electrification, a common method is to combine an electrical driveline with a conventional driveline that uses a petrol or diesel engine, thus creating a hybrid electric vehicle. To fully be able to utilise the potential of the driveline in such a vehicle, an efficient energy management strategy is needed. This thesis describes the development of an efficient route-based energy management strategy. Three different optimisation strategies are combined, deterministic dynamic programming, equivalent consumption minimisation strategy and convex optimisation, together with segmentation of the input data. The developed strategy shows a decrease in computational time with up to more than one hundred times compared to a benchmark algorithm. When implemented in Volvo's simulation tool, VSim, substantial fuel savings of up to ten percent is shown compared to a charge-depleting charge-sustain strategy.
11
Gharat, Asmita. "Bluetooth based dynamic critical route volume estimation on signalized arterials". Thesis, Virginia Tech, 2011. http://hdl.handle.net/10919/76871.
Texto completoResumen
Bluetooth Data collection technique is recently proven as a reliable data collection technique that provides the opportunity to modify traditional methodologies to improve system performance. Actual volume in the network is a result of the timing plans which are designed and modified based on the volume which is generated using existing timing plans in the system. This interdependency between timing plan and volume on the network is a dynamic process and should be captured to obtain actual traffic states in the network. The current practice is to calculate synthetic origin destination information based on detector volume that doesn't necessarily represent the volume scenario accurately. The data from Bluetooth technology can be utilized to calculate dynamic volume on the network which can be further used as input for signal timing design. Application of dynamic volume improves the system performance by providing the actual volume in system to design optimal timing plans. This thesis proposes a framework that can be used to integrate data obtained from the Bluetooth technology with the traditional methods to design timing plans. The proposed methodology utilizes the origin destination information obtained from Bluetooth data, detector data, characteristics of intersections such as number of lanes, saturation flow rate and existing timing plans as a basis for the calculation of the dynamic volume for the various movements at each intersection. The study shows that using the Bluetooth based OD matrix to calculate accurate dynamic volumes results in better system performance compared to the traditional way of using the static detector volume alone.Master of Science
12
Djannaty, Farhad. "Network based heuristics for the set covering problem". Thesis, Brunel University, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.320547.
Texto completo
13
Zhuang, Lizhang. "A multi-variable product classification system for non-standard route manufacturing". Thesis, Glasgow Caledonian University, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.241592.
Texto completo
14
Fellner, Irene, Haosheng Huang y Georg Gartner. ""Turn Left after the WC, and Use the Lift to Go to the 2nd Floor" - Generation of Landmark-Based Route Instructions for Indoor Navigation". MDPI AG, 2017. http://dx.doi.org/10.3390/ijgi6060183.
Texto completoResumen
People in unfamiliar environments often need navigation guidance to reach a destination.
Research has found that compared to outdoors, people tend to lose orientation much more easily
within complex buildings, such as university buildings and hospitals. This paper proposes
a category-based method to generate landmark-based route instructions to support people's
wayfinding activities in unfamiliar indoor environments. Compared to other methods relying
on detailed instance-level data about the visual, semantic, and structural characteristics of individual
spatial objects, the proposed method relies on commonly available data about categories of spatial
objects, which exist in most indoor spatial databases. With this, instructions like "Turn right after the
second door, and use the elevator to go to the second floor" can be generated for indoor navigation. A case
study with a university campus shows that the method is feasible in generating landmark-based
route instructions for indoor navigation. More importantly, compared to metric-based instructions
(i.e., the benchmark for indoor navigation), the generated landmark-based instructions can help users
to unambiguously identify the correct decision point where a change of direction is needed, as well
as offer information for the users to confirm that they are on the right way to the destination.
15
Litzinger, Paul. "The route change of travel time based routing influenced by weather". Thesis, Linköpings universitet, Kommunikations- och transportsystem, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-67939.
Texto completoResumen
As usual route planners are based on the principle of travel time minimization, the travel speed and distance from the destination are two key factors to calculate the optimal route. Current systems are based on predetermined speed limits stored on road maps. However, few of the systems used today, consider current environmental influences. The aim of this thesis is to examine the extent of route changes for MIT (Motorized Individual Transport), when weather-related speed reductions are considered. The basis for the work are road data from OpenStreetMap and historical weather data in the NetCDF (Network Common Data Format) provided by the company Ubimet. The data is processed, by using the ArcGIS software from ESRI (Environmental Systems Research Institute, Inc). The study area corresponds to the territory of Austria. After the treatment of roads and weather information, the records are processed, using the software, to weather-related road networks. This is done by two different methods, static and dynamic. The static model concerns the routing behaviour using a specific weather situation, while the dynamic model takes temporal change of the weather into account. For the analysis of the new, influenced by the weather, routing behaviour the created routes at times of strong weathering are compared with predetermined reference cases without considering the weather. Routes referring to periods of normal and strong weathering, e.g. heavy rain, are analysed and compared in travel time, route length and exposure to adverse weather conditions.
16
Almgren, Johan y Gustav Elingsbo. "Route Based Optimal Control Strategy for Plug-In Hybrid Electric Vehicles". Thesis, Linköpings universitet, Fordonssystem, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-138713.
Texto completoResumen
More restrictive emission legislations, rising fuel prices and the realisation that oil is a limited resource have lead to the emergence of the hybrid electric vehicles.To fully utilise the potential of the hybrid electric vehicles, energy management strategies are needed. The main objective of the strategy is to ensure that the limited electric energy is utilised in an efficient manner.This thesis develops and evaluates an optimisation based energy management strategy for plug-in hybrid electric vehicles. The optimisation methods used are based on a dynamic programming and ECMS approach. The strategy is validated against Vsim, Volvo Cars' performance and fuel consumption analysis tool as well as against strategies where parts of the optimisation is replaced by logic. The results show that the developed strategy consumes less fuel both compared to the corresponding Vsim strategy and the logic strategies.
17
Hildebrandt, N. C. (Nils Christoph). "Paper-based composites via the partial dissolution route with NaOH/urea". Doctoral thesis, Oulun yliopisto, 2018. http://urn.fi/urn:isbn:9789526221243.
Texto completoResumen
Abstract Replacing the plastics in packaging applications with bio based and biodegradable cellulosic materials, especially all cellulose composites, would be a sustainable alternative. The main problem would be the non ecological and non economic nature of the processing required by all cellulose composites due to the use of toxic and expensive chemicals such as cellulose solvents. In addition, the raw materials typically studied for all cellulose composites have been highly specialized cellulosic pulps. This thesis therefore explores the possibility of using NaOH/urea as a cellulose solvent together with commercially available chemical pulps from the paper and board industry for the production of sustainable all cellulose composites materials. Furthermore, the effect of calendering and fibre orientation was investigated. The methods used for characterizing the materials were tensile strength measurements, X Ray diffraction, imaging and the short compression strength test. In connection with the X Ray diffraction measurements a method for evaluating the crystallinity of cellulose was modified from the literature and partly automated. The results show that NaOH/urea is a suitable solvent for producing all cellulose composites within a significant shorter time than reported in the literature. In addition, the tensile strength of the paper used for this purpose could be increased up to ten times and it is shown that the dissolution of cellulose fibres was indeed only partial. The efficiency of the treatment is nevertheless greatly dependent on the pulps used and their hemicellulose and lignin content. Further post-processing in the form of calendering is not recommended because it weakens the compositesTiivistelmä Fossiilisien muovien korvaaminen biopohjaisilla ja -hajoavilla materiaaleilla pakkausteollisuuden sovelluksissa on ympäristön kannalta kestävä vaihtoehto, varsinkin kun materiaalina käytetään itselujittuva selluloosakomposiitti (eng. all-cellulose composite). Tämän materiaalin teollinen valmistus ei kuitenkaan ole vielä ollut taloudellisesti kannattavaa eikä ympäristöystävällistä, koska selluloosan liuotukseen tarvitaan kalliita ja ympäristölle haitallisia kemikaaleja. Lisäksi raaka-aineena on aiemmin käytetty kalliita erikoisselluloosakuituja. Edellä mainituista syistä tässä väitöskirjatyössä tutkitaan itselujittuvien selluloosakomposiittien valmistusta käyttäen raaka-aineina kaupallisesti saatavilla olevia selluloosakuituja ja niiden liuottimena NaOH/urean vesiliuosta. Tämän liuottimen etuja ovat vähäinen myrkyllisyys, edullisuus ja riittävien määrien saatavuus teolliseen tuotantoon. Lisäksi työssä tutkitaan kalanteroinnin ja kuituorientaation vaikutusta komposiitin ominaisuuksiin. Käytettyjä analyysimenetelmiä ovat röntgendiffraktio, elektronimikroskoopilla kuvantaminen ja erityyppiset mekaaniset testit. Röntgendiffraktiomittausten tulosten arvioinnissa käytetään aiemmin raportoidusta menetelmästä kehitettyä osin automatisoitua selluloosan kiteisyyden määrittämisen menetelmää. Tulosten perusteella voidaan sanoa, että NaOH/urea on sopiva liuotin itselujittuvien selluloosakomposiittien valmistukseen ja sillä prosessia voidaan nopeuttaa huomattavasti muihin raportoituihin menetelmiin verrattuna. Raaka-aineena käytetyn paperin vetolujuus parani liuotinkäsittelyllä jopa kymmenkertaiseksi. Liuotinkäsittelyn tehokkuus riippui paljon käytettyjen selluloosakuitujen tyypistä ja niiden hemiselluloosa- ja ligniinipitoisuuksista
18
Vemulapalli, Shanthi. "Mobility-based route recovery from multiple node failures in movable sensor networks /". Available to subscribers only, 2009. http://proquest.umi.com/pqdweb?did=1967797561&sid=5&Fmt=2&clientId=1509&RQT=309&VName=PQD.
Texto completo
19
Borowiec, Anita. "New acrolein production route starting from alcohols mixtures over FeMo-based catalysts". Thesis, Lille 1, 2016. http://www.theses.fr/2016LIL10153/document.
Texto completoResumen
L'acroléine est le plus simple des aldéhydes insaturés, qui - en raison de sa réactivité élevée - trouve des applications comme produit intermédiaire dans l'industrie chimique (par exemple pour la synthèse d'acide acrylique et la production de méthionine (i.e. acide aminé essentiel)). Récemment, on a observé une augmentation de la demande mondiale de produits dérivés de l'acroléine, qui devrait croître de façon continue au cours des prochaines années. De nos jours, l’acroléine est obtenue par oxydation du propylène, et donc ce procédé est basé sur des ressources fossiles qui ne cessent de décroitre. Ce travail propose une nouvelle méthode de production d'acroléine à partir de matières premières renouvelables – un mélange d’alcools formé de méthanol et d'éthanol. Cette réaction a été étudiée et optimisée en travaillant sur : les conditions de réaction via l’établissement d’un plan d’expériences afin de minimiser le nombre de tests catalytiques à réaliser, les modifications de la formulation catalytique FeMoOx (i.e. différents rapports Mo / Fe, température de calcination, et l’ajout d’éléments basiques (e.g. La, Ce) pendant la synthèse) et enfin l’utilisation d’un second catalyseur pour balancer les propriétés acides-bases nécessaires à l’obtention de notre molécule cibleAcrolein is the simplest unsaturated aldehyde, which - due to its high reactivity - finds applications as an intermediate in the chemical industry (e.g., for acrylic acid and methionine production). Recently, a worldwide demand increase of acrolein derivatives was observed, which is expected to continuously grow within the next years. However, nowadays acrolein is commercially obtained by propylene oxidation, where the raw material comes from fossil resources. This work proposes a new method of acrolein production starting from renewable feedstock – methanol and ethanol mixture. This reaction was approached by reaction conditions optimization (i.e. Design of Experiment method do decrease the number of catalytic tests and save time), FeMoOx modifications (e.g. various Mo/Fe ratios, calcination temperature, and basic elements addition) and a second catalyst utilization (e.g. single commercial oxides and silica-based materials) in order to balance the acid base properties
20
VEMULAPALLI, SHANTHI. "MOBILITY-BASED ROUTE RECOVERY FROM MULTIPLE NODE FAILURES IN MOVABLE SENSOR NETWORKS". OpenSIUC, 2009. https://opensiuc.lib.siu.edu/theses/80.
Texto completoResumen
In wireless sensor networks (WSNs), maintaining connectivity with the sink node is a crucial issue to collect data from sensors without any interruption. While sensors are typically deployed in abundance to tolerate possible node failures, a number of such failures within the same region simultaneously may result in losing the connectivity with the sink node which eventually reduces the quality and efficiency of the network operation. Given that WSNs are deployed in inhospitable environments, such multiple node failures are very likely due to storms, volcano eruptions, floods, etc. To recover from these multiple node failures, in this thesis, we first present a local partition detection algorithm which makes the sensors aware of the partitioning in the network. We then utilize this information to recover the paths by exploiting sensor mobility. The idea is to locate the failed nodes by keeping complete routing information from each sensor to the sink node and move some of the sensors to such locations to re-establish the routes with the sink node. When performing the recovery, we make sure that the least number of nodes will be moving so that total movement distance can be minimized to improve the lifetime of the WSN. Our proposed approach depends only on the local information to not only minimize the messaging overhead on the sensors but also to ensure the scalability when large-scale Failures and larger networks are considered. The effectiveness of the proposed route recovery approach is validated through simulation experiments.
21
Lowther, Marcus Benjamin. "En route speed optimization for continuous descent arrival". Thesis, Atlanta, Ga. : Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/28271.
Texto completo
22
Kaul, Manohar. "Frequent Route Based Continuous Moving Object Location and Density Prediction on Road Networks". Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-155759.
Texto completoResumen
Emerging trends in urban mobility have accelerated the need for effective traffic management and prediction systems. Simultaneously, the widespread adoption of GPS-enabled mobile devices has opened radical new possibilities for such systems. Motivated by this development, this thesis proposes an end-to-end streaming approach for traffic management that encompasses a novel prediction model. The stream processing is achieved by a sliding window model. In particular, the approach performs online 1) management of the current evolving trajectories, 2) incremental mining of closed frequent routes and 3) prediction of near-future locations of the moving objects based on the current object trajectories and historical frequent routes. The approach proposes storage of closed frequent routes and all possible turns a moving object can make at a junction, in a FP-tree like structure. This structure is created on the-fly from the buffered contents of each constituent window of the trajectories stream and then used to determine probabilistic future locations of each moving object. It additionaly calculates the densities of moving objects and parked objects for the entire road network. The prototype implements the approach as extensions to SCSQ - a data stream management system (DSMS) developed at UDBL. SCSQ is an extension of Amos II which is an extensible, mainmemory OO DBMS. The solution utilizes SCSQ’s stream manipulation and windowing capabilities coupled with Amos II’s functionality to efficiently store, index and query frequent routes for prediction. The approach is empirically evaluated on a large real-world data set of moving object trajectories, originating from a fleet of taxis, showing that detailed closed frequent routes can be efficiently discovered and used for prediction.
23
Bai, Tongzhou. "Consistently estimating route choice models using indirect inference based on emprical observation data". Thesis, KTH, Transportvetenskap, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-43389.
Texto completoResumen
In the thesis, a proposed route choice model is tested on the empirical observation data. The model gives link specific errors to the links in the network, which allows natural correlation structure among paths. Indirect inference method is used to consistently estimate the route choice model, and a logit model is chosen to be the auxiliary model. The observation data with multiple OD pairs was collected in the Borlänge, a city located in the middle part of Sweden. Two main experiments are carried out, one with only one attribute, length to be specific in the route choice model and the other with two attributes, namely length and speed bump dummy. The final estimates of parameters have positive signs as anticipated and the magnitudes are reasonable. In addition, judging from the estimated binding functions, parameters in the cost function have negative effect on utility in the logti model and the parameter in the logit model are more apparently affected by its indirectly inferred parameter in the route choice model than the others do. Some other trials of the model are also carried out, but the estimates are not satisfying. This may be due to lack of attributes in the route choice model and further suggestion on better defined model is given out. A Monte Carlo experiment is also carried out to test the efficiency of model with unfixed scale parameter to the random term in the route choice model.
24
Hayes, Jennifer Anne. "Inflectional morphology and compounding in English : a single route, associative memory based account". Thesis, University of Hertfordshire, 2003. http://hdl.handle.net/2299/14138.
Texto completoResumen
Native English speakers include irregular plurals in English compounds (e. g., mice chaser) more frequently than regular plurals (e. g., *rats chaser) (Gordon, 1985). This dissociation in inflectional morphology has been argued to stem from an internal and innate morphological constraint as it is thought that the input to which English speaking children are exposed is insufficient to signal that regular plurals are prohibited in compounds but irregulars might be allowed (Marcus, Brinkmann, Clahsen, Weise & Pinker, 1995). In addition, this dissociation in English compounds has been invoked to support the idea that regular and irregular morphology are mediated by separate cognitive systems (Pinker, 1999). It is argued in this thesis however, that the constraint on English compounds can be derived from the general frequencies and patterns in which the two types of plural (regular and irregular) and the possessive morpheme occur in the input. In English both plurality (on regular nouns) and possession are denoted by a [-s] morpheme. It is argued that the constraint on the use of plurals in English compounds occurs because of competition between these two identical morphemes. Regular plurals are excluded before a second noun because the pattern -noun-[-sJ morpheme- noun- is reserved for marking possession in English. Irregular plurals do not end in the [-s] morpheme and as such do not compete with the possessive marker and consequently may be optionally included in compounds. Interestingly, plurals are allowed in compounds in other languages where this competitive relationship does not exist (e. g. Dutch (Schreuder, Neijt, van der Weide & Baayen, 1998) and French (Murphy, 2000). As well as not being in competition with the possessive structure irregular plurals also occur relatively infrequently in the input compared to regular plurals. This imbalance between the frequency of regular and irregular plurals in compounds also affects the way the two types of plural are treated in compounds. Thus there is no need for an innate mechanism to explain the treatment of plurals in English compounds. There is enough evidence available in the input to constrain the formation of compound words in English.
25
CROIN, LUCA. "A Si based technology route to chemical vapor deposition of large area graphene". Doctoral thesis, Politecnico di Torino, 2015. http://hdl.handle.net/11583/2593358.
Texto completoResumen
The era of two-dimensional materials has begun with graphene. It is the first artificially-isolated single-atom-thick material, which is also an exceptional example of its kind. With its extraordinary physical and chemical properties, it has become hugely popular among scientists and technologists isn a timeframe of less than a decade.
When first isolated, graphene has been a subject of fundamental research by condensed matter physicists. Later, the possibility to exploit graphene’s applicability have brought research toward methods for large scale production. One leading technique to obtain graphene is by its synthesis on sacrificial substrates by Chemical Vapor Deposition (CVD). Thus, a great deal of interest in research and development of graphene has risen all over the world.
This thesis work has been conducted at INRiM (Istituto Nazionale di Ricerca Metrologica) and has addressed the synthesis of graphene by CVD on copper, which has become the most popular catalyst for graphene growth. The entire CVD process, performed on both Cu thin films and foils, is here presented as well as transfer methods are discussed. Growth of graphene is discussed also in terms of direct deposition onto insulating substrates, and preliminary results are reported. Finally, a first approach on electrical characterization of graphene grown on Cu foils is described.
Although many aspect of graphene growth have been developed, the main work has been done on the growth of graphene on Cu thin films investigating the possibility of lowering the film thickness. This goal was in competition with dewetting phenomena: thin films energy minimization at high temperature, indeed, let the film to dewet forming holes and eventually islands. In chapter 3 is reported an analysis on Cu thin films dewetting, results of chapter 3 are used in chapter 4 where CVD on such thin films is reported. Chapter 5 deals with transferring methods of graphene, alongside of the "standard" method a new technique is proposed. In Chapter 6 the direct deposition onto insulating substrates is investigated via a method where Cu is used as a remote catalyzer. In the last chapter the electrical characterization of graphene is approached with the aim of demonstrating the feasibility of performing also this characterization procedure in INRiM labs.
26
Mofya, Enock Chisonge. "Exact and Heuristic Algorithms for Solving the Generalized Minimum Filter Placement Problem". Diss., Tucson, Arizona : University of Arizona, 2005. http://etd.library.arizona.edu/etd/GetFileServlet?file=file:///data1/pdf/etd/azu%5Fetd%5F1311%5F1%5Fm.pdf&type=application/pdf.
Texto completo
27
Martin, Lee Margaret. "Non-covalently cross-linked chitosan based hydrogels for drug delivery via the buccal route". Thesis, University of Strathclyde, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.248264.
Texto completo
28
SIVO, ANTONIO. "On the Laser Powder Bed Fusion based processing route for hard to weld Nickel Superalloys". Doctoral thesis, Politecnico di Torino, 2022. http://hdl.handle.net/11583/2971609.
Texto completo
29
Kahne, Brian C. "A Genetic Algorithm-Based Place-and-Route Compiler For A Run-time Reconfigurable Computing System". Thesis, Virginia Tech, 1997. http://hdl.handle.net/10919/36521.
Texto completoResumen
Configurable Computing is a technology which attempts to increase computational power by customizing the computational platform to the specific problem at hand. An experimental computing model known as wormhole run-time reconfiguration allows for partial reconfiguration and is highly scalable. In this approach, configuration information and data are grouped together in a computing unit called a stream, which can tunnel through the chip creating a series of interconnected pipelines.
The Colt/Stallion project at Virginia Tech implements this computing model into integrated circuits. In order to create applications for this platform, a compiler is needed which can convert a human readable description of an algorithm into the sequences of configuration information understood by the chip itself. This thesis covers two compilers which perform this task. The first compiler, Tier1, requires a programmer to explicitly describe placement and routing inside of the chip. This could be considered equivalent to an assembler for a traditional microprocessor. The second compiler, Tier2, allows the user to express a problem as a dataflow graph. Actual placing and routing of this graph onto the physical hardware is taken care of through the use of a genetic algorithm.
A description of the two languages is presented, followed by example applications. In addition, experimental results are included which examine the behavior of the genetic algorithm and how alterations to various genetic operator probabilities affects performance.Master of Science
30
Danielsson, Anna y Gabriella Gustafsson. "Link flow destination distribution estimation based on observed travel times for traffic prediction during incidents". Thesis, Linköpings universitet, Kommunikations- och transportsystem, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-170080.
Texto completoResumen
In a lot of big cities, the traffic network is overloaded, with congestion and unnecessary emissions as consequence. Therefore, different traffic control methods are useful, especially in case of an incident. One key problem for traffic control is traffic prediction and the aim of this thesis is to develop, calibrate and evaluate a route flow model using only observed travel times and travel demand as input. The route flow model was used to calculate the metric link flow destination distribution, that presents to which destinations the travelers on a link are going in percentage.
31
Ueng, Weng Bin y 翁文彬. "Wireless Internet Based Route Guidance System". Thesis, 2000. http://ndltd.ncl.edu.tw/handle/85675784602371187953.
Texto completoResumen
碩士國立臺灣科技大學
機械工程系
88
Conventional In-vehicle Route Guidance Systems often utilize closed and centralized architectures by placing road database management and optimal route calculation tasks in the computer on-board of the vehicle. Such approach usually has complicate hardware requirement. In addition, the road database in the vehicle cannot be dated easily and often lack real-time information. In this thesis we propose a new route guidance system based on wireless communication and Internet technologies. The system can be divided into three subsystems: Optimal Route Provider locates on a Internet-based server; Message Server transmit messages between the wireless data network and the Internet, and the on-board simplified Car PC that accepts user input and displays route guidance information received from remote server. By sharing route guidance tasks between these subsystems, optimal routes with real-time traffic considerations can be generated by a remote host, and in-vehicle Car PC have very simple hardware requirement due to the removal of the route calculation and database management tasks. For the system implementation, GSM/SMS is used as the wireless communication method, and the TCP/IP based Message Server and Optimal Route Provider is placed on the NTUST Computer Network. In-vehicle Route Guidance function such as optimal route and current position display, road name display, maneuver instruction, and off-route warning, are provided in a simple Dos program running in the on-board notebook PC. Actual road tests demonstrate very satisfactory results and show the huge potential of the proposed system.
32
Chen, Kuan-Ning y 陳冠寧. "A Study on AIS-based Route". Thesis, 2010. http://ndltd.ncl.edu.tw/handle/62989114357872589010.
Texto completoResumen
碩士國立臺灣海洋大學
通訊與導航工程系
98
This thesis aims to extract the most taken routes and high-risk areas in Taiwan waters in order to review current routes by efficiency and safety, assist the planning of ships’ routing, service dispatch, and the tracking of ships. Various spatial analysis techniques are used to explore the database of vessel dynamic reports received from a coastal network of automatic identification system (AIS) for application testing. Track generalization is implemented based on Douglas-Peucker Algorithm. DBSCAN Algorithm was used to find out the clustering of waypoints and crossovers of vessel tracks as well as directions of tracks. Grid-based line density algorithm was used to extract the center line of the most take route. Results from these analyses form a network of sea routes around Taiwan waters. The time of ship’s arrival and the routes that ships may sail can then be estimated with the aid of such information of the route network, no matter domestic routes or international routes.
33
Cheng, Chi-T'ing y 鄭吉廷. "Ajax-based Web Service for Route Planning". Thesis, 2007. http://ndltd.ncl.edu.tw/handle/13339257488701418525.
Texto completoResumen
碩士國立臺灣海洋大學
通訊與導航工程系
95
Abstract On the trend toward e-navigation, shipborne instruments are becoming fully replaced by automatic ones. However, modern automatic or traditional manual operating, navigation must rely on adequate navigational charts to fix the current location relative to the marine environment and to continue heading towards the destination. For safe and efficient navigation, every voyage must be well planned, and the first step is to have the most suitable, accurate, and updated charts prepared for the various stages of navigation. This thesis designs and implements a web service for voyage planning by utilizing AJAX web technology, spatial database, as well as the satellite image and maps provided by Google Map server. With this service, users can freely zoom and pan the geo-referenced maps and set waypoints by simple mouse clicks. Geographic coordinates, route distance, estimated voyage time are calculated accordingly. Available charts along the route are simultaneously retrieved from chart catalogue database for the user to interactively review the various chart coverage, scale or usage bands and decide on the final chart selections. Keyword：Route Planning、AJAX
34
李志宏. "NAT-Based Route Optimization for Mobile IP". Thesis, 2002. http://ndltd.ncl.edu.tw/handle/03422495711898509076.
Texto completoResumen
碩士南台科技大學
資訊管理系
90
The base Mobile IP has a routing problem called “triangle routing”. It means all datagrams sending to a mobile node have to be routed through its home agent. This indirect routing can significantly delay the delivery of the datagrams and increase the data traffic of network. Route Optimization can solve this problem, but each host communicating with a mobile host has to understand Mobile IP Route Optimization. Moreover, the tunneling technology cause more overhead on network traffic. In this thesis, we propose a novel solution called NAT-Based Route Optimization (NAT-RO) to this problem. We introduce a model that represents the features of the NAT-RO and measure round-trip time between mobile node and correspondent node. In addition, we investigate some implementation issues and propose the specification for the NAT-RO design.
35
Wu, Yong-Jiang y 吳永將. "Shore-based Route Monitoring,Prediction and Warning". Thesis, 2011. http://ndltd.ncl.edu.tw/handle/00324610039763790770.
Texto completoResumen
碩士國立臺灣海洋大學
通訊與導航工程學系
99
This thesis performs trajectory mining in vessel tracks received by the coastal network of automatic identification system (AIS) to construct representative segment database. By comparing the current vessel position and the representative segment database, the vessel’s most possible route and the navigation time of the route can be predicted, and better logistics or navigation support can be provided. Furthermore, traffic flow patterns revealed by these representative segments is valuable to related decision-makers such as the harbor or maritime authorities for use in the planning of "traffic separation scheme" or navigational aids, etc.. The implemented trajectory mining method is based on a partition-and-group framework for trajectory clustering proposed by J.G.Lee et al. , with the micro clustering method adapted for the mining of AIS trajectories.
36
Sung, Ren-Cheng y 宋仁誠. "Optimization of AP Election for Handoff Based on Route Optimization of AP Election for Handoff Based on Route History". Thesis, 2007. http://ndltd.ncl.edu.tw/handle/14708034223283438591.
Texto completoResumen
碩士國立屏東科技大學
資訊管理系
95
In WLAN, a mobile node (MN) accesses the network through access points (APs). As traveling, the MN may be handed over from one AP to another to maintain the connection. In a high-density-AP-deployment area, there could be several APs available for the MH to choose from. A simple strategy is to choose the AP with the best signal quality. However such a strategy may result in some redundant handoffs because of user movement and dynamic change of AP’s signal strength. Therefore, in this research, based on the assumption that repetitive path patterns exist, we present a historical-based optimal handoff scheme. In principle, the MN uses the signal-strength-based approach for the first trial of a path. During each AP handoff, the MH analyzes the redundancy of the AP and marks it as optimal if it is indispensable. When taking the same route again, the MN will choose the optimal APs to handoff directly. Through simulation, we show that our scheme can help reducing redundant handoffs with great significance particularly in an environment with high AP density and strong repetitive path patterns.
37
Alrabaee, Saed Saleh. "QoS based Route Management in Cognitive Radio Networks". Thesis, 2012. http://spectrum.library.concordia.ca/974461/1/Alrabaee_MASc_F2012.pdf.
Texto completoResumen
Cognitive radio networks are smart networks that automatically sense the channel and adjust the network parameters accordingly. Cognitive radio is an emerging technology that enables the dynamic deployment of highly adaptive radios that are built upon software defined radio technology. The radio technology allows the unlicensed operation to be in the licensed band. The cognitive radio network paradigm therefore raises many technical challenges such as the power efficiency, spectrum management, spectrum detection, environment awareness, the path selection as well as the path robustness, and security issues.
Traditionally, in the routing approaches in the wired network, each node allows a maximum load through the selected route while traditionally in the routing approaches in wireless network, each node broadcasts its request with the identification of the required destination. However, the existing routing approaches in cognitive radio networks (CRN) follow the traditional approaches in wireless network especially those applied for ad hoc networks. In addition, these traditional approaches do not take into account spectrum trading as well as spectrum competition among licensed users (PUs).
In this thesis, a novel QoS based route management approach is proposed by introducing two different models; the first model is without game theory and the second model is with game theory. The proposed QoS routing algorithm contains the following elements: (i) a profile for each user, which contains different parameters such as the unlicensed user (secondary user, SU) identification, number of neighbors, channel identification, neighbor identification, probabilities of idle slots and the licensed user (primary user, PU) presence. In addition, the radio functionality feature for CRN nodes gives the capability to sense the channels and therefore each node shares its profile with the sensed PU, which then exchanges its profile with other PUs, (ii) spectrum trading, a PU calculates its price based on the SU requirements, (iii) spectrum competition, a new coefficient α is defined that controls the price because of competition among PUs and depends on many factors such as the number of primary users, available channels, and duration of the usage, (iv) a new function called QoS function is defined to provide different levels of quality of service to SUs, and (v) the game theory concept adds many features such as the flexibility, the dynamicity in finding solutions to the model and the dynamic behaviors of users. Based on the previous elements, all possible paths are managed and categorized based on the level of QoS requested by SUs and the price offered by the PU. The simulation results show that the aggregate throughput and the average delay of the routes determined by the proposed QoS routing algorithm are superior to existing wireless routing algorithms. Moreover, network dynamics is examined under different levels of QoS.
38
Min-CheWu y 吳旻哲. "Biking Route Planning Based on Target Calorie Comsumption". Thesis, 2010. http://ndltd.ncl.edu.tw/handle/58860763748807600959.
Texto completoResumen
碩士國立成功大學
資訊管理研究所
98
Cycling becomes more popular recently, because it is not only environmentally friendly, but also a more pleasant way to lose weight. Conventional researches in route planning usually focus on selecting a route of minimum time, distance, or risks. This thesis, on the other hand, aims at methodologies to generate a least risky biking route that satisfies the calorie consumption requirement specified by the cyclist. We first introduce methods to estimate risks associated with nodes or arcs and propose a calorie consumption formula that takes the 3-dimensional geographical data over each route segment, the biking velocity and weight of the cyclist, and the speed and direction of the wind into consideration. Three categories of biking routes: simple paths, eulerian subgraphs, and general circuits are investigated. These are NP-hard integer programming problems. Their IP formulations have to include plenty of subtour elimination constraints due to the lower bound in the calorie consumption. The problem of seeking an optimal biking route of the first category (i.e. an optimal simple path) can be viewed as a specialized constrained shortest path (CSP). We have exploit variants of conventional CSP methodologies such as K-shortest path (KSP) algorithms and Lagrangian Relaxation (LR), but found they both consume too much time. We then develop variants of Genetic Algorithms (GA) and Particle Swarm Optimization (PSO) heuristics to efficiently calculate an optimal biking route. Moreover, we also derive valid inequalities that generate new cuts in the branch-and- cut scheme and conduct preprocessing to simplify the network, so that the IP solution time is further reduced. To effciently seek optimal biking routes that are circuits, we also propose a few GA and PSO heuristics that involve different encoding mechanisms. Computational experiments indicate our proposed PSO heuristics are more effcient and effective than the state-of-the-art IP solver and GA, for solving these three categories of biking routes, and thus are suitable for real-world implementation.
39
Chiang, Ho-Chun y 江和俊. "A Gateway-based Mobile IP with Route Optimization". Thesis, 2005. http://ndltd.ncl.edu.tw/handle/73088494129291280569.
Texto completoResumen
碩士國立交通大學
電機資訊學院碩士在職專班
93
Mobile IP has some limitations due to triangle routing, handoff latency, and packet lost during handoff process. In this thesis, we will focus on the route optimization and propose an approach to solve the triangle routing problem in Mobile IP network. In addition to home agent, foreign agent, mobile node, and correspondent node, we add a new functional entity, called Cache Agent (CA), to our approach. The CA is a gateway and functions as a mobility agent in the correspondent network to support route optimization between mobile node and correspondent node. In this architecture, all correspondent nodes do not require installing any mobility software to support route optimization. By deploying CAs in the network, the triangle routing problem can be eliminated and the throughput between mobile node and correspondent node can be improved.
40
Pimentel, Sérgio Bairos. "Drone Route Optimization using Constrained Based Local Search". Master's thesis, 2018. http://hdl.handle.net/10362/59500.
Texto completoResumen
This dissertation focuses on an optimization problem that consists of finding the best
flight plan (i.e. routes) for an Unmanned Aerial Vehicle (UAV), or drone, overflying a
farming field that needs to be swept and sprayed with fertilizers or pesticides. This system
calculates an optimal route for a crop field, having into consideration that the field needs
to be swept and covered entirely. Drones have been around for many years, especially in
the military, but only recently they have expanded to other fields, including agriculture,
which makes it a particularly interesting field of study. The drones we consider in this
thesis are not any regular type of drone for common use, but rather a specially adapted
drone for agriculture to facilitate the process of farming. These drones fly close to the
ground spraying fertilizers using specialized extension tools. Therefore, the main problem
is to search for an efficient route that sweeps the field and saves as much resources as
possible. Additionally, the resolution to this problem should not only consist of searching
for an ideal route, but also to help the user in planning and selecting a desired field. Some
factors need to be taken into account when considering such problems such as legislation,
drone’s energy consumption, and environment related variables such as field elevations
or man-made infrastructures. This system is built using local search as a basis, which
essentially consists in making small changes to a solution, improving it iteratively until
some near optimal solution is hopefully found.
41
Tao, Bo-Chuan y 陶伯川. "Improving route planning based on road reservation system". Thesis, 2018. http://ndltd.ncl.edu.tw/handle/52u48b.
Texto completo
42
Chen, Chung-Lin y 陳重霖. "Advanced route recovery based on degree in MAODV". Thesis, 2007. http://ndltd.ncl.edu.tw/handle/a42vx2.
Texto completoResumen
碩士國立臺北科技大學
電腦與通訊研究所
95
Mobile Ad Hoc Network (MANET) needs no infrastructure. Its characteristics of network include self-creating, self-organizing and self-administrating. It consists of mobile nodes. Packets are routed and forwarded via multi-hop peer-to-peer protocol between nodes to the destination node. In multicast routing of MANET, the mobility of mobile hosts frequently make the routes broken, and leads to the lower data packet ratio. The purpose of this study is to propose “An advance route recovery based on degree” to reduce the link breakage for the tree-based topology of multicast in MANET. For the Multicast Ad hoc On-demand Distance Vector (MAODV), the route maintenance could detect the link breakage when the node does not receive any packets from the upstream node after a certain time. However, the re-active route maintenance does not the different influence on different tree degree, and the same waiting time cannot reflect the real topology situation. MAODV initiates tree repair after some nodes losing packets, but it reduces the delivery rate of data packet. Our proposes an advance route recovery based on degree for the MAODV. The node based on the tree degree could obtain better link information from the structure of multicast tree, and initiates tree repair to promote the efficiency of routes in MANET. The simulation results show that the advance route recovery based on degree could improve the route maintenance of MAODV, increase the delivery rate of data packet and reduce the control overhead.
43
Cheng-Hao, Wang y 王呈豪. "Synthesizing a NPR Navigating Animation Based on Route Recommendation". Thesis, 2015. http://ndltd.ncl.edu.tw/handle/93340633719596099549.
Texto completoResumen
碩士國立暨南國際大學
資訊工程學系
103
As science and technology continue to progress, we can retrieve almost all of the latest information of human society through mobile devices. We are also getting used to living with these new information technologies. For example, Google Map and Open Street Map have become very popular and important tools for viewing street maps in recent years. Every day, a tremendous amount of map information is up/downloaded. For the purpose of map navigations, the research field of Route Recommendation has proposed several convenient and useful tools. However, most of these results are provided on a 2D planar map. For users, it is unintuitive and difficult to imagine realistic 3D scenes by only watching these linked line segments on a 2D map. Moreover, although many online maps provide photorealistic street views, these images are usually too complicated and containing too much unnecessary information. These pictures are also fixed and invariant regardless of the weather and season. Therefore, in this research, we propose a novel navigation system which visualizes the results of route recommendation with NPR animation effects. Furthermore, by combining Non-Photorealistic Rendering techniques with the Open Weather Map, our system aims to create more interesting scenery with the real-time weather effects.
44
Zheng, Ji-Ren y 鄭吉仁. "A Novel SIP-based Route Optimization for Network Mobility". Thesis, 2005. http://ndltd.ncl.edu.tw/handle/78995144392940536339.
Texto completoResumen
碩士國立成功大學
資訊工程學系碩博士班
93
With the provision of various wireless services, e.g., 3G and WLAN, more and more people request to access the Internet anywhere at anytime. For example, people can check their e-mails while commuting on the bus or watch the on-line news while traveling by train. Therefore, IETF proposed the concept of mobile networks, i.e., a set of users moves as a unit. We motivate the network mobility problem by considering the state-of-the-art scenario of the basic NEtwork MObility (NEMO) protocol that is extended from the Mobile IPv6 (MIPv6). In order to avoid the same problems suffered by MIPv6, a new SIP-based network mobility management called SIP-NEMO is designed and proposed in this thesis. The proposed SIP-NEMO not only copes with the movement of a mobile network but also achieves the route optimization between two SIP clients, in which one is inside the mobile network and the other one is outside the mobile network, even if the mobile network is nested. In this thesis, we also analytically compute and simulate the performance of SIP-NEMO with the basic NEMO protocol proposed by IETF.
45
Russell, Brian. "Learning-based route management in wireless ad hoc networks". 2008. http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.17559.
Texto completo
46
Hung, Wei-Chi y 洪蔚齊. "The Route Planning in Flooded Areas Based on Indexing Techniques". Thesis, 2015. http://ndltd.ncl.edu.tw/handle/aqm9b8.
Texto completoResumen
碩士國立臺灣海洋大學
資訊工程學系
103
The disaster brought by heavy rain has become more and more serious in Taiwan. In the past, a researcher has studied the problem of planning an unflooded path from the given origin to the destination, and proposed two approaches. The first one is called the Baseline approach. It mainly picks out the roads passing through flooded areas, and invokes the Dijkstra algorithm to determine the shortest path based on the remaining unflooded roads. The second proposed approach, called Cloud, utilizes the Google Maps routing planning service to get an initial shortest path. If the path passes through flooded areas, the system will identify nearby alternative roads and re-plan again. The main goal of this thesis is to improve the efficiency of the two existing approaches by using indexing techniques. For the Baseline approach, we consider the task of determining whether a road is flooded or not, and explore the possibilities of using roads or flooded areas to build indices, respectively. As to the Cloud approach, we consider the task of identifying the nearby alternative roads for a flooded road, and discuss two types of indices. The first one extends the road index constructed for the Baseline approach. The second one uses intersections to build the index. We have implemented these different indices, and performed a series of experiments to compare their performance. Experimental results show that the Cloud approach with indices is much more efficient than the Baseline approach with indices. The difference may be up to an order of magnitude when the road network is large. Besides, although the Cloud approach cannot always output a path without passing through flooded areas at the first time, it may achieve ninety percent of success rates if it is allowed to adjust its route up to three times.
47
tyasnurita, raras y 劉樂斯. "Adaptive Route Recommendation by Using Neural Based Fuzzy Inference Systems". Thesis, 2011. http://ndltd.ncl.edu.tw/handle/20135854290044122749.
Texto completoResumen
碩士國立臺灣科技大學
工業管理系
100
Transportation is a key component of economic growth, however the increasing population nowadays cause traffic congestion becomes a challenging issue. Intelligent Transportation Systems (ITS) with its technology progressivity had been a powerful solution to increase transportation efficiency. One promising option among ITS is Advanced Traveler Information Systems (ATIS) which enable driver in having less frustrated driving experience by providing valuable real time information. Even though this system capable in guiding driver to reach destination, the recommendation will not always be the optimal one because different drivers have different personal preferences. Moreover, the route selection system can be based on the driver attributes, route characteristics, and situational factors with different degree of importance which make the system be more difficult to generate a right recommendation for the driver. Due to these facts, self learning ability in the system becomes necessary. Navigation systems requires to be able to personalize to individual driver by adapt to driver’s behavior. The ability of the system to responsively self-adjust upon change is the objective here. Therefore, Adaptive Neural Fuzzy Inference Systems (ANFIS) is used to model the vague attributes which is come from the driver’s feedback and then learn it by itself. It has both advantages of Fuzzy Logic which has a role as an excellent tool for modeling human thought and Neural Network for the learning capability. Finally the system will gradually improve the model in order to give a better route suggestion corresponding to driver’s inclination.
48
Hung, Shin-Chiech y 洪士傑. "A Mobile Platform Accessible Cloud-Based Dynamic Route Planning Service". Thesis, 2011. http://ndltd.ncl.edu.tw/handle/84386705581573461182.
Texto completoResumen
碩士國立臺灣海洋大學
電機工程學系
99
Due to lack of real-time traffic flow data, most traditional route planning services can only respond to a path-finding request by drawing a path that is either the shortest by mileage or the fastest by allowable speed grade. Route planning services based on this type of strategy might be useful in finding relatively long routes extending over a large area covering multiple cities or counties. However, for metropolitan areas, especially during rush hour, this type of strategy is likely to cause a number of problems as follows. First, route planning requests generated during a certain time window with same starting location and destination combinations may be directed to the same route, thus causing congestion. Second, for requests with different starting location and destination pairs, as long as their starting locations (or destinations) are close enough, the routes suggested may still overlap partially and cause congestion as well. Last and the most fundamental problem is that traffic flow changes with time. The shortest path planned for an original starting/ending pair may suddenly become very time-consuming because of ever changing traffic flow and unexpected road mishaps. To resolve these problems, a route planning system must take into account real-time traffic information. Therefore, the goal of this research is to develop a cloud computing based dynamic route planning service. Using Google App Engine, we have developed a dynamic route planning service on the foundation of an augmented A* pathfinding algorithm. The algorithm accepts as a parameter the real-time municipal traffic flow information extracted from a server administered by the Department of Transportation, Taipei City Government, and updates the pending routes should the condition for re-routing arise. To obtain the service, users can use any smartphone or suitable mobile device to connect to the Google platform. We currently support the Android Mobile Platform only. Experimental results show that our system is successful in providing effective and time-saving route planning service. Out of 178 simulated runs, the system succeeded in re-routing the user’s requests with faster new paths 160 times. The success rate is about 90%. Key words：Dynamic route planning, cloud computing, A* algorithm, real-time traffic information, Android.
49
Lee, Kun-Da y 李坤達. "A route-based algorithm for task assignment in Telecommunications system breakdown". Thesis, 2012. http://ndltd.ncl.edu.tw/handle/55111789059836809047.
Texto completoResumen
碩士國立交通大學
資訊學院資訊學程
100
The digital era, telecommunication is in our every aspect of life. Accordingly, the repair and maintenance of the telecommunication systems and facilities are also important. The most serious damages are always associated with the shortage of maintenance personnel and resource when the large disasters such as typhoons and earthquakes occur. Therefore, how to improve maintenance efficiency and reduce the failure of telecommunication systems by using demand for information, maintenance resources and planning maintenance path in order to decrease the effects on society has become an important issue. In this study, task assignment of telecommunication system breakdown contains resource allocation and path selection . Resource allocation of resources refers to allocation of the maintenance equipments (materials) and maintenance personnel. A good the path selection is the shortest traveling distance and the minimal congestion. Moreover, the most efficient dispatching method is to arrive the the repair site at the shortest time. An efficient dispatching method is beneficial for resource allocation. Found to comply with the limits for the telecommunications system task assignment, in order to achieve every dispatching can make the repair efficiency highest in the shortest possible time, to reach the fault location. We use the Minimal File Spanning Tree(MFST) algorithm to identify all dispatching path complying with the constraints. The use of different maintenance points have different maintenance efficiency, to calculate the waiting time for an assignment, the highest dispatching path to identify a minimum delay time and maintenance efficiency. Keyword: Task Assignment Problem、Resource Allocation、Path Selection、Minimal File Spanning Tree
50
Huang, Ting-Yao y 黃廷耀. "Formation of Al-based Bulk Amorphous Alloys by Powder Metallurgy Route". Thesis, 2009. http://ndltd.ncl.edu.tw/handle/35257539434916980353.
Texto completoResumen
碩士大同大學
材料工程學系(所)
97
This study examined the amorphization behavior of Al-based alloy powders synthesized by mechanical alloying technique and consolidated by vacuum hot pressing for Al60Ti35Ni2Si3, Al60Ti35Ni2B3, Al60Ti35Ni2Cu3, (Al75Cu17Mg8)97Ni3 and (Al75Cu19Mg6)97Ni3 alloys. Surface oxidation of powders in milling and consolidation processes led to larger amount of porosity and bad bulk forming ability. In addition, the hardness of the bulk amorphous alloys is 336.2 Hv for Al60Ti35Ni2Si3, 315.8 Hv for Al60Ti35Ni2B3, 309.8 Hv for Al60Ti35Ni2Cu3, 321.4 Hv for (Al75Cu17Mg8)97Ni3 and 317.6 Hv for (Al75Cu19Mg6)97Ni3, respectively. Furthermore, (Al75Cu17Mg8)97Ni3 and (Al75Cu19Mg6)97Ni3 bulk amorphous alloys were found to exhibit a better corrosion resistance evaluated by potentiodynamic polarization measurements in 3.5wt% NaCl solution.