scholarly journals Timeliness-Aware On-Site Planning Method for Tour Navigation

Smart Cities ◽  
2020 ◽  
Vol 3 (4) ◽  
pp. 1383-1404 ◽  
Author(s):  
Shogo Isoda ◽  
Masato Hidaka ◽  
Yuki Matsuda ◽  
Hirohiko Suwa ◽  
Keiichi Yasumoto

In recent years, there has been a growing interest in travel applications that provide on-site personalized tourist spot recommendations. While generally helpful, most available options offer choices based solely on static information on places of interest without consideration of such dynamic factors as weather, time of day, and congestion, and with a focus on helping the tourist decide what single spot to visit next. Such limitations may prevent visitors from optimizing the use of their limited resources (i.e., time and money). Some existing studies allow users to calculate a semi-optimal tour visiting multiple spots in advance, but their on-site use is difficult due to the large computation time, no consideration of dynamic factors, etc. To deal with this situation, we formulate a tour score approach with three components: static tourist information on the next spot to visit, dynamic tourist information on the next spot to visit, and an aggregate measure of satisfaction associated with visiting the next spot and the set of subsequent spots to be visited. Determining the tour route that produces the best overall tour score is an NP-hard problem for which we propose three algorithms variations based on the greedy method. To validate the usefulness of the proposed approach, we applied the three algorithms to 20 points of interest in Higashiyama, Kyoto, Japan, and confirmed that the output solution was superior to the model route for Kyoto, with computation times of the three algorithms of 1.9±0.1, 2.0±0.1, and 27.0±1.8 s.

Smart Cities ◽  
2020 ◽  
Vol 3 (2) ◽  
pp. 212-231 ◽  
Author(s):  
Masato Hidaka ◽  
Yuki Kanaya ◽  
Shogo Kawanaka ◽  
Yuki Matsuda ◽  
Yugo Nakamura ◽  
...  

Recently, due to the drastic increase in foreign tourists coming to Japan, there has been a demand to provide smart tourism services that enable inbound tourists to comfortably enjoy sightseeing. To provide satisfactory experiences for tourists, it is desirable to provide tourist information in a timely manner by considering dynamic information, which is information that changes over time, such as current congestion information in destination spots and travel route information, in addition to static information, such as the preferences and profiles of tourists. However, in many existing systems, serious problems occur, such as (1) a lack of support for on-site use, (2) a lack of consideration of dynamic information, and (3) heavy burden on tourists. In this paper, we propose a novel system that can provide tourism plans for tourism spots in a timely manner. The proposed system consists of the following two key mechanisms: (A) A mechanism for acquiring preference information from tourists (including preference on dynamic information); (B) a curation mechanism for realizing on-site tourism. To demonstrate the effectiveness of the proposed system, we carried out evaluation experiments utilizing real tourism spots and simulations. As a result, we obtained the following primary findings: (1) On-site tourism spot recommendation is effective for tourists who do not make detailed tourism plans before sightseeing; (2) preference information for participants can be reflected in the tourism spot recommendation while massively reducing the burden on participants; (3) it is possible to obtain a higher satisfaction level than is achieved with model courses, which are often used for sightseeing.


Symmetry ◽  
2020 ◽  
Vol 12 (10) ◽  
pp. 1710
Author(s):  
Mojisola Grace Asogbon ◽  
Oluwarotimi Williams Samuel ◽  
Yanbing Jiang ◽  
Lin Wang ◽  
Yanjuan Geng ◽  
...  

The constantly rising number of limb stroke survivors and amputees has motivated the development of intelligent prosthetic/rehabilitation devices for their arm function restoration. The device often integrates a pattern recognition (PR) algorithm that decodes amputees’ limb movement intent from electromyogram (EMG) signals, characterized by neural information and symmetric distribution. However, the control performance of the prostheses mostly rely on the interrelations among multiple dynamic factors of feature set, windowing parameters, and signal conditioning that have rarely been jointly investigated to date. This study systematically investigated the interaction effects of these dynamic factors on the performance of EMG-PR system towards constructing optimal parameters for accurately robust movement intent decoding in the context of prosthetic control. In this regard, the interaction effects of various features across window lengths (50 ms~300 ms), increments (50 ms~125 ms), robustness to external interferences and sensor channels (2 ch~6 ch), were examined using EMG signals obtained from twelve subjects through a symmetrical movement elicitation protocol. Compared to single features, multiple features consistently achieved minimum decoding error below 10% across optimal windowing parameters of 250 ms/100 ms. Also, the multiple features showed high robustness to additive noise with obvious trade-offs between accuracy and computation time. Consequently, our findings may provide proper insight for appropriate parameter selection in the context of robust PR-based control strategy for intelligent rehabilitation device.


