\documentclass[11pt,twoside]{article}\makeatletter \IfFileExists{xcolor.sty}% {\RequirePackage{xcolor}}% {\RequirePackage{color}} \usepackage{colortbl} \usepackage{wrapfig} \usepackage{ifxetex} \ifxetex \usepackage{fontspec} \usepackage{xunicode} \catcode`⃥=\active \def⃥{\textbackslash} \catcode`❴=\active \def❴{\{} \catcode`❵=\active \def❵{\}} \def\textJapanese{\fontspec{Noto Sans CJK JP}} \def\textChinese{\fontspec{Noto Sans CJK SC}} \def\textKorean{\fontspec{Noto Sans CJK KR}} \setmonofont{DejaVu Sans Mono} \else \IfFileExists{utf8x.def}% {\usepackage[utf8x]{inputenc} \PrerenderUnicode{–} }% {\usepackage[utf8]{inputenc}} \usepackage[english]{babel} \usepackage[T1]{fontenc} \usepackage{float} \usepackage[]{ucs} \uc@dclc{8421}{default}{\textbackslash } \uc@dclc{10100}{default}{\{} \uc@dclc{10101}{default}{\}} \uc@dclc{8491}{default}{\AA{}} \uc@dclc{8239}{default}{\,} \uc@dclc{20154}{default}{ } \uc@dclc{10148}{default}{>} \def\textschwa{\rotatebox{-90}{e}} \def\textJapanese{} \def\textChinese{} \IfFileExists{tipa.sty}{\usepackage{tipa}}{} \fi \def\exampleFont{\ttfamily\small} \DeclareTextSymbol{\textpi}{OML}{25} \usepackage{relsize} \RequirePackage{array} \def\@testpach{\@chclass \ifnum \@lastchclass=6 \@ne \@chnum \@ne \else \ifnum \@lastchclass=7 5 \else \ifnum \@lastchclass=8 \tw@ \else \ifnum \@lastchclass=9 \thr@@ \else \z@ \ifnum \@lastchclass = 10 \else \edef\@nextchar{\expandafter\string\@nextchar}% \@chnum \if \@nextchar c\z@ \else \if \@nextchar l\@ne \else \if \@nextchar r\tw@ \else \z@ \@chclass \if\@nextchar |\@ne \else \if \@nextchar !6 \else \if \@nextchar @7 \else \if \@nextchar (8 \else \if \@nextchar )9 \else 10 \@chnum \if \@nextchar m\thr@@\else \if \@nextchar p4 \else \if \@nextchar b5 \else \z@ \@chclass \z@ \@preamerr \z@ \fi \fi \fi \fi \fi \fi \fi \fi \fi \fi \fi \fi \fi \fi \fi \fi} \gdef\arraybackslash{\let\\=\@arraycr} \def\@textsubscript#1{{\m@th\ensuremath{_{\mbox{\fontsize\sf@size\z@#1}}}}} \def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}} \def\abbr{} \def\corr{} \def\expan{} \def\gap{} \def\orig{} \def\reg{} \def\ref{} \def\sic{} \def\persName{}\def\name{} \def\placeName{} \def\orgName{} \def\textcal#1{{\fontspec{Lucida Calligraphy}#1}} \def\textgothic#1{{\fontspec{Lucida Blackletter}#1}} \def\textlarge#1{{\large #1}} \def\textoverbar#1{\ensuremath{\overline{#1}}} \def\textquoted#1{‘#1’} \def\textsmall#1{{\small #1}} \def\textsubscript#1{\@textsubscript{\selectfont#1}} \def\textxi{\ensuremath{\xi}} \def\titlem{\itshape} \newenvironment{biblfree}{}{\ifvmode\par\fi } \newenvironment{bibl}{}{} \newenvironment{byline}{\vskip6pt\itshape\fontsize{16pt}{18pt}\selectfont}{\par } \newenvironment{citbibl}{}{\ifvmode\par\fi } \newenvironment{docAuthor}{\ifvmode\vskip4pt\fontsize{16pt}{18pt}\selectfont\fi\itshape}{\ifvmode\par\fi } \newenvironment{docDate}{}{\ifvmode\par\fi } \newenvironment{docImprint}{\vskip 6pt}{\ifvmode\par\fi } \newenvironment{docTitle}{\vskip6pt\bfseries\fontsize{22pt}{25pt}\selectfont}{\par } \newenvironment{msHead}{\vskip 6pt}{\par} \newenvironment{msItem}{\vskip 6pt}{\par} \newenvironment{rubric}{}{} \newenvironment{titlePart}{}{\par } \newcolumntype{L}[1]{){\raggedright\arraybackslash}p{#1}} \newcolumntype{C}[1]{){\centering\arraybackslash}p{#1}} \newcolumntype{R}[1]{){\raggedleft\arraybackslash}p{#1}} \newcolumntype{P}[1]{){\arraybackslash}p{#1}} \newcolumntype{B}[1]{){\arraybackslash}b{#1}} \newcolumntype{M}[1]{){\arraybackslash}m{#1}} \definecolor{label}{gray}{0.75} \def\unusedattribute#1{\sout{\textcolor{label}{#1}}} \DeclareRobustCommand*{\xref}{\hyper@normalise\xref@} \def\xref@#1#2{\hyper@linkurl{#2}{#1}} \begingroup \catcode`\_=\active \gdef_#1{\ensuremath{\sb{\mathrm{#1}}}} \endgroup \mathcode`\_=\string"8000 \catcode`\_=12\relax \usepackage[a4paper,twoside,lmargin=1in,rmargin=1in,tmargin=1in,bmargin=1in,marginparwidth=0.75in]{geometry} \usepackage{framed} \definecolor{shadecolor}{gray}{0.95} \usepackage{longtable} \usepackage[normalem]{ulem} \usepackage{fancyvrb} \usepackage{fancyhdr} \usepackage{graphicx} \usepackage{marginnote} \renewcommand{\@cite}[1]{#1} \renewcommand*{\marginfont}{\itshape\footnotesize} \def\Gin@extensions{.pdf,.png,.jpg,.mps,.tif} \pagestyle{fancy} \usepackage[pdftitle={Global Network Management under Spatial Grasp Paradigm}, pdfauthor={}]{hyperref} \hyperbaseurl{} \paperwidth210mm \paperheight297mm \def\@pnumwidth{1.55em} \def\@tocrmarg {2.55em} \def\@dotsep{4.5} \setcounter{tocdepth}{3} \clubpenalty=8000 \emergencystretch 3em \hbadness=4000 \hyphenpenalty=400 \pretolerance=750 \tolerance=2000 \vbadness=4000 \widowpenalty=10000 \renewcommand\section{\@startsection {section}{1}{\z@}% {-1.75ex \@plus -0.5ex \@minus -.2ex}% {0.5ex \@plus .2ex}% {\reset@font\Large\bfseries}} \renewcommand\subsection{\@startsection{subsection}{2}{\z@}% {-1.75ex\@plus -0.5ex \@minus- .2ex}% {0.5ex \@plus .2ex}% {\reset@font\Large}} \renewcommand\subsubsection{\@startsection{subsubsection}{3}{\z@}% {-1.5ex\@plus -0.35ex \@minus -.2ex}% {0.5ex \@plus .2ex}% {\reset@font\large}} \renewcommand\paragraph{\@startsection{paragraph}{4}{\z@}% {-1ex \@plus-0.35ex \@minus -0.2ex}% {0.5ex \@plus .2ex}% {\reset@font\normalsize}} \renewcommand\subparagraph{\@startsection{subparagraph}{5}{\parindent}% {1.5ex \@plus1ex \@minus .2ex}% {-1em}% {\reset@font\normalsize\bfseries}} \def\l@section#1#2{\addpenalty{\@secpenalty} \addvspace{1.0em plus 1pt} \@tempdima 1.5em \begingroup \parindent \z@ \rightskip \@pnumwidth \parfillskip -\@pnumwidth \bfseries \leavevmode #1\hfil \hbox to\@pnumwidth{\hss #2}\par \endgroup} \def\l@subsection{\@dottedtocline{2}{1.5em}{2.3em}} \def\l@subsubsection{\@dottedtocline{3}{3.8em}{3.2em}} \def\l@paragraph{\@dottedtocline{4}{7.0em}{4.1em}} \def\l@subparagraph{\@dottedtocline{5}{10em}{5em}} \@ifundefined{c@section}{\newcounter{section}}{} \@ifundefined{c@chapter}{\newcounter{chapter}}{} \newif\if@mainmatter \@mainmattertrue \def\chaptername{Chapter} \def\frontmatter{% \pagenumbering{roman} \def\thechapter{\@roman\c@chapter} \def\theHchapter{\roman{chapter}} \def\thesection{\@roman\c@section} \def\theHsection{\roman{section}} \def\@chapapp{}% } \def\mainmatter{% \cleardoublepage \def\thechapter{\@arabic\c@chapter} \setcounter{chapter}{0} \setcounter{section}{0} \pagenumbering{arabic} \setcounter{secnumdepth}{6} \def\@chapapp{\chaptername}% \def\theHchapter{\arabic{chapter}} \def\thesection{\@arabic\c@section} \def\theHsection{\arabic{section}} } \def\backmatter{% \cleardoublepage \setcounter{chapter}{0} \setcounter{section}{0} \setcounter{secnumdepth}{2} \def\@chapapp{\appendixname}% \def\thechapter{\@Alph\c@chapter} \def\theHchapter{\Alph{chapter}} \appendix } \newenvironment{bibitemlist}[1]{% \list{\@biblabel{\@arabic\c@enumiv}}% {\settowidth\labelwidth{\@biblabel{#1}}% \leftmargin\labelwidth \advance\leftmargin\labelsep \@openbib@code \usecounter{enumiv}% \let\p@enumiv\@empty \renewcommand\theenumiv{\@arabic\c@enumiv}% }% \sloppy \clubpenalty4000 \@clubpenalty \clubpenalty \widowpenalty4000% \sfcode`\.\@m}% {\def\@noitemerr {\@latex@warning{Empty `bibitemlist' environment}}% \endlist} \def\tableofcontents{\section*{\contentsname}\@starttoc{toc}} \parskip0pt \parindent1em \def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}} \newenvironment{reflist}{% \begin{raggedright}\begin{list}{} {% \setlength{\topsep}{0pt}% \setlength{\rightmargin}{0.25in}% \setlength{\itemsep}{0pt}% \setlength{\itemindent}{0pt}% \setlength{\parskip}{0pt}% \setlength{\parsep}{2pt}% \def\makelabel##1{\itshape ##1}}% } {\end{list}\end{raggedright}} \newenvironment{sansreflist}{% \begin{raggedright}\begin{list}{} {% \setlength{\topsep}{0pt}% \setlength{\rightmargin}{0.25in}% \setlength{\itemindent}{0pt}% \setlength{\parskip}{0pt}% \setlength{\itemsep}{0pt}% \setlength{\parsep}{2pt}% \def\makelabel##1{\upshape ##1}}% } {\end{list}\end{raggedright}} \newenvironment{specHead}[2]% {\vspace{20pt}\hrule\vspace{10pt}% \phantomsection\label{#1}\markright{#2}% \pdfbookmark[2]{#2}{#1}% \hspace{-0.75in}{\bfseries\fontsize{16pt}{18pt}\selectfont#2}% }{} \def\TheFullDate{2020-01-15 (revised: 15 January 2020)} \def\TheID{\makeatother } \def\TheDate{2020-01-15} \title{Global Network Management under Spatial Grasp Paradigm} \author{}\makeatletter \makeatletter \newcommand*{\cleartoleftpage}{% \clearpage \if@twoside \ifodd\c@page \hbox{}\newpage \if@twocolumn \hbox{}\newpage \fi \fi \fi } \makeatother \makeatletter \thispagestyle{empty} \markright{\@title}\markboth{\@title}{\@author} \renewcommand\small{\@setfontsize\small{9pt}{11pt}\abovedisplayskip 8.5\p@ plus3\p@ minus4\p@ \belowdisplayskip \abovedisplayskip \abovedisplayshortskip \z@ plus2\p@ \belowdisplayshortskip 4\p@ plus2\p@ minus2\p@ \def\@listi{\leftmargin\leftmargini \topsep 2\p@ plus1\p@ minus1\p@ \parsep 2\p@ plus\p@ minus\p@ \itemsep 1pt} } \makeatother \fvset{frame=single,numberblanklines=false,xleftmargin=5mm,xrightmargin=5mm} \fancyhf{} \setlength{\headheight}{14pt} \fancyhead[LE]{\bfseries\leftmark} \fancyhead[RO]{\bfseries\rightmark} \fancyfoot[RO]{} \fancyfoot[CO]{\thepage} \fancyfoot[LO]{\TheID} \fancyfoot[LE]{} \fancyfoot[CE]{\thepage} \fancyfoot[RE]{\TheID} \hypersetup{citebordercolor=0.75 0.75 0.75,linkbordercolor=0.75 0.75 0.75,urlbordercolor=0.75 0.75 0.75,bookmarksnumbered=true} \fancypagestyle{plain}{\fancyhead{}\renewcommand{\headrulewidth}{0pt}} \date{} \usepackage{authblk} \providecommand{\keywords}[1] { \footnotesize \textbf{\textit{Index terms---}} #1 } \usepackage{graphicx,xcolor} \definecolor{GJBlue}{HTML}{273B81} \definecolor{GJLightBlue}{HTML}{0A9DD9} \definecolor{GJMediumGrey}{HTML}{6D6E70} \definecolor{GJLightGrey}{HTML}{929497} \renewenvironment{abstract}{% \setlength{\parindent}{0pt}\raggedright \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}} \vskip16pt \textcolor{GJBlue}{\large\bfseries\abstractname\space} }{% \vskip8pt \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}} \vskip16pt } \usepackage[absolute,overlay]{textpos} \makeatother \usepackage{lineno} \linenumbers \begin{document} \author[1]{Peter Simon Sapaty} \renewcommand\Authands{ and } \date{\small \em Received: 16 December 2019 Accepted: 1 January 2020 Published: 15 January 2020} \maketitle \begin{abstract} The paper describes basics of high-level management model and technology for dealing with large distributed human or technical systems which can be represented as dynamic physical-virtual networks covering any terrestrial or celestial environments. The main technology component, Spatial Grasp Language (SGL), allows us to obtain powerful and compact spatial solutions of different problems by directly expressing their top semantics while hiding traditional system organization and management routines inside efficient networked implementation. Different network creation, evolution, matching, and transformation approaches are investigated and shown in SGL on general networks, which may be practically useful in a variety of areas influencing the dangerously growing world dynamics and caused, for example, by climate change, military, religious and ethnic conflicts, terrorism, refugee flows, weapons proliferation, political and industrial restructuring, growing inequality, economic instability, global insecurity, and very recently, due to the world-wide pandemic horror. \end{abstract} \keywords{world dynamics, high-level network management, spatial grasp technology, spatial} \begin{textblock*}{18cm}(1cm,1cm) % {block width} (coords) \textcolor{GJBlue}{\LARGE Global Journals \LaTeX\ JournalKaleidoscope\texttrademark} \end{textblock*} \begin{textblock*}{18cm}(1.4cm,1.5cm) % {block width} (coords) \textcolor{GJBlue}{\footnotesize \\ Artificial Intelligence formulated this projection for compatibility purposes from the original article published at Global Journals. However, this technology is currently in beta. \emph{Therefore, kindly ignore odd layouts, missed formulae, text, tables, or figures.}} \end{textblock*} \let\tabcellsep& \section[{Introduction}]{Introduction}\par e are witnessing rapidly growing world dynamics caused by climate change, military, religious and ethnic conflicts, terrorism, refugee flows, weapons proliferation, political and industrial restructuring, inequality, economic instability, global insecurity, and very recently, due to the world-wide pandemic horror \hyperref[b0]{[1]}\hyperref[b1]{[2]}\hyperref[b2]{[3]}\hyperref[b3]{[4]} {\ref [5]}\hyperref[b4]{[6]}\hyperref[b6]{[7]}\hyperref[b7]{[8]}\hyperref[b8]{[9]}\hyperref[b9]{[10]}. Dealing with frequently emerging crises may need rapid integration of scattered heterogeneous resources into capable operational forces pursuing goals which may not be known in advance. Proper understanding and managing of unpredictable and crisis situations urgently need their detailed simulation at runtime and even ahead of it \hyperref[b10]{[11]} {\ref [12]} {\ref [13]} {\ref [14]} {\ref [15]}\hyperref[b11]{[16]}\hyperref[b12]{[17]}\hyperref[b13]{[18]}\hyperref[b14]{[19]}\hyperref[b15]{[20]}\hyperref[b16]{[21]}\hyperref[b17]{[22]} {\ref [23]}\hyperref[b19]{[24]}\hyperref[b20]{[25]}\hyperref[b32]{[26]}\hyperref[b33]{[27]} {\ref [28]}\hyperref[b34]{[29]}\hyperref[b35]{[30]}. This may also require deep integration of advanced simulation with live control and management within united and enriching each other concepts of virtual, physical, and executive worlds, which should be effectively organized in both local and global scale {\ref [31]}\hyperref[b21]{[32]}\hyperref[b22]{[33]}\hyperref[b23]{[34]} {\ref [35]} {\ref [36]}\hyperref[b24]{[37]} {\ref [38]} {\ref [39]} {\ref [40]} {\ref [41]} {\ref [42]}.\par The developed Spatial Grasp formalism and Technology (SGT), which was patented and revealed in numerous previous publications (Wiley, Springer, and Emerald books including) \hyperref[b25]{[43]}\hyperref[b26]{[44]}\hyperref[b27]{[45]}\hyperref[b28]{[46]}\hyperref[b29]{[47]}\hyperref[b30]{[48]} provides basics for deep integration, actually symbiosis, of different worlds allowing us to unite advanced distributed simulation with spatial parallel and fully distributed control. The investigated applications included classical graph and network theory problems, missile defense, massive collective robotics, evolution of space systems, flexible command and control, industrial, social and international security problems, also effectively expressing main gestalt theory laws allowing them to cover any distributed systems rather than just human mind and brain. The developed formalism allows us to directly exist, operate, and move in different worlds and their combinations, while shifting traditional numerous and boring system management and simulation routines (DIS and HLA \hyperref[b14]{[19]}\hyperref[b15]{[20]}\hyperref[b16]{[21]}\hyperref[b17]{[22]} {\ref [23]}\hyperref[b19]{[24]}\hyperref[b20]{[25]}\hyperref[b32]{[26]}\hyperref[b33]{[27]} including) completely to automatic networked interpretation of the basic Spatial Grasp Language (SGL), with resulting solutions often hundreds of times shorter and simpler.\par Many problems in the mentioned areas can be formulated on distributed dynamic physical and virtual networks, from their initial creation, growth and evolution to possible decline and death. The current paper analyzes and shows SGT capabilities for parallel and often holistic expression of some basic operations on general networks of arbitrary size and physical distribution, which may be practically useful in all listed above areas for solving various problems. The demonstrated networking approach can also cover much greater spheres, up to creation and evolution of the very universe, by offering practical mechanisms for its simulation on arbitrary large distributed computer networks with millions to billions of communication nodes.\par The rest of the paper is organized as follows. Section 2 provides basic details of the developed spatial paradigm that resulted in Spatial Grasp Technology (SGT) with its basic Spatial Grasp Language (SGL) suitable for creation and management of large dynamic systems in distributed and parallel mode. Section 3 describes examples in SGL of simulation of hypothetical business networks covering certain physical spaces, highlighting top level network creation, its hierarchical growth, appearance of new inter-node relations, and further unlimited evolution. Section 4 gives an example of how arbitrary large network can be created in SGL in a randomized and parallel mode, in a single breath, symbolically mimicking "Big Bang" hypothesis. Sections 5 and 6 are investigating different kinds of pattern matching techniques on the created network example. In Section 5, only constant patterns are used with known names of all nodes and links, also ranging from simple to arbitrary topologies. In Section 6, different patterns with variables are considered, first with variables in nodes only, then with variables in both nodes and links, and additionally, with variable graph structures.\par Examples of possible global network dynamics are considered in Section 7, from their gradual shrinking to unlimited expansion. Regarding the shrinking process, it is shown how to substitute arbitrary subnetwork with a single node having same links to the remaining nodes the removed nodes had. This shrinking also continued in a repeated swallowing by such node of new neighbors in a "Black Hole" mode, until the whole net degenerates into a single node. Another possible network self-destruction is shown where nodes self-discovering fewer neighbors than a threshold given are ceasing to exist, thus weakening in such a way their direct neighbors, and so on. A technique is also shown in SGL for the opposite process -unlimited network growth by the number of nodes and links, and also expansion in physical space up to the whole universe (imitating "Dark Matter" hypothesis too). Section 8 concludes the paper showing possibility of SGT implementation in traditional environments and the ongoing researched of its applicability in other areas. \section[{II.}]{II.} \section[{Spatial Grasp Technology Basics a) General SGT Idea}]{Spatial Grasp Technology Basics a) General SGT Idea}\par Within Spatial Grasp Technology (SGT), a highlevel scenario for any task to be performed in a distributed world is represented as an active selfevolving pattern rather than traditional program, sequential or parallel. This pattern, written in a high-level Spatial Grasp Language (SGL) and expressing top semantics of the problem to be solved, can start from any world point. It then spatially propagates, replicates, modifies, covers and matches the distributed world in parallel wavelike mode, while echoing the reached control states and data found or obtained for making decisions at higher levels and further space navigation. This inherently parallel and fully distributed spatial process is very symbolically shown in Fig. {\ref 1}. These infrastructures, which may remain active any time, can effectively support or express distributed databases, advanced command and control, situation awareness, autonomous and collective decisions, as well as any existing or hypothetical computational and or control models. \section[{b) Spatial Grasp Language}]{b) Spatial Grasp Language}\par General SGL organization is as follows, where syntactic categories are shown in italics, vertical bar separates alternatives, parts in braces indicate zero or more repetitions with a delimiter at the right if multiple, and constructs in brackets may be optional:grasp ? constant | variable | [ rule ] [(\{ grasp,\})]\par From this definition, an SGL scenario called grasp, supposedly applied in some point of the distributed space, can just be a constant directly providing the result to be associated with this point. It can be a variable whose content, assigned to it previously when staying in this or (remotely) in other space point (as variables may have non-local meaning and coverage), provides the result in the application point too. It can also be a rule (expressing certain action, control, description or context) optionally accompanied with operands separated by comma (if multiple) and embraced in parentheses. These operands can be of any nature and complexity (including arbitrary scenarios themselves) and defined recursively as grasp too, i.e. can be constants, variables or any rules with operands (i.e. as grasps again), and so on.\par Rules, starting in some world point, can organize navigation of the world sequentially, in parallel or any combinations thereof. They can result in staying in the same application point or can cause movement to other world points with obtained results to be left there, as in the rule's final points. Such results can also be collected, processed, and returned to the rule's starting point, the latter serving as the final one on this rule. The final world points reached after the rule invocation can themselves become starting ones for other rules. The rules, due to recursive language organization, can form arbitrary operational and control infrastructures expressing any sequential, parallel, hierarchical, centralized, localized, mixed and up to fully decentralized and distributed algorithms. These algorithms, called spatial, can effectively operate in, with, under, in between, over, and instead of (as for simulation) large, dynamic, and heterogeneous spaces, which can be physical, virtual, management, command and control, or combined.\par SGL full syntax description, as of its latest version, is as follows, with the words in Courier New font being direct language symbols (boldfaced braces including). ?? thru | done | fail | fatal | infinite | nil | any | all | other | allother | current | passed | existing | neighbors | direct | forward | backward | synchronous | asynchronous | virtual | physical | executive | engaged | vacant | firstcome | unique | usual | real | simulate variable ? global | heritable | frontal | nodal | environmental global ? G\{alphameric\} heritable ? H\{alphameric\} frontal ? F\{alphameric\} nodal ? N\{alphameric\} environmental ? TYPE | IDENTITY | NAME | CONTENT | ADDRESS | POINT | QUALITIES | WHERE | BACK | PREVIOUS | PREDECESSOR | DOER | RESOURCES | LINK | DIRECTION | WHEN | TIME | STATE | VALUE | IDENTITY | IN | OUT | STATUS | MODE | COLOR rule ? type | usage | movement | creation | echoing | verification | assignment | advancement | branching | transference | exchange | timing | qualifying | grasp type ? global | heritable | frontal | nodal | environmental | matter | number | string | scenario | constant | custom usage ? address | coordinate | content | index | time | speed | name | place | center | range | doer | node | link | unit movement ? hop | hopfirst | hopforth | move | shift | pass | return | follow creation ? create | form | linkup | delete | unlink echoing ? state | rake | order | unit | unique | sum | count | first | last | min | max | random | average | sortup | sortdown | reverse | element | position | fromto | add | subtract | multiply | divide | degree | separate | unite | attach | append | common | withdraw | increment | decrement | access | invert | apply | location verification ? equal | nonequal | less | lessorequal | more | moreorequal | bigger | smaller | heavier | lighter | longer | shorter | empty | nonempty | belong | notbelong | intersect | notintersect | yes | no assignment ? assign | assignpeers | associate advancement ? advance | slide | repeat | align | fringe branching ? branch | sequence | parallel | if | or | and | choose | quickest | cycle | loop | sling | whirl | split transference ? run | call exchange ? input | output | send | receive | emit | get timing ? sleep | allowed qualification ? contain | release | free | blind | quit | abort | stay | lift | seize c) SGL Interpreter\par The SGL interpreter main components and its general organization are shown in Fig. {\ref 3}. \section[{Fig. 3: SGL interpreter main components and their interactions}]{Fig. 3: SGL interpreter main components and their interactions}\par The interpreter consists of a number of specialized functional processors (shown by rectangles) working with and sharing specific data structures. These include: Communication Processor, Control Processor, Navigation Processor, Parser, different Operation Processors, and special (external \& internal) World Access Unit directly manageable from SGL. Main data structures (also referred to as stores) with which these processors operate (shown by ovals) comprise: Grasps Queue, Suspended Grasps, Track Forest, Activated Rules, Knowledge Network, Grasps Identities, Heritable Variables, Fontal Variables, Nodal Variables, Environmental Variables, Global Variables, Incoming Queue, and Outgoing Queue. SGL interpretation network generally serves multiple scenarios or their parallel branches simultaneously navigating the distributed world, which can cooperate or compete with each other.\par As both backbone and nerve system of the distributed interpreter, its hierarchical spatial track system dynamically spans the worlds in which SGL scenarios evolve, providing automatic control of multiple distributed processes. Its part related to the current interpreter is kept in the Track Forest store which is interlinked with similar parts in other interpreters, forming altogether global control coverage. Self-optimizing in parallel echo processes, this (generally forest-like) distributed track structure provides hierarchical command and control as well as remote data and code access. It also supports spatial variables and merges distributed control states for making decisions at different organizational levels. The track infrastructure can be automatically distributed between different world points during scenario spreading in distributed environments.\par Each interpreter can support and process multiple SGL scenario code which happens to be in its responsibility at different moments of time. More details on SGT, SGL, its implementation and investigated and tested applications can be found elsewhere, including in \hyperref[b26]{[44]}\hyperref[b27]{[45]}\hyperref[b28]{[46]}\hyperref[b29]{[47]}\hyperref[b30]{[48]}. Implanted into any distributed systems and integrated with them, the interpretation network (having potentially millions to billions of communicating interpreter copies) allows us to form spatial world computer with practically unlimited power for simulation and management of the whole mankind. \section[{III. Creation and Growth of Business Networks}]{III. Creation and Growth of Business Networks}\par We will show here how the birth and growth of hypothetical business centers with subordinate units and evolution of different kinds of channels and relations between them can be expressed in the spatial grasp mode provided by SGL. All network nodes will be considered as having all three (i.e. physical, virtual, and executive) dimensions discussed in \hyperref[b45]{[65]}, and the randomized development of business network will be taking place in a physical region with certain boundaries. \section[{a) Top Level Network Creation}]{a) Top Level Network Creation}\par Creation and activation of initial top level business nodes (having names for simplicity in digits) with their random physical distribution, as in Fig. \hyperref[fig_1]{4}, may be done in SGL as follows (where these initial business loci can be created in parallel, thus simulating possible concurrent appearance of different businesses in a distributed area). Explicit mentioning of the combined type of these nodes (i.e. by using TYPE = P\textunderscore V\textunderscore E) is optional, because such features as IDENTITY and linkage to physical (i.e. X-Y defined) space are just speaking for themselves. In a three-dimensional environment (like, for example, in outer space) coordinate Z may be needed too.\par Linking the created top level nodes by a sort of global channels, as shown in Fig. \hyperref[fig_2]{5} by hard lines, may be done as follows. Introducing additional top level nodes randomly distributed in space too, which could be done in parallel, with random and parallel linking them by global channels to the already created nodes, as in Fig. \hyperref[fig_3]{6}, may be achieved by the following SGL scenario. \section[{b) Hierarchical Network Evolution and Growth}]{b) Hierarchical Network Evolution and Growth}\par Let us consider a possible further hierarchical extension and growth of the created network, by introducing additional subordinate nodes to the already created top nodes with establishing directed management links from them, as in Fig. \hyperref[fig_4]{7}, with possible SGL scenario following. Three subordinate nodes (with digital sub-names from 1 to 3) for each top node are planned, with a randomly defined distance to them within certain threshold (expressed in italics). Imagine now that these new subordinate nodes (already having direct control, management and business links with their top level nodes) want to establish additional direct local business or even joint production relations with other subordinate nodes existing in some vicinity, as shown by dashed lines in Fig. {\ref 8} and by the SGL scenario following. Fig. {\ref 8}: Establishing new business and information relations between nodes hop\textunderscore random\textunderscore nodes(CONTENT("subordinate")); linkup("business", hop\textunderscore random\textunderscore nodes(distance(maxdistance), CONTENT("subordinate")))\par We may also suppose that any nodes of this network already operating for some time, may establish different kinds of information exchange or shared knowledge links regardless of distance between them, as shown in Fig. {\ref 8} in dotted lines and by the following scenario. hop\textunderscore random\textunderscore nodes(all); linkup("information", random\textunderscore nodes(others)) \section[{d) Further Network Growth}]{d) Further Network Growth}\par Using similar SGL scenarios as above, we can continue growing the network of Fig. {\ref 8}, both hierarchically by adding more levels of nodal subordination (names of lower level nodes may be extended from the names of the previous level, similar to Fig. \hyperref[fig_1]{4}), and also introducing additional direct links between different types of nodes, as shown in Fig. \hyperref[fig_5]{9}. In further developments, new top level nodes may appear with new global links between themselves and already existing top nodes, which, in their turn, may create subordinate nodes within any levels of hierarchy. Various new links with other nodes can be established too, and so on, thus effectively imitating industrial growth in both terrestrial and celestial environments, including its inevitable extension to Moon, Cislunar Space, even Mars and beyond, and all this can be clearly and concisely described and simulated in SGL.\par IV. \section[{Parallel Creation of Arbitrary Network}]{Parallel Creation of Arbitrary Network}\par In the previous section we have described an example of creation and growth of industrial-like networks in distributed environments which, despite generality, had certain specifics like general hierarchical organization and particular semantics-oriented types of relations and connections between nodes.\par For investigation of various operations on general networks in the subsequent sections we will consider here the creation of arbitrarily large exemplary virtual network in a single breath mode, symbolically imitating the "Big Bang" hypothesis [49]. It will be using node names expressed for simplicity by digits and links randomly connecting such nodes with random number of other nodes, with link names as lower case alphabetic letters. This is shown in Fig. \hyperref[fig_6]{10} and by the following parallel SGL scenario (using for compactness of the picture only a limited number of nodes named from 1 to 20, with the number of possible connections to other nodes just between 2 and 6). If to consider distribution of the created nodes in physical space, the scenario may look like follows, with nodes supposedly allowed to be randomly linked with each other only within certain threshold distance between them. And the nodes' physical positions should also be within certain boundaries defined by: Xmin, Xmax, Ymin, and Ymax. \section[{create\textunderscore parallel\textunderscore nodes(}]{create\textunderscore parallel\textunderscore nodes(}\par fromto \hyperref[b0]{(1,}\hyperref[b15]{20)}, coordinates(random(Xmin, Xmax), random(Ymin, Ymax))); linkup\textunderscore parallel( random(lower\textunderscore case\textunderscore letters), nodes(number\textunderscore random\textunderscore fromto \hyperref[b1]{(2,}\hyperref[b4]{6)}, names\textunderscore random(all\textunderscore others), distance(maxdistance)))\par As the network and its distribution in physical space were performed randomly by this scenario, its real visual planar picture may not be as nice as in Fig. \hyperref[fig_6]{10}, which we have drawn here only for conveniently showing and explaining various solutions on general networks, to be discussed in the subsequent sections. It to consider a 3-D network creation, distribution and growth, say, like both on Earth and in outer space, we should engage the third dimension too, with Zmin and Zmax as its expected limits.\par V. \section[{Network Pattern Matching with Constant Patterns}]{Network Pattern Matching with Constant Patterns}\par Describing and finding different structures in distributed networks has numerous applications in different areas of system management. We are starting here with discovering various structures in arbitrary networks that have known topology and names of all their nodes and links, which can be found by applying corresponding constant graph patterns to the whole network. Similar to all above will be if to start matching from the second node of the pattern. The only match of this pattern is shown in Fig. \hyperref[fig_0]{12}. The output in case of matching success can be issued in the central pattern's node (i.e. 6) or in the scenario starting location, with SGL code for the second case following and matching result in Fig. \hyperref[fig_0]{12} if((hop\textunderscore node \hyperref[b4]{(6)}; and\textunderscore parallel( hop(link(j), node(20)), hop(link(p), node(5)), hop(link(m), node(3)), hop(link(z), node( {\ref 14})), hop(link(n), node(7)))), output(OK))\par . {\ref Pattern 3} The output for this tree-structured pattern can be issued in the top tree node (i.e. 17) or in the scenario starting location as for the previous pattern, with SGL code for the second option following and successful match shown in Fig. \hyperref[fig_0]{12}. Any constant graph pattern can be easily represented as a tree too, as in the previous case, which should cover all pattern's nodes and all links, and for this, some nodes may be repeated more than once, as for the pattern in Fig. {\ref 13},a and one of its possible tree representation shown in Fig. {\ref 13,b}. The repeated nodes in this tree will be as: 6, 7, 10, and 14. \section[{Fig. 13: Representation of arbitrary graph pattern by a tree with repeating nodes}]{Fig. 13: Representation of arbitrary graph pattern by a tree with repeating nodes}\par The SGL matching scenario will be as follows, with matching result to be issued in the outside position issuing the scenario (the output can also be organized in the top tree node, here 4). \section[{Using Graph Patterns with Variables}]{Using Graph Patterns with Variables}\par In the previous section we considered finding parts of the network with exact structures, exact number of nodes and links, and all link and node names as known constants, with all this expressed in detail in the search patterns. In the current section, we will be considering matching patterns having variables associated with their different elements: nodes, links, as well as total graph structures with not known in advance numbers of nodes and links. \section[{a) Patterns with Variables in Nodes Only}]{a) Patterns with Variables in Nodes Only}\par Such patterns will be having variables in all nodes only with their meanings to be found after successful matches with the network, by using different constant graph structures, from simplest to most general. \section[{i. Particular patterns with nodal variables}]{i. Particular patterns with nodal variables}\par We will be using simple patterns with variables in nodes as in Fig. \hyperref[fig_13]{15}, which are similar to the patterns with all constants of Fig. {\ref 11}. Output of all solutions (see Fig. \hyperref[fig_3]{16}) will be: (2, 1), (1, 2) , (7, 10), \hyperref[b9]{(10,}\hyperref[b6]{7)}. Output (see Fig. \hyperref[fig_12]{14}) will be as: X:5, Y:12, Z:3, U:6, V:20, W:13. Printing in the scenario starting location of all possible matches where different matches as separate units should be enclosed in parentheses to be distinguishable from each other, if more than one (we only have a single match for this pattern, as in Fig. \hyperref[fig_3]{16}). The printed solution will be as: (X:5, Y:12, Z:3, U:6, V:20, W:13). \section[{Pattern 3}]{Pattern 3}\par A particular match for this pattern, if found, can be issued in the X-related node, and all matches can also be printed in the scenario starting position (similar to the previous case). We are showing here the second option, with only a single match available for the network of Fig. \hyperref[fig_3]{16}. \section[{ii. Using arbitrary graph patterns}]{ii. Using arbitrary graph patterns}\par One of possible matching techniques for arbitrary patterns with variables in nodes, actually the simplest one, can be based on a path through all pattern's nodes, simplifying collection of all found values of variables for a particular match at the end of the path (see Fig. \hyperref[fig_17]{17,a,b}). Some nodes and links may have to be represented more than once in such a pass (not for the case of Fig. \hyperref[fig_17]{17,a}). With the resultant node matches represented in the order reflecting indexing of variables Xi in the path, and the remaining links always leading to the previous nodes of the path, the SGL solution for Fig. \hyperref[fig_17]{17,b} will be as follows, with the output in final node of the path corresponding to variable X7. hop\textunderscore nodes(all); frontal(X) = NAME; hop\textunderscore link(n); X \&\&= NAME; hop\textunderscore link(c); X \&\&= NAME; hop\textunderscore link(n); X \&\&= NAME; hop\textunderscore link(p); X \&\&= NAME; hop\textunderscore link(b); true\textunderscore hop(link(z), node(X \hyperref[b0]{[1]})); X \&\&= NAME; hop\textunderscore link(d); true\textunderscore hop(link(e), node(X \hyperref[b1]{[2]})); true\textunderscore hop(link(k), node(X \hyperref[b2]{[3]})); true\textunderscore hop(link(i), node(X \hyperref[b3]{[4]})); true\textunderscore hop(link(g), node(X[5])); X \&\&= NAME; output(X)\par Resultant match for variables X1 to X7, issued in the final node match 3, will be as: 11, 4, 7, 6, 5, 12, 3 (see also Fig. \hyperref[fig_18]{18}) The only available match (same as before) will be issued in the outside position as a parenthesized unit: \hyperref[b10]{(11,}\hyperref[b3]{4,}\hyperref[b6]{7,}\hyperref[b4]{6,} {\ref 5,} {\ref 12,}\hyperref[b2]{3)}. We could also issue each match after its full completion in the starting node of the pattern (corresponding to variable X1, i.e. found node 11), as was shown for the previous patterns. \section[{b) Arbitrary Graph Patterns with Variables in Both Nodes and Links}]{b) Arbitrary Graph Patterns with Variables in Both Nodes and Links}\par An example of such pattern, similar to the previous one of Fig. \hyperref[fig_17]{17} but with variables on links too, is shown in Fig \hyperref[fig_19]{19,a,b}, where the indexing of variables for nodes and links is chosen to be arbitrary and possibly more convenient, not necessarily following the path though all nodes as before. (This is accomplished by organizing sets of variables as indexed lists allowing for their growth and access to elements in any order, by explicit indices, during storing of different matches of nodes and links). The output of all matches for the network of Fig. \hyperref[fig_6]{10} (possibly, in a different order) will be as follows, with the order of printed names of nodes and links in each match corresponding to the indices of related X and Y variables of the pattern in Fig. \hyperref[fig_19]{19}.\par 14 matches found for the graph of Fig. \hyperref[fig_18]{18} shown in bold:\par ((X: 11, 12, 3, 4, 5, 6, 7), (Y: z, b, n, d, e, b, g, i, k, c, p, n)), ? , And also there are 14 matches for the graph of Fig. \hyperref[fig_12]{14}, in bold too: ((X: 4, 3, 7, 19, 6, 14, 10), (Y: e, c, a, k, l, i, n, x, w, z , l)), ? .\par Multiple matches for same graphs of Figs 14 and 18 appeared because each node of these graphs can match the starting pattern's node, i.e. X1, and also the circular path from it via remaining nodes can develop in two opposite directions (like clockwise and counterclockwise), but all the mentioned above matches are formally different and legitimate. \section[{c) Patterns with Variable Structures}]{c) Patterns with Variable Structures}\par All previous cases with constants or variables in nodes and links considered exact, fixed structures of the patterns which should be matched with the network. But the pattern's structure can also be a sort of a variable too, say, by fitting solutions with different number of nodes and links, as well as their interconnections. We will consider here a simple example of finding structures representing a cyclic chain (ring) of interconnected nodes which may not have known in advance number of nodes (say, with its maximum limited by some threshold), with all nodes and links as variables too, as in Fig. \hyperref[fig_20]{20}. Special constraints are also be added to this pattern --that all nodes of these rings do not have other connections with each other than those forming the ring, and also there is no at least a single outside node that has links with all nodes of the ring (like "external authority", say, for special applications). Finding such a match with output in its finally found (i.e. Xn related) node can be achieved by the following scenario, with the threshold number of nodes (or count) in such matches taken as 5. hop\textunderscore nodes(all); frontal(X = NAME, Y); repeat( hop\textunderscore noback\textunderscore links(all); append(LINK, Y); if(NAME = X \hyperref[b0]{[1]}, done(no(hop\textunderscore nodes(X); hop(links(all), nodes(not(X)); and\textunderscore parallel\textunderscore hop(links(any), nodes(X))); output(unit('X:', X), unit('Y:', Y))); notbelong(NAME, X); no\textunderscore hop\textunderscore noback(links(any), nodes(X)); append(NAME, X); count(X) <= 5)\par Output in the scenario starting position of all possible matches can be achieved by: output( hop\textunderscore nodes(all); frontal(X = NAME, Y); repeat( hop\textunderscore noback\textunderscore links(all); append(LINK, Y); if(NAME = X \hyperref[b0]{[1]}, done(no(hop\textunderscore nodes(X); hop(links(all), nodes(not(X)); and\textunderscore parallel\textunderscore hop(links(any), nodes(X))); unit(unit('X:', X), unit('Y:', Y)))); notbelong(NAME, X); no\textunderscore hop\textunderscore noback(links(any), nodes(X)); append(NAME, X)); count(X) <= 5))\par Output of only some matches in the scenario starting node will be: ((X: 1, 11, 12), (Y:a, z, c)), ((X: 3, 7, 6), (Y: k, n, i)), ? --all three nodes ((X: 16, 13, 5, 20), (Y: y, t, d, b)), ((X: 4, 18, 15, \hyperref[b14]{19)}, (Y: m, a, t, a)) --four nodes ((X: 19, 15, 8, 9, 10), (Y: t, e, f, u, l)) --five nodes Some of the found matches are shown in Fig. \hyperref[fig_21]{21} in bold or dashed lines if solutions intersect, where full result includes all triangles. Each match will actually have repetitions, as its search starts from all nodes of the same solution, also develops in both ways in the ring (like clockwise and counterclockwise), which will be reflected by indices of the resultant values of X and Y variables. Multiple repeated solutions, which may start from each node of the ring and develop in two directions, can be easily reduced to only two. This is achievable by allowing them to start only with the node having the strongest name (or address) among all nodes of the ring. In this respect, we can extend the string just before the last one in two previous scenarios as follows:\par X[1] > NAME; notbelong(NAME, X); no(hop\textunderscore noback(links(any), nodes(X)));\par If to take other than 5 threshold number of nodes in the previous scenario, we will have additional ring solutions without "central authority", as below for count(X) <= 6, see also \section[{Examples of Global Network Dynamics}]{Examples of Global Network Dynamics}\par We will be considering here some massive operations and transformations on distributed networks in a global scale and their effective expression in SGL. \section[{a) Shrinking Networks}]{a) Shrinking Networks}\par We will show here how to express massive gradual self-reduction of the network in its size, i.e. in a number of its nodes and links, from its full body to the ultimate naught, by using different kinds of parallel techniques.\par i. Substituting of a group of nodes with a single node By first considering the pattern of Fig. \hyperref[fig_17]{17} with variables in nodes, will be trying to substitute all nodes of its match found in Fig. \hyperref[fig_18]{18} by a single node, say, with a symbolic name 100, which should have all links to the remaining nodes the substituted pattern had, as in Fig. \hyperref[fig_23]{23}. Also assuming the CONTENT of this new node will reflect the number of substituted nodes by it. If the group's nodes to be substituted are known in advance, the SGL solution will be shorter, as follows. Also, we may place the new node into the averaged topological center of the deleted group if physical positions of its nodes are known, like for the case of virtual-physical world integration. frontal(Group) = \hyperref[b10]{(11,}\hyperref[b3]{4,}\hyperref[b6]{7,}\hyperref[b4]{6,} {\ref 5,} {\ref 12,}\hyperref[b2]{3)}; Center = average(hop\textunderscore nodes(Group); WHERE); sequence( (create\textunderscore node(100, coordinate(Center)); frontal(New) = ADDRESS; CONTENT = count(Group); hop\textunderscore nodes(Group); hop(links(all), nodes(notbelong(Group)); linkup(LINK, node(New))),\par The CONTENT of node 100 will be 7, reflecting the number of nodes it substituted.\par ii. Black hole mode of further network shrinking Having substituted part of the network by the new node named 100, as above, let us consider further shrinking of this network in the "Black Hole" [50] mode, where each time this new node absorbs all neighboring nodes and establishes all links with the nodes these neighbors had before their consumption. Let us also increase the CONTENT of this Black Hole node by the number of newly swallowed nodes by it. This spatial iterative process, shown in three stages in Fig. \hyperref[fig_24]{24} after obtaining the network of Fig. \hyperref[fig_23]{23}, results in the only renaming node 100 as the ultimate Black Hole, with SGL solution of such gradual shrinking-consumption process being as follows. The final CONENT of the resulting Black Hole node will be: 7 + 5 + 5 + 1 = 18.\par iii. Gradual asynchronous self-destruction of the whole network\par The main idea here is that nodes having fewer connections with other nodes than a certain threshold are considered weak and cannot exist any more, thus removing themselves from the network. The SGL solution below is hopping to all nodes only once and staying in them as long as possible until discovering the lower number of neighboring (i.e. directly connected) nodes than the established threshold, with subsequent self-destruction. In Fig. \hyperref[fig_2]{25}, the three stages are shown of parallel self-shrinking of the network of Fig. \hyperref[fig_6]{10} (the fourth stage would just be the empty network), with the nodes initially or subsequently (after the neighboring nodes dying) having 3 or less neighbors ceasing to exist. hop\textunderscore nodes(all); repeat( if(count(hop\textunderscore links(all)) <= 3, remove(current)); sleep(delay)) Fig. \hyperref[fig_2]{25}: Gradual network self-destruction by the death of weakest nodes Under topologies other than of Fig. \hyperref[fig_6]{10}, and also with more links between different nodes, a part or parts of the network can survive despite initially having nodes below the given threshold number of neighbors, and this threshold can also be made varying during the network dynamics. \section[{b) Expanding Networks}]{b) Expanding Networks}\par In the previous section we considered mechanisms that can provide global shrinking of networks, from their full body to ultimate naught. In the current section, we will be showing how the network can unlimitedly expand in size (i.e. the number of nodes and links) and in physical space, also imitating a sort of its symbolic explosion. \section[{i. Growing by the numbers of nodes and links}]{i. Growing by the numbers of nodes and links}\par We are providing here a very simple example of a possible massive expansion of the network of Fig. \hyperref[fig_6]{10} by introducing additional nodes instead of each link, which the new nodes connected with the two nodes of the substituted links by the same named links. The new nodes may also randomly establish additional links with other nodes in certain vicinity by obeying allowed distance (or radius) in the explored region, as shown in Fig. \hyperref[fig_25]{26} In this elementary example of massive network expansion, we assume that all new nodes and all new links from them are same named, respectively as x and y. In Fig. \hyperref[fig_25]{26}, links with previous names that directly connected nodes of the network of Fig. \hyperref[fig_6]{10} are shown in bold. After adding more semantics to this simplified network extension example the names and contents of new nodes and links may be quite different.\par Using same ideas as above of the network extension, we may now substitute again all links between nodes by new nodes with establishing new links with other nodes, and so on, thus providing endless and unlimited extension, actually explosion, of the network of Fig. \hyperref[fig_6]{10}. The following SGL scenario is based on the previous one by just repeating it certain number of times, here 50 (for prevention of unlimited explosion), with all new nodes and links, for simplicity, again named x and y. \section[{ii. Network expansion in physical space}]{ii. Network expansion in physical space}\par We can assume that the growing number of network nodes and links can be naturally linked with network's expansion in physical space too. The gradual expansion of the net in physical space can be organized as follows. If randomly found possible new location of a node (using the Radius-like threshold distance which can also grow during network's physical expansion) Combining this physical extension with the previously considered network growth by the number of nodes and links, we can effectively simulate unlimited expansion, even explosion, of the network in both virtual and physical environments, actually covering the whole universe. This can be clearly expressed by the following SGL scenario using procedures Blow and Spread. In establishing new links of a node with other nodes, we are regularly updating the considered depth of their vicinity by recalculating the value of Radius, as the network itself is constantly expanding in physical space.\par In our simple example, the shadowed new x nodes (as of Fig. \hyperref[fig_25]{26}) may symbolically look like imitating a sort of "Dark Matter" [51] of the universe. This matter by the above scenario will, however, quickly dominate the whole network as the latter grows both virtually and physically only due to the increase of the number of shadowed nodes, with other, initial, nodes remaining in the same quantity. \section[{VIII.}]{VIII.} \section[{Conclusions}]{Conclusions}\par In this paper we have shown how different operations on general networks can be described and implemented in fully distributed and highly parallel mode using the developed Spatial Grasp model and Technology and its basic spatial Grasp Language, SGL. The obtained experience of using SGT and SGL and shown exemplary solutions on networks may be useful for solving different problems in many important areas reviewed at the beginning of the paper, most of which can be conveniently formulated on distributed dynamic networks. These solutions in SGL proved to be simple and concise as the model and language allow us to directly exist and operate in distributed spaces by expressing top level problem semantics, with hiding numerous traditional system routines inside effective networked technology implementation.\par At first sight, SGT and SGL may have some philosophical and conceptual resemblance to physical phenomenon like waves [52, 53] (the ancestor versions of SGL were named as WAVE \hyperref[b25]{[43]}\hyperref[b26]{[44]}\hyperref[b27]{[45]}), also to biological and computer viruses \hyperref[b36]{[54,} {\ref 55]} and what is called "mobile agents" \hyperref[b37]{[56]}\hyperref[b38]{[57]} {\ref [58]}. Yes, SGL allows us to freely move in distributed spaces in a highly parallel mode, but it also readily provides, if needed, the return of any remote results directly to any previous space points, with their analysis and possible launching of new waves there, or the return to already gained remote space positions and further wavelike development from them, and so on. With such forward-backward recursive mode this is effectively covering and controlling any distributed systems with any power, to any depth, and by any hierarchy needed. Moreover, after and even during space coverage in recursive SGL mode, arbitrary complex and active infrastructure may be explicitly or implicitly embedded into the distributed world fabric (like openly, on agreements, or in a stealth mode for special applications). With these infrastructures effectively modeling any other concepts and models (like Petri nets or neural networks) and also capable of launching themselves new parallel waves, and so on, SGT may provide the most powerful paradigm and technology for conquering and ruling of the universe.\par SGT continues its development in different areas, including advanced mosaic-type operations in distributed systems \hyperref[b39]{[59]}, in trying to understand and simulate such extremely complex features as awareness and consciousness \hyperref[b40]{[60]}, in providing philosophical and technological support of space conquest and advanced terrestrial and celestial missions \hyperref[b41]{[61]}, and many others. Among the latest publications related to other SGT applications, \hyperref[b42]{[62]}\hyperref[b43]{[63]}\hyperref[b44]{[64]}\hyperref[b45]{[65]} can be named. The latest SGL version can be implemented even within standard university environments, similar to its previous versions in different countries under the author's supervision. The technology can be installed in numerous copies worldwide and deeply integrated with any other systems, actually acquiring unlimited power for simulation and management of the whole world.\begin{figure}[htbp] \noindent\textbf{12}\includegraphics[]{image-2.png} \caption{\label{fig_0}Fig. 1 :Fig. 2 :}\end{figure} \begin{figure}[htbp] \noindent\textbf{4}\includegraphics[]{image-3.png} \caption{\label{fig_1}Fig. 4 :}\end{figure} \begin{figure}[htbp] \noindent\textbf{5}\includegraphics[]{image-4.png} \caption{\label{fig_2}Fig. 5 :}\end{figure} \begin{figure}[htbp] \noindent\textbf{6}\includegraphics[]{image-5.png} \caption{\label{fig_3}Fig. 6 :}\end{figure} \begin{figure}[htbp] \noindent\textbf{7}\includegraphics[]{image-6.png} \caption{\label{fig_4}Fig. 7 :}\end{figure} \begin{figure}[htbp] \noindent\textbf{9}\includegraphics[]{image-7.png} \caption{\label{fig_5}Fig. 9 :}\end{figure} \begin{figure}[htbp] \noindent\textbf{10}\includegraphics[]{image-8.png} \caption{\label{fig_6}Fig. 10 :}\end{figure} \begin{figure}[htbp] \noindent\textbf{}\includegraphics[]{image-9.png} \caption{\label{fig_7}©}\end{figure} \begin{figure}[htbp] \noindent\textbf{111}\includegraphics[]{image-10.png} \caption{\label{fig_8}Fig. 11 : 1}\end{figure} \begin{figure}[htbp] \noindent\textbf{12}\includegraphics[]{image-11.png} \caption{\label{fig_9}Fig. 12 :}\end{figure} \begin{figure}[htbp] \noindent\textbf{}\includegraphics[]{image-12.png} \caption{\label{fig_10}}\end{figure} \begin{figure}[htbp] \noindent\textbf{}\includegraphics[]{image-13.png} \caption{\label{fig_11}}\end{figure} \begin{figure}[htbp] \noindent\textbf{14}\includegraphics[]{image-14.png} \caption{\label{fig_12}Fig. 14 :}\end{figure} \begin{figure}[htbp] \noindent\textbf{15}\includegraphics[]{image-15.png} \caption{\label{fig_13}Fig. 15 :}\end{figure} \begin{figure}[htbp] \noindent\textbf{162}\includegraphics[]{image-16.png} \caption{\label{fig_14}Fig. 16 : 2}\end{figure} \begin{figure}[htbp] \noindent\textbf{}\includegraphics[]{image-17.png} \caption{\label{fig_15}}\end{figure} \begin{figure}[htbp] \noindent\textbf{}\includegraphics[]{image-18.png} \caption{\label{fig_16}}\end{figure} \begin{figure}[htbp] \noindent\textbf{17}\includegraphics[]{image-19.png} \caption{\label{fig_17}Fig. 17 :}\end{figure} \begin{figure}[htbp] \noindent\textbf{18}\includegraphics[]{image-20.png} \caption{\label{fig_18}Fig. 18 :}\end{figure} \begin{figure}[htbp] \noindent\textbf{19}\includegraphics[]{image-21.png} \caption{\label{fig_19}Fig. 19 :}\end{figure} \begin{figure}[htbp] \noindent\textbf{20}\includegraphics[]{image-22.png} \caption{\label{fig_20}Fig. 20 :}\end{figure} \begin{figure}[htbp] \noindent\textbf{21}\includegraphics[]{image-23.png} \caption{\label{fig_21}Fig. 21 :}\end{figure} \begin{figure}[htbp] \noindent\textbf{2222}\includegraphics[]{image-24.png} \caption{\label{fig_22}Fig. 22 .Fig. 22 :}\end{figure} \begin{figure}[htbp] \noindent\textbf{23}\includegraphics[]{image-25.png} \caption{\label{fig_23}Fig. 23 :}\end{figure} \begin{figure}[htbp] \noindent\textbf{24}\includegraphics[]{image-26.png} \caption{\label{fig_24}Fig. 24 :}\end{figure} \begin{figure}[htbp] \noindent\textbf{26}\includegraphics[]{image-27.png} \caption{\label{fig_25}Fig. 26 :}\end{figure} \begin{figure}[htbp] \noindent\textbf{}\includegraphics[]{image-28.png} \caption{\label{fig_26}}\end{figure} \begin{figure}[htbp] \noindent\textbf{} \par \begin{longtable}{P{0.85\textwidth}} frontal(Group) = ( hop\textunderscore nodes(all);\\ frontal(X); hop\textunderscore link(m); X =\\ NAME; hop\textunderscore link(c); X \&\&= NAME;\\ hop\textunderscore link(n); X \&\&= NAME;\\ hop\textunderscore link(p); X \&\&= NAME;\\ hop\textunderscore link(b); X \&\&= NAME;\\ true\textunderscore hop(link(z), node(X[1]));\\ hop\textunderscore link(d); X \&\&= NAME;\\ true\textunderscore and\textunderscore parallel(\\ hop(link(e), node(X[2])),\\ hop(link(k), node(X[3]));\\ hop(link(i), node(X[4]));\\ hop(link(g), node(X[5])));\\ \&\& NAME);\\ sequence(\\ (create\textunderscore node(100); CONTENT = count(Group);\\ frontal(New) = ADDRESS;\\ hop\textunderscore nodes(Group);\\ hop(links(all), nodes(notbelong(Group));\\ linkup(LINK, node(New))),\\ remove\textunderscore nodes(Group))\end{longtable} \par \caption{\label{tab_1}}\end{figure} \begin{figure}[htbp] \noindent\textbf{} \par \begin{longtable}{P{0.7867848970251716\textwidth}P{0.06321510297482837\textwidth}} repeat\textunderscore 50(\tabcellsep \\ \multicolumn{2}{l}{stay(hop\textunderscore nodes(all); frontal(Start = NAME, Radius = maxdistance);}\\ \multicolumn{2}{l}{hop\textunderscore links(all); PREVIOUS > ADDRESS; frontal(Link) = LINK;}\\ \multicolumn{2}{l}{remove(LINK); create(link(Link), node(x));}\\ parallel(\tabcellsep \\ linkup(Link, node(Start)), linkup(y,\tabcellsep \\ random\textunderscore nodes(Radius)));\tabcellsep \\ sleep(delay))\tabcellsep \\ Asynchronous internal unlimited self-growth,\tabcellsep achieved by the following recursive scenario procedure\\ only first time contacting all nodes from outside, while\tabcellsep named Blow.\\ further extending from the new nodes only, can be\tabcellsep \\ frontal(Blow) =\tabcellsep \\ \multicolumn{2}{l}{\{frontal(Start = NAME, Radius = maxdistance); hop\textunderscore links(all);}\\ \multicolumn{2}{l}{PREVIOUS > ADDRESS; frontal(Link) = LINK; remove(LINK);}\\ create(link(Link), node(x));\tabcellsep \\ stay\textunderscore parallel(\tabcellsep \\ linkup(Link, node(Start)), linkup(y,\tabcellsep \\ random\textunderscore nodes(Radius)));\tabcellsep \\ \multicolumn{2}{l}{sleep(delay); run(Blow)\}; hop\textunderscore nodes(all); run(Blow)}\end{longtable} \par \caption{\label{tab_2}}\end{figure} \begin{figure}[htbp] \noindent\textbf{} \par \begin{longtable}{P{0.85\textwidth}} hop\textunderscore nodes(all);\\ repeat(\\ Radius = max(hop\textunderscore links(all); distance(BACK, WHERE));\\ Sum = add(hop\textunderscore links(all); distance(BACK, WHERE));\\ Min = min(hop\textunderscore links(all); distance(BACK, WHERE));\\ New = (move\textunderscore random(Radius); WHERE);\\ Sum1 = add(hop\textunderscore links(all); distance(New, WHERE));\\ Min1 = min(hop\textunderscore links(all); distance(New, WHERE));\\ if(or\textunderscore seq(Sum1 > Sum, Min1 > Min), WHERE = New);\\ sleep(delay))\\ Xx X Issue V Version I\\ ) Volume\\ J\\ (\\ lobal Journal of Researches in Engineering\end{longtable} \par \caption{\label{tab_3}}\end{figure} \footnote{© 2020 Global Journals lobal Journal of Researches in Engineering ( ) Volume Xx X Issue V Version I J} \footnote{© 2020 Global Journals} \backmatter \begin{bibitemlist}{1} \bibitem[ World-Systems Theory]{b0}\label{b0} \textit{}, \url{https://en.wikipedia.org/wiki/World-systems\textunderscore theory} \textit{World-Systems Theory} \bibitem[Sapaty ()]{b30}\label{b30} \textit{}, P S Sapaty . \textit{Complexity in International Security: A Holistic Spatial Approach} 2019. Emerald Publishing. \bibitem[Sapaty ()]{b25}\label{b25} ‘A Distributed Processing System, European Patent No. 0389655’. P Sapaty . Publ. 10.11.93. \textit{European Patent Office} 1993. \bibitem[Anagnostou and Taylor (2017)]{b15}\label{b15} ‘A distributed simulation methodological framework for OR/MS applications’. A Anagnostou , S J E Taylor . \url{https://www.researchgate.net/publication/309628600\textunderscore A\textunderscore distributed\textunderscore simulation\textunderscore methodological\textunderscore framework\textunderscore for\textunderscore ORMS\textunderscore applications} \textit{Simulation Modelling Practice and Theory} January 2017. 70 p. . \bibitem[Burgess and Fisher]{b21}\label{b21} \textit{A Framework for the Study of Command and Control Structures, DSTO Defence Science and Technology Organisation PO Box 1500}, A Burgess , P Fisher . \bibitem[Teng et al.]{b35}\label{b35} ‘Adaptive computer-generated forces for simulator-based 52’. T.-H Teng , A.-H Tan , L.-N Teow . \url{https://en.wikipedia.org/wiki/Wave} \textit{Electromagnetic radiation}, \bibitem[Hakir et al. (2010)]{b20}\label{b20} ‘Addressing the Challenge of Distributed Interactive Simulation With Data Distribution Service, Researh Gate’. A Hakir , P Berthou , T Gayraud . \url{https://www.sciencedirect.com/science/article/abs/pii/S0957417413004661} Expert System Applications August 2010. 15 December 2013. Elesevier. 40 (18) . \bibitem[Sapaty]{b42}\label{b42} ‘Advanced terrestrial and celestial missions under spatial grasp technology’. P S Sapaty . \url{https://medcraveonline.com/AAOAJ/AAOAJ-04-00110.pdf} \textit{Aeronautics and Aerospace Open Access Journal} 4. (Issue 3 -2020) \bibitem[Jezic et al. (2019)]{b38}\label{b38} ‘Agents and Multiagent Systems: Technologies and Applications’. G Jezic , Y.-H J Chen-Burger , M Kusek , R ?perka , R J Howlett , L C Jain . \xref{http://dx.doi.org/10.1007/978-981-13-8679-4}{10.1007/978-981-13-8679-4}. \url{https://link.springer.com/book/10.1007/978-981-13-8679-4} \textit{13th KES International Conference}, (Malta) 2019. June 2019. (KES-AMSTA-2019 St) \bibitem[Farand]{b7}\label{b7} \textit{Climate change tops risks for world in 2020 -Davos report, Climate Home News}, C Farand . \url{https://www.climatechangenews.com/2020/01/15/climate-change-tops-risks-for-world-in-2020-davos-report/} (Published on 15/01/2020) \bibitem[Distributed-Simulation-of-Cooperatively-Interacting-Vehicles.pdf 23. Distributed Interactive Simulation ()]{b18}\label{b18} \url{https://en.wikipedia.org/wiki/Distributed\textunderscore Interactive\textunderscore Simulation} \textit{Distributed-Simulation-of-Cooperatively-Interacting-Vehicles.pdf 23. Distributed Interactive Simulation}, 2018. \bibitem[Wade ()]{b4}\label{b4} \textit{Environmental Threats Dominate}, G Wade . 2020. \bibitem[Frohn et al.]{b17}\label{b17} C Frohn , S Ilov , E Kriebel , B Kusmenko , A Rumpe , Ryndin . \textit{Distributed Simulation of Cooperatively Interacting Vehicles, International Conference on Intelligent Transportation Systems (ITSC'18)}, \bibitem[Fujimoto and Yilmaz Chan Moon Roeder Macal Rossetti (ed.)]{b14}\label{b14} R Fujimoto . \url{https://www.informs-sim.org/wsc15papers/004.pdf} \textit{Parallel and Distributed Simulation, Proceedings of the 2015 Winter Simulation Conference}, L Yilmaz, W K V Chan, I Moon, T M K Roeder, C Macal, M D Rossetti (ed.) \bibitem[Burke, Anthony, Parker, Rita (ed.) ()]{b2}\label{b2} \textit{Global Insecurity. Futures of Global Chaos and Governance, Pakgrave Macmillian}, \url{https://www.palgrave.com/gp/book/9781349951444} Burke, Anthony, Parker, Rita (ed.) 2017. \bibitem[Global Network Management under Spatial Grasp Paradigm]{b31}\label{b31} \textit{Global Network Management under Spatial Grasp Paradigm}, \bibitem[Global Risks Report for the First Time in History, By Acclimatize News 20 th January 2020 Climate Change Impacts, Features]{b5}\label{b5} \url{https://www.acclimatise.uk.com/2020/01/20/environmental-threats-dominate-2020-global-risks-report-for-the-first-time-in-history/} \textit{Global Risks Report for the First Time in History, By Acclimatize News 20 th January 2020 Climate Change Impacts, Features}, \bibitem[Topçu and O?uztüzün ()]{b19}\label{b19} \textit{Guide to Distributed Simulation with HLA}, O Topçu , H O?uztüzün . \url{https://www.springer.com/gp/book/9783319612669} 2017. Springer. \bibitem[High Level Architecture]{b33}\label{b33} \url{https://en.wikipedia.org/wiki/High\textunderscore Level\textunderscore Architecture} \textit{High Level Architecture}, \bibitem[Sapaty ()]{b29}\label{b29} \textit{Holistic Analysis and Management of Distributed Social Systems}, P S Sapaty . 2018. Springer. \bibitem[Inequality in a Rapidly Changing World, ST/ESA/372 United Nations publication Sales No. E.20.IV.1, United Nations World Social Report ()]{b3}\label{b3} ‘Inequality in a Rapidly Changing World, ST/ESA/372 United Nations publication Sales No. E.20.IV.1, United Nations’. \url{https://www.un.org/development/desa/dspd/wp-content/uploads/sites/22/2020/02/World-Social-Report2020-FullReport.pdf} \textit{World Social Report} 2020. 2020. \bibitem[Sapaty (2015)]{b41}\label{b41} ‘Integral spatial intelligence for advanced terrestrial and celestial missions’. P S Sapaty . \url{https://www.longdom.org/proceedings/integral-spatial-intelligence-for-advanced-terrestrial-and-celestial-missions-5094.html} \textit{3rd International Conference and Exhibition on Mechanical \& Aerospace Engineering}, (San Francisco, USA) October 05-07. 2015. \bibitem[Hamal et al. (2020)]{b9}\label{b9} ‘Let Us Fight Together against COVID-19, Pandemic’. P K Hamal , G Dangal , P Gyawnli , A K Jha . \url{https://www.researchgate.net/publication/340807721\textunderscore Let\textunderscore Us\textunderscore Fight\textunderscore Together\textunderscore against\textunderscore COVID-19\textunderscore Pandemic} \textit{Journal of Nepal Health Research Council} I-II (ed.) April 2020. 18 (46) . \bibitem[Live]{b34}\label{b34} Live . \url{https://www.scalable-networks.com/live-virtual-constructive-simulation-software} \textit{Constructive Simulation Software, Scalable Network Technologies}, \bibitem[Sapaty ()]{b28}\label{b28} \textit{Managing Distributed Dynamic Systems with Spatial Grasp Technology}, P S Sapaty . 2017. Springer. \bibitem[Sapaty ()]{b39}\label{b39} ‘Mosaic warfare: from philosophy to model to solutions’. P S Sapaty . \url{https://medcraveonline.com/IRATJ/IRATJ-05-00190.pdf} \textit{International Robotics \& Automation Journal} 2019. 5 (5) . \bibitem[Page (2011)]{b11}\label{b11} \textit{Multi-level spatial simulation. The Seventh Conference of the European Social Simulation Association ESSA}, C L Page . \url{https://www.researchgate.net/publication/230802219\textunderscore Multi-level\textunderscore spatial\textunderscore simulation} 2011. January 2011. \bibitem[O'sullivan and Perry (2013)]{b12}\label{b12} D O'sullivan , G L W Perry . \xref{http://dx.doi.org/10.1002/9781118527085}{10.1002/9781118527085}. \url{https://onlinelibrary.wiley.com/doi/book/10.1002/9781118527085} \textit{Spatial Simulation: Exploring Pattern and Process}, August 2013. John Wiley \& Sons, Ltd. \bibitem[Lai (2012)]{b8}\label{b8} ‘Organizational Collaborative Capacity in Fighting Pandemic Crises: A Literature Review From the Public Management Perspective’. A Lai . \url{https://www.researchgate.net/publication/221842851\textunderscore Organizational\textunderscore Collaborative\textunderscore Capacity\textunderscore in\textunderscore Fighting\textunderscore Pandemic\textunderscore Crises\textunderscore A\textunderscore Literature\textunderscore Review\textunderscore From\textunderscore the\textunderscore Public\textunderscore Management\textunderscore Perspective} \textit{Asia-Pacific Journal of Public Health} February 2012. 24 (1) p. . \bibitem[Straßburger (2006)]{b32}\label{b32} \textit{Overview about the High Level Architecture for Modelling and Simulation and Recent Developments}, S Straßburger . \url{https://www.researchgate.net/publication/251422110\textunderscore Overview\textunderscore about\textunderscore the\textunderscore High\textunderscore Level\textunderscore Architecture\textunderscore for\textunderscore Modelling\textunderscore and\textunderscore Simulation\textunderscore and\textunderscore Recent\textunderscore Developments} September 2006. Research Gate. \bibitem[Angelo (2011)]{b16}\label{b16} ‘Parallel and Distributed Simulation from Many Cores to the Public Cloud’. G Angelo . \url{https://arxiv.org/pdf/1105.2301.pdf} \textit{Proceedings of the International Conference on High Performance Computing and Simulation (HPCS 2011). Istanbul (Turkey)}, (the International Conference on High Performance Computing and Simulation (HPCS 2011). Istanbul (Turkey)) July 2011. IEEE. \bibitem[Sapaty ()]{b27}\label{b27} \textit{Ruling Distributed Dynamic Worlds}, P S Sapaty . 2005. New York: John Wiley \& Sons. \bibitem[Sapaty ()]{b26}\label{b26} P S Sapaty . \textit{Mobile Processing in Distributed and Open Environments}, (New York) 1999. John Wiley \& Sons. \bibitem[Hoffman et al. (2007%20Hoffman%20et%20al%20Simul%20for %20Sustain)]{b10}\label{b10} ‘Simulation Models for Sustainability’. R Hoffman , B Mcinnis , P Bunnell . \url{https://unigis.at/weiterbildung/spatial-simulation/} \textit{Global Simulation System --a global scale, high granularity, stock and flow model, Sympoetic}, 2007\%20Hoffman\%20et\%20al\%20Simul\%20for \%20Sustain. (Gudrun Wallentin) \bibitem[Sapaty (2020)]{b43}\label{b43} ‘Spatial Management of Distributed Social Systems’. P S Sapaty . \url{https://ojs.bilpublishing.com/index.php/jcsr/article/view/2077/pdf} \textit{Journal of Computer Science Research} July 2020. 02 (03) . \bibitem[Baumann et al. (2002)]{b37}\label{b37} ‘Special Issue: Mobile Agent Systems’. J Baumann , F Hohl , K Rothermel , M Strasser , W Theilmann . \xref{http://dx.doi.org/10.1002/spe.450}{10.1002/spe.450}. \url{https://onlinelibrary.wiley.com/doi/10.1002/spe.450} \textit{Journal of Software: Practice and Experience12} May 2002. 32 (6) . (MOLE: A mobile agent system) \bibitem[Sapaty (2020)]{b45}\label{b45} ‘Symbiosis of Distributed Simulation and Control under Spatial Grasp Technology’. P S Sapaty . \url{http://www.internationaljournalssrg.org/IJMCA/2020/Volume7-Issue2/IJMCA-V7I2P101.pdf} \textit{SSRG International Journal of Mobile Computing and Application (IJMCA)} May -August 2020. 7 (2) . \bibitem[Sapaty ()]{b40}\label{b40} \textit{Symbiosis of Real and Simulated Worlds Under Global Awareness and Consciousness, abstract at: The Science of Consciousness (TSC) conferences}, P S Sapaty . \url{https://eagle.sbs.arizona.edu/sc/report\textunderscore poster\textunderscore detail.php?abs=3696} 2020. Tucson, Arizona. \bibitem[Thoughts About C4I Systems, Blog on C4ISR systems development and maintenance CC BY]{b23}\label{b23} ‘Thoughts About C4I Systems, Blog on C4ISR systems development and maintenance’. \textit{CC BY} 3 p. . \bibitem[Markovitz (2020)]{b6}\label{b6} ‘Top risks are environmental, but ignore economics and they'll be harder to fix’. G Markovitz . \url{https://www.weforum.org/agenda/2020/01/what-s-missing-from-the-2020-global-risks-report/} \textit{World Economic Forum} 15 Jan 2020. \bibitem[Bell (2008)]{b24}\label{b24} ‘Toward a Definition of "Virtual Worlds’. M W Bell . \url{https://journals.tdl.org/jvwr/index.php/jvwr/article/view/283/237} \textit{Virtual Worlds Research: Past, Present \& Future}, July 2008. 1. \bibitem[Sapaty ()]{b44}\label{b44} ‘Towards Global Nano systems Under High-level Networking Technology’. P S Sapaty . \textit{Acta Scientific Computer Sciences} 2020. 2 (8) . \bibitem[Qadri (2018)]{b1}\label{b1} \textit{Understanding Dynamics of Modern World, Research Gate}, B Qadri . \url{https://www.researchgate.net/publication/328333429\textunderscore Understanding\textunderscore Dynamics\textunderscore of\textunderscore Modern\textunderscore World} October 2018. \bibitem[Heartfield (2018)]{b22}\label{b22} \textit{Understanding the Chain of Command in Your Workplace, Human Resources Glossary}, S M Heartfield . \url{https://www.thebalancecareers.com/chain-of-command-1918082} September 16. 2018. \bibitem[Darvishi and Ahmadib ()]{b13}\label{b13} \textit{Validation techniques of agent based modelling for geospatial simulations. The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences}, M Darvishi , G Ahmadib . XL-2/W3. \url{https://www.int-arch-photogramm-remote-sens-spatial-inf-sci.net/XL-2-W3/91/2014/isprsarchives-XL2-W3-91-2014.pdf} 2014. \bibitem[Villarreal (2008)]{b36}\label{b36} L P Villarreal . \url{https://www.scientificamerican.com/article/are-viruses-alive-2004/} \textit{Are Viruses Alive? Scientific American}, August 8, 2008. \end{bibitemlist} \end{document}