In the present study we have tested the hypothesis that evoked traveling alpha waves are behaviorally significant. The results of a visual-semantic categorization task show that three early ERP components including the P1-N1 complex had a dominant frequency characteristic in the alpha range and behaved like traveling waves do. They exhibited a traveling direction from midline occipital to right...

The spreading speeds and traveling waves are established for a class of non-monotone discrete-time integrodifference equation models. It is shown that the spreading speed is linearly determinate and coincides with the minimal wave speed of traveling waves.

In this paper we consider the location of stops along the edges of an already existing public transportation network. This can be the introduction of bus stops along some given bus routes, or of railway stations along the tracks in a railway network. The positive effect of new stops is given by the better access of the customers to the public transport network, while the traveling time increase...

We construct boundary states for D-branes which carry traveling waves in the covariant formalism. We compute their vacuum amplitudes to investigate their interactions. In non-compact space, the vacuum amplitudes become trivial as is common in plane wave geometries. However, we found that if they are compactified in the traveling direction, then the amplitudes are affected by non-trivial time de...

In this paper we investigate the time decay rates of perturbations of the traveling waves for viscous conservation laws with dispersion. The convergence rates in time to traveling waves are obtained when the initial data have different asymptotic limits at the far fields 7N: This improves previous results on decay rates. r 2002 Elsevier Science (USA). All rights reserved.

The traveling repairman problem is a customer-centric routing problem, in which the total waiting time of the customers is minimized, rather than the total travel time of a vehicle. To date, research on this problem has focused on exact algorithms and approximation methods. This paper presents the first metaheuristic approach for the traveling repairman problem.

This paper introduces a time efficient deep learning-based solution to the traveling salesman problem with window (TSPTW). Our goal is reduce total tour length traveled by -*the agent without violating any limitations. will aid in decreasing required supply type of service, as well lowering emissions produced automobiles, allowing our planet recover from air pollution emissions. The proposed mo...