2019 ◽  
Vol 12 (1) ◽  
pp. 257
Author(s):  
Gianmarco Garrisi ◽  
Cristina Cervelló-Pastor

This paper focuses on optimizing the schedule of trains on railway networks composed of busy complex stations. A mathematical formulation of this problem is provided as a Mixed Integer Linear Program (MILP). However, the creation of an optimal new timetable is an NP-hard problem; therefore, the MILP can be solved for easy cases, computation time being impractical for more complex examples. In these cases, a heuristic approach is provided that makes use of genetic algorithms to find a good solution jointly with heuristic techniques to generate an initial population. The algorithm was applied to a number of problem instances producing feasible, though not optimal, solutions in several seconds on a laptop, and compared to other proposals. Some improvements are suggested to obtain better results and further improve computation time. Rail transport is recognized as a sustainable and energy-efficient means of transport. Moreover, each freight train can take a large number of trucks off the roads, making them safer. Studies in this field can help to make railways more attractive to travelers by reducing operative cost, and increasing the number of services and their punctuality. To improve the transit system and service, it is necessary to build optimal train scheduling. There is an interest from the industry in automating the scheduling process. Fast computerized train scheduling, moreover, can be used to explore the effects of alternative draft timetables, operating policies, station layouts, and random delays or failures.


2012 ◽  
Vol 3 (1) ◽  
pp. 80-99 ◽  
Author(s):  
Ritu Garg ◽  
Awadhesh Kumar Singh

Grid provides global computing infrastructure for users to avail the services supported by the network. The task scheduling decision is a major concern in heterogeneous grid computing environment. The scheduling being an NP-hard problem, meta-heuristic approaches are preferred option. In order to optimize the performance of workflow execution two conflicting objectives, namely makespan (execution time) and total cost, have been considered here. In this paper, reference point based multi-objective evolutionary algorithms, R-NSGA-II and R-e-MOEA, are used to solve the workflow grid scheduling problem. The algorithms provide the preferred set of solutions simultaneously, near the multiple regions of interest that are specified by the user. To improve the diversity of solutions we used the modified form of R-NSGA-II (represented as M-R-NSGA-II). From the simulation analysis it is observed that, compared to other algorithms, R-e-MOEA delivers better convergence, uniform spacing among solutions keeping the computation time limited.


2014 ◽  
Vol 931-932 ◽  
pp. 1382-1386 ◽  
Author(s):  
Duangduen Asavasuthirakul ◽  
Antony Harfield ◽  
Kraisak Kesorn

Planning each comprehensive trip is regarded as a complicated and time-consuming task which includes the process starting from searching specific tourist information to planning an itinerary in unfamiliar areas. In response to the decision making challenges that tourists may encounter in planning a trip or discovering a destination, this paper proposes an integrated framework for a system supporting tourists in Thailand. The aim of the framework is to provide a service that considers data from a variety of sources, including static and social data, and then recommends points of interest (POI) and itineraries for POI, based on the requirements and interests of the user. The framework consists of three components: a personalized POI recommendation engine, an itinerary planner, and a mobile application. Together these form the foundation of a personalized travelling information system for Thailand. This paper outlines the basic framework and provides a discussion on the potential issues encountered.


Author(s):  
Milad Yousefi ◽  
Moslem Yousefi ◽  
Danial Hooshyar ◽  
Jefferson Ataide de Souza Oliveira

In this paper, an evolutionary-based approach based on the discrete particle swarm optimization (DPSO) algorithm is developed for finding the optimum schedule of a registration problem in a university. Minimizing the makespan, which is the total length of the schedule, in a real-world case study is considered as the target function. Since the selected case study has the characteristics of job shop scheduling problem (JSSP), it is categorized as a NP-hard problem which makes it difficult to be solved by conventional mathematical approaches in relatively short computation time.


2020 ◽  
Vol 1 (1) ◽  
pp. 28-50
Author(s):  
Sven Gross ◽  
Dominik Huber

In recent years more and more tourist information boards have been put up on German motorways. Little research exists with regard to the effects of these information boards. A qualitative research approach was used and 29 semi-structured interviews were conducted to increase knowledge about the relationships between tourist information boards and related tourism behaviour. A model was developed which integrates the elements perception of tourist motorway signage, its memory effects and tourism decision-making processes. Findings suggest that spontaneous driving off the motorway is rarely found and points of interest are more likely to be visited after the trip or used as travel inspiration. This study shows for the first time that tourist information boards can play an important role in tourism decision-making processes and resulting behaviours.


Author(s):  
Abba Suganda Girsang ◽  
Tjeng Wawan Cenggoro ◽  
Ko-Wei Huang

