<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.0 20120330//EN" "JATS-journalpublishing1.dtd">

<article article-type="research-article" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML">
 <front>
    <journal-meta>
	<journal-id journal-id-type="publisher-id">Jemr</journal-id>
      <journal-title-group>
        <journal-title>Journal of Eye Movement Research</journal-title>
      </journal-title-group>
      <issn pub-type="epub">1995-8692</issn>
	  <publisher>								
	  <publisher-name>Bern Open Publishing</publisher-name>
	  <publisher-loc>Bern, Switzerland</publisher-loc>
	</publisher>
    </journal-meta>
    <article-meta>
	<article-id pub-id-type="doi">10.16910/jemr.11.4.1</article-id> 
	  <article-categories>								
				<subj-group subj-group-type="heading">
					<subject>Research Article</subject>
				</subj-group>
		</article-categories>
      <title-group>
        <article-title>Using Eye Movement Data Visualization to Enhance Training of Air Traffic Controllers: A Dynamic Network Approach</article-title>
      </title-group>
	   <contrib-group> 
				<contrib contrib-type="author">
					<name>
						<surname>Mandal</surname>
						<given-names>Saptarshi</given-names>
					</name>
					<xref ref-type="aff" rid="aff1">1</xref>
				</contrib>
				<contrib contrib-type="author">
					<name>
						<surname>Kang</surname>
						<given-names>Ziho</given-names>
					</name>
					<xref ref-type="aff" rid="aff1">1</xref>
				</contrib>				
        <aff id="aff1">
		<institution>University of Oklahoma</institution>,   <country>USA</country>
        </aff>
		</contrib-group>   

		
	  <pub-date date-type="pub" publication-format="electronic"> 
		<day>8</day>  
		<month>8</month>
        <year>2018</year>
      </pub-date>
	  <pub-date date-type="collection" publication-format="electronic"> 
	  <year>2018</year>
	</pub-date>
      <volume>11</volume>
      <issue>4</issue>
	 <elocation-id>10.16910/jemr.11.4.1</elocation-id> 
	<permissions> 
	<copyright-year>2018</copyright-year>
	<copyright-holder>Mandal, S. &#x26; Kang, Z</copyright-holder>
	<license license-type="open-access">
  <license-p>This work is licensed under a Creative Commons Attribution 4.0 International License, 
  (<ext-link ext-link-type="uri" xlink:href="https://creativecommons.org/licenses/by/4.0/">
    https://creativecommons.org/licenses/by/4.0/</ext-link>), which permits unrestricted use and redistribution provided that the original author and source are credited.</license-p>
</license>
	</permissions>
      <abstract>
        <p>The Federal Aviation Administration (FAA) forecasted substantial increase in the US air traffic volume creating a high demand in Air Traffic Control Specialists (ATCSs). Training times and passing rates for ATCSs might be improved if expert ATCSs’ eye movement (EM) characteristics can be utilized to support effective training. However, effective EM visualization is difficult for a dynamic task (e.g. aircraft conflict detection and mitigation) that includes interrogating multi-element targets that are dynamically moving, appearing, disappearing, and overlapping within a display. To address the issues, a dynamic network-based approach is introduced that integrates adapted visualizations (i.e. time-frame networks and normalized dot/bar plots) with measures used in network science (i.e. indegree, closeness, and betweenness) to provide in-depth EM analysis. The proposed approach was applied in an aircraft conflict task using a high-fidelity simulator; employing the use of veteran ATCSs and pseudo pilots. Results show that, ATCSs’ visual attention to multi-element dynamic targets can be effectively interpreted and supported through multiple evidences obtained from the various visualization and associated measures. In addition, we discovered that fewer eye fixation numbers or shorter eye fixation durations on a target may not necessarily indicate the target is less important when analyzing the flow of visual attention within a network. The results show promise in cohesively analyzing and visualizing various eye movement characteristics to better support training.</p>
      </abstract>
      <kwd-group>
        <kwd>Eye tracking</kwd>
        <kwd>Eye movement</kwd>
        <kwd>Scanpath</kwd>
        <kwd>Air Traffic Control</kwd>
        <kwd>Dynamic network</kwd>
        <kwd>Visualization</kwd>		
      </kwd-group>
    </article-meta>
  </front>	
  <body>

    <sec id="S1">
      <title>1. Introduction</title>

<p>The Federal Aviation Administration (FAA) forecasted a 1.4% annual increase
in the US air traffic volume; from currently 43.2 million aircraft to
60.3 million by 2040.(<xref ref-type="bibr" rid="b1">1</xref>) However, the currently available
number of expert air traffic control specialists (ATCSs) might not be
sufficient to handle the anticipated increase of air traffic volume.
Additionally, the current training completion time of the air traffic
controllers takes many years of intensive training.(<xref ref-type="bibr" rid="b2">2</xref>)
Therefore, the FAA has been trying to find ways to efficiently train the
FAA Academy candidates.</p>

<p>One of the critical tasks of ATCSs is to detect and mitigate possible
aircraft conflicts (i.e. possible collisions) through visually scanning
the radar screen. The ATCSs look for conflicting situations between
aircraft pairs (or groups) to resolve it and guide them to their
destination in a safe/timely manner. Thus, the ATCS’s task involves a
significant amount of visual scanning of the radar display and,
subsequently, cognitive processing of the observed information to take
necessary actions. Eye-mind hypothesis(<xref ref-type="bibr" rid="b3">3</xref>) showed there exists
high correlation between the eye movement (EM) data and the cognitive
process of an observer. Kang and Landry(<xref ref-type="bibr" rid="b4">4</xref>) demonstrated that
exposing novice controllers to the visual scanpath of the expert ATCSs
improved their overall scanning efficiency by reducing their false
positive cases of conflict detection among aircraft. On Similar lines,
Rudi, Kiefer and Raubal(<xref ref-type="bibr" rid="b5">5</xref>) demonstrated that visualization of
EM data of pilot’s working in a cockpit might prove useful for flight
instruction purposes. Therefore, if we could effectively analyze,
visualize, and interpret experts’ eye movement characteristics, we might
be able to use those findings to train the candidates or novices.</p>

<fig id="fig01" fig-type="figure" position="float">
					<label>Figure 1.</label>
					<caption>
						<p>Dynamic aspects of aircraft representation on the radar
display of an ATCS: (a) Location of the data blocks changes relative to
the aircraft location. (b) Two overlapping aircraft.</p>
					</caption>
					<graphic id="graph01" xlink:href="jemr-11-04-a-figure-01.png"/>
				</fig>


<p>Effective analysis of ATCSs’ visual scanning process is challenging.
The Radar display has, a large number of dynamic targets (i.e. aircraft
on radar display) which have dynamic properties (e.g. radar
representation of an aircraft can change their shape and position with
time). Figure 1 represents the dynamic aspect of the radar
representation of aircraft.</p>

<p>Visualization of ATCSs’ EM data includes two steps. The first step
involves developing a time-ordered mapping between the eye fixations
(EFs) and the aircraft on the display. The second step consists of
characterization of the developed scanpath sequences. To develop the
mapping function in case of moving and overlapping targets, Dynamic
Areas of Interest (AOIs) can be created which are dynamic convex
boundaries that fits the moving targets and considers the visual angle
accuracy.(<xref ref-type="bibr" rid="b6 b7 b8">6, 7, 8</xref>) However, as the number of targets increases,
visualization of the scanpath sequences becomes challenging using the
widely used visualization methods such as point based and AOI based
methods(<xref ref-type="bibr" rid="b9">9</xref>) (explained below in Background section), since these
methods might create visual clutter when numerous targets are
visualized. In addition, air traffic has a dynamic nature, meaning that
an aircraft can dynamically move within the radar display for a certain
amount of time, and/or two or more aircraft can overlap on one another.
As a result, any aircraft’s relevance from the visual scanning point of
view evolves with time. The prevalent visualization methods are unable
to handle this dynamic aspect of the ATCS’s visual scanning process.</p>

<p>In addition, other existing pivotal researches(<xref ref-type="bibr" rid="b10 b11 b12">10, 11, 12</xref>) focus
more on EF numbers and EF durations or simpler forms of scanpaths
(explained in Background section); however, for a dynamic task such as
air traffic control task, how the multiple targets (e.g. aircraft) are
observed as a network (using the various EM transition characteristics)
can also be important, meaning that even if there were fewer number of
EFs or less durations, a target can be considered important if it plays
a crucial role in the EM flow among multiple targets or acts as a bridge
between two disconnected groups of targets. Furthermore, if we only
consider the number of EFs on the aircraft, it might produce an
incorrect interpretation about the important aircraft. For example,
consider a case when an aircraft has just entered the radar display.
There is high chance that this new entrant aircraft might receive a
substantial amount of EF duration, as the ATCSs might want to know about
its destination, altitude, and other details; however, this new aircraft
might not be important in terms of conflict resolution with the already
existing set of aircraft on the display. As a result, the ATCSs will not
fixate again on this aircraft, rendering it unimportant in terms of the
overall scanning strategy. Zhang, Ren and Wu(<xref ref-type="bibr" rid="b13">13</xref>) provided
valuable findings using static networks in the air traffic control
domain, but the dynamic aspects and the issues raised above were not
addressed.</p>

<p>Therefore, we need an improved analysis framework which will help us
(1) develop visualization methods which can represent the EM data with a
large number of targets with less visual clutter, (2) find measures that
can accommodate the dynamic aspects of the moving targets, and (3)
integrate the visualizations and measures for effective analyses and
interpretations.</p>

<p>In this paper, we provide several approaches to address the issues
raised above. First is to adapt the dynamic network (DNet)
approach(<xref ref-type="bibr" rid="b11">11</xref>) and modify its structural components for
visualizing the EM data of the ATCSs. A DNet is a collection of
time-ordered static networks. The DNet visualization enables easy
handling of a large number of targets, thereby reducing visual clutter.
Being a collection of several networks, the DNet can easily represent
the evolution of a target’s importance over time and the dynamics of
visual scanning characteristics. The adapted DNet is aligned with three
“vertex importance measures” such as “indegree,” “closeness,” and
“betweenness”(<xref ref-type="bibr" rid="b14">14</xref>) to better determine important targets.
Furthermore, two types of normalization procedures (i.e. percent
normalization and distance normalization) are introduced that calculate
the relative amount of visual attention given to a target in comparison
to the maximum values obtained for a specific task. Finally, we adapted
the dot plots and bar plots to either better represent the evolution of
the important targets or compare the vertex importance measures among
the participants. Note that we will replace the term “vertex” with
“target” or “AOI” for easier understanding.</p>
    </sec>
	
    <sec id="S2">
      <title>2. Background</title>
    <sec id="S2a">
      <title>2.1 Eye movement (EM) visualizations: Point based, area of
interest (AOI) based, and hybrid</title>

<p>Blascheck et al(<xref ref-type="bibr" rid="b9">9</xref>) have categorized the various EM
visualization methods into point based, AOI based, and hybrid
visualizations. Summaries and issues are as follows.</p>

<p>Existing point based visualization methods, e.g. timeline
visualization,(<xref ref-type="bibr" rid="b15">15</xref>) scanpath visualization,(<xref ref-type="bibr" rid="b16">16</xref>)
attention maps,(<xref ref-type="bibr" rid="b17">17</xref>) space-time cubes,(<xref ref-type="bibr" rid="b17">17</xref>) represent
the time-ordered horizontal and vertical coordinates of the EFs
occurring on the display. These methods are effective on visualizing the
exact EF locations to unravel important regions (in absence of
predefined targets) when given static stimuli. However, due to the
visual angle error of the eye trackers, it is challenging to map the EFs
with small and dynamic multi-element targets making it difficult to
apply the point based methods.(<xref ref-type="bibr" rid="b18">18</xref>) In addition, our interest is
in investigating which moving targets were focused upon rather than the
physically fixed area within a display.</p>

<p>On the other hand, existing AOI based visualization methods allows EM
analysis based on either pre-defined region or target on the display.
The AOI based methods have been categorized into timeline and relational
AOI visualizations.(<xref ref-type="bibr" rid="b9">9</xref>) Time­line AOI visualizations such as
parallel scanpath,(<xref ref-type="bibr" rid="b19">19</xref>) scarf plot,(<xref ref-type="bibr" rid="b20">20</xref>) and AOI river
plot(<xref ref-type="bibr" rid="b21">21</xref>) on developing effective methods to represent the AOIs
that have been fixated upon at various time intervals. However, these
methods are challenging to apply for long duration tasks having large
number of targets (e.g. twenty or more targets) and frequent EF
transitions between them (e.g. air traffic control task).</p>

<p>Relational AOI visualization methods are more appropriate to handle
the issues raised above through visualizations using circular heat map
transition diagram,(<xref ref-type="bibr" rid="b10">10</xref>) transition matrix,(<xref ref-type="bibr" rid="b12">12</xref>) and
network visualization.(<xref ref-type="bibr" rid="b11">11</xref>) These methods visualize the
aggregated EM data by showing the relationship that exists between he
AOIS in terms of the EF transitions between them, unlike the timeline
approaches. Relational AOI based approaches do not represent the
physical location of the AOIs on the display. In detail, in circular
heat map visualization,(<xref ref-type="bibr" rid="b10">10</xref>) AOIs are represented as segments of
a circular layout (using different colors and sizes) and the EF
transitions are shown by directed arrows between the circular segments.
Transition matrix visualization(<xref ref-type="bibr" rid="b12">12</xref>) represents the EF
transitions among the AOIs in a tabular fashion. The most appropriate
approach to address the issues of a dynamic task is through the network
visualization that shows the AOIs as vertices and the EF transitions
between AOIs as the directed edges between the vertices of a
network.(<xref ref-type="bibr" rid="b11 b18 b22 b23">11, 18, 22, 23</xref>)</p>

<p>However, if we try to apply the relational AOI visualization methods,
we often run into possible visual clutter issues if there are large
number of targets and it can be difficult to represent all the EM
characteristics using the existing network approach. The following
subsections 2.2. and 2.3 provide summaries of the DNet mathematical
framework and how various EM network characteristics can be integrated
based on time intervals.</p>
    </sec>
	
    <sec id="S2b">
      <title>2.2. Mathematical framework of DNet</title>

<p>A DNet is as a sequence of static networks (also called networks),
where each constituent network is associated with a time
interval.(<xref ref-type="bibr" rid="b24">24</xref>) If the total time duration of the collected EM
data is divided into <inline-formula>

<mml:math display="inline" id="m1"><mml:mi>T</mml:mi></mml:math></inline-formula>
time intervals, then a DNet representing such a data is written as
<inline-formula>

<mml:math display="inline" id="m2"><mml:mrow><mml:mi>D</mml:mi><mml:mi>y</mml:mi><mml:mi>n</mml:mi><mml:mi>N</mml:mi><mml:mspace width="0.222em"></mml:mspace><mml:mo>=</mml:mo><mml:mo stretchy="false" form="prefix">{</mml:mo><mml:msub><mml:mi>N</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>N</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mi>.</mml:mi><mml:mi>.</mml:mi><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mtext mathvariant="normal">t </mml:mtext><mml:mspace width="0.333em"></mml:mspace></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mi>.</mml:mi><mml:mi>.</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>N</mml:mi><mml:mi>T</mml:mi></mml:msub><mml:mo stretchy="false" form="postfix">}</mml:mo></mml:mrow></mml:math></inline-formula><italic>,</italic>
where <inline-formula>

<mml:math display="inline" id="m3"><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mtext mathvariant="normal">t </mml:mtext><mml:mspace width="0.333em"></mml:mspace></mml:mrow></mml:msub></mml:math></inline-formula>
is the network for time interval <inline-formula>

<mml:math display="inline" id="m4"><mml:mi>t</mml:mi></mml:math></inline-formula>,
where <inline-formula>

<mml:math display="inline" id="m5"><mml:mrow><mml:mi>t</mml:mi><mml:mspace width="0.222em"></mml:mspace><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mi>.</mml:mi><mml:mi>.</mml:mi><mml:mo>,</mml:mo><mml:mi>T</mml:mi></mml:mrow></mml:math></inline-formula>.</p>

<p>A network <inline-formula>

<mml:math display="inline" id="m6"><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mspace width="0.222em"></mml:mspace></mml:mrow></mml:msub></mml:math></inline-formula>
is written as <inline-formula>

<mml:math display="inline" id="m7"><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mtext mathvariant="normal">t </mml:mtext><mml:mspace width="0.333em"></mml:mspace></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mo stretchy="false" form="prefix">(</mml:mo><mml:msub><mml:mi>V</mml:mi><mml:mrow><mml:mtext mathvariant="normal">t </mml:mtext><mml:mspace width="0.333em"></mml:mspace></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mtext mathvariant="normal">t </mml:mtext><mml:mspace width="0.333em"></mml:mspace></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>M</mml:mi><mml:mrow><mml:mtext mathvariant="normal">t </mml:mtext><mml:mspace width="0.333em"></mml:mspace></mml:mrow></mml:msub><mml:mo stretchy="false" form="postfix">)</mml:mo></mml:mrow></mml:math></inline-formula><italic>,</italic>
where, <inline-formula>

<mml:math display="inline" id="m8"><mml:msub><mml:mi>V</mml:mi><mml:mrow><mml:mtext mathvariant="normal">t </mml:mtext><mml:mspace width="0.333em"></mml:mspace></mml:mrow></mml:msub></mml:math></inline-formula>
is the set of vertices (AOIs for the present study),
<inline-formula>

<mml:math display="inline" id="m9"><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mtext mathvariant="normal">t </mml:mtext><mml:mspace width="0.333em"></mml:mspace></mml:mrow></mml:msub></mml:math></inline-formula>
is the set of edges (EF transitions for the present study) between the
vertices, and <inline-formula>

<mml:math display="inline" id="m10"><mml:msub><mml:mi>M</mml:mi><mml:mrow><mml:mtext mathvariant="normal">t </mml:mtext><mml:mspace width="0.333em"></mml:mspace></mml:mrow></mml:msub></mml:math></inline-formula>
is the adjacency matrix which contains all edge weights (amount of EF
transitions between AOI pairs).</p>

<p>The set of vertices is written as <inline-formula>

<mml:math display="inline" id="m11"><mml:mrow><mml:msub><mml:mi>V</mml:mi><mml:mrow><mml:mtext mathvariant="normal">t </mml:mtext><mml:mspace width="0.333em"></mml:mspace></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mo stretchy="false" form="prefix">(</mml:mo><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:mn>1</mml:mn><mml:mspace width="0.222em"></mml:mspace></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>v</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mi>…</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>v</mml:mi><mml:mrow><mml:msub><mml:mi>m</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mspace width="0.222em"></mml:mspace></mml:mrow></mml:msub><mml:mo stretchy="false" form="postfix">)</mml:mo></mml:mrow></mml:math></inline-formula><italic>,</italic>
where <inline-formula>

<mml:math display="inline" id="m12"><mml:msub><mml:mi>m</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:math></inline-formula>
is the number of vertices for time interval
<inline-formula>

<mml:math display="inline" id="m13"><mml:mi>t</mml:mi></mml:math></inline-formula>.
A network can either have directed or undirected edges, although for EM
visualization we only consider directed edges. The set
<inline-formula>

<mml:math display="inline" id="m14"><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mtext mathvariant="normal">t </mml:mtext><mml:mspace width="0.333em"></mml:mspace></mml:mrow></mml:msub></mml:math></inline-formula>
consists of ordered pairs of vertices <inline-formula>

<mml:math display="inline" id="m15"><mml:mrow><mml:mo stretchy="false" form="prefix">(</mml:mo><mml:msub><mml:mi>v</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>v</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false" form="postfix">)</mml:mo></mml:mrow></mml:math></inline-formula>
showing that there exists a directed edge from the vertex
<inline-formula>

<mml:math display="inline" id="m16"><mml:msub><mml:mi>v</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula>
towards vertex <inline-formula>

<mml:math display="inline" id="m17"><mml:msub><mml:mi>v</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:math></inline-formula>.
Thus, <inline-formula>

<mml:math display="inline" id="m18"><mml:mrow><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mtext mathvariant="normal">t </mml:mtext><mml:mspace width="0.333em"></mml:mspace></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo stretchy="true" form="prefix">{</mml:mo><mml:msub><mml:mi>e</mml:mi><mml:mtext mathvariant="normal">ij</mml:mtext></mml:msub><mml:mo stretchy="false" form="prefix">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false" form="postfix">)</mml:mo><mml:mo stretchy="true" form="postfix">|</mml:mo></mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>v</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>∈</mml:mo><mml:msub><mml:mi>V</mml:mi><mml:mrow><mml:mtext mathvariant="normal">t </mml:mtext><mml:mspace width="0.333em"></mml:mspace></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mspace width="0.222em"></mml:mspace><mml:mi>i</mml:mi><mml:mo>≠</mml:mo><mml:mi>j</mml:mi><mml:mo stretchy="false" form="postfix">}</mml:mo></mml:mrow></mml:math></inline-formula>.
Lastly, the adjacency matrix is written as
<inline-formula>

<mml:math display="inline" id="m19"><mml:mrow><mml:msub><mml:mi>M</mml:mi><mml:mrow><mml:mtext mathvariant="normal">t </mml:mtext><mml:mspace width="0.333em"></mml:mspace></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mo stretchy="false" form="prefix">[</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mtext mathvariant="normal">ij</mml:mtext></mml:msub><mml:mo stretchy="false" form="prefix">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false" form="postfix">)</mml:mo><mml:mo stretchy="false" form="postfix">]</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mi>m</mml:mi><mml:mrow><mml:mtext mathvariant="normal">t </mml:mtext><mml:mspace width="0.333em"></mml:mspace></mml:mrow></mml:msub><mml:mo>×</mml:mo><mml:msub><mml:mi>m</mml:mi><mml:mrow><mml:mtext mathvariant="normal">t </mml:mtext><mml:mspace width="0.333em"></mml:mspace></mml:mrow></mml:msub></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>,
where, <inline-formula>

<mml:math display="inline" id="m20"><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mtext mathvariant="normal">ij</mml:mtext></mml:msub><mml:mo stretchy="false" form="prefix">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false" form="postfix">)</mml:mo></mml:mrow></mml:math></inline-formula>
is the weight of the edge <inline-formula>

<mml:math display="inline" id="m21"><mml:mrow><mml:msub><mml:mi>e</mml:mi><mml:mtext mathvariant="normal">ij</mml:mtext></mml:msub><mml:mo stretchy="false" form="prefix">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false" form="postfix">)</mml:mo></mml:mrow></mml:math></inline-formula>.(<xref ref-type="bibr" rid="b25 b26">25, 26</xref>)</p>
    </sec>
	
    <sec id="S2c">
      <title>2.3 DNet for EM visualization</title>

<p>Beck et al(<xref ref-type="bibr" rid="b24">24</xref>) provided an exhaustive list of various DNet
visualization approaches representing EM data. Depending on the
representation of the time variable, various visualization approaches
have been categorized into two groups: Animation, and timeline
visualization. Animation visualization refers to representing a DNet as
an animated sequence of networks. Timeline visualization refers to
representing a DNet as a sequence of networks in a single image showing
the complete sequence of interactions between the targets. In the
present work, we have applied the node-link based timeline approach for
representing the DNet, because this visualization helps to preserve the
mental map and reduces the cognitive load of the
observer.(<xref ref-type="bibr" rid="b27">27</xref>)</p>

<p>As noted by various researchers,(<xref ref-type="bibr" rid="b28 b29 b30">28, 29, 30</xref>) preserving the
mental map (i.e. the abstract structural information layout about a
network’s elements that an analyst develops in their mind as they
visually scan the visualization) helps in tracing the change in vertex
properties and edge paths across different time intervals. Additionally,
the timeline visualization, using the node-link approach, provides an
intuitive and efficient framework for analyzing the change of states of
multiple vertices over time.(<xref ref-type="bibr" rid="b31 b32">31, 32</xref>)</p>

<p>However, the existing DNet approach only uses the number and duration
of EFs on the AOI to measures the AOI importance. As noted in the
introduction, these two raw measures may lead to misleading results in
case of dynamic targets. Therefore, it is required to consider other
target importance measures to address the highlighted issue.</p>

<p>The next section discusses the three target importance measures (from
the network science domain) that can be adapted for analysing AOI
importance for dynamic scenarios.</p>
    </sec>
	
    <sec id="S2d">
      <title>2.4 Target (or AOI) importance measures</title>

<p>The three most popular target importance measures in a given network
are indegree, closeness, and betweenness.(<xref ref-type="bibr" rid="b14 b25 b33">14, 25, 33</xref>) Mandal et
al(<xref ref-type="bibr" rid="b18">18</xref>) have shown some possibilities in applying the
above-mentioned measures to build a basic foundation for the proposed
approach in this article. It is noted that we introduce the “time”
element (“t”) within the three vertex importance measures to consider
the dynamicity.</p>

<p>Indegree of a vertex is defined as the sum of all incoming weights to
it from all other vertices in the network. For the present study,
incoming weights can be interpreted as the incoming EF transitions to a
given AOI. Thus, indegree for the <inline-formula>

<mml:math display="inline" id="m22"><mml:msup><mml:mi>j</mml:mi><mml:mtext mathvariant="normal">th</mml:mtext></mml:msup></mml:math></inline-formula>
AOI is given as <inline-formula>

<mml:math display="inline" id="m23"><mml:mrow><mml:msub><mml:mi>I</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:msubsup><mml:mo>∑</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>m</mml:mi></mml:msubsup><mml:msub><mml:mi>w</mml:mi><mml:mtext mathvariant="normal">kj</mml:mtext></mml:msub></mml:mrow></mml:math></inline-formula>,(<xref ref-type="bibr" rid="b25">25</xref>)
where, <inline-formula>

<mml:math display="inline" id="m24"><mml:msub><mml:mi>w</mml:mi><mml:mtext mathvariant="normal">kj</mml:mtext></mml:msub></mml:math></inline-formula>
is the number of EF transitions from the <inline-formula>

<mml:math display="inline" id="m25"><mml:msup><mml:mi>k</mml:mi><mml:mtext mathvariant="normal">th</mml:mtext></mml:msup></mml:math></inline-formula>AOI
to the <inline-formula>

<mml:math display="inline" id="m26"><mml:msup><mml:mi>j</mml:mi><mml:mtext mathvariant="normal">th</mml:mtext></mml:msup></mml:math></inline-formula>AOI,
and <inline-formula>

<mml:math display="inline" id="m27"><mml:mi>m</mml:mi></mml:math></inline-formula>
is the total number of AOIs on the display.</p>

<p>We should note that the indegree measure, shown above, is static in
nature. As a result, we modified it to develop the dynamic analogous,
where the indegree for an AOI is defined for each of the time interval
considered in the DNet framework. Thus, the modified indegree measure
for the <inline-formula>

<mml:math display="inline" id="m28"><mml:msup><mml:mi>j</mml:mi><mml:mtext mathvariant="normal">th</mml:mtext></mml:msup></mml:math></inline-formula>AOI
for time interval <inline-formula>

<mml:math display="inline" id="m29"><mml:mi>t</mml:mi></mml:math></inline-formula>
is calculated as:</p>

<p><disp-formula>
<label>(i)</label>
<mml:math display="inline" id="m30"><mml:mrow><mml:msub><mml:mi>I</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false" form="prefix">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false" form="postfix">)</mml:mo><mml:mo>=</mml:mo><mml:msubsup><mml:mo>∑</mml:mo><mml:mtable><mml:mtr><mml:mtd columnalign="center"><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd columnalign="center"><mml:mi>k</mml:mi><mml:mo>≠</mml:mo><mml:mi>j</mml:mi></mml:mtd></mml:mtr></mml:mtable><mml:msub><mml:mi>m</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:msubsup><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mtext mathvariant="normal">kj</mml:mtext></mml:msub><mml:mo stretchy="false" form="prefix">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false" form="postfix">)</mml:mo></mml:mrow></mml:mrow></mml:math></disp-formula>
</p>

<p>Where, <inline-formula>

<mml:math display="inline" id="m31"><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mtext mathvariant="normal">kj</mml:mtext></mml:msub><mml:mo stretchy="false" form="prefix">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false" form="postfix">)</mml:mo></mml:mrow></mml:math></inline-formula>
is the number of EF transitions coming for the
<inline-formula>

<mml:math display="inline" id="m32"><mml:msup><mml:mi>k</mml:mi><mml:mtext mathvariant="normal">th</mml:mtext></mml:msup></mml:math></inline-formula>AOI
to <inline-formula>

<mml:math display="inline" id="m33"><mml:msup><mml:mi>j</mml:mi><mml:mtext mathvariant="normal">th</mml:mtext></mml:msup></mml:math></inline-formula>AOI
and <inline-formula>

<mml:math display="inline" id="m34"><mml:msub><mml:mi>m</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:math></inline-formula>
is the number of unique AOIs in the AOI fixation sequence for time
interval <inline-formula>

<mml:math display="inline" id="m35"><mml:mi>t</mml:mi></mml:math></inline-formula>.
Large indegree value suggests higher importance for an AOI, as it
received large number of EFs. Thus, indegree can be interpreted as a
measure of direct attention received by an AOI.</p>

<p>However, indegree measure only considers the local structure (direct
EF transitions) around a vertex but neglects the global structure of the
network.(<xref ref-type="bibr" rid="b33 b34">33, 34</xref>) This issue is addressed by the two measures
named “closeness” and “betweenness.”</p>

<p>Note that the network science (or graph theory) includes the concept
of “outdegree” however, the indegree values and outdegree values are
always the same within the EM network since there is no possibility of
an inward single EM transition dividing into two or more outward
transitions.</p>

<p>Before we understand the two measures, we need to define the concept
of distance between AOIs in a network visualizing EM data. In the
present case, we define the distance from one AOI (e.g. ‘A’) to another
AOI (e.g. ‘B’) as the inverse of the number of EF transitions from AOI
<italic><bold>A</bold></italic> towards <italic><bold>B</bold></italic>.
Thus, a large number of EF transitions between AOIs results in a smaller
distance between them in terms of the visual scanning strategy.</p>

<p>The closeness of a vertex measures its distance from all other
vertices in the network. Thus, higher closeness value for a given vertex
means it is easier to access any part of the network from it. In the
present study, higher accessibility of an AOI can be interpreted as a
greater association (both direct and indirect) with other AOIs in the
network. High closeness value suggests that the AOI lies in the central
location in terms of the observer’s visual scanning strategy. The
closeness for the <inline-formula>

<mml:math display="inline" id="m36"><mml:msup><mml:mi>j</mml:mi><mml:mtext mathvariant="normal">th</mml:mtext></mml:msup></mml:math></inline-formula>
AOI is given as <inline-formula>

<mml:math display="inline" id="m37"><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:msubsup><mml:mo>∑</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>m</mml:mi></mml:msubsup><mml:mrow><mml:mo stretchy="true" form="prefix">(</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:msup><mml:msub><mml:mi>d</mml:mi><mml:mtext mathvariant="normal">jk</mml:mtext></mml:msub><mml:mo>*</mml:mo></mml:msup></mml:mfrac><mml:mo stretchy="true" form="postfix">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>,(<xref ref-type="bibr" rid="b33">33</xref>)
where, <inline-formula>

<mml:math display="inline" id="m38"><mml:msup><mml:msub><mml:mi>d</mml:mi><mml:mtext mathvariant="normal">jk</mml:mtext></mml:msub><mml:mo>*</mml:mo></mml:msup></mml:math></inline-formula>
is the minimum distance from the <inline-formula>

<mml:math display="inline" id="m39"><mml:msup><mml:mi>j</mml:mi><mml:mtext mathvariant="normal">th</mml:mtext></mml:msup></mml:math></inline-formula>AOI
to the <inline-formula>

<mml:math display="inline" id="m40"><mml:msup><mml:mi>k</mml:mi><mml:mtext mathvariant="normal">th</mml:mtext></mml:msup></mml:math></inline-formula>AOI
(if multiple paths exist) and <inline-formula>

<mml:math display="inline" id="m41"><mml:mi>m</mml:mi></mml:math></inline-formula>
is the total number of AOIs on the display. Like the previous indegree
measure case, the static closeness measure is also modified to develop
its dynamic analogous. Thus, the modified closeness measure for the
<inline-formula>

<mml:math display="inline" id="m42"><mml:msup><mml:mi>j</mml:mi><mml:mtext mathvariant="normal">th</mml:mtext></mml:msup></mml:math></inline-formula>
AOI for time interval <inline-formula>

<mml:math display="inline" id="m43"><mml:mi>t</mml:mi></mml:math></inline-formula>
is defined as follows:</p>

<p><disp-formula>
<label>(ii)</label>
<mml:math display="inline" id="m44"><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false" form="prefix">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false" form="postfix">)</mml:mo><mml:mo>=</mml:mo><mml:msubsup><mml:mo>∑</mml:mo><mml:mtable><mml:mtr><mml:mtd columnalign="center"><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd columnalign="center"><mml:mi>k</mml:mi><mml:mo>≠</mml:mo><mml:mi>j</mml:mi></mml:mtd></mml:mtr></mml:mtable><mml:msub><mml:mi>m</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:msubsup><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:msup><mml:msub><mml:mi>d</mml:mi><mml:mtext mathvariant="normal">jk</mml:mtext></mml:msub><mml:mo>*</mml:mo></mml:msup><mml:mo stretchy="false" form="prefix">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false" form="postfix">)</mml:mo></mml:mrow></mml:mfrac></mml:mrow></mml:math></disp-formula>
</p>

<p>Where, <inline-formula>

<mml:math display="inline" id="m45"><mml:mrow><mml:msup><mml:msub><mml:mi>d</mml:mi><mml:mtext mathvariant="normal">jk</mml:mtext></mml:msub><mml:mo>*</mml:mo></mml:msup><mml:mo stretchy="false" form="prefix">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false" form="postfix">)</mml:mo></mml:mrow></mml:math></inline-formula>
is the minimum distance from the <inline-formula>

<mml:math display="inline" id="m46"><mml:msup><mml:mi>j</mml:mi><mml:mtext mathvariant="normal">th</mml:mtext></mml:msup></mml:math></inline-formula>AOI
to the <inline-formula>

<mml:math display="inline" id="m47"><mml:msup><mml:mi>k</mml:mi><mml:mtext mathvariant="normal">th</mml:mtext></mml:msup></mml:math></inline-formula>AOI
(if multiple paths exist) and <inline-formula>

<mml:math display="inline" id="m48"><mml:msub><mml:mi>m</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:math></inline-formula>
is the number of unique AOIs in the AOI fixation sequence for time
interval <inline-formula>

<mml:math display="inline" id="m49"><mml:mi>t</mml:mi></mml:math></inline-formula>.</p>

<p>In a dynamic scenario, there are instances where due to visual
scanning strategy of the observer, an AOI despite receiving small amount
of direct attention (low indegree measure) and being present in a
non-central location (low closeness value) can still play a significant
role by connecting (acting as a bridge between) two groups of AOIs. Such
an AOI plays a crucial role in controlling the flow of attention among
the other AOIs on the display, and this aspect is measured through the
concept of betweenness explained below.</p>

<p>Betweenness for the <inline-formula>

<mml:math display="inline" id="m50"><mml:msup><mml:mi>j</mml:mi><mml:mtext mathvariant="normal">th</mml:mtext></mml:msup></mml:math></inline-formula>
AOI is defined as <inline-formula>




<mml:math display="inline" id="m51"><mml:mrow><mml:msub><mml:mi>B</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:msubsup><mml:mo>∑</mml:mo><mml:mrow><mml:mi>l</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>m</mml:mi></mml:msubsup><mml:mrow><mml:msubsup><mml:mo>∑</mml:mo><mml:mtable><mml:mtr><mml:mtd columnalign="center"><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="0.222em"></mml:mspace><mml:mi>j</mml:mi><mml:mo>≠</mml:mo><mml:mi>l</mml:mi><mml:mo>≠</mml:mo><mml:mi>k</mml:mi><mml:mspace width="0.222em"></mml:mspace></mml:mtd></mml:mtr><mml:mtr><mml:mtd columnalign="center"><mml:mspace width="0.222em"></mml:mspace></mml:mtd></mml:mtr></mml:mtable><mml:mi>m</mml:mi></mml:msubsup><mml:mrow><mml:mo stretchy="true" form="prefix">(</mml:mo><mml:mfrac><mml:msubsup><mml:mtext mathvariant="normal">SP</mml:mtext><mml:mtext mathvariant="normal">kl</mml:mtext><mml:mi>j</mml:mi></mml:msubsup><mml:msub><mml:mtext mathvariant="normal">SP</mml:mtext><mml:mtext mathvariant="normal">kl</mml:mtext></mml:msub></mml:mfrac><mml:mo stretchy="true" form="postfix">)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula>,(<xref ref-type="bibr" rid="b33">33</xref>)
where <inline-formula>

<mml:math display="inline" id="m52"><mml:msub><mml:mtext mathvariant="normal">SP</mml:mtext><mml:mtext mathvariant="normal">kl</mml:mtext></mml:msub></mml:math></inline-formula>
represents the total number of shortest paths (if multiple paths exist)
from the <inline-formula>

<mml:math display="inline" id="m53"><mml:msup><mml:mi>k</mml:mi><mml:mtext mathvariant="normal">th</mml:mtext></mml:msup></mml:math></inline-formula>AOI
to the <inline-formula>

<mml:math display="inline" id="m54"><mml:msup><mml:mi>l</mml:mi><mml:mtext mathvariant="normal">th</mml:mtext></mml:msup></mml:math></inline-formula>AOI,
and <inline-formula>

<mml:math display="inline" id="m55"><mml:msubsup><mml:mtext mathvariant="normal">SP</mml:mtext><mml:mtext mathvariant="normal">kl</mml:mtext><mml:mi>j</mml:mi></mml:msubsup></mml:math></inline-formula>
represents the number of such shortest paths that pass through the
<inline-formula>

<mml:math display="inline" id="m56"><mml:msup><mml:mi>j</mml:mi><mml:mtext mathvariant="normal">th</mml:mtext></mml:msup></mml:math></inline-formula>AOI.
Thus, the modified betweenness measure for the
<inline-formula>

<mml:math display="inline" id="m57"><mml:msup><mml:mi>j</mml:mi><mml:mtext mathvariant="normal">th</mml:mtext></mml:msup></mml:math></inline-formula>
AOI for time interval <inline-formula>

<mml:math display="inline" id="m58"><mml:mi>t</mml:mi></mml:math></inline-formula>
is defined as follows:</p>

<p><disp-formula>
<label>(iii)</label>



<mml:math display="inline" id="m59"><mml:mrow><mml:msub><mml:mi>B</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false" form="prefix">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false" form="postfix">)</mml:mo><mml:mo>=</mml:mo><mml:msubsup><mml:mo>∑</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:msub><mml:mi>m</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:msubsup><mml:mrow><mml:msubsup><mml:mo>∑</mml:mo><mml:mtable><mml:mtr><mml:mtd columnalign="center"><mml:mi>l</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd columnalign="center"><mml:mspace width="0.222em"></mml:mspace><mml:mi>j</mml:mi><mml:mo>≠</mml:mo><mml:mi>l</mml:mi><mml:mo>≠</mml:mo><mml:mi>k</mml:mi></mml:mtd></mml:mtr></mml:mtable><mml:msub><mml:mi>m</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:msubsup><mml:mfrac><mml:mrow><mml:msubsup><mml:mtext mathvariant="normal">SP</mml:mtext><mml:mtext mathvariant="normal">kl</mml:mtext><mml:mi>j</mml:mi></mml:msubsup><mml:mo stretchy="false" form="prefix">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false" form="postfix">)</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mtext mathvariant="normal">SP</mml:mtext><mml:mtext mathvariant="normal">kl</mml:mtext></mml:msub><mml:mo stretchy="false" form="prefix">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false" form="postfix">)</mml:mo></mml:mrow></mml:mfrac></mml:mrow></mml:mrow></mml:math></disp-formula>
</p>

<p>Where, <inline-formula>

<mml:math display="inline" id="m60"><mml:mrow><mml:msub><mml:mtext mathvariant="normal">SP</mml:mtext><mml:mtext mathvariant="normal">kl</mml:mtext></mml:msub><mml:mo stretchy="false" form="prefix">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false" form="postfix">)</mml:mo></mml:mrow></mml:math></inline-formula>
represents the total number of shortest paths (if multiple paths exist)
from the <inline-formula>

<mml:math display="inline" id="m61"><mml:msup><mml:mi>k</mml:mi><mml:mtext mathvariant="normal">th</mml:mtext></mml:msup></mml:math></inline-formula>AOI
to the <inline-formula>

<mml:math display="inline" id="m62"><mml:msup><mml:mi>l</mml:mi><mml:mtext mathvariant="normal">th</mml:mtext></mml:msup></mml:math></inline-formula>AOI,
and <inline-formula>

<mml:math display="inline" id="m63"><mml:mrow><mml:msubsup><mml:mtext mathvariant="normal">SP</mml:mtext><mml:mtext mathvariant="normal">kl</mml:mtext><mml:mi>j</mml:mi></mml:msubsup><mml:mo stretchy="false" form="prefix">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false" form="postfix">)</mml:mo></mml:mrow></mml:math></inline-formula>
represents the number of such shortest paths which pass through the
<inline-formula>

<mml:math display="inline" id="m64"><mml:msup><mml:mi>j</mml:mi><mml:mtext mathvariant="normal">th</mml:mtext></mml:msup></mml:math></inline-formula>AOI
for the time interval <inline-formula>

<mml:math display="inline" id="m65"><mml:mi>t</mml:mi></mml:math></inline-formula>.</p>
    </sec>
    </sec>

    <sec id="S3">
      <title>3. Proposed approach</title>

<p>Figure 2 represents the various steps in the proposed methodology for
analyzing ATCS’s EM data.</p>

    <sec id="S3a">
      <title>3.1 STEP 1. Collect observer’s EM and targets’ location
data</title>

<p>The input for the first step is the simulation experimental data. As
output for this step, two types of data are obtained: (a) EM data, that
consists of horizontal and vertical coordinates of the EF and its
associated fixation duration, and (b) target location data, that
consists of the pixel coordinates of the various targets on the
display.</p>

<fig id="fig02" fig-type="figure" position="float">
					<label>Figure 2.</label>
					<caption>
						<p>Flowchart showing the various steps of the proposed
methodology for analyzing time interval based EM data.</p>
					</caption>
					<graphic id="graph02" xlink:href="jemr-11-04-a-figure-02.png"/>
				</fig>
    </sec>

    <sec id="S3b">
      <title>STEP 2. Divide the experiment time into several smaller
time intervals</title>

<p>The input for step 2 is the time duration (in minutes or hours) for
which the experiment has been conducted, and the output are several
equal (unequal) sized time intervals which sum to the experimental time
duration. For example, consider that the total experiment duration is
divided into four equal time intervals (i.e.
<inline-formula>

<mml:math display="inline" id="m66"><mml:mrow><mml:mi>T</mml:mi><mml:mo>=</mml:mo><mml:mn>4</mml:mn></mml:mrow></mml:math></inline-formula>,
see section 2.2). Note that the time intervals can be chosen based on
the task characteristics or the researcher’s judgment (i.e. fixed or
event-based time intervals).</p>
    </sec>

    <sec id="S3c">
      <title>3.3. STEP 3. Select first time interval</title>

<p>The inputs for this step are the various time intervals obtained in
the previous step 2. The intervals are indexed and arranged in a
time-order sequence. In this step, we start with the the first time
interval to initiate developing the AOI fixation sequence.</p>
    </sec>

    <sec id="S3d">
      <title>3.4 STEP 4. Develop AOI fixation sequence (i.e. scanpath
sequence) for the selected time interval</title>

<p>As input, step 4 receives three things, the time interval selected in
step 3, and the EM and target location data for this time interval. As
output from this step, we obtain the AOI fixation sequence for the time
interval considered. The size of the AOI fixation sequence is directly
proportional to the number of EFs in the time interval. The AOI fixation
sequence is created for the selected time interval by adapting the
approach suggested by Kang et al(<xref ref-type="bibr" rid="b7">7</xref>). Creating the AOI fixation
sequence involves mapping the EFs with the AOIs. Only those EFs falling
within any of the AOI boundaries are considered for AOI fixation
sequence development, else they are ignored. AOIs are coded by assigning
uppercase letters followed by lowercase alphabets (i.e. A, B, …, a, b).
The developed AOI fixation sequence is the collapsed form of a raw AOI
fixation sequence. In the collapsed form of the sequence, multiple
consecutive fixations of the same AOI is collapsed to a single fixation
case (e.g. <italic><bold>AAA</bold></italic> is collapsed into
<italic><bold>A</bold></italic>). Thus, a raw AOI fixation sequence
<italic><bold>AABCC</bold></italic> is collapsed to
<italic><bold>ABC</bold></italic>. In addition, an overlapping AOI case
is shown in parenthesis with individual constituent AOIs separated by a
semi-colon. For example, if an EF falls within the overlapped region of
AOIs <italic><bold>A</bold></italic> and
<italic><bold>B</bold></italic>, it is represented as <italic><bold>(A;
B)</bold></italic>. After mapping all the EFs to the AOIs, we obtain a
time-ordered sequence of AOIs, that shows which AOIs were fixated and in
which order. Table 1 shows a sample AOI fixation sequence for four time
intervals in a hypothetical scenario with seven AOIs.</p>
    </sec>

    <sec id="S3e">
      <title>3.5 STEP 5. Develop AOI transition matrix for the selected time
interval</title>

<p>Step 5 receives the AOI fixation sequence developed in step 4 as
input. Afterwards, the AOI fixation sequence is transformed, as per the
approach suggested by Noton and Stark,(<xref ref-type="bibr" rid="b35">35</xref>) for developing the
associated AOI transition matrix, which is the output of this step. The
size of the transition matrix depends on the number of unique AOI states
(single and overlapped both) in the fixation sequence. The AOI
transition matrix shows, in a tabular manner, how many transitions have
occurred between various AOIs pairs. For example, Table 2 represents the
AOI transition matrix associated with the AOI fixation sequence for time
interval 1 in Table 1. The sequence shows there are three EF transitions
from AOI <italic><bold>A</bold></italic> to
<italic><bold>B</bold></italic> highlighted in grey within Table 2. A
different AOI transition matrix is required for each time interval;
thus, before moving to the next step, we need to create the associated
AOI transition matrix for each time interval.</p>

<table-wrap id="t01" position="float">
					<label>Table 1.</label>
					<caption>
						<p>Samples AOI fixation sequences having overlaps</p>
					</caption>
					<table frame="hsides" rules="groups" cellpadding="3">

    <thead>
      <tr>
        <th><bold>Time interval</bold></th>
        <th><bold>AOI fixation sequence</bold></th>
      </tr>
    </thead>
    <tbody>
      <tr>
        <td>1</td>
        <td>ABABABEBAEAEACACAEA</td>
      </tr>
      <tr>
        <td>2</td>
        <td>EAEAEAEABABCBC(D; G)C(D;G)</td>
      </tr>
      <tr>
        <td>3</td>
        <td>C(D;G)C(D;G)C(D;G)CEAEAEFEF</td>
      </tr>
      <tr>
        <td>4</td>
        <td>EFEFEFCFC(D;G)C(D;G)FC(D;G)</td>
      </tr>
    </tbody>
  </table>
</table-wrap>

<table-wrap id="t02" position="float">
					<label>Table 2</label>
					<caption>
						<p>AOI transition matrix developed from the AOI fixation
sequence for time interval 1 within Table 1</p>
					</caption>
					<table frame="hsides" rules="groups" cellpadding="3">
    <thead>
      <tr>
        <th rowspan="2"><bold>From AOI</bold></th>
        <th colspan="4"><bold>To AOI</bold></th>
      </tr>
    </thead>
    <tbody>
      <tr>
        <td></td>
        <td><bold>A</bold></td>
        <td><bold>B</bold></td>
        <td><bold>C</bold></td>
        <td><bold>E</bold></td>
      </tr>
      <tr>
        <td><bold>A</bold></td>
        <td>0</td>
        <td>3</td>
        <td>2</td>
        <td>3</td>
      </tr>
      <tr>
        <td><bold>B</bold></td>
        <td>3</td>
        <td>0</td>
        <td>0</td>
        <td>1</td>
      </tr>
      <tr>
        <td><bold>C</bold></td>
        <td>2</td>
        <td>0</td>
        <td>0</td>
        <td>0</td>
      </tr>
      <tr>
        <td><bold>E</bold></td>
        <td>3</td>
        <td>1</td>
        <td>0</td>
        <td>0</td>
      </tr>
    </tbody>
  </table>
</table-wrap>

    </sec>

    <sec id="S3f">
      <title>3.6 STEP 6. Develop DNet visualization</title>

<p>The inputs for step 6 are the AOI transition matrix for all the time
intervals obtained in step 2. As output from this step, we obtain the
DNet representation of the EM data. Developing the DNet involves two
steps. First, developing a static network for each of the time intervals
considered in STEP 2. Second, arranging the static networks in a
time-based order to visualize the DNet. The details of both the steps
are given below.</p>

    <sec id="S3fa">
      <title>3.6.1 Develop static network for each time interval</title>


<p>The static network is developed by adopting the design principles
suggested by Mandal et al(<xref ref-type="bibr" rid="b18">18</xref>). Thus, a network’s vertex size is
drawn proportional to the number of EFs received by the corresponding
AOI and the vertex’s color is based on a sequential multihued color
scale, where red color means high EF duration and yellow color means low
EF duration occurring on the associated AOI. The thickness of an edge
between a vertex pair is proportional to the number of EF transitions
occurring between the vertices in the edge’s direction. Therefore, for
the example shown in Table 1, we have four time intervals, thus the DNet
is written as <inline-formula>

<mml:math display="inline" id="m67"><mml:mrow><mml:mtext mathvariant="normal">DynN</mml:mtext><mml:mspace width="0.222em"></mml:mspace><mml:mo>=</mml:mo><mml:mo stretchy="false" form="prefix">{</mml:mo><mml:msub><mml:mi>N</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>N</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mn>3</mml:mn><mml:mspace width="0.222em"></mml:mspace></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>N</mml:mi><mml:mn>4</mml:mn></mml:msub><mml:mo stretchy="false" form="postfix">}</mml:mo></mml:mrow></mml:math></inline-formula>,
where <inline-formula>

<mml:math display="inline" id="m68"><mml:msub><mml:mi>N</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula>
is the static network for time interval <inline-formula>

<mml:math display="inline" id="m69"><mml:mrow><mml:mi>i</mml:mi><mml:mspace width="0.222em"></mml:mspace><mml:mo stretchy="false" form="prefix">(</mml:mo><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>…</mml:mi><mml:mo>,</mml:mo><mml:mn>4</mml:mn><mml:mo stretchy="false" form="postfix">)</mml:mo></mml:mrow></mml:math></inline-formula>.</p>
    </sec>

    <sec id="S3fb">
      <title>3.6.2 Visualize the DNet</title>

<p>Before visualizing the DNet, the vertices of the component static
networks are to be arranged in a specific layout for mental map
preservation. We have used the rectangular grid layout for this purpose;
in which, we start from the left bottom corner and move towards the
right, ending at the top right corner. We sort the AOI positions using
the natural ordering of English letters and putting uppercase AOI groups
first and then lowercase AOI groups. The single AOIs are followed by
overlapped AOI cases in the grid layout. The overlapped AOI cases are
arranged in an increasing order of constituent AOI numbers, i.e. an
overlapped AOI case with two AOIs comes before a case with three AOIs.
For example, overlapped AOI <italic><bold>(A;B)</bold></italic> comes
before <italic><bold>(A;B;C)</bold></italic>, which comes before
<italic><bold>(A;B;C;D)</bold></italic>, and so on.</p>

<p>Consider an AOI fixation sequence that has
<inline-formula>

<mml:math display="inline" id="m70"><mml:mi>n</mml:mi></mml:math></inline-formula>
unique AOI states (including both single and overlapped AOIs).
Therefore, the number of columns (number of AOIs in a single row) in the
grid layout will be the smallest integer greater equal to
<inline-formula>

<mml:math display="inline" id="m71"><mml:msqrt><mml:mi>n</mml:mi></mml:msqrt></mml:math></inline-formula>.
Figure 3 represents a sample ordering scheme of six AOIs in a
rectangular grid layout.</p>

<p>Once the component static networks are arranged in a grid layout, we
visualize the DNet by arranging the static networks in a time-ordered
sequence. Figure 4 represents a sample DNet visualization of the EM data
for a hypothetical scenario (see section 3.4). Note that the relative
location of all AOIs in Figure 4 remains constant in each of the
networks corresponding to various time intervals. For example, AOI
<italic><bold>A</bold></italic> is placed at the bottom row first column
in all the constituent networks. This constant relative position of each
AOI helps in their navigation across various time intervals and thus
helps to preserve the mental map of the observer. The DNet has four time
intervals, and the AOI fixation sequences for all these intervals is
shown in Table 1. We should note that, due to the dynamic nature of the
AOIs and typical scanning strategy of ATCSs, some AOIs may not be
fixated upon despite being present on the display. In addition, the
overlapped AOI cases arise in the AOI fixation sequence only if they are
fixated upon by the ATCSs. Theoretically, there can be many possible
overlapped AOI cases as compared to what is observed in real life
experimental data. For example, with <inline-formula>

<mml:math display="inline" id="m72"><mml:mi>n</mml:mi></mml:math></inline-formula>
unique AOIs, theoretically, we can have <inline-formula>

<mml:math display="inline" id="m73"><mml:mrow><mml:msubsup><mml:mo>∑</mml:mo><mml:mrow><mml:mi>r</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:msubsup><mml:mrow><mml:mrow><mml:mo stretchy="true" form="prefix">(</mml:mo><mml:mfrac><mml:mi>n</mml:mi><mml:mi>r</mml:mi></mml:mfrac><mml:mo stretchy="true" form="postfix">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msubsup><mml:mo>∑</mml:mo><mml:mrow><mml:mi>r</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:msubsup><mml:mfrac><mml:mrow><mml:mi>n</mml:mi><mml:mi>!</mml:mi></mml:mrow><mml:mrow><mml:mi>r</mml:mi><mml:mi>!</mml:mi><mml:mrow><mml:mo stretchy="true" form="prefix">(</mml:mo><mml:mi>n</mml:mi><mml:mo>−</mml:mo><mml:mi>r</mml:mi><mml:mo stretchy="true" form="postfix">)</mml:mo></mml:mrow><mml:mi>!</mml:mi></mml:mrow></mml:mfrac></mml:mrow></mml:mrow></mml:math></inline-formula>
possible AOIs cases (including both single and overlapped cases) on the
display. Although, not all overlapped AOI states will appear on the
display and even if they occur not all of them will be fixated upon by
the ATCSs. This is also the case with single AOI cases.</p>

<p>Thus, it is computationally expensive and inefficient approach to
consider all those AOI states which have not being fixated at all and
thus does not appear in the AOI fixation sequence. Consequently, we only
consider those AOI states for visualization and analysis which appear at
least once in the AOI fixation sequence of the ATCS’s. As a result, we
ignore those AOIs which, despite being present on the display, received
no EFs from the ATCSs. Therefore, not all AOIs appear in the DNet
visualization for each of the ATCSs, which results in a change in the
relative position of each AOI in the grid structure of the DNet
visualization. In addition, for comparing various visual scanning
strategies, we only consider the AOI cases which are common to all the
AOI fixation sequences of various ATCS’s.</p>

<fig id="fig03" fig-type="figure" position="float">
					<label>Figure 3.</label>
					<caption>
						<p>Sample AOI ordering scheme for the grid layout used in
designing the networks in the DNet framework.</p>
					</caption>
					<graphic id="graph03" xlink:href="jemr-11-04-a-figure-03.png"/>
				</fig>
    </sec>
    </sec>

    <sec id="S3g">
      <title>3.7 STEP 7. Calculate target (or AOI) importance
measures</title>

<p>Step 7 involves calculating the measures using equations (i), (ii),
and (iii). As a result, we provide the DNet as the input to this step,
and as output we obtain all three importance measure values for each of
the AOIs with respect to all the time intervals considered in the DNet.
For example, consider the DNet visualization in Figure 4, where the
indegree value of AOI <italic><bold>B</bold></italic> changes from 4 to
3 as we move from the time interval 1 to 2 (Figure 4 (a)-(b)). For the
given DNet in Figure 4, to calculate the closeness and betweenness value
for AOI <italic><bold>B</bold></italic>, we first demonstrate how to
calculate the distance between the AOIs. For example, in the first time
interval, the distance from AOI <italic><bold>B</bold></italic> to
<italic><bold>A</bold></italic> is given by
<inline-formula>

<mml:math display="inline" id="m74"><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mtext mathvariant="normal">BA</mml:mtext></mml:msub><mml:mrow><mml:mo stretchy="true" form="prefix">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="true" form="postfix">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mtext mathvariant="normal">BA</mml:mtext></mml:msub><mml:mrow><mml:mo stretchy="true" form="prefix">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="true" form="postfix">)</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:mrow></mml:math></inline-formula>
and substituting <inline-formula>

<mml:math display="inline" id="m75"><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula>,
we get<inline-formula>

<mml:math display="inline" id="m76"><mml:mrow><mml:msub><mml:mrow><mml:mspace width="0.333em"></mml:mspace><mml:mtext mathvariant="normal"> d</mml:mtext></mml:mrow><mml:mtext mathvariant="normal">BA</mml:mtext></mml:msub><mml:mrow><mml:mo stretchy="true" form="prefix">(</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="true" form="postfix">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mn>3</mml:mn></mml:mfrac></mml:mrow></mml:math></inline-formula>.</p>

<p>To calculate the minimum distance between two AOIs consider Figure 4
(a), where there are two EF transition paths from AOI
<italic><bold>B</bold></italic> to <italic><bold>E</bold></italic>:
Direct path from AOI <italic><bold>B</bold></italic> to
<italic><bold>E</bold></italic>, which has edge weight 1; indirect path
from AOI <italic><bold>B</bold></italic> to
<italic><bold>A</bold></italic> and then to
<italic><bold>E</bold></italic>, which has edge weights 3 and 3,
respectively. Thus, the shortest distance from AOI
<italic><bold>B</bold></italic> to <italic><bold>E</bold></italic> is
defined as the path having the minimum distance of
<inline-formula>

<mml:math display="inline" id="m77"><mml:mrow><mml:msup><mml:msub><mml:mi>d</mml:mi><mml:mtext mathvariant="normal">BE</mml:mtext></mml:msub><mml:mo>*</mml:mo></mml:msup><mml:mrow><mml:mo stretchy="true" form="prefix">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="true" form="postfix">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mo>min</mml:mo><mml:mrow><mml:mo stretchy="true" form="prefix">[</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mtext mathvariant="normal">BE</mml:mtext></mml:msub><mml:mrow><mml:mo stretchy="true" form="prefix">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="true" form="postfix">)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="0.222em"></mml:mspace><mml:mrow><mml:mo stretchy="true" form="prefix">(</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mtext mathvariant="normal">BA</mml:mtext></mml:msub><mml:mrow><mml:mo stretchy="true" form="prefix">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="true" form="postfix">)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mtext mathvariant="normal">AE</mml:mtext></mml:msub><mml:mrow><mml:mo stretchy="true" form="prefix">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="true" form="postfix">)</mml:mo></mml:mrow><mml:mo stretchy="true" form="postfix">)</mml:mo></mml:mrow><mml:mo stretchy="true" form="postfix">]</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.
For the first time interval (<inline-formula>

<mml:math display="inline" id="m78"><mml:mrow><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula>),
we obtain <inline-formula>

