Computations in geographic space are necessarily based on discrete versions of space, but much of the existing work on the foundations of GIS assumes a continuous infinitely divisible space. This is true both of quantitative approaches, using R, and qualitative approaches using systems such as the Region-Connection Calculus (RCC). This paper shows how the RCC can be modified so as to permit dis...

As infrastructure projects get larger and more complex, innovation, which is highly dependent on collaboration interactions among stakeholders, critical to meet the challenges. Nevertheless, existing literature lacking in terms of studies into spread cooperative behaviors project innovations, success contingent. Hence, based network science theories, this study aims shed light cascade processes...

We investigated incompressible and compressible magnetohydrodynamic (MHD) energy cascade rates in the solar wind at different heliocentric distances. used situ magnetic field plasma observations provided by Parker Solar Probe mission exact relations fully developed turbulence. To estimate rate, we applied two recent for isothermal polytropic MHD turbulence, respectively. Our observational resul...

Time irreversibility is a distinctive feature of non-equilibrium phenomena such as turbulent flows, where mainly associated with an energy cascade process. An Eulerian, multiscale analysis time in wall-bounded turbulence proposed this study, which differs from previous works relying on Lagrangian approach and focusing homogeneous turbulence. Outcomes reveal strong connection between levels cohe...

The Zener-Klein (ZK) interband tunneling in graphene layers (GLs) with the lateral n-i-n and p-i-n junctions results nonlinear I-V characteristics that can be used for rectification detection of terahertz (THz) signals. transit time delay electrons holes depletion regions leads to phase shift between THz current voltage causing negative dynamic conductance a certain frequency range resulting so...

An arc-colored digraph D is properly (properly-walk) connected if, for any ordered pair of vertices (u,v), the contains a directed path (a walk) from u to v such that arcs adjacent on (on have distinct colors. The proper connection number pc→(D) (the proper-walk wc→(D)) minimum colours make (properly-walk connected). We prove pc→(Cn(S))≤2 every circulant Cn(S) with S⊆{1,…,n−1},|S|≥2 and 1∈S. Fu...

This paper describes a mechanism, called \persis-tent connection," to preserve stream connections after the communicating peer exits and till it restarts. Such connections have many applications: to survive failures that crash one party, network partitions that cut oo the two parties, and temporary disconnection in a mobile computing environment. They can also facilitate suspension of process e...