<p>Data clustering is popular data analysis approaches, which used to organizing data into sensible clusters based on similarity measure, where data within a cluster are similar to each other but dissimilar to that of another cluster. In the recently, the cluster problem has been proven as NP-hard problem, thus, it can be solved with meta-heuristic algorithms, such as the particle swarm optimization (PSO), genetic algorithm (GA), and ant colony optimization (ACO), respectively. This paper proposes an algorithm called Fast Ant Colony Optimization for Clustering (FACOC) to reduce the computation time of Ant Colony Optimization (ACO) in clustering problem. FACOC is developed by the motivation that a redundant computation is occurred in ACO for clustering. This redundant computation can be cut in order to reduce the computation time of ACO for clustering. The proposed FACOC algorithm was verified on 5 well-known benchmarks. Experimental result shows that by cutting this redundant computation, the computation time can be reduced about 28% while only suffering a small quality degradation.</p>


2018 ◽  
Vol 10 (1) ◽  
Author(s):  
Andrew Walsh

ObjectiveCharacterize the behavior of nonparametric regression models for message arrival probability as outage detection tools.IntroductionTimely and accurate syndromic surveillance depends on continuous data feeds from healthcare facilities. Typical outlier detection methodologies in syndromic surveillance compare predictions of counts for an interval to observed event counts, either to detect increases in volume associated with public health incidents or decreases in volume associated with compromised data transmission.Accurate predictions of total facility volume need to account for significant variance associated with the time of day and week; at the extreme are facilities which are only open during limited hours and on select days. Models need to account for the cross-product of all hours and days, creating a significant data burden. Timely detection of outages may require sub-hour aggregation, increasing this burden by increasing the number of intervals for which parameters need to be estimated.Nonparametric models for the probability of message arrival offer an alternative approach to generating predictions. The data requirements are reduced by assuming some time-dependent structure in the data rather than allowing each interval to be independent of all others, allowing for predictions at sub-hour intervals.MethodsHealthcare facility data was collected as HL7 messages via the EpiCenter syndromic surveillance system from June 1, 2017 through August 31, 2017. 713 facilities sent at least 1,000 messages during this period and were included in the analysis.Standard Poisson regression models were fit to counts of messages per quarter hour. Predictors were indicators for day of week, hour of day, and quarter of hour, along with interaction terms between them.Nonparametric logistic regression models were fit to data on the presence or absence of any message for each minute of the first two months of the study period, using the minute within the week as a predictor. The last month of data was scanned for outages at 15-minute intervals and calculating the probability of no messages since the last received message per facility as:P(Gap from mlast to mnow) = ∏t 1 - Pmessage(t)Four consecutive intervals with probability below 1-10 were considered outages.ResultsA total of 12,710,275 ADT A04 messages were received from 713 facilities from June 1, 2017 through August 31, 2017.Estimation of Poisson regression models averaged 1 minute, while nonparametric models averaged 1.5 minutes to estimate. Poisson models required 672 parameters to specify, whereas nonparametric models required 29. Calculating predictions from fitted models averaged 0.2 seconds for Poisson models and 2 seconds for nonparametric models. Although predictions from the two models are not on identical scales and thus not directly comparable, they did correlate well with each other with an average correlation of 0.8.The nonparametric regression method detected 175 resolved outages and 9 open outages in August, 2017. The resolved outages lasted an average of 1.5 days (1.75 hours to 15 days). The likelihood of these outages averaged 6e-13 (3e-160 to 4e-11).Figure 1 illustrates how the nonparametric models can be used in a dashboard for all 713 connections. Likelihood of an outage is available for each facility based on how long it has been since the last message was received; this can be updated every minute as needed. Figure 2 illustrates the predictions from a nonparametric model for a single facility and a detected outage.ConclusionsNonparametric regression models of message arrival demonstrated suitable performance for use in detecting connection outages. Compared to standard Poisson regression models, computation time for nonparametric models was longer but within acceptable ranges for operational needs and storage was significantly reduced. Further, storage and computation time for standard models will increase if greater time granularity is desired, whereas the nonparametric models require no additional storage or computation. Model predictions were sufficiently similar between both models for the two to give comparable performance in detecting outages. Given the greater time flexibility of the nonparametric models and the smaller data requirements for initial model estimation (due to fewer estimated parameters), the nonparametric approach represents a promising new option for monitoring syndromic surveillance data quality. 


Author(s):  
J. M. Pankratz

It is often desirable in transmission electron microscopy to know the vertical spacing of points of interest within a specimen. However, in order to measure a stereo effect, one must have two pictures of the same area taken from different angles, and one must have also a formula for converting measured differences between corresponding points (parallax) into a height differential.Assume (a) that the impinging beam of electrons can be considered as a plane wave and (b) that the magnification is the same at the top and bottom of the specimen. The first assumption is good when the illuminating system is overfocused. The second assumption (the so-called “perspective error”) is good when the focal length is large (3 x 107Å) in relation to foil thickness (∼103 Å).


Sign in / Sign up

Export Citation Format

Share Document