<mml:math display="inline" id="m79"><mml:mrow><mml:msup><mml:msub><mml:mi>d</mml:mi><mml:mtext mathvariant="normal">BE</mml:mtext></mml:msub><mml:mo>*</mml:mo></mml:msup><mml:mrow><mml:mo stretchy="true" form="prefix">(</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="true" form="postfix">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mo>min</mml:mo><mml:mrow><mml:mo stretchy="true" form="prefix">[</mml:mo><mml:mn>1</mml:mn><mml:mi>/</mml:mi><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="0.222em"></mml:mspace><mml:mrow><mml:mo stretchy="true" form="prefix">(</mml:mo><mml:mn>1</mml:mn><mml:mi>/</mml:mi><mml:mn>3</mml:mn><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mi>/</mml:mi><mml:mn>3</mml:mn><mml:mo stretchy="true" form="postfix">)</mml:mo></mml:mrow><mml:mo stretchy="true" form="postfix">]</mml:mo></mml:mrow><mml:mspace width="0.222em"></mml:mspace><mml:mo>=</mml:mo><mml:mo>min</mml:mo><mml:mrow><mml:mo stretchy="true" form="prefix">[</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mspace width="0.222em"></mml:mspace><mml:mn>2</mml:mn><mml:mi>/</mml:mi><mml:mn>3</mml:mn><mml:mo stretchy="true" form="postfix">]</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mn>2</mml:mn><mml:mi>/</mml:mi><mml:mn>3</mml:mn></mml:mrow></mml:math></inline-formula>.
Thus, for the first time interval, the closeness and betweenness value
of AOI <italic><bold>B</bold></italic> is given by 2.375 and 8,
respectively.</p>

<fig id="fig04" fig-type="figure" position="float">
					<label>Figure 4.</label>
					<caption>
						<p>Sample DNet visualization of EM data for the hypothetical
scenario described in section 3.4. The DNet consists of four time
intervals. The figure shows the important AOIs for each time interval,
and how the importance of various AOI’s is changing with time.
Sequentially: (a) Time interval 1. (b) Time interval 2. (c) Time
interval 3. (d) Time interval 4.</p>
					</caption>
					<graphic id="graph04" xlink:href="jemr-11-04-a-figure-04.png"/>
				</fig>
    </sec>

    <sec id="S3h">
      <title>3.8 STEP 8. Normalize and visualize target (or AOI) importance
measures</title>

<p>The last step involves normalizing the calculated measures and
subsequently visualizing the normalized measure values. Thus, the
obtained AOI importance measures in step 7 acts as input for this step,
and as output we obtain the normalized measure values accompanied by
their visualization. Equation (i), (ii), and (iii) shows that the three
measures both depend on the number of AOIs and the amount of EFs. In
addition, these measures also have different units, as a result, they
are incommensurable. For the present dynamic scenario, both the number
of AOIs and EFs are not constant for the different time intervals
considered in the DNet analysis. In addition, to compare the AOI
importance values across various time intervals and across multiple
observers, we need to eliminate the units of importance measures,
thereby bringing them to a similar scale. To address this issue, we
present two normalization options.</p>

    <sec id="S3ha">
      <title>3.8.1 Percent normalization</title>

<p>Percent normalization refers to dividing an importance measurement of
an AOI by the sum of the same measurement of all the AOIs. The percent
normalized indegree value of an AOI shows the percentage share of the
total number of EFs received by an AOI. Thus, it can be interpreted as
the percentage of the total attention attributed to an AOI. The percent
normalized indegree value of the <inline-formula>

<mml:math display="inline" id="m80"><mml:msup><mml:mi>j</mml:mi><mml:mtext mathvariant="normal">th</mml:mtext></mml:msup></mml:math></inline-formula>AOI
for time interval <inline-formula>

<mml:math display="inline" id="m81"><mml:mi>t</mml:mi></mml:math></inline-formula>
is calculated as:</p>

<p><disp-formula>
<label>(iv)</label>
<mml:math display="inline" id="m82"><mml:mrow><mml:mover><mml:msub><mml:mi>I</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo accent="true">¯</mml:mo></mml:mover><mml:mo stretchy="false" form="prefix">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false" form="postfix">)</mml:mo><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mrow><mml:mspace width="0.333em"></mml:mspace><mml:mtext mathvariant="normal"> I</mml:mtext></mml:mrow><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false" form="prefix">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false" form="postfix">)</mml:mo></mml:mrow><mml:mrow><mml:msubsup><mml:mo>∑</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mspace width="0.222em"></mml:mspace></mml:mrow><mml:msub><mml:mi>m</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:msubsup><mml:mrow><mml:msub><mml:mrow><mml:mspace width="0.333em"></mml:mspace><mml:mtext mathvariant="normal"> I</mml:mtext></mml:mrow><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false" form="prefix">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false" form="postfix">)</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:mrow></mml:math></disp-formula>
</p>

<p>Where, <inline-formula>

<mml:math display="inline" id="m83"><mml:mrow><mml:mover><mml:msub><mml:mi>I</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo accent="true">¯</mml:mo></mml:mover><mml:mo stretchy="false" form="prefix">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false" form="postfix">)</mml:mo></mml:mrow></mml:math></inline-formula>
is the percent normalized indegree value for time interval
<inline-formula>

<mml:math display="inline" id="m84"><mml:mi>t</mml:mi></mml:math></inline-formula>.
We get, <inline-formula>

<mml:math display="inline" id="m85"><mml:mrow><mml:mn>0</mml:mn><mml:mo>≤</mml:mo><mml:mover><mml:msub><mml:mi>I</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo accent="true">¯</mml:mo></mml:mover><mml:mo stretchy="false" form="prefix">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false" form="postfix">)</mml:mo><mml:mo>≤</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula>
and <inline-formula>

<mml:math display="inline" id="m86"><mml:mrow><mml:msubsup><mml:mo>∑</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mspace width="0.222em"></mml:mspace></mml:mrow><mml:msub><mml:mi>m</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:msubsup><mml:mrow><mml:mover><mml:msub><mml:mi>I</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo accent="true">¯</mml:mo></mml:mover><mml:mrow><mml:mo stretchy="true" form="prefix">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="true" form="postfix">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>
    </sec>

    <sec id="S3hb">
      <title>3.8.2 Distance normalization</title>

<p>Distance normalization refers to calculating how far away a given
importance measurement of an AOI is from the maximum value observed for
that measurement within a time interval. The distance normalization
process is defined for all the three target importance measures. The
distance normalized measure value of an AOI can be interpreted as the
relative amount of attention given to an AOI as compared to the maximum
amount of attention given to any AOI. The distance normalized measure
for the <inline-formula>

<mml:math display="inline" id="m87"><mml:msup><mml:mi>j</mml:mi><mml:mtext mathvariant="normal">th</mml:mtext></mml:msup></mml:math></inline-formula>AOI,
for time interval <inline-formula>

<mml:math display="inline" id="m88"><mml:mi>t</mml:mi></mml:math></inline-formula>,
is calculated as:</p>

<p><disp-formula>
<label>(v)</label>
<mml:math display="inline" id="m89"><mml:mrow><mml:mover><mml:msub><mml:mi>⌀</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo accent="true">̃</mml:mo></mml:mover><mml:mo stretchy="false" form="prefix">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false" form="postfix">)</mml:mo><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mrow><mml:mspace width="0.222em"></mml:mspace><mml:mi>⌀</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msub><mml:mrow><mml:mo stretchy="true" form="prefix">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="true" form="postfix">)</mml:mo></mml:mrow><mml:mo>−</mml:mo><mml:msub><mml:mo>min</mml:mo><mml:mi>j</mml:mi></mml:msub><mml:mrow><mml:msub><mml:mrow><mml:mspace width="0.222em"></mml:mspace><mml:mi>⌀</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msub><mml:mrow><mml:mo stretchy="true" form="prefix">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="true" form="postfix">)</mml:mo></mml:mrow></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mo>max</mml:mo><mml:mi>j</mml:mi></mml:msub><mml:mrow><mml:msub><mml:mrow><mml:mspace width="0.222em"></mml:mspace><mml:mi>⌀</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msub><mml:mrow><mml:mo stretchy="true" form="prefix">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="true" form="postfix">)</mml:mo></mml:mrow></mml:mrow><mml:mo>−</mml:mo><mml:msub><mml:mo>min</mml:mo><mml:mi>j</mml:mi></mml:msub><mml:mrow><mml:msub><mml:mrow><mml:mspace width="0.222em"></mml:mspace><mml:mi>⌀</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msub><mml:mrow><mml:mo stretchy="true" form="prefix">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="true" form="postfix">)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mfrac></mml:mrow></mml:math></disp-formula>
</p>

<p>Where, <inline-formula>

<mml:math display="inline" id="m90"><mml:mrow><mml:msub><mml:mo>max</mml:mo><mml:mi>j</mml:mi></mml:msub><mml:mrow><mml:msub><mml:mrow><mml:mspace width="0.222em"></mml:mspace><mml:mi>⌀</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msub><mml:mrow><mml:mo stretchy="true" form="prefix">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="true" form="postfix">)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula>,
<inline-formula>

