In this paper, we propose a safe and comprehensive route finding algorithm for pedestrians based on lighting and landmark conditions. Safety and comprehensiveness can be predicted by the five possible indicators: (1) lighting conditions, (2) landmark visibility, (3) landmark effectiveness, (4) turning counts along a route, and (5) road widths. We first investigate impacts of these five indicators on pedestrians' perceptions on safety and comprehensiveness during route findings. After that, a route finding algorithm is proposed for pedestrians. In the algorithm, we design the score based on the indicators (1), (2), (3), and (5) above and also introduce a turning count reduction strategy for the indicator (4). Thus we find out a safe and comprehensive route through them. In particular, we design daytime score and nighttime score differently and find out an appropriate route depending on the time periods. Experimental simulation results demonstrate that the proposed algorithm obtains higher scores compared to several existing algorithms. We also demonstrate that the proposed algorithm is able to find out safe and comprehensive routes for pedestrians in real environments in accordance with questionnaire results.

This paper presents a method of calculating an interval including a bifurcation point. Turning points, simple bifurcation points, symmetry breaking bifurcation points and hysteresis points are calculated with guaranteed accuracy by the extended systems for them and by the Krawczyk-based interval validation method. Taking several examples, the results of validation are also presented.

This paper is concerned with the validation of simple turning points of two-point boundary value problems of nonlinear ordinary differential equations. Usually it is hard to validate approximate solutions of turning points numerically because of it's singularity. In this paper, it is pointed out that applying the infinite dimensional Krawcyzk-based interval validation method to enlarged system, the existence of simple turning points can be verified. Taking an example, the result of validation is also presented.

In the present paper, we focus ourselves on the turning point (TP) algorithm proposed by Mueller and evaluate its performance when applied to a Gaussian signal with definite covariance function. Then the ECG wave is modeled by Gaussian signals: namely, the ECG is divided into two segments, the baseline segment and the QRS segment. The baseline segment is modeled by a Gaussian signal with butterworth spectrum and the QRS one by a narrow-band Gaussian signal. Performance of the TP algorithm is evaluated and compared when it is applied to a real ECG signal and its Gaussian model. The compression rate (CR) and the normalized mean square error (NMSE) are used as measures of performance. These measures show good coincidence with each other when applied to Gaussian signals with the mentioned spectra. Our results suggest that performance evaluation of the compression algorithms based on the stochastic-process model of ECG waves may be effective.

As the values of parameters in periodic systems vary, a nodal point appearing on a locus of period doubling bifurcation points crosses over a locus of turning points. We consider the nodal point lying just on the locus of turning points and consider its accurate location. To compute it, we consider an extended system which consists of an original equation and an additional equation. We present a result assuring that this extended system has an isolated solution containing the nodal point.