<mml:math display="inline" id="m91"><mml:mrow><mml:msub><mml:mo>min</mml:mo><mml:mi>j</mml:mi></mml:msub><mml:mrow><mml:msub><mml:mrow><mml:mspace width="0.222em"></mml:mspace><mml:mi>⌀</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msub><mml:mrow><mml:mo stretchy="true" form="prefix">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="true" form="postfix">)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula>
and <inline-formula>

<mml:math display="inline" id="m92"><mml:mrow><mml:mover><mml:msub><mml:mi>⌀</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo accent="true">̃</mml:mo></mml:mover><mml:mo stretchy="false" form="prefix">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false" form="postfix">)</mml:mo></mml:mrow></mml:math></inline-formula>
is the maximum, minimum, and distance normalized value of the measure
<inline-formula>

<mml:math display="inline" id="m93"><mml:mrow><mml:msub><mml:mrow><mml:mspace width="0.222em"></mml:mspace><mml:mi>⌀</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false" form="prefix">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false" form="postfix">)</mml:mo></mml:mrow></mml:math></inline-formula>
respectively (<inline-formula>

<mml:math display="inline" id="m94"><mml:mrow><mml:mn>0</mml:mn><mml:mo>≤</mml:mo><mml:mover><mml:msub><mml:mi>⌀</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo accent="true">̃</mml:mo></mml:mover><mml:mo stretchy="false" form="prefix">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false" form="postfix">)</mml:mo><mml:mo>≤</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula>).</p>

<p><inline-formula>

<mml:math display="inline" id="m95"><mml:mrow><mml:msub><mml:mrow><mml:mspace width="0.222em"></mml:mspace><mml:mi>⌀</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false" form="prefix">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false" form="postfix">)</mml:mo></mml:mrow></mml:math></inline-formula>
is applicable for representing any of the three target importance
measures (i.e. indegree, closeness, and betweenness) whereas percent
normalization is useful for only indegree due to manner in which the
measures are calculated (see sections 2.4 and 3.7).</p>
    </sec>

    <sec id="S3hc">
      <title>3.8.3 Target (or AOI) importance measure
visualization</title>


<p>Once the values of the target importance measures are normalized, the
last step involves their subsequent visualization. We provide a couple
of examples of visualization approaches: Dot plot based on multiple time
intervals (for a single observer and single vertex importance measure)
and bar plot based on multiple participants (for a single time interval
and single vertex importance measure). There can be various ways to
visually represent the combinations of importance measures,
normalization methods, multiple time intervals, and number of
participants. Another example of a bar plot that compares all importance
measures of a single participant for a single time frame is also
provided in the Results section.</p>

    <sec id="S3hca">
      <title>3.8.3.1 Adapted dot plot visualization</title>

<p>Dot plots can better represent the evolution of the visual attention
across various time intervals. We have adapted the dot plot to visualize
the percent normalized indegree measure for all the time intervals
considered in the DNet framework. Using the normalized measurements
helps in comparing the relative significance of AOIs within a single
time interval and how an AOI’s importance is changing across various
time intervals. Figure 5 shows a sample dot plot for the normalized
indegree measure for all the AOIs presented in the DNet in Figure 4. In
Figure 5, the size of each dot is proportional to the percent normalized
indegree value of the AOI for the given time interval.</p>
    </sec>

    <sec id="S3hcb">
      <title>3.8.3 Target (or AOI) importance measure
visualization</title>

<p>Bar plots can better assist in comparing a single importance measure
among multiple participants or multiple importance measures for a single
participant. Figure 6 shows an example of the adapted bar plot that
compares the indegree measurements among multiple participants through
the distance normalization approach.</p>

<fig id="fig05" fig-type="figure" position="float">
					<label>Figure 5.</label>
					<caption>
						<p>Sample dot plot showing the evolutions of the indegree
measurements (for both single and overlapping AOIs) based on time frames
using the results shown in Figure 4. Note that the time intervals need
not be fixed but can be determined differently (e.g. dividing the time
intervals based on events).</p>
					</caption>
					<graphic id="graph05" xlink:href="jemr-11-04-a-figure-05.png"/>
				</fig>

<fig id="fig06" fig-type="figure" position="float">
					<label>Figure 6.</label>
					<caption>
						<p>Sample bar plot showing the relative indegree values of
various AOIs among multiple observers (i.e. P1, P2, and P3) using the
results shown in Figure 4. For this example, the vertical axis
represents the distance normalized indegree measure value. Only
considering the indegree measure (in this example), AOI A is considered
as the important AOI by all participants, whereas AOI B is considered
important by only P2.</p>
					</caption>
					<graphic id="graph06" xlink:href="jemr-11-04-a-figure-06.png"/>
				</fig>
    </sec>
    </sec>
    </sec>
     </sec>  

    <sec id="S4">
      <title>4. Experiment</title>              

<p>The proposed approach was implemented into an air traffic control
task. The task involved expert ATCSs observing the radar display to
detect possible aircraft collisions. Details are as follows.</p>
     </sec>  

    <sec id="S4a">
      <title>4.1. Participants</title>  

<p>Three retired ATCSs (P1, P2 and P3) with over thirty years of
experience were participants for the experiment. The ATCSs were
recruited with the help of FAA Civil Aerospace Medical Institute (CAMI).
Also, three FAA CAMI employees were also involved in the experiment as
pseudo-pilots. They made the necessary maneuverings by following the
ATCS’s voice commands. A simulated radio connection was used as the
communication channel between the pseudo-pilots and ATCSs.</p>
     </sec>  

    <sec id="S4b">
      <title>4.2. Apparatus</title> 

<p><bold>Hardware</bold>: A 19.83 × 19.83-inch monitor, with a 2048 ×
2048-pixel active display area, was used for displaying the simulated
air traffic scenarios. Apart from this, an additional monitor (kept to
the right of the simulation monitor) was used to display textual
information about the aircraft, e.g. trajectory and possible future
conflicts it might encounter (also known as the Enroute Automation
Modernization tool). The ATCS’s used a keyboard, placed beneath the
simulation display, to provide necessary input commands. FaceLab 5 eye
tracker with an accuracy in the range of <inline-formula>

<mml:math display="inline" id="m96"><mml:mrow><mml:mn>0.5</mml:mn><mml:mo>−</mml:mo><mml:mn>1.0</mml:mn></mml:mrow></mml:math></inline-formula>
degree visual angle error and sampling rate of 60 Hz(<xref ref-type="bibr" rid="b36">36</xref>) was
used to collect ATCSs’ EM data. A threshold of 100 milliseconds was used
for defining fixations. The participants were seated within a range of
50-70 cm from the simulated radar display. <bold>Software</bold>: A
customized ISim software used by FAA CAMI was used for simulating the
enroute air traffic scenario (with an update rate of 1 sec). EyeWorks
software was used to process the raw eye tracking data collected through
FaceLabs eye trackers.</p>
     </sec>  

    <sec id="S4c">
      <title>4.3. Scenario and task</title> 
    <sec id="S4ca">
      <title>4.3.1 Scenario</title> 

<p>For the experiment we used one 20 minutes long simulated enroute air
traffic scenario, which was developed and provided by the FAA. This
scenario had a total of thirty nine unique aircraft (named as A, B, …,
Z, a, b, …, m) with an average of twenty aircraft per frame. The
scenario had a minimum of seven and maximum of thirty aircraft per
frame. Figure 7 represents a screen capture of the simulated scenario.
The scenario update rate was 1 second. The display shows various
aircraft and a weather patch in blue color. The aircraft representation
shows the direction in which the aircraft is moving (shown by the white
line) and data block which contains information about the aircraft’s
computer code name, altitude, current speed, and destination airport.
For example, in Figure 7, the aircraft N7890 (AOI
<italic><bold>U</bold></italic>) is flying at a constant altitude of
19,000 ft (as shown by 190C) with a speed of 402 knots and it going to
KGPT airport (i.e. Gulfport–Biloxi International Airport in
Mississippi).</p>
     </sec>  

    <sec id="S4cb">
      <title>4.3.2 Task</title> 

<p>The task involved controlling the simulated low altitude enroute
airspace using the ERAM system. The ATCSs are required to fulfil two
objectives: (1) Route the aircraft through the sector within the display
and (2) avoid any conflict scenario by preventing loss of separation
(vertical and horizontal separation of 1000 ft and 5 knots respectively)
between aircraft. To achieve these objectives, the ATCSs gave voice
commands (e.g. change is altitudes, speed and direction of the aircraft)
to the pseudo pilots, using the simulated radio, for necessary
maneuvering of the aircraft.</p>
     </sec>  
     </sec> 

    <sec id="S4d">
      <title>4.4. Data analysis</title>

<p>For the DNet analysis, the 20 minutes simulated scenario was divided
manually, on trial and error basis, into four equal time intervals of 5
minutes. This choice was motivated by the fact that we observed on
average an aircraft spends around 5 minutes on the radar display. Event
based intervals were not applied in this research since many aircraft
appeared and disappeared throughout.</p>

<p>Matlab was used to develop the AOI fixation sequence for each of the
four time intervals mentioned above. In addition, igraph
package(<xref ref-type="bibr" rid="b37">37</xref>) in R software was used to create the dynamic
network representation of the AOI fixation sequences and also for AOI
importance metric calculation and visualization.</p>

<p>Figure 2 shows there are eight major steps in the proposed
methodology. The time complexity (TC) of steps 1-4 for one time interval
can be written as <inline-formula>

<mml:math display="inline" id="m97"><mml:mrow><mml:msub><mml:mtext mathvariant="normal">TC</mml:mtext><mml:mrow><mml:mn>1</mml:mn><mml:mo>−</mml:mo><mml:mn>4</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>α</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:msub><mml:mi>e</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:msub><mml:mi>n</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>
, where, <inline-formula>

<mml:math display="inline" id="m98"><mml:msub><mml:mi>e</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:math></inline-formula>
and <inline-formula>

<mml:math display="inline" id="m99"><mml:msub><mml:mi>n</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:math></inline-formula>
are the number of eye fixations and number of AOIs in time interval
<inline-formula>

<mml:math display="inline" id="m100"><mml:mi>t</mml:mi></mml:math></inline-formula>
respectively, and <inline-formula>

<mml:math display="inline" id="m101"><mml:msub><mml:mi>α</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math></inline-formula>
is some positive constant. Due to human physiological limitations the
value of <inline-formula>

<mml:math display="inline" id="m102"><mml:msub><mml:mi>e</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:math></inline-formula>
cannot increase arbitrability. Therefore, the governing factor of the
time complexity for steps 1-4 is the number of AOIs. Thus, we can
approximately write <inline-formula>

<mml:math display="inline" id="m103"><mml:mrow><mml:msub><mml:mtext mathvariant="normal">TC</mml:mtext><mml:mrow><mml:mn>1</mml:mn><mml:mo>−</mml:mo><mml:mn>4</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>O</mml:mi><mml:mo stretchy="false" form="prefix">(</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo stretchy="false" form="postfix">)</mml:mo></mml:mrow></mml:math></inline-formula>.
Taking the worst case scenario, we can find an upper bound for this
value by taking the maximum number of AOIs across all time intervals.
Let, <inline-formula>

<mml:math display="inline" id="m104"><mml:msub><mml:mi>n</mml:mi><mml:mo>max</mml:mo></mml:msub></mml:math></inline-formula>
be the maximum number of AOIs present during any of the time intervals.
Thus, we get <inline-formula>

<mml:math display="inline" id="m105"><mml:mrow><mml:msub><mml:mtext mathvariant="normal">TC</mml:mtext><mml:mrow><mml:mn>1</mml:mn><mml:mo>−</mml:mo><mml:mn>4</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>α</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:msub><mml:mi>n</mml:mi><mml:mo>max</mml:mo></mml:msub></mml:mrow></mml:math></inline-formula>.
Similarly, the time complexity of step 5 can be written as
<inline-formula>

<mml:math display="inline" id="m106"><mml:mrow><mml:msub><mml:mtext mathvariant="normal">TC</mml:mtext><mml:mn>5</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>α</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:msup><mml:msub><mml:mi>n</mml:mi><mml:mo>max</mml:mo></mml:msub><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:math></inline-formula>,
where <inline-formula>

<mml:math display="inline" id="m107"><mml:msub><mml:mi>α</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:math></inline-formula>
is some positive constant. For <inline-formula>

<mml:math display="inline" id="m108"><mml:mi>T</mml:mi></mml:math></inline-formula>
time intervals the time complexity of step 1-4 and 5 can be written as
<inline-formula>

<mml:math display="inline" id="m109"><mml:mrow><mml:msub><mml:mtext mathvariant="normal">TC</mml:mtext><mml:mrow><mml:mn>1</mml:mn><mml:mo>−</mml:mo><mml:mn>4</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mtext mathvariant="normal">Tα</mml:mtext><mml:mn>1</mml:mn></mml:msub><mml:msub><mml:mi>n</mml:mi><mml:mo>max</mml:mo></mml:msub></mml:mrow></mml:math></inline-formula>
and <inline-formula>

<mml:math display="inline" id="m110"><mml:mrow><mml:msub><mml:mtext mathvariant="normal">TC</mml:mtext><mml:mn>5</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mtext mathvariant="normal">Tα</mml:mtext><mml:mn>2</mml:mn></mml:msub><mml:msup><mml:msub><mml:mi>n</mml:mi><mml:mo>max</mml:mo></mml:msub><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:math></inline-formula>
respectively.</p>

<p>As mentioned in section 3.6.2, in a given DNet visualization, the
relative location of each AOI remains constant within the various
constituent networks for various time intervals. As a result, for
drawing the DNet, we need to consider all the unique AOI states that
arise in the AOI fixation sequence of an ATCS. Therefore, the time
complexity for step 6 can be written as, <inline-formula>

<mml:math display="inline" id="m111"><mml:mrow><mml:msub><mml:mtext mathvariant="normal">TC</mml:mtext><mml:mn>6</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mtext mathvariant="normal">Tα</mml:mtext><mml:mn>3</mml:mn></mml:msub><mml:msub><mml:mi>n</mml:mi><mml:mtext mathvariant="normal">uniq</mml:mtext></mml:msub></mml:mrow></mml:math></inline-formula>,
where, <inline-formula>

<mml:math display="inline" id="m112"><mml:msub><mml:mi>n</mml:mi><mml:mtext mathvariant="normal">uniq</mml:mtext></mml:msub></mml:math></inline-formula>
is the number of unique AOI states (both single and overlapped) in the
AOI fixation sequence and <inline-formula>

<mml:math display="inline" id="m113"><mml:msub><mml:mi>α</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:math></inline-formula>
is some positive constant. Step 7 consists of calculating three AOI
importance measure. The time complexity for indegree, closeness and
betweenness metric are <inline-formula>

<mml:math display="inline" id="m114"><mml:mrow><mml:msub><mml:mtext mathvariant="normal">Tα</mml:mtext><mml:mn>4</mml:mn></mml:msub><mml:msub><mml:mi>n</mml:mi><mml:mo>max</mml:mo></mml:msub></mml:mrow></mml:math></inline-formula>,
<inline-formula>

<mml:math display="inline" id="m115"><mml:mrow><mml:msub><mml:mtext mathvariant="normal">Tα</mml:mtext><mml:mn>5</mml:mn></mml:msub><mml:mo stretchy="false" form="prefix">(</mml:mo><mml:msup><mml:msub><mml:mi>n</mml:mi><mml:mo>max</mml:mo></mml:msub><mml:mn>2</mml:mn></mml:msup><mml:mo>−</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mo>max</mml:mo></mml:msub><mml:mo stretchy="false" form="postfix">)</mml:mo></mml:mrow></mml:math></inline-formula>,
<inline-formula>

<mml:math display="inline" id="m116"><mml:mrow><mml:msub><mml:mtext mathvariant="normal">Tα</mml:mtext><mml:mn>6</mml:mn></mml:msub><mml:msub><mml:mi>n</mml:mi><mml:mo>max</mml:mo></mml:msub><mml:mo stretchy="false" form="prefix">(</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mo>max</mml:mo></mml:msub><mml:mo>−</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false" form="postfix">)</mml:mo><mml:mo stretchy="false" form="prefix">(</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mo>max</mml:mo></mml:msub><mml:mo>−</mml:mo><mml:mn>2</mml:mn><mml:mo stretchy="false" form="postfix">)</mml:mo></mml:mrow></mml:math></inline-formula>
respectively. Thus, the time complexity for step 7 can be written as
<inline-formula>

<mml:math display="inline" id="m117"><mml:mrow><mml:msub><mml:mtext mathvariant="normal">TC</mml:mtext><mml:mn>7</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mtext mathvariant="normal">Tα</mml:mtext><mml:mn>4</mml:mn></mml:msub><mml:msub><mml:mi>n</mml:mi><mml:mo>max</mml:mo></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mtext mathvariant="normal">Tα</mml:mtext><mml:mn>5</mml:mn></mml:msub><mml:mrow><mml:mo stretchy="true" form="prefix">(</mml:mo><mml:msup><mml:msub><mml:mi>n</mml:mi><mml:mo>max</mml:mo></mml:msub><mml:mn>2</mml:mn></mml:msup><mml:mo>−</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mo>max</mml:mo></mml:msub><mml:mo stretchy="true" form="postfix">)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msub><mml:mtext mathvariant="normal">Tα</mml:mtext><mml:mn>6</mml:mn></mml:msub><mml:msub><mml:mi>n</mml:mi><mml:mo>max</mml:mo></mml:msub><mml:mo stretchy="false" form="prefix">(</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mo>max</mml:mo></mml:msub><mml:mo>−</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false" form="postfix">)</mml:mo><mml:mo stretchy="false" form="prefix">(</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mo>max</mml:mo></mml:msub><mml:mo>−</mml:mo><mml:mn>2</mml:mn><mml:mo stretchy="false" form="postfix">)</mml:mo></mml:mrow></mml:math></inline-formula>.
The time complexity of Step 8 can be written as
<inline-formula>

<mml:math display="inline" id="m118"><mml:mrow><mml:msub><mml:mtext mathvariant="normal">TC</mml:mtext><mml:mn>8</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mtext mathvariant="normal">Tα</mml:mtext><mml:mn>7</mml:mn></mml:msub><mml:msub><mml:mi>n</mml:mi><mml:mo>max</mml:mo></mml:msub></mml:mrow></mml:math></inline-formula>,
where, <inline-formula>

<mml:math display="inline" id="m119"><mml:msub><mml:mi>α</mml:mi><mml:mn>7</mml:mn></mml:msub></mml:math></inline-formula>
is some positive constant. Adding all the time complexity for step 1-8,
the total time complexity for the overall process can be written as:
<inline-formula>

<mml:math display="inline" id="m120"><mml:mrow><mml:msub><mml:mtext mathvariant="normal">TC</mml:mtext><mml:mtext mathvariant="normal">tot</mml:mtext></mml:msub><mml:mo>=</mml:mo><mml:mi>T</mml:mi><mml:mrow><mml:mo stretchy="true" form="prefix">[</mml:mo><mml:msub><mml:mi>α</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:msub><mml:mi>n</mml:mi><mml:mo>max</mml:mo></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>α</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:msup><mml:msub><mml:mi>n</mml:mi><mml:mo>max</mml:mo></mml:msub><mml:mn>2</mml:mn></mml:msup><mml:mo>+</mml:mo><mml:msub><mml:mi>α</mml:mi><mml:mn>3</mml:mn></mml:msub><mml:msub><mml:mi>n</mml:mi><mml:mtext mathvariant="normal">uniq</mml:mtext></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>α</mml:mi><mml:mn>4</mml:mn></mml:msub><mml:msub><mml:mi>n</mml:mi><mml:mo>max</mml:mo></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mrow><mml:mspace width="0.333em"></mml:mspace><mml:mtext mathvariant="normal"> α</mml:mtext></mml:mrow><mml:mn>5</mml:mn></mml:msub><mml:mrow><mml:mo stretchy="true" form="prefix">(</mml:mo><mml:msup><mml:msub><mml:mi>n</mml:mi><mml:mo>max</mml:mo></mml:msub><mml:mn>2</mml:mn></mml:msup><mml:mo>−</mml:mo><mml:msub><mml:mrow><mml:mspace width="0.333em"></mml:mspace><mml:mtext mathvariant="normal">  n</mml:mtext></mml:mrow><mml:mo>max</mml:mo></mml:msub><mml:mo stretchy="true" form="postfix">)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msub><mml:mi>α</mml:mi><mml:mn>6</mml:mn></mml:msub><mml:msub><mml:mi>n</mml:mi><mml:mo>max</mml:mo></mml:msub><mml:mrow><mml:mo stretchy="true" form="prefix">(</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mo>max</mml:mo></mml:msub><mml:mo>−</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="true" form="postfix">)</mml:mo></mml:mrow><mml:mrow><mml:mo stretchy="true" form="prefix">(</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mo>max</mml:mo></mml:msub><mml:mo>−</mml:mo><mml:mn>2</mml:mn><mml:mo stretchy="true" form="postfix">)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mspace width="0.222em"></mml:mspace><mml:msub><mml:mi>α</mml:mi><mml:mn>7</mml:mn></mml:msub><mml:msub><mml:mi>n</mml:mi><mml:mo>max</mml:mo></mml:msub><mml:mspace width="0.222em"></mml:mspace><mml:mo stretchy="true" form="postfix">]</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.</p>

<p>On simple algebraic reorganization, we get that:
<inline-formula>

<mml:math display="inline" id="m121"><mml:mrow><mml:msub><mml:mrow><mml:mspace width="0.333em"></mml:mspace><mml:mtext mathvariant="normal">   TC</mml:mtext></mml:mrow><mml:mtext mathvariant="normal">tot</mml:mtext></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi>T</mml:mi><mml:mo stretchy="false" form="prefix">[</mml:mo><mml:mi>α</mml:mi></mml:mrow><mml:mn>6</mml:mn></mml:msub><mml:msup><mml:msub><mml:mi>n</mml:mi><mml:mo>max</mml:mo></mml:msub><mml:mn>3</mml:mn></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:msub><mml:mi>n</mml:mi><mml:mo>max</mml:mo></mml:msub><mml:mn>2</mml:mn></mml:msup><mml:mrow><mml:mo stretchy="true" form="prefix">(</mml:mo><mml:msub><mml:mi>α</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>α</mml:mi><mml:mn>5</mml:mn></mml:msub><mml:mo>−</mml:mo><mml:mn>3</mml:mn><mml:msub><mml:mi>α</mml:mi><mml:mn>6</mml:mn></mml:msub><mml:mo stretchy="true" form="postfix">)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mspace width="0.222em"></mml:mspace><mml:mspace width="0.222em"></mml:mspace><mml:mspace width="0.222em"></mml:mspace><mml:mspace width="0.222em"></mml:mspace><mml:mspace width="0.222em"></mml:mspace><mml:mspace width="0.222em"></mml:mspace><mml:mspace width="0.222em"></mml:mspace><mml:mspace width="0.222em"></mml:mspace><mml:mspace width="0.222em"></mml:mspace><mml:mspace width="0.222em"></mml:mspace><mml:mspace width="0.222em"></mml:mspace><mml:mspace width="0.222em"></mml:mspace><mml:mspace width="0.222em"></mml:mspace><mml:mspace width="0.222em"></mml:mspace><mml:mspace width="0.222em"></mml:mspace><mml:mspace width="0.222em"></mml:mspace><mml:mspace width="0.222em"></mml:mspace><mml:mspace width="0.222em"></mml:mspace><mml:mspace width="0.222em"></mml:mspace><mml:mspace width="0.222em"></mml:mspace><mml:mspace width="0.222em"></mml:mspace><mml:mspace width="0.222em"></mml:mspace><mml:msub><mml:mi>n</mml:mi><mml:mo>max</mml:mo></mml:msub><mml:mrow><mml:mo stretchy="true" form="prefix">(</mml:mo><mml:msub><mml:mi>α</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>α</mml:mi><mml:mn>4</mml:mn></mml:msub><mml:mo>+</mml:mo><mml:mn>2</mml:mn><mml:msub><mml:mi>α</mml:mi><mml:mn>6</mml:mn></mml:msub><mml:msub><mml:mrow><mml:mo>+</mml:mo><mml:mi>α</mml:mi></mml:mrow><mml:mn>7</mml:mn></mml:msub><mml:mo>−</mml:mo><mml:msub><mml:mi>α</mml:mi><mml:mn>5</mml:mn></mml:msub><mml:mo stretchy="true" form="postfix">)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msub><mml:mi>α</mml:mi><mml:mn>3</mml:mn></mml:msub><mml:msub><mml:mi>n</mml:mi><mml:mtext mathvariant="normal">uniq</mml:mtext></mml:msub><mml:mo stretchy="false" form="postfix">]</mml:mo></mml:mrow></mml:math></inline-formula>.</p>

<p>Thus, neglecting the lower order terms of
<inline-formula>

<mml:math display="inline" id="m122"><mml:msub><mml:mi>n</mml:mi><mml:mo>max</mml:mo></mml:msub></mml:math></inline-formula>,
the approx. time complexity of the overall data analysis process reduces
to the order of <inline-formula>

<mml:math display="inline" id="m123"><mml:mrow><mml:mi>O</mml:mi><mml:mo stretchy="false" form="prefix">(</mml:mo><mml:msup><mml:msub><mml:mtext mathvariant="normal">Tn</mml:mtext><mml:mo>max</mml:mo></mml:msub><mml:mn>3</mml:mn></mml:msup><mml:mo>+</mml:mo><mml:mi>T</mml:mi><mml:msub><mml:mi>n</mml:mi><mml:mtext mathvariant="normal">uniq</mml:mtext></mml:msub><mml:mo stretchy="false" form="postfix">)</mml:mo></mml:mrow></mml:math></inline-formula>.
Thus, we can see that the number of time interval, maximum number of
AOIs within any time interval and the number of unique AOI states in the
AOI fixation sequence do impact the processing time of the proposed
approach.</p>
     </sec>  


    <sec id="S5">
      <title>5. Results</title>
    <sec id="S5a">
      <title>5.1. Dynamic graph visualization</title>


<p>Figure 8 represents the DNet visualization of the EM data of one ATCS
for the simulated scenario shown in Figure 7. In Figure 8 (a) (i.e. time
interval 0-5 minutes), AOI <italic><bold>F</bold></italic> (i.e. AAL68)
and <italic><bold>U</bold></italic> (i.e. N7890) are the most important
AOIs as they both have most EF numbers (circle size) and longest EF
duration (circle color). In addition, there are highest EF transitions
between AOI <italic><bold>F</bold></italic> and AOI
<italic><bold>U</bold></italic> (based on the thickness of the link).
AOI <italic><bold>K</bold></italic> (i.e. EJA33), despite having a small
number of EFs, has substantially longer EF duration. AOI
<italic><bold>b</bold></italic> and AOI <italic><bold>d</bold></italic>
can also be considered as important AOIs based on how a researcher wants
to set the threshold.</p>

<p>For the second time interval (i.e. 5-10 minutes) shown in Figure 8
(b), the important AOIs have changed to AOI</p>

<p><italic><bold>G</bold></italic> (newly appeared aircraft not shown in
Figure 8(a) and AOI <italic><bold>K</bold></italic>. Notice that AOI
<italic><bold>F</bold></italic> has moved out of the display (see Figure
7(b)) and AOI <italic><bold>U</bold></italic> is still within the
display but AOI <italic><bold>U</bold></italic> is not visually attended
any longer.</p>

<p>In addition, notice that AOI <italic><bold>d</bold></italic> (i.e.
UAL1322) has been receiving consistent visual attention throughout the
two time intervals 0-5 minutes and 5-10 minutes. Similarly, the
important AOIs change for the next two time intervals. In the last time
interval, the overlapping AOI (i.e. AOI
<italic><bold>(J;f)</bold></italic>) receives much visual attention. As
we move across time intervals from 1 to 4, a visible trend is the
increase in the complexity of the network, with increase in the number
of AOIs and EF transitions among them.</p>
     </sec> 

    <sec id="S5b">
      <title>5.2. Adapted dot plot</title>

<p>Figure 9 represents the dotplot visualization of the normalized
indegree measure for all the AOIs present in DNet shown in Figure 8. For
example, in Figure 9 (a), AOI <italic><bold>F</bold></italic> and
<italic><bold>U</bold></italic> has high importance in first time
interval (i.e. 0-5), although, their importance reduces drastically in
the subsequent intervals. AOI <italic><bold>d</bold></italic> receives
consistent visual attention throughout the first two intervals. The
indegree results are in accordance with the DNet results in Figure 8
since indegree measures the number of EFs received by an AOI.</p>

<p>The adapted dot plot better shows the evolution of important AOIs.
Considering AOI <italic><bold>K</bold></italic>, we see that its
importance initially grows as we move from the first time interval to
the second, where it reaches its maximum and then starts decreasing for
the last two time intervals. Another noticeable fact is that majority of
the overlapped AOI cases have significant importance only in one time
interval. These trends took more time to identify when observing the
DNet.</p>
     </sec> 

    <sec id="S5c">
      <title>5.3. Adapted bar plot</title>

<p>Figure 10 represents the relative importance of various AOIs present
in the first time interval of participant 1 (i.e. P1). Again, AOI
<italic><bold>F</bold></italic> and <italic><bold>U</bold></italic> are
important, but also, we can identify that AOI
<italic><bold>b</bold></italic> (i.e. SWA340) and AOI
<italic><bold>d</bold></italic> can also be important AOIs when we
additionally consider the closeness and betweenness values. We can also
observe that AOI <italic><bold>K</bold></italic> had small EF numbers
during the first interval, however, it can be considered as an important
AOI due to the long EF duration and relatively high closeness value.
Furthermore, we can see that the AOI <italic><bold>Q</bold></italic> and
AOI <italic><bold>a</bold></italic> might be an important AOI
considering that AOI <italic><bold>(Q;a)</bold></italic> also has
moderate indegree and closeness values.</p>

<p>Figure 11 shows the measures (i.e. indegree, closeness, and
betweenness) visualized based on participants for the first time
interval. Although there are slight variations, we can see a consistent
trend among the participants. In addition, it becomes more evident that
AOI <italic><bold>Q</bold></italic> and AOI
<italic><bold>a</bold></italic> can be important AOIs (considering the
values of AOI <italic><bold>(Q;a)</bold></italic>) in addition to AOI
<italic><bold>F</bold></italic>, AOI <italic><bold>K</bold></italic>,
AOI <italic><bold>b</bold></italic> and AOI
<italic><bold>d</bold></italic>. In detail, overlapping AOI
<italic><bold>(Q;a)</bold></italic> received substantial EF duration (as
shown by the vertex color in the DNet visualization) although it
received moderate number of EFs on it (as shown by the vertex size in
the DNet visualization). On the other hand, comparing the three
importance measurements, AOI <italic><bold>(Q;a)</bold></italic>, in
spite of having moderate indegree and closeness value, has insignificant
betweenness value.</p>

<p>This might be due to the short lifespan of the overlapped AOI state
since AOI <italic><bold>a</bold></italic> (i.e. SWA2920 flying at 21000
ft with speed 424 knots overtakes AOI <italic><bold>Q</bold></italic>
(i.e. N46332 flying at 7000 ft with speed 163 knots very quickly on the
display. As a result, it is highly unlikely that it will play a crucial
role as a bridge for the flow of attention between other groups of
aircraft.</p>
     </sec> 
     </sec> 

    <sec id="S6">
      <title>6. Discussion</title>

<p>Results obtained from the DNet visualization coupled with multiple
time interval visualizations enabled us to identify which are the
important targets in each of the time intervals and how their importance
evolves as we move across time intervals. Application of the three
adapted target importance measures (i.e. indegree, closeness, and
betweenness) along with the various ways to visualize those values
showed that we can better analyze target importance measures that
accounts for the interaction among targets.</p>

<p>In addition, we could identify various EM network characteristics of
each participant and how the relative importance of various targets
differs among them.</p>

<p>DNet was better to visualize the EM flow of the overall network and
EF transitions, whereas the adapted dot plot was better to visualize the
evolution of importance of each AOI across various time intervals. It is
noted that the results could have been different if we had used a
different time interval. For example, if the time interval was to 10
minutes, the most important AOI would turn out to be AOI
<bold><italic>d</italic></bold> and the importance of AOI
<italic><bold>F</bold></italic> and AOI <italic><bold>U</bold></italic>
would have been less substantial. However, such results can be
misleading since AOI <italic><bold>F</bold></italic> and AOI
<bold><italic>U</italic></bold> were important AOIs during the first 5
minutes.</p>

<p>Selection of time interval thresholds (whether fixed or varied based
on events/triggers) can be tricky and depend on the scenario
characteristics.</p>

<p>The adapted bar plots were better when multiple target importance
measures and/or multiple participants’ measures were needed to be
compared side-by-side. The normalized and adapted measure plots show
that, despite receiving substantial amount of EFs, an AOI may not be
significant in terms of the flow of visual attention across the various
AOIs within the display as shown by the closeness and betweenness
measures. The proposed approach can be useful in increasing the training
efficiency of the novice controllers. Novice controllers can know which
are the important targets that needs to be focused upon and how to move
the attention across various targets as the scenario characteristics
change. Furthermore, the trainees can better understand which targets
are highly correlated for conflict mitigation through observing the EF
transition characteristics using the DNet and evaluating the closeness/
betweenness values.</p>
     </sec> 

    <sec id="S7">
      <title>7. Conclusion</title>

<p>In this research, we integrated the DNet framework with three target
important measures (i.e. indegree, closeness, and betweenness). During
the integration, we normalized the measurements and then adapted the dot
plot and bar plot to better visualize the outputs. The approach
facilitated the understanding of how visual attentions occur on the
dynamic network (i.e. EM network created from an aircraft conflict task)
from various perspectives. The results obtained showed that, the
traditional approach of using the raw EM data measures (i.e. number and
duration of EFs) might be misleading for dynamic scenarios where the
targets’ lifespan on the display are non-uniform. The proposed approach
enabled us to better understand how the observers’ attention were
devoted to the various targets including the overlapping targets on the
display. In addition, in case of dynamic targets, to understand target
importance we need to also consider which targets are integral in the
smooth flow of attention across the various targets within the
display.</p>

<fig id="fig07" fig-type="figure" position="float">
					<label>Figure 7.</label>
					<caption>
						<p>Screen captures at the 0 and 5 minutes. The blue patch
shows a weather feature (e.g. thunderstorm) which the aircraft needs to
avoid. The characters and arrows in yellow color represent an AOI and
the direction of the aircraft, respectively. These characters and arrows
were not present during the experiment. Each AOI consists of an aircraft
shown as a diamond shape, its direction shown as a vector line, and its
associated data block (first line shows the aircraft ID, second line
shows its altitude, third line shows its computer ID and speed, and
forth line shows its destination). If the altitude changes, the aimed
altitude is shown followed by letter “T” and the current altitude. For
example, AOI <italic><bold>F</bold></italic> is AAL68 (i.e. American
Airlines 68) and flying toward northwest. Its current altitude is 21,300
ft (at 5 minutes) and target altitude is 23,000 ft. Its speed is 345
knots (at 5 minutes) and destination is KDEN (i.e. Denver international
airport).</p>
					</caption>
					<graphic id="graph07" xlink:href="jemr-11-04-a-figure-07.png"/>
				</fig>

<fig id="fig08" fig-type="figure" position="float">
					<label>Figure 8.</label>
					<caption>
						<p>DNet visualisation of the EM data of one ATCS for the
    simulated enroute air traffic scenario. The figure shows the
    important AOIs in terms of EF numbers and EF duration for all the
    four time intervals. It also shows how the importance of various
    AOIs changes as we move across various time intervals. The relative
    location of each of the AOIs remains constant across all the static
    networks associated with different time intervals. For example, AOI
    <italic><bold>K</bold></italic> is placed at the bottom row sixth
    column for all the constituent static networks.</p>
					</caption>
					<graphic id="graph08" xlink:href="jemr-11-04-a-figure-08.png"/>
				</fig>

<fig id="fig09" fig-type="figure" position="float">
					<label>Figure 9.</label>
					<caption>
						<p>Adapted dot plot visualization of the percent normalized
indegree measure value for all AOIs (single and overlapped) present in
the DNet visualization in Figure 8.</p>
					</caption>
					<graphic id="graph09" xlink:href="jemr-11-04-a-figure-09.png"/>
				</fig>

<fig id="fig10" fig-type="figure" position="float">
					<label>Figure 10.</label>
					<caption>
						<p>Distance normalized measure value for all AOIs present in
the DNet for time interval 0-5 mins for P1 (see Figure 8(a)). “Norm
Indeg,” “Norm Close,” and “Norm Bet” refers to normalized indegree,
closeness, and betweenness values, respectively. The vertical axis
represents the distanced normalized measure value. The vertical axis
ranges from 0 to 1, thus it helps to analyze the relative importance of
all three measures at a given time interval.</p>
					</caption>
					<graphic id="graph10" xlink:href="jemr-11-04-a-figure-10.png"/>
				</fig>
     </sec> 

    <sec id="S8">
      <title>8. Limitations and Future work</title>

<p>One challenging issue was determining the time intervals for
effective analysis. We have used five minute time intervals for the
experiment based on trial and errors and we could have applied time
intervals based on specific events (e.g. when target appears or
disappears, or when a verbal control command is issued by an expert
ATCS).</p>

<p>However, event-based time intervals can create issues if too many
events occur within very short times or too few events occur in very
long times. Instead, we could try applying shorter time intervals. For
example, reducing the 5 minute interval to 1 minute interval). However,
we might be burdened with visualizing and analyzing too many outputs.
Therefore, formal sensitivity analysis needs to be performed as part of
future study to determine an optimal range of values for the
intervals.</p>

<p>In addition, we have not used pre-determined thresholds to identify
important AOIs and only identified them if all measures were relatively
higher than others. Therefore, a statistical method should be developed
that clearly differentiate the important AOIs from the non-important
one.</p>

<p>Moreover, as a future study, we can also analyze the variation of the
saccade length and eye fixation duration with time and various air
traffic scenario characteristics. For example, we can consider how the
distance between several aircraft on the display affects the saccade
length of the ATCS. This might help us analyze the type of search
behaviors undertaken by them, i.e. is the search goal oriented where
they search for targets having similar characteristics or is it a random
one.</p>

<p>With increase in the number of AOIs and EF transition between them,
the visual scalability of the DNet visualization gets impacted
negatively, as there are more instances of edge crossings in the network
representations. Furthermore, increase in the number of time intervals
also increases the number of static networks within a DNet framework.
This leads to increase in the cognitive load of the observers as they
have to keep track of an AOI across more number of network
representations. Thus, in terms of visualization scalability, we can
apply various graph simplification processes, also known as graph
filtering processes, where the unimportant edges (i.e. edges
representing low EF transitions) are not considered for visualization
purpose, thus reducing the visual clutter.</p>

<p>Furthermore, it can be valuable to analyze the community structure of
AOIs (cluster of AOIs having high amount of EF transitions between them)
and their evolution formed in the network representation of the EF data.
Finally, we are planning to develop a mapping scheme between the visual
scanning pattern classifications(<xref ref-type="bibr" rid="b38">38</xref>) with the DNet results.
This might help in understanding how different visual scanning
strategies are related to the overall target’s importance</p>

<fig id="fig11" fig-type="figure" position="float">
					<label>Figure 11.</label>
					<caption>
						<p>Comparison of three ATCS’s visual scanning strategy by
analyzing the distance normalized importance measure values of AOIs. The
Figures (a), (b), and (c) shows the relative importance of AOIs in terms
of distance normalized indegree, closeness, and betweenness value (as
shown by their zero values in the vertical axis in Figure 10).</p>
					</caption>
					<graphic id="graph11" xlink:href="jemr-11-04-a-figure-11.png"/>
				</fig>
     </sec> 

    <sec id="S9" sec-type="COI-statement">
      <title>Ethics and Conflict of Interest</title>

<p>The author(s) declare(s) that the contents of the article are in
agreement with the ethics described in
<ext-link ext-link-type="uri" xlink:href="http://biblio.unibe.ch/portale/elibrary/BOP/jemr/ethics.html" xlink:show="new">http://biblio.unibe.ch/portale/elibrary/BOP/jemr/ethics.html</ext-link>
and that there is no conflict of interest regarding the publication of
this paper.</p>
     </sec> 

    <sec id="S10">
      <title>Acknowledgements</title>

<p>This research is supported by the Federal Aviation Administration
Center of Excellence (Project No. A17-0162) and the FAA Aviation
Research Grants Program (Project No. 15-P-0009). The FAA has sponsored
this project through the Center of Excellence for Technical Training and
Human Performance. However, the agency neither endorses nor rejects the
findings of this research. This information is provided in the interest
of invoking technical community comment on the results and conclusions
of the research. We worked closely with the FAA Civil Aerospace Medical
Institute at Mike Monroney Aeronautical Center (AAM-520).</p>
     </sec>
</body>
<back>
<ref-list>
<ref id="b28"><mixed-citation publication-type="book-chapter" specific-use="linked"><person-group person-group-type="author"><name><surname>Archambault</surname> <given-names>D</given-names></name>, <name><surname>Purchase</surname> <given-names>HC</given-names></name></person-group>. <chapter-title>Mental map preservation helps user orientation in dynamic graphs.</chapter-title> In: Didimo W, Patrignani M, editors. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Heidelberg, Berlin: Springer, Berlin, Heidelberg; <year>2013</year>. p. 475&#8211;86. <pub-id pub-id-type="doi">10.1007/978-3-642-36763-2_42</pub-id></mixed-citation></ref>
<ref id="b27"><mixed-citation publication-type="conference" specific-use="linked"><person-group person-group-type="author"><name><surname>Beck</surname> <given-names>F</given-names></name>, <name><surname>Burch</surname> <given-names>M</given-names></name>, <name><surname>Diehl</surname> <given-names>S.</given-names></name></person-group> <article-title>Matching Application Requirements with Dynamic Graph Visualization Profiles.</article-title> In: <source>Information Visualisation (IV)</source>, <year>2013</year> 17th International Conference; <conf-date>2013 July 16-18</conf-date>; <publisher-loc>London, United Kingdom</publisher-loc>. <publisher-name>IEEE</publisher-name>; 2013. p. <fpage>11</fpage>&#8211;<lpage>8</lpage>. <pub-id pub-id-type="doi">10.1109/IV.2013.2</pub-id></mixed-citation></ref>
<ref id="b24"><mixed-citation publication-type="conference" specific-use="parsed"><person-group person-group-type="author"><name><surname>Beck</surname> <given-names>F</given-names></name>, <name><surname>Burch</surname> <given-names>M</given-names></name>, <name><surname>Diehl</surname> <given-names>S</given-names></name>, <name><surname>Weiskopf</surname> <given-names>D.</given-names></name></person-group> <article-title>The State of the Art in Visualizing Dynamic Graphs.</article-title> In: <person-group person-group-type="editor"><name><surname>Borgo</surname> <given-names>R</given-names></name>, <name><surname>Maciejewski</surname> <given-names>R</given-names></name>, <name><surname>Viola</surname> <given-names>I</given-names></name><role>, editors</role></person-group>. <source>Eurographics Conference on Visualization (EuroVis)</source>. <conf-loc>Swansea, UK</conf-loc>; <year>2014</year>. p. <fpage>1</fpage>–<lpage>20</lpage>.</mixed-citation></ref>
<ref id="b9"><mixed-citation publication-type="conference" specific-use="parsed"><person-group person-group-type="author"><name><surname>Blascheck</surname> <given-names>T</given-names></name>, <name><surname>Kurzhals</surname> <given-names>K</given-names></name>, <name><surname>Raschke</surname> <given-names>M</given-names></name>, <name><surname>Burch</surname> <given-names>M</given-names></name>, <name><surname>Weiskopf</surname> <given-names>D</given-names></name>, <name><surname>Ertl</surname> <given-names>T.</given-names></name></person-group> <article-title>State-of-the-Art of Visualization for Eye Tracking Data.</article-title> In: <source>Eurographics Conference on Visualization (EuroVis)</source>; <conf-date>2014 June 9-13</conf-date>; <publisher-loc>Swansea, UK</publisher-loc>. <publisher-name>The Eurographics Association</publisher-name>; 2014. p. <fpage>1</fpage>&#8211;<lpage>20</lpage>.</mixed-citation></ref>
<ref id="b10"><mixed-citation publication-type="conference" specific-use="linked"><person-group person-group-type="author"><name><surname>Blascheck</surname> <given-names>T</given-names></name>, <name><surname>Raschke</surname> <given-names>M</given-names></name>, <name><surname>Ertl</surname> <given-names>T</given-names></name></person-group>. <article-title>Circular heat map transition diagram.</article-title> In: Proceedings of the 2013 Conference on Eye Tracking South Africa - ETSA ’13;2013 August 29 - 31; Cape Town, SA. ACM; <year>2013</year>. p. 58–61. <pub-id pub-id-type="doi">10.1145/2509315.2509326</pub-id></mixed-citation></ref>
<ref id="b34"><mixed-citation publication-type="journal" specific-use="restruct"><person-group person-group-type="author"><name><surname>Borgatti</surname>, <given-names>S. P.</given-names></name></person-group> (<year>2005</year>). <article-title>Centrality and network flow.</article-title> <source>Social Networks</source>, <volume>27</volume>(<issue>1</issue>), <fpage>55</fpage>&#8211;<lpage>71</lpage>. <pub-id pub-id-type="doi">10.1016/j.socnet.2004.11.008</pub-id><issn>0378-8733</issn></mixed-citation></ref>
<ref id="b11"><mixed-citation publication-type="conference" specific-use="linked"><person-group person-group-type="author"><name><surname>Burch</surname> <given-names>M</given-names></name>, <name><surname>Beck</surname> <given-names>F</given-names></name>, <name><surname>Raschke</surname> <given-names>M</given-names></name>, <name><surname>Blascheck</surname> <given-names>T</given-names></name>, <name><surname>Weiskopf</surname> <given-names>D.</given-names></name></person-group> <article-title>A dynamic graph visualization perspective on eye movement data.</article-title> In: <source>Proceedings of the Symposium on Eye Tracking Research and Applications</source>; <conf-date>2014 March 26 - 28</conf-date>; Safety Harbor, FL. ACM; <year>2014</year>. p. <fpage>151</fpage>&#8211;<lpage>8</lpage>. <pub-id pub-id-type="doi">10.1145/2578153.2578175</pub-id></mixed-citation></ref>
<ref id="b21"><mixed-citation publication-type="conference" specific-use="linked"><person-group person-group-type="author"><name><surname>Burch</surname> <given-names>M</given-names></name>, <name><surname>Kull</surname> <given-names>A</given-names></name>, <name><surname>Weiskopf</surname> <given-names>D.</given-names></name></person-group> <article-title>AOI Rivers for Visualizing Dynamic Eye Gaze Frequencies.</article-title> In: <source>Proceedings of the EuroVis ’13 Proceedings of the 15th Eurographics Conference on Visualization</source>; <conf-date>2013 June 17-21</conf-date>; <publisher-loc>Leipzig, Germany</publisher-loc>. <publisher-name>Eurographs Association</publisher-name> &#x26; John Wiley &#x26; Sons, Ltd.; Chichester, UK; <year>2013</year>. p. <fpage>281</fpage>-<lpage>90</lpage>. <pub-id pub-id-type="doi">10.1111/cgf.12115</pub-id></mixed-citation></ref>
<ref id="b37"><mixed-citation publication-type="journal" specific-use="restruct"><person-group person-group-type="author"><name><surname>Csardi</surname>, <given-names>G.</given-names></name>, &#x26; <name><surname>Nepusz</surname>, <given-names>T.</given-names></name></person-group> (<year>2006</year>). <article-title>The igraph software package for complex network research. InterJournal</article-title>. <source>Complex Systems</source>, <volume>1695</volume>(<issue>5</issue>), <fpage>1</fpage>&#8211;<lpage>9</lpage>.<issn>0891-2513</issn></mixed-citation></ref>
<ref id="b36"><mixed-citation publication-type="web-page" specific-use="unparsed"><person-group person-group-type="author"><collab>Eyetracking.com</collab></person-group>. <ext-link ext-link-type="uri" xlink:href="http://www.eyetracking.com/Hardware/Eye-Tracker-List">http://www.eyetracking.com/Hardware/Eye-Tracker-List</ext-link> [Internet]. <year>2016</year> [<date-in-citation content-type="access-date">cited 2017 Mar 1</date-in-citation>]. Available from: <ext-link ext-link-type="uri" xlink:href="http://www.eyetracking.com/Software/EyeWorks">http://www.eyetracking.com/Software/EyeWorks</ext-link></mixed-citation></ref>
<ref id="b1"><mixed-citation publication-type="web-page" specific-use="unparsed"><person-group person-group-type="author"><collab>Federal Aviation Administration</collab></person-group>. Forecasts of IFR aircraft handled by FAA air route traffic control centers FY 2017-2040 [Internet]. <year>2018</year>[<date-in-citation content-type="access-date">cited 2018 Mar 1</date-in-citation>]. Available from: <ext-link ext-link-type="uri" xlink:href="https://www.faa.gov/data_research/aviation/aerospace_forecasts/">https://www.faa.gov/data_research/aviation/aerospace_forecasts/</ext-link></mixed-citation></ref>
<ref id="b14"><mixed-citation publication-type="journal" specific-use="restruct"><person-group person-group-type="author"><name><surname>Freeman</surname>, <given-names>L. C.</given-names></name></person-group> (<year>1978</year>). <article-title>Centrality in social networks conceptual clarification.</article-title> <source>Social Networks</source>, <volume>1</volume>(<issue>3</issue>), <fpage>215</fpage>&#8211;<lpage>239</lpage>. <pub-id pub-id-type="doi">10.1016/0378-8733(78)90021-7</pub-id><issn>0378-8733</issn></mixed-citation></ref>
<ref id="b29"><mixed-citation publication-type="journal" specific-use="restruct"><person-group person-group-type="author"><name><surname>Ghani</surname>, <given-names>S.</given-names></name>, <name><surname>Elmqvist</surname>, <given-names>N.</given-names></name>, &#x26; <name><surname>Yi</surname>, <given-names>J. S.</given-names></name></person-group> (<year>2012</year>). <article-title>Perception of Animated Node-Link Diagrams for Dynamic Graphs.</article-title> <source>Computer Graphics Forum</source>, <volume>31</volume>(<supplement>3pt3</supplement>), <fpage>1205</fpage>&#8211;<lpage>1214</lpage>. <pub-id pub-id-type="doi">10.1111/j.1467-8659.2012.03113.x</pub-id><issn>0167-7055</issn></mixed-citation></ref>
<ref id="b16"><mixed-citation publication-type="conference" specific-use="linked"><person-group person-group-type="author"><name><surname>Goldberg</surname> <given-names>JH</given-names></name>, <name><surname>Helfman</surname> <given-names>JI</given-names></name></person-group>. <article-title>Visual scanpath representation.</article-title> In: Proc 2010 Symp Eye-Tracking Res Appl - ETRA ’10; <year>2010</year> <month>March</month> <day>22-24</day>; Austin, TX, USA. ACM 2010; p. 203-10. <pub-id pub-id-type="doi">10.1145/1743666.1743717</pub-id></mixed-citation></ref>
<ref id="b12"><mixed-citation publication-type="journal" specific-use="restruct"><person-group person-group-type="author"><name><surname>Goldberg</surname>, <given-names>J. H.</given-names></name>, &#x26; <name><surname>Kotval</surname>, <given-names>X.</given-names></name></person-group> (<year>1999</year>). <article-title>Computer interface evaluation using eye movements&#8239;: Methods and constructs.</article-title> <source>International Journal of Industrial Ergonomics</source>, <volume>24</volume>(<issue>6</issue>), <fpage>631</fpage>&#8211;<lpage>645</lpage>. <pub-id pub-id-type="doi">10.1016/S0169-8141(98)00068-7</pub-id><issn>0169-8141</issn></mixed-citation></ref>
<ref id="b2"><mixed-citation publication-type="web-page" specific-use="unparsed"><person-group person-group-type="author"><name><surname>Hampton</surname> <given-names>ME</given-names></name></person-group>. Key issues facing FAA’s air traffic controller workforce [Internet]. <year>2016</year>[<date-in-citation content-type="access-date">cited 2018 Mar 1</date-in-citation>].Available from: <ext-link ext-link-type="uri" xlink:href="https://www.oig.dot.gov/library-item/33382">https://www.oig.dot.gov/library-item/33382</ext-link></mixed-citation></ref>
<ref id="b22"><mixed-citation publication-type="book-chapter" specific-use="restruct"><person-group person-group-type="author"><name><surname>Holmqvist</surname>, <given-names>K.</given-names></name>, <name><surname>Holsanova</surname>, <given-names>J.</given-names></name>, <name><surname>Barthelson</surname>, <given-names>M.</given-names></name>, &#x26; <name><surname>Lundqvist</surname>, <given-names>D.</given-names></name></person-group> (<year>2003</year>). <chapter-title>Reading or Scanning? A Study of Newspaper and Net Paper Reading</chapter-title>. In <person-group person-group-type="editor"><name><given-names>J.</given-names> <surname>Hyönä</surname></name>, <name><given-names>R.</given-names> <surname>Radach</surname></name>, &#x26; <name><given-names>H.</given-names> <surname>Deubel</surname></name> (<role>Eds.</role>),</person-group> <source>The Mind’s Eye: Cognitive and Applied Aspects of Eye Movement Research. North Holland: Elsevier B.V</source> (pp. <fpage>658</fpage>–<lpage>670</lpage>). <pub-id pub-id-type="doi">10.1016/B978-044451020-4/50035-9</pub-id></mixed-citation></ref>
<ref id="b3"><mixed-citation publication-type="journal" specific-use="restruct"><person-group person-group-type="author"><name><surname>Just</surname>, <given-names>M. A.</given-names></name>, &#x26; <name><surname>Carpenter</surname>, <given-names>P. A.</given-names></name></person-group> (<year>1976</year>). <article-title>Eye fixations and cognitive processes.</article-title> <source>Cognitive Psychology</source>, <volume>8</volume>(<issue>4</issue>), <fpage>441</fpage>&#8211;<lpage>480</lpage>. <pub-id pub-id-type="doi">10.1016/0010-0285(76)90015-3</pub-id><issn>0010-0285</issn></mixed-citation></ref>
<ref id="b4"><mixed-citation publication-type="journal" specific-use="restruct"><person-group person-group-type="author"><name><surname>Kang</surname>, <given-names>Z.</given-names></name>, &#x26; <name><surname>Landry</surname>, <given-names>S. J.</given-names></name></person-group> (<year>2014</year>). <article-title>Using scanpaths as a learning method for a conflict detection task of multiple target tracking.</article-title> <source>Hum Factors J Hum Factors Ergon Soc.</source>, <volume>56</volume>(<issue>6</issue>), <fpage>1150</fpage>&#8211;<lpage>1162</lpage>. <pub-id pub-id-type="doi">10.1177/0018720814523066</pub-id><pub-id pub-id-type="pmid">25277023</pub-id><issn>0018-7208</issn></mixed-citation></ref>
<ref id="b6"><mixed-citation publication-type="conference" specific-use="linked"><person-group person-group-type="author"><name><surname>Kang</surname> <given-names>Z</given-names></name>, <name><surname>Bass</surname> <given-names>EJ</given-names></name></person-group>. <article-title>Supporting the eye tracking analysis of multiple moving targets&#8239;: Design concept and algorithm.</article-title> In: <source>Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics (SMC &#8217;14)</source>; <conf-date>2014 Oct 5-8</conf-date>; <publisher-loc>San Diego, CA</publisher-loc>. <publisher-name>IEEE</publisher-name>; 2014. p. <fpage>3184</fpage>&#8211;<lpage>9</lpage>. <pub-id pub-id-type="doi">10.1109/SMC.2014.6974418</pub-id></mixed-citation></ref>
<ref id="b7"><mixed-citation publication-type="journal" specific-use="restruct"><person-group person-group-type="author"><name><surname>Kang</surname>, <given-names>Z.</given-names></name>, <name><surname>Mandal</surname>, <given-names>S.</given-names></name>, <name><surname>Crutchfield</surname>, <given-names>J.</given-names></name>, <name><surname>Millan</surname>, <given-names>A.</given-names></name>, &#x26; <name><surname>McClung</surname>, <given-names>S. N.</given-names></name></person-group> (<year>2016</year>). <article-title>Designs and Algorithms to Map Eye Tracking Data with Dynamic Multielement Moving Objects.</article-title> <source>Computational Intelligence and Neuroscience</source>, <volume>2016</volume>(<issue>1</issue>), <fpage>1</fpage>–<lpage>18</lpage>. <pub-id pub-id-type="doi">10.1155/2016/9354760</pub-id><pub-id pub-id-type="pmid">27725830</pub-id><issn>1687-5265</issn></mixed-citation></ref>
<ref id="b20"><mixed-citation publication-type="journal" specific-use="restruct"><person-group person-group-type="author"><name><surname>Kurzhals</surname>, <given-names>K.</given-names></name>, <name><surname>Fisher</surname>, <given-names>B.</given-names></name>, <name><surname>Burch</surname>, <given-names>M.</given-names></name>, &#x26; <name><surname>Weiskopf</surname>, <given-names>D.</given-names></name></person-group> (<year>2015</year>). <article-title>Eye tracking evaluation of visual analytics.</article-title> <source>Information Visualization</source>, <volume>15</volume>(<issue>4</issue>), <fpage>340</fpage>–<lpage>358</lpage>. <pub-id pub-id-type="doi">10.1177/1473871615609787</pub-id><issn>1473-8716</issn></mixed-citation></ref>
<ref id="b17"><mixed-citation publication-type="journal" specific-use="restruct"><person-group person-group-type="author"><name><surname>Kurzhals</surname>, <given-names>K.</given-names></name>, &#x26; <name><surname>Weiskopf</surname>, <given-names>D.</given-names></name></person-group> (<year>2013</year>). <article-title>Space-time visual analytics of eye-tracking data for dynamic stimuli.</article-title> <source>IEEE Transactions on Visualization and Computer Graphics</source>, <volume>19</volume>(<issue>12</issue>), <fpage>2129</fpage>–<lpage>2138</lpage>. <pub-id pub-id-type="doi">10.1109/TVCG.2013.194</pub-id><pub-id pub-id-type="pmid">24051779</pub-id><issn>1077-2626</issn></mixed-citation></ref>
<ref id="b15"><mixed-citation publication-type="conference" specific-use="unparsed"><person-group person-group-type="author"><name><surname>Kurzhals</surname> <given-names>K</given-names></name>, <name><surname>Heimerl</surname> <given-names>F</given-names></name>, <name><surname>Weiskopf</surname> <given-names>D.</given-names></name></person-group> ISeeCube&#8239;: Visual Analysis of Gaze Data for Video. In: Proceedings of the symposium on Eye tracking research &#x26; applications - ETRA&#8217;14; 2014 March 26 - 28; Safety Harbor, FL. ACM; <year>2014</year>. p. 43&#8211;50.</mixed-citation></ref>
<ref id="b18"><mixed-citation publication-type="conference" specific-use="linked"><person-group person-group-type="author"><name><surname>Mandal</surname> <given-names>S</given-names></name>, <name><surname>Kang</surname> <given-names>Z</given-names></name>, <name><surname>Millan</surname> <given-names>A.</given-names></name></person-group> <article-title>Data Visualization of Complex Eye Movements Using Directed Weighted Networks : A Case Study on a Multi-Element Target Tracking Task.</article-title> In: <source>Proceedings of the Human Factors and Ergonomics Society 60th Annual Meeting</source>; <conf-date>2016 September 19-23</conf-date> <publisher-loc>Washington, DC</publisher-loc>. <publisher-name>Human Factors and Ergonomics Society</publisher-name>; <year>2016</year>. p. <fpage>106</fpage>–<lpage>10</lpage>. <pub-id pub-id-type="doi">10.1177/1541931213601024</pub-id></mixed-citation></ref>
<ref id="b38"><mixed-citation publication-type="journal" specific-use="restruct"><person-group person-group-type="author"><name><surname>McClung</surname>, <given-names>S. N.</given-names></name>, &#x26; <name><surname>Kang</surname>, <given-names>Z.</given-names></name></person-group> (<year>2016</year>). <article-title>Characterization of Visual Scanning Patterns in Air Traffic Control.</article-title> <source>Computational Intelligence and Neuroscience</source>, <volume>2016</volume>(<issue>1</issue>), <fpage>1</fpage>&#8211;<lpage>17</lpage>. <pub-id pub-id-type="doi">10.1155/2016/8343842</pub-id><issn>1687-5265</issn></mixed-citation></ref>
<ref id="b25"><mixed-citation publication-type="journal" specific-use="restruct"><person-group person-group-type="author"><name><surname>Newman</surname>, <given-names>M. E. J.</given-names></name></person-group> (<year>2004</year>). <article-title>Analysis of weighted networks.</article-title>. <source>Phys Rev E - Stat Nonlinear Soft Matter Phys.</source>, <volume>70</volume>(<issue>5</issue>), <fpage>1</fpage>–<lpage>9</lpage>.</mixed-citation></ref>
<ref id="b26"><mixed-citation publication-type="book" specific-use="restruct"><person-group person-group-type="author"><name><surname>Newman</surname>, <given-names>M. E. J.</given-names></name></person-group> (<year>2010</year>). <source>Networks: An introduction</source>. <publisher-loc>New York, NY</publisher-loc>: <publisher-name>Oxford University Press Inc.</publisher-name> <pub-id pub-id-type="doi">10.1093/acprof:oso/9780199206650.001.0001</pub-id></mixed-citation></ref>
<ref id="b35"><mixed-citation publication-type="journal" specific-use="restruct"><person-group person-group-type="author"><name><surname>Noton</surname>, <given-names>D.</given-names></name>, &#x26; <name><surname>Stark</surname>, <given-names>L.</given-names></name></person-group> (<year>1971</year>). <article-title>Scanpaths in eye movements during pattern perception.</article-title> <source>Science</source>, <volume>171</volume>(<issue>3968</issue>), <fpage>308</fpage>&#8211;<lpage>311</lpage>. <pub-id pub-id-type="doi">10.1126/science.171.3968.308</pub-id><pub-id pub-id-type="pmid">5538847</pub-id><issn>0036-8075</issn></mixed-citation></ref>
<ref id="b33"><mixed-citation publication-type="journal" specific-use="restruct"><person-group person-group-type="author"><name><surname>Opsahl</surname>, <given-names>T.</given-names></name>, <name><surname>Agneessens</surname>, <given-names>F.</given-names></name>, &#x26; <name><surname>Skvoretz</surname>, <given-names>J.</given-names></name></person-group> (<year>2010</year>). <article-title>Node centrality in weighted networks: Generalizing degree and shortest paths.</article-title> <source>Social Networks</source>, <volume>32</volume>(<issue>3</issue>), <fpage>245</fpage>&#8211;<lpage>251</lpage>. <pub-id pub-id-type="doi">10.1016/j.socnet.2010.03.006</pub-id><issn>0378-8733</issn></mixed-citation></ref>
<ref id="b8"><mixed-citation publication-type="journal" specific-use="restruct"><person-group person-group-type="author"><name><surname>Papenmeier</surname>, <given-names>F.</given-names></name>, &#x26; <name><surname>Huff</surname>, <given-names>M.</given-names></name></person-group> (<year>2010</year>). <article-title>DynAOI: A tool for matching eye-movement data with dynamic areas of interest in animations and movies.</article-title> <source>Behavior Research Methods</source>, <volume>42</volume>(<issue>1</issue>), <fpage>179</fpage>&#8211;<lpage>187</lpage>. <pub-id pub-id-type="doi">10.3758/BRM.42.1.179</pub-id><pub-id pub-id-type="pmid">20160298</pub-id><issn>1554-351X</issn></mixed-citation></ref>
<ref id="b30"><mixed-citation publication-type="conference" specific-use="unparsed"><person-group person-group-type="author"><name><surname>Purchase</surname> <given-names>HC</given-names></name>, <name><surname>Hoggan</surname> <given-names>E</given-names></name>, <name><surname>G&#246;rg</surname> <given-names>C</given-names></name></person-group>. How Important Is the &#8220;Mental Map&#8221;? &#8211; An Empirical Investigation of a Dynamic Graph Layout Algorithm. In: Kaufmann M, Wagner D, editors. International Symposium on Graph Drawing GD 2006: Graph Drawing. Berlin: Springer, Berlin, Heidelberg; <year>2006</year>. p. 184&#8211;95.</mixed-citation></ref>
<ref id="b19"><mixed-citation publication-type="conference" specific-use="linked"><person-group person-group-type="author"><name><surname>Raschke</surname> <given-names>M</given-names></name>, <name><surname>Chen</surname> <given-names>X</given-names></name>, <name><surname>Ertl</surname> <given-names>T.</given-names></name></person-group> <article-title>Parallel scan-path visualization.</article-title> In: Proceedings of the Symposium on Eye Tracking Research and Applications - ETRA ’12; 2012 March 28-30; Santa Barbara, CA. ACM; <year>2012</year>. p. 165–8. <pub-id pub-id-type="doi">10.1145/2168556.2168583</pub-id></mixed-citation></ref>
<ref id="b5"><mixed-citation publication-type="conference" specific-use="linked"><person-group person-group-type="author"><name><surname>Rudi</surname> <given-names>D</given-names></name>, <name><surname>Kiefer</surname> <given-names>P</given-names></name>, <name><surname>Raubal</surname> <given-names>M.</given-names></name></person-group> <article-title>Visualizing Pilot Eye Movements for Flight Instructors.</article-title> In: Proceedings of the 3rd Workshop on Eye Tracking and Visualization - ETVIZ&#8217;18; 2018 June 15; Warsaw, Poland. New York: ACM; <year>2018</year>. <pub-id pub-id-type="doi">10.1145/3205929.3205934</pub-id></mixed-citation></ref>
<ref id="b31"><mixed-citation publication-type="conference" specific-use="unparsed"><person-group person-group-type="author"><name><surname>Saraiya</surname> <given-names>P</given-names></name>, <name><surname>Lee</surname> <given-names>P</given-names></name>, <name><surname>North</surname> <given-names>C</given-names></name></person-group>. <article-title>Visualization of graphs with associated timeseries data.</article-title> In: Proceedings of the 2005 IEEE Symposium on Information Visualization, INFO VIS; 2005 October 23-28; Minneapolis, MN. IEEE; <year>2005</year>. p. 225&#8211;32.</mixed-citation></ref>
<ref id="b23"><mixed-citation publication-type="conference" specific-use="unparsed"><person-group person-group-type="author"><name><surname>Tory</surname> <given-names>M</given-names></name>, <name><surname>Atkins</surname> <given-names>MS</given-names></name>, <name><surname>Kirkpatrick</surname> <given-names>AE</given-names></name>, <name><surname>Nicolaou</surname> <given-names>M</given-names></name>, <name><surname>Yang</surname> <given-names>GZ</given-names></name></person-group>. Eyegaze analysis of displays with combined 2D and 3D views. In: Proceedings of the 2005 IEEE Symposium on Information Visualization, INFO VIS; 2005 October 23-28; Minneapolis, MN. IEEE; <year>2005</year>. p. 519–26.</mixed-citation></ref>
<ref id="b32"><mixed-citation publication-type="journal" specific-use="restruct"><person-group person-group-type="author"><name><surname>von Landesberger</surname>, <given-names>T.</given-names></name>, <name><surname>Kuijper</surname>, <given-names>A.</given-names></name>, <name><surname>Schreck</surname>, <given-names>T.</given-names></name>, <name><surname>Kohlhammer</surname>, <given-names>J.</given-names></name>, <name><surname>van Wijk</surname>, <given-names>J. J.</given-names></name>, <name><surname>Fekete</surname>, <given-names>J. D.</given-names></name>, &#x26; <name><surname>Fellner</surname>, <given-names>D. W.</given-names></name></person-group> (<year>2011</year>). <article-title>Visual analysis of large graphs: State-of-the-art and future research challenges.</article-title> <source>Eurographics Symp Geom Process.</source>, <volume>30</volume>(<issue>6</issue>), <fpage>1719</fpage>–<lpage>1749</lpage>. <pub-id pub-id-type="doi">10.1111/j.1467-8659.2011.01898.x</pub-id></mixed-citation></ref>
<ref id="b13"><mixed-citation publication-type="conference" specific-use="parsed"><person-group person-group-type="author"><name><surname>Zhang</surname> <given-names>J</given-names></name>, <name><surname>Ren</surname> <given-names>J</given-names></name>, <name><surname>Wu</surname> <given-names>C</given-names></name></person-group>. <article-title>Modeling air traffic controllers&#8217; decision making processes with relational complexity network.</article-title> In: <source>17th International IEEE Conference on Intelligent Transportation Systems (ITSC)</source>; <conf-date>2014 Oct 8-11</conf-date>; <publisher-loc>Qingdao, China</publisher-loc>. <publisher-name>IEEE</publisher-name>; 2014. p. <fpage>2663</fpage>&#8211;<lpage>8</lpage>.</mixed-citation></ref>
</ref-list>
</back>
</article>
