<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main">Risk Modeling During Complex Dynamic System Evolution Using Abstract Event Network Model</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author>
							<persName><forename type="first">Volodymyr</forename><surname>Sherstjuk</surname></persName>
							<affiliation key="aff0">
								<orgName type="institution">Kherson National Technical University</orgName>
								<address>
									<addrLine>Beryslavske shose 24</addrLine>
									<postCode>73008</postCode>
									<settlement>Kherson</settlement>
									<country key="UA">Ukraine</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Maryna</forename><surname>Zharikova</surname></persName>
							<affiliation key="aff1">
								<orgName type="institution">Universität der Bundeswehr</orgName>
								<address>
									<addrLine>Werner-Heisenberg-Weg 393GEB</addrLine>
									<postCode>85579</postCode>
									<settlement>München, Neubiberg</settlement>
									<country key="DE">Germany</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Ibraim</forename><surname>Didmanidze</surname></persName>
							<affiliation key="aff2">
								<orgName type="institution">Batumi Shota Rustaveli State University</orgName>
								<address>
									<addrLine>Ninoshvili/Rustaveli str. 35/32</addrLine>
									<postCode>6010</postCode>
									<settlement>Batumi</settlement>
									<country key="GE">Georgia</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Irina</forename><surname>Dorovskaja</surname></persName>
							<affiliation key="aff0">
								<orgName type="institution">Kherson National Technical University</orgName>
								<address>
									<addrLine>Beryslavske shose 24</addrLine>
									<postCode>73008</postCode>
									<settlement>Kherson</settlement>
									<country key="UA">Ukraine</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Svitlana</forename><surname>Vyshemyrska</surname></persName>
							<affiliation key="aff0">
								<orgName type="institution">Kherson National Technical University</orgName>
								<address>
									<addrLine>Beryslavske shose 24</addrLine>
									<postCode>73008</postCode>
									<settlement>Kherson</settlement>
									<country key="UA">Ukraine</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">Risk Modeling During Complex Dynamic System Evolution Using Abstract Event Network Model</title>
					</analytic>
					<monogr>
						<imprint>
							<date/>
						</imprint>
					</monogr>
					<idno type="MD5">FE263B273D56DA8CDBFE847ADEAF1629</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2023-03-19T16:26+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<textClass>
				<keywords>
					<term>knowledge representation model</term>
					<term>dynamic system evolution</term>
					<term>energy-driven abstract event network</term>
					<term>uncertainty model</term>
					<term>temporal and spatial referencing</term>
				</keywords>
			</textClass>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>The paper is devoted to the issues of knowledge representation about a plurality of processes of various intensities that arise unexpectedly and evolve simultaneously in complex dynamical systems in a wide range of domains. A knowledge representation model based on events that are referenced to certain time intervals and spatial areas is proposed. Since some information about events is inaccurate or blurred, the uncertainty of the observed information about the evolving processes is represented using gray numbers and soft sets. Events are connected in an abstract network, where arcs express possible transitions from one event to another. Within the network, transitions between events are driven by impulses and correspond to transitions of a dynamic system from state to state. The energy accumulated in the nodes is considered to generate impulses, which express the achievement of a certain threshold by the energy. The proposed abstract event network can be used to model the evolution of dynamic systems that can be expressed by events that occurred inside the system but driven by impacts from the outside (environmental effects). Such evolution is considered in a wide range of rates, from the slowest processes associated with climate change to the most rapid processes associated with the effects of natural forces of a destructive nature. Connections between nodes allow representing sequential and parallel streams of events concerning cascade and triggering effects, which makes it possible to study complex interactions between separate processes within a complex system of a random structure.</p></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.">Introduction</head><p>There are many domains of technical, socio-technical, or socio-economical nature that evolve in space and time within the natural environment. Usually, they can be represented by complex CITRisk'2021: 2nd International Workshop on Computational &amp; Information Technologies for Risk-Informed Systems, September 16-17, 2021, Kherson, Ukraine EMAIL: vgsherstyuk@gmail.com (V.Sherstjuk); maryna.zharikova@unibw.de (M.Zharikova); ibraim.didmanidze@bsu.edu.ge (I.Didmanidze); irina.dora07@gmail.com (I.Dorovskaja); vyshemyrska.svitlana@kntu.net.ua (S.Vyshemyrska) ORCID: 0000-0002-9096-2582 (V.Sherstjuk); 0000-0001-6144-480X (M.Zharikova); 0000-0001-6695-4980 (I.Didmanidze); 0000-0001-9280-8098 (I.Dorovskaja); 0000-0002-6343-7512 (S.Vyshemyrska) dynamic systems containing multitudes of interacting dynamic objects. Due to such interactions, a plurality of processes of various intensity arises unexpectedly and evolve simultaneously within dynamic systems <ref type="bibr" target="#b0">[1]</ref>. Typically, these processes are transient, non-linear, and nonstationary. The dynamic objects have specific states at specific times, which are represented by certain points within the state space of the dynamic system, so their behavior is usually represented by their trajectories within this space. Clearly, if their trajectories touch or intersect each other (and even in the case of some proximity of the trajectories within the state space), most often these objects are exposed to a variety of dangers, threats, and risks. Some processes such as climatic changes proceed very slowly, others, on the contrary, very quickly, so they can be dangerous and cause deaths, injuries, and huge damage <ref type="bibr" target="#b1">[2]</ref>. Since the processes, which evolve and interact within complex dynamic systems, are principally stochastic, the dynamic system has a random structure and is difficult to control. The evolution of the dynamic systems is mainly driven by the impacts of humans and nature <ref type="bibr" target="#b2">[3]</ref>. The manifestation of such evolution can be ex-pressed by events that occurred inside the dynamic system but associated with im-pacts from the outside (environmental effects). Due to the wide dispersion of a plural-ity of the evolving processes over space and time, events should be properly referenced within space and time.</p><p>At the same time, people must be concerned about the prevention or elimination of dangerous events to minimize losses, so there is a need to ensure the safety of the dynamic system <ref type="bibr" target="#b3">[4]</ref>. To make the dynamic system safe, people need first to observe the system itself and the environment. Although there are a lot of technical means of observation (i. e. sensor networks, unmanned vehicles, etc.), all of them are based on sensors, which usually provide ambiguous, imprecise, incomplete, inconsistent, and doubtful information. Such a wide range of uncertainties distorts observations and introduces unpredictability of the states of the dynamic objects and the dynamic system as a whole. Naturally, this requires the development of special safety-enabled methods to overcome uncertainty both in the spatial and temporal aspects <ref type="bibr" target="#b4">[5]</ref>.</p><p>Second, since a human cannot directly control the flow of processes within the complex dynamic system, he must be able to make decisions, the implementation of which allows him to change the flow of processes indirectly. Thus, people need to use decision support systems <ref type="bibr" target="#b5">[6]</ref>. However, due to the above-mentioned reasons, decision support is a complex and non-trivial task.</p><p>The spatial aspects of the dynamic system can be typically expressed by a geo-graphic information system (GIS), which contains a spatial model and outlines an area of interest (AOI) critical for decision making. Thus, the events distributed over the AOI can be properly referred to spatially, but their references are usually limited by measurement inaccuracy.</p><p>The temporal aspects are more complicated due to their stochastic nature and simultaneous impacts. Moreover, it is very difficult to refer to events temporally be-cause of the different rates of their occurrence. Unlike spatial references, which usual-ly are vague or blur due to the sensors' imprecision, temporal references are inaccurate and can be primarily represented by time intervals.</p><p>Since decision-makers usually operate under the conditions of high responsibility and a lack of time, the decision support system must work in real-time. Thus, considering the above reasons, the most topical and important issue for today is the development of GIS-based realtime decision-support systems (DSS) aimed at danger and risk assessment for the considered class of complex dynamic systems.</p><p>Unfortunately, today there is a lack of knowledge representation models and methods that would be operable in real-time and take into account a wide range of measurement uncertainties in data captured by sensors during the observation of the dynamic system. Thus, the research of knowledge representation methods based on events and adequate uncertainty models that allow describing dynamic systems by spatially and temporally referred trajectories is a topic of our interest. The problem addressed in this paper relates to the representation of knowledge about dynamic system evolution using abstract event networks from the point of view of developing real-time DSS.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.">Recent Works</head><p>Representation of uncertain knowledge about events that occur simultaneously and jointly has been studied in many fields of knowledge. A wide range of models of knowledge representation about events has been proposed in the field of natural language processing <ref type="bibr" target="#b6">[7]</ref>. Mainly, such models are focused on event-to-event relations and processing of events to discover their causal relationships and detect anomalies within language structures <ref type="bibr" target="#b7">[8]</ref>.</p><p>In existing risk assessment decision support systems, the most frequently observed information is represented by event streams, which describe sequences of time-referred events <ref type="bibr" target="#b8">[9]</ref>. Mainly, the event stream model is a subject of study in event sequence analysis, which focuses on the time gaps between events and their order in the sequence <ref type="bibr" target="#b9">[10]</ref>. Another trend is the use of knowledge structures based on events as certain building blocks to build and update situation models <ref type="bibr" target="#b10">[11]</ref>. Thus, a most used definition of an event has been proposed in the literature as "a segment of time at a given location that is conceived by an observer to have a beginning and an end" <ref type="bibr" target="#b11">[12]</ref>.</p><p>The above-mentioned approaches are mainly semantic based, so they use strict definitions of events, time, and space and take little into account the uncertainty of the information, based on which the events must be determined <ref type="bibr" target="#b12">[13]</ref>.</p><p>Many non-semantic methods have been proposed including Causal events, Force Dynamics, Stochastic Context-Free Grammars <ref type="bibr" target="#b13">[14]</ref> that represent complex event structures based on hierarchical definitions, which are hard for decision-maker interpretation and do not meet the requirements for real-time DSSs.</p><p>In general, considering the nature of the events, we emphasize two main approaches to represent events -probabilistic and non-probabilistic. The first one includes such methods as Hidden Markov Models, dynamic Bayesian networks, Monte Carlo sampling, Variance propagation, etc. <ref type="bibr" target="#b14">[15]</ref>. The second one includes methods mainly based on fuzzy sets and possibility theory <ref type="bibr" target="#b15">[16]</ref>. Obviously, a lack of sufficient statistical data for probabilistic approach as well as a lack of well-known possibility degrees or membership functions for nonprobabilistic approach complicates their efficient use and leads to high computational complexity. Detailed overviews of such approaches concerning a considered class of DSSs have been presented in <ref type="bibr" target="#b16">[17]</ref>.</p><p>The event tree approach enables the modeling of a sequence of events, which constitute the structures of any level of complexity adapted to various uncertainty models (probabilistic, fuzzy, rough, etc.) <ref type="bibr" target="#b17">[18]</ref>. Despite the flexibility of this approach and its potential for evolution, the existing event tree models refer events to time only, so there is a lack of spatial localization of events. A method for representing hierarchical structures of events referred both to time and space and equipped with a complex uncertainty model has been proposed in <ref type="bibr" target="#b18">[19]</ref>. However, the computational complexity of the proposed method is significant, which complicates its use in real-time DSSs. Thus, we conclude that existing event-based knowledge representation models can be weakly applied to DSSs of the considered class. We need not only to refer events to a certain time and spatial locations but also use a relatively simple but effective model for the representation of uncertainty that could satisfy both the requirements for the representation of incomplete and inaccurate information obtained from the observation of a dynamic system and requirements to efficiency that makes a model suitable for real-time GIS-based DSS.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.">Uncertainty Models</head><p>Last years, researchers have directed sufficient efforts towards improving the above-mentioned issues. The classical approach <ref type="bibr" target="#b19">[20]</ref> is that a behavior of a dynamic system can be represented by high-dimensional nonlinear equations, which describe complex processes arising within the considered space and time. However, such continuous modeling of dynamic systems contradicts a lack of data of required quality and accuracy caused by uncertainty and imprecision of sensor data as well as its discontinuous measurements. Furthermore, systems of high-dimensional equations cannot be solved in a reasonable time due to a significant computational complexity <ref type="bibr" target="#b20">[21]</ref>. The statistical approaches <ref type="bibr" target="#b21">[22]</ref> also cannot provide justified assessments primarily be-cause of a lack of reliable statistics and weak observability of a dynamic system.</p><p>Since the use of the continuous space, time, and correspondent models of the dynamic system leads to a huge computational complexity, it is advisable to discretize time and space (e.g. AOI) <ref type="bibr" target="#b22">[23]</ref> for better compatibility with discrete measurements provided by sensors and to speed up the calculations. At the same time, the use of a discrete model reduces the accuracy and credibility of assessments <ref type="bibr" target="#b23">[24]</ref>. Therefore, based on the domain features, it is necessary to choose such a sampling discrete that provide both the sufficient performance of assessments and the required accuracy of its results.</p><p>The main question is how to manage uncertainties. The most commonly used approach to take into account uncertainties is probabilistic, which represents different aspects of uncertainty in terms of chances <ref type="bibr" target="#b24">[25]</ref>. However, typically there are few repeated occurrences of events under the same conditions, especially considering their spatial and temporal references. Thus, the probabilistic approach deals only with stochastically stable data and represents uncertainty inadequately <ref type="bibr" target="#b25">[26]</ref>.</p><p>In this regard, various non-probabilistic methods of uncertainty modeling have been developed such as fuzzy, rough, vague, soft, grey sets, etc.</p><p>Obviously, real data cannot be represented as crisp and well-determined. Instead, sensors provide data that can be not clearly known, undetermined, problematic, varying, vague, can have many interpretations but not certain information, and, of course, can be no reliable <ref type="bibr" target="#b26">[27]</ref>. Discretization of space and time will also lead to various sampling errors, delays in time, outdated data, etc. <ref type="bibr" target="#b27">[28]</ref>.</p><p>Thus, there are a lot of types of uncertainties that should be modeled and processed within event-based knowledge representation about complex dynamic systems. Let us consider the available tools for modeling uncertainty.</p><p>Zadeh introduced the concept of the fuzzy set <ref type="bibr" target="#b28">[29]</ref> that has been used in a wide range of various fields and proposes a convenient tool to represent vague data. Its drawbacks are that fuzzy sets are computationally hard, and their membership functions are subjective and can be difficult to found <ref type="bibr" target="#b29">[30]</ref>.</p><p>The long-term study of many researchers has led to the emergence of dozens of fuzzy extensions and additions both in theoretical and practical areas <ref type="bibr" target="#b30">[31]</ref>, however, they do not allow to overcome the above disadvantages, and further increase the computational complexity, which hinders their use.</p><p>Pawlak introduced the concept of rough sets <ref type="bibr" target="#b31">[32]</ref> as a mathematical tool to deal with imprecise or noisy data based on equivalence (e.g., indiscernibility) relation, that fits well to discrete-valued and nominal data. Rough sets are easy to understand, suitable for inconsistent data, and do not need any additional information about data. Their drawbacks are a problem with dirty or noisy data, depending on complete information, and a lack of membership values. In general, in many fields of application, the rough set algorithms are much more efficient than fuzzy.</p><p>Clearly, fuzzy sets and rough sets provide models for two different types of uncertainties. Fuzzy sets can be represented by their membership values, but rough sets can be approximated through partitions. Fuzzy sets highlight the vagueness of information while rough sets focus on incomplete information. Therefore, fuzzy sets mainly represent subjective uncertainties while rough sets represent objective uncertainties.</p><p>Grey sets and grey numbers have been proposed by Deng Julong <ref type="bibr" target="#b32">[33]</ref>. A grey number is a number, whose exact value is not known but its interval is known. In general, the grey number introduces a certain set of values and represents only one number, which is not clearly identified among the elements of the set. It can be reduced to a white number or black number, the first one is an exact or crisp value while the second is a number, whose exact value or value's interval is not known. Thus, grey numbers can be an adequate model in the case when the exact value is not completely known.</p><p>Molodtsov introduced the concept of the soft sets <ref type="bibr" target="#b33">[34]</ref> as a relatively new approach to model both uncertainties and vagueness, which is free from the difficulties of existing methods. Soft set membership can be determined through a certain parametrization given by real numbers, functions, mappings, and others, even words or sentences. Thus, a membership function problem cannot arise in the soft sets. They are a convenient and easy tool for model both objective and subjective uncertainty, their main advantage is that they are free from the inadequacy of parameterization tool. The drawback is that the soft set does not assign any membership values. Soft sets are rarely used independently, but often become the basis for complex models for representing uncertainty.</p><p>Obviously, in the real world, objective uncertainty and subjective uncertainty may exist at the same time. Accordingly, researchers try to build complex models that consider different types of uncertainty at once either by extending existing models or by combining them. Often, the uncertainty models presented above are related and complementary to each other. Moreover, they can also be reduced to one another <ref type="bibr" target="#b34">[35]</ref>. This makes it possible to combine them, obtaining complex models of uncertainty.</p><p>The most effective uncertainty models are soft and gray. In this work, we propose to use gray numbers to represent the values of the observed parameters of the dynamic system as well as soft sets to represent events concerning their classes, temporal and spatial locations that make them applicable to the analysis of dynamic processes.</p><p>Let us consider a model of a dynamic process at two levels: at the micro level considering individual spatial elements, and at the macro-level considering spatial areas of a larger or smaller scale.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.">Micro-Model of Dynamic Processes</head></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.1.">Cells and their states</head><p>Consider an AOI as a two-dimensional Euclidean space discretized uniformly by a metrical grid D . Using the spatial discrete δ , the grid D outlines the two-dimensional array is an object of consideration that represents a minimal homogeneous area within the AOI.</p><p>Let us imagine that a certain non-empty set of parameters</p><formula xml:id="formula_0">{ } 1 m i i A a = =</formula><p>can be obtained as a result of the observation and associated with the cell</p><formula xml:id="formula_1">xy d D ∈ . Let i a V be a domain of each i a A ∈ , i i a A a V V ∈ = ∪</formula><p>, and f be a value function : ⊆ . There can also be such parameters whose values change over time, but slow enough (e.g., environmental parameters), they constitute a subset E A of slowly changing parameters. Obviously,</p><formula xml:id="formula_2">f A D V × → that</formula><formula xml:id="formula_3">S D E A A A A = ∪ ∪ . Each cell xy d D ∈</formula><p>can be associated with a certain subset ( )</p><formula xml:id="formula_4">, xy A d t A</formula><p>⊆ of parameters' values at a certain time t ; some of them can be imprecise while others can be unobservable at the time t . It should also be noted that some of the parameters cannot be directly measured or estimated, so they require to use of indirect methods.</p><p>Let us consider a state ( ) ϑ × → . Thus, we can correlate a cell with a particular status based on information about the values of a certain subset of its static parameters. For example, a cell can have a status of "water", "soil", "sand", or "rocky" based on the value of the observed parameter "ground". Obviously, the meaning of the cell's status can vary but it should be based on a selected set of static parameters. Similarly, the state of the cell can be defined with respect to the different points of view. Let w is an initial micro-state and kf w is a final micro-state. Concerning the dynamic process, we assume that the dynamic process covers the cell when the last being in the micro-state 1 k w and ends within the cell when the cell enters the state kf w . Obviously, each micro-state kl w can be defined as a certain subset of the cell's state at the time t determined by a specific subset of parameters</p><formula xml:id="formula_5">,</formula><formula xml:id="formula_6">{ } 1 u kl klm m A a A = = ⊆ .</formula><p>Fig. <ref type="figure" target="#fig_4">1</ref> shows the example of two classes of states, namely "moisture" and "burning", defined by sequences of micro-states 1 w and 2 w . Some microstates can be observed simultaneously, for example, the cell can be defined by micro-states "dry" and "pre-ignited" at the same time. However, micro-states "wet" and "pre-ignited" cannot coexist. Another peculiarity of the proposed micro-model is that micro-states of a certain class are not always compatible with every possible cell status. For example, the cell statuses "water" or "rocky" is not compatible with the state class "moistening" for obvious reason. Clearly, we need to define a state class function : D A W ω × → that returns a micro-state of the cell based on the values of its parameters that belong to kl A . We assume that each transition of the cell xy d from one micro-state kl w to another micro-state km w is a micro-event : kl km w w →  (Fig. <ref type="figure" target="#fig_5">2</ref>). </p><p>:</p><formula xml:id="formula_8">kl k l w w + →  kl w ( 1) k l w + 2<label>( 1)</label></formula><p>: Thus, the dynamic process can be modeled by sequences of dynamic changes of micro-states of cells covered by the process spatially. During the process, cells pass through a sequence of micro-states. Obviously, some transitions from one micro-state to another in the context of a certain state class can entail transitions within other state classes. Moreover, the transitions of micro-states of one cell can spread to neighboring cells, which makes it possible to simulate the propagation of the dynamic processes within AOI.</p><formula xml:id="formula_9">k l kl w w + → </formula></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.2.">Propagation of the Dynamic Processes</head><p>We assume that all changes in the micro-states of cells, as well as all conditions for the propagation of a dynamic process between cells, are associated with the transfer of certain contingent energy.</p><p>Suppose that each class of states has its class of energy. Energy can be generated because of changes in the values of the cell parameters and accumulated in the specific energy storage inside the cell.</p><p>There are a set I of energy transfer channels to transfer energy between cells as shown in These channels can be unidirectional or bidirectional.</p><p>Since the propagation of the process is usually influenced by a significant number of factors of a stochastic nature located outside the system under consideration, it is necessary to have a specific tool for modeling such effects. Many dynamic systems are influenced by such external processes associated with the environment. For example, the speed and direction of propagation of a forest fire are most influenced by the speed and direction of the wind. Clearly, the wind is a separate dynamic process observable by dynamic parameters, which should be taken into account in the model. . Direct determination of the values of the coefficient matrix Ω is beyond the scope of this paper, but its source is obviously the observations.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.3.">Micro-Events</head><p>In this work, each micro-event is referenced in space and time. The impulse paradigm is used to model micro-events, which are considered as the direct effects of the change of values of specific observable parameters.</p><p>A unique descriptor j y can be defined as a tuple:</p><p>, , ,</p><formula xml:id="formula_10">j j j j j y a λ δ = ∆ ,<label>(1)</label></formula><p>where j a is a certain parameter, j kl a A ∈ , j ∆ is an absolute change of the value j a , j λ is a susceptibility for the attribute j a , and j δ is a threshold value. Due to the inaccuracy of observations, the estimated values of parameters are mainly inaccurate. This requires adequate representation. To ensure correct representation, we can define intervals that contain the confidence degrees from the minimum to the maximum possible value. Since such intervals can be narrowed during further observations, we propose to represent the value of the observed parameter as a gray number. Moreover, it is also necessary to represent the threshold value as a gray number to achieve a trigger effect, which is often observed in real natural systems.</p><p>Thus, the value j ∆ can be described as the interval ,</p><formula xml:id="formula_11">j j j ± − +   ∆ = ∆ ∆ </formula><p> that represents a grey number and j δ can be "grayed" in the same way. The descriptor j y also turns gray and is denoted by j y</p><p> . An integral descriptor y can be defined as a tuple:</p><formula xml:id="formula_12">{ } 1 m j j j y y β = = ⋅  ,<label>(2)</label></formula><p>where j β is a certain coefficient for each corresponding descriptor j y  . It represents the direct effect of the simultaneous change of several parameters' values within the exposed cell.</p><p>Consider a micro-event as a consequence of the transition of a cell's micro-state of a certain class, which can be generated as an energy impulse ε based on y .</p><p>The impulse generation scheme is shown in Fig. <ref type="figure">4</ref>.</p><formula xml:id="formula_13">, γ − − , I − − , I + + Channels … , γ + + 1 y  m y  Descriptors … 1 λ m λ ( ) ( ) , ,<label>,</label></formula><formula xml:id="formula_14">j j I γ ι λ * * * * * * ±   ⊕ ⋅   = ⊕   ⊕ ⋅ ∆   m δ − m δ + 1 δ − 1 δ + Impulse generator k ε  Correlator ι</formula></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Figure 4: The impulse generation schemes</head><p>It considers the fact that the change in the values of the parameters is influenced by the impulses received through the channels from the neighboring cells. The correlator (Fig. <ref type="figure">4</ref>) accumulates inputs and ensures that the control stimulus is found, and the impulse generator produces an energy impulse of an amount k ε that depends on the magnitude of the control stimulus ι . The descriptors' values are compared with a threshold value. The result of the descriptors' triggering helps us to determine whether an event will occur.</p><p>Thus, let us describe the micro-event k  as a couple , , , ,</p><formula xml:id="formula_15">j xy k km k t d w w ε   ,<label>(3)</label></formula><p>where j t is a time reference of  , xy d is a spatial reference of  within AOI, km w is a new xy d micro-state of state class k w , and k ε is an amount of generated energy of class k that represents an event magnitude.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.">Macro-Model of Dynamic Processes</head><p>At the higher level, the grid D can be divided into disjoint objects, which describe the homogeneous areas of the AOI in terms of their parameters' values.</p><p>Suppose </p><formula xml:id="formula_16">D xy mn j kl xy j mn j R d d D D a A f d a f d a = ∈ × ∀ ∈ =<label>( ) ( ) ( ) { } , , , , kl A</label></formula><p>. Using this relation, we can describe homogeneous spatial areas, which are uniform concerning the values of the parameters belonging to the subset kl A , represented by the approximating set of cells, and denoted by h . All cells that belong to the spatial area h are kl A -indiscernible. Each spatial area cannot overlap or cover one another, but they can be adjacent or adjoin to one another. They have such features as continuity and connectivity (spatial concentration of the underlying cells).</p><p>Let H be a set of spatial areas, { } 1 ,... k H h h = . To represent a plurality of spatial areas that have not the property of the continuity, but describe a set of separate areas spatially distributed on the set D , we can also use a certain </p><formula xml:id="formula_17">H l q m n m l n q k lm m k n k R h h H d d D d h d h a A f d a f d a =∀ ∈ ∀ ∈ ∃ ∈ ∈ ∀ ∈ =<label>) ( ) { } , , , , , , , , lm A</label></formula><p>. Obviously, all areas belonging to j A H R are lm A -indiscernible.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.1.">Energy transfer</head><p>The accumulation of energy inside the cell cannot continue indefinitely. As soon as the amount of energy reaches a certain predetermined level, it "overflows", forming an impulse, which should be distributed between the channels under the matrix Ω of coefficients and transmitted to other cells. Energy transfer is seen both as a basis of causal relationships between events and as a means of organizing them into cascading structures.</p><p>Obviously, energy can be of different types, each of which corresponds to the class of the observed event. The class of observed events, in turn, corresponds to the class of state that changed and raised the event. Usually, specific events can be driven only by the appropriate type of energy.</p><p>When the event of a certain class occurs, the impulse generator must eject some quantum of energy of a corresponding class with an appropriate amount. In general, the event model should consider the possibility that a quantum of energy contains interrelated portions of energy of different classes, which do not just correspond to the event class. The key role in understanding the dynamics of the ongoing processes is played by the dynamic parameters of the generated impulses. Depending on the impulse duration, its amplitude, the pressure it exerts on the input of the event, a different picture of the reaction of one event to the other event that has occurred can be observed.</p><p>Thus, the proposed model can transfer different types of energy by short bursts (as impulses) or by long potential inputs. The event can be only triggered if a sufficient amount of appropriate energy is received, which should be determined by the integral of the received energy over time.</p><p>Consider the portions of energy transfer. Let k ε be an energy portion of class k that corresponds to k w . Suppose energy portion k ε can be described as</p><formula xml:id="formula_18">( )<label>1 2</label></formula><p>, , ,</p><formula xml:id="formula_19">k k q q ε τ = , (<label>4</label></formula><formula xml:id="formula_20">)</formula><p>where k is an energy class, τ is a duration, 1 q is an initial amplitude, and 2 q is a final amplitude (Fig. <ref type="figure">5</ref>). (5) The released energy can directly impact events sensitive to this type of energy through certain connections between them. The proposed model allows us to express not only the direct but also indirect effects of events through the energy transfer.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.2.">Connectors</head><p>Let l ϕ be a connector that connects events j  and k  transferring energy portions 1 ,... j jm ε ε from the first one to the second. Such transfer for each energy portion can be labeled by certain confidence represented by a gray number l µ ± and a certain time l t ± , which is also grayed. The connector l ϕ can also have a sensitivity point l σ , which controls the transfer process, if necessary. Suppose the impact of a certain energy portion l ε on the connector allows it to block, break, or amplify the energy transfer from j  to k  (depending on the type and amount of l ε ). Thus, the connector l ϕ can be defined as a tuple</p><formula xml:id="formula_21">{ } { }<label>1 1</label></formula><p>,... , , , , , : ,...</p><formula xml:id="formula_22">l j jm j k l l l l lw t ϕ ε ε µ σ ε ε ± ± =   ,<label>(6)</label></formula><p>where j  and k  are events, { } 1 ,...</p><formula xml:id="formula_23">j jm ε ε</formula><p>is a subset of energy portions permitted to transfer through l ϕ , l µ ± is a likelihood, l t ± is the time to receive energy portion, and l σ is an optional sensitivity point with the energy portions { } 1 ,... </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.3.">Abstract Events</head><p>Suppose an abstract event η consists of a set of inputs { }</p><p>, ,... , where each kj π accumulates energy portions j ε of a class j through the input kj x . Each input kj</p><p>x is connected to the accumulator kj π with a weight (multiplication factor) kj ζ .</p><p>Thus, the energy portion j ε received through input kj x adds the amount of energy 0 T kj q ζ τ ⋅ ∫ of type j to the accumulator kj π . If accumulated kj π energy exceeds a threshold value kj β , a certain quantum of energy Ε should be released and ejected to the connectors. The classes, amplitudes, and durations of energy portions released by energy quantum depend on a certain multiplication factor kj γ .</p><p>Thus, the abstract event k η can be represented as , ,</p><formula xml:id="formula_25">k k k k X Y η Ξ  ,<label>(8)</label></formula><p>where k X is an input part, </p><formula xml:id="formula_26">( ) ( ) { } 1 1 , ,... , k k k km km X x x ζ ζ = , k Y is an output part, { } 1 ,...</formula></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.4.">Abstract Event Network</head><p>An abstract event network can be represented as a time-ordered event structure</p><formula xml:id="formula_27">{ } { } { } 1 1 1</formula><p>, , , ,</p><formula xml:id="formula_28">n w v k l k k l k G η τ ν ϕ ψ = = = =</formula><p>, where { } 1 n k k η = is a set of abstract events, : T τ η → is a mapping that expresses sequential order of the events, :</p><formula xml:id="formula_29">H ν η →</formula><p>is a mapping that expresses the spatial reference of events, { } 1 w l l ϕ = is a set of connectors between events, and { } 1 v k k ψ = is a set of metaconnectors, which connect events and corresponding sensitivity point of the connectors. This formalization allows the use of soft sets to represent different sequences of events, based on the indiscernibility relation between events by class, spatial position, or time intervals. Fig. <ref type="figure" target="#fig_14">6</ref> shows the abstract event network, in which nodes represent events and the arcs represent connectors and meta-connectors. </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="6.">Implementation</head><p>The proposed model has been implemented using Visual C++ based on the double indexed lists and approbated on the simulated area. The AOI is the Lower Dnieper Sands (Oleshky Sands) in the Kherson region, in Southern Ukraine. The sands are surrounded by very dense artificial coniferous forests that prevent the sands from moving during strong winds. Global warming leads to the loss of forests in this area. As a result of global warming, we can observe chains of cascading effects. Due to warming, the groundwater levels are decreased, which further increases fire danger, rapid destruction of forests in large areas, desertification of the territory, and the revival of sand movement. Due to warming, forests are also being affected by invasions of insects, and also become more prone to forest fires (Fig. <ref type="figure" target="#fig_15">7</ref>).</p><p>The results of the conducted simulation show that the proposed model provides enough performance to real-time modeling of a wide range of natural processes from climate change to forest fires and adequate knowledge representation about cascading events taking into account the uncertainty of the observations. </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="7.">Conclusion</head><p>The proposed event-based model enables knowledge representation about an observed plurality of dynamic processes of various intensities that arise unexpectedly and evolve simultaneously in a wide range of domains. It is based on events that are referenced to time intervals and spatial areas and take into account the uncertainty of the observed information about the evolving processes. Uncertainty is represented by gray numbers and soft sets. Events are connected in an abstract network, where arcs represent connectors and meta-connectors that transfer energy by impulses to model transitions of a dynamic system from state to state. The proposed abstract event network can be used to model the evolution of dynamic systems that can be expressed by events that occurred inside the system but driven by impacts from the outside (environmental effects). Such evolution is considered in a wide range of rates, from the slowest processes associated with climate change to the most rapid processes associated with the effects of natural forces of a destructive nature. The proposed model also makes it possible to adequately represent sequential, parallel, and cascade chains of events with a trigger effect, information about which is incomplete and inaccurate. Future research will be devoted to the study of the coefficient matrices and formalization of the process of generating energy quantum.</p></div><figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_0"><head></head><label></label><figDesc>d of size δ δ × , where x and y are the array indices corresponding to the coordinate axes. Suppose a certain cell xy d D ∈</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_1"><head></head><label></label><figDesc>returns a value of a certain parameter for the cell xy d D ∈ . If the values of some parameters i a A ∈ are unchanged over time, such parameters belong to a subset S A of static parameters, S A A ⊆ . In this way, if the values of certain parameters are varying over time, such parameters constitute a subset D A of dynamic parameters, D A A</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_2"><head></head><label></label><figDesc>xy S d t of the cell xy d at the time t such that ( ) state function : D A S υ × → , which returns the state of the cell xy d diagnosed at the time t based on the observed subset of the cell's parameters. of cell's statuses and ϑ be a status function :</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_4"><head>Figure 1 :</head><label>1</label><figDesc>Figure 1: Representation of micro-states of the cell 1 ( 1)</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_5"><head>Figure 2 :</head><label>2</label><figDesc>Figure 2: Example of direct and reverse transition of a cell from one micro-state to another</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_6"><head>Fig. 3 .</head><label>3</label><figDesc>Fig. 3. Eight channels { } , ,0 , ,0 0, , 0, , , , , , , , , I I I I I I I I I + + + + − − + − − − − + ∈ reflect the relative position of cells in space and therefore are denoted relative to the considered cell.These channels can be unidirectional or bidirectional.Since the propagation of the process is usually influenced by a significant number of factors of a stochastic nature located outside the system under consideration, it is necessary to have a specific tool for modeling such effects. Many dynamic systems are influenced by such external processes associated with the environment. For example, the speed and direction of propagation of a forest fire are most influenced by the speed and direction of the wind. Clearly, the wind is a separate dynamic process observable by dynamic parameters, which should be taken into account in the model.</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_7"><head>Figure 3 :</head><label>3</label><figDesc>Figure 3: Channels for energy transfer between cellsThus, it is proposed to use a matrix Ω of coefficients of energy transfer through channels, where each coefficient can slow down or accelerate the process of energy transfer, so the speed of the dynamic process propagation can change accordingly.</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_8"><head></head><label></label><figDesc>-empty finite subset of parameters. Let us define an kl Aindiscernibility relation on the grid D ,</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_9"><head>lmA</head><label></label><figDesc>-indiscernibility relation defined over H , (</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_10"><head>Impulse τ 1 q 2 qFigure 5 :</head><label>125</label><figDesc>Figure 5: Dynamic parameters for energy transfer impulse</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_11"><head></head><label></label><figDesc>k ψ be a meta-connector that connects the event j  and the sensitivity point l σ of a certain connector. It allows transferring energy portions of given classes { }</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_12"><head></head><label></label><figDesc>of which is sensitive to a class k of energy and receive only the correspondent energy potions k ε , a set of outputs of which ejects an energy portion p ε of a class p, and a set of accumulators</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_13"><head>.</head><label></label><figDesc>The proposed model of the event is flexible and dynamic, since the weights kj ζ , threshold values kj λ , and factors kj γ can dynamically change in time.</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_14"><head>Figure 6 :</head><label>6</label><figDesc>Figure 6: Abstract Event Network</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_15"><head>Figure 7 :</head><label>7</label><figDesc>Figure 7: Cascading chains of events in Kherson Region</figDesc><graphic coords="14,114.80,315.22,374.80,198.91" type="bitmap" /></figure>
		</body>
		<back>
			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<monogr>
		<title level="m" type="main">Modelling, Monitoring, Manipulating and Managing? Modelling Process Flow in Complex Systems</title>
		<author>
			<persName><forename type="first">D</forename><surname>Slater</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2017">2017</date>
			<publisher>Cambrensis</publisher>
			<pubPlace>Porthcawl, UK</pubPlace>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<monogr>
		<title level="m" type="main">Engineering a Safer World: Systems Thinking Applied to Safety</title>
		<author>
			<persName><forename type="first">N</forename><forename type="middle">G</forename><surname>Leveson</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2011">2011</date>
			<publisher>MIT Press</publisher>
			<pubPlace>Cambridge, MA</pubPlace>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<analytic>
		<title level="a" type="main">Uncertainty treatment in risk analysis of complex systems: The cases of STAMP and FRAM</title>
		<author>
			<persName><forename type="first">T</forename><surname>Bjerga</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Aven</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Zio</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.ress.2016.08.004</idno>
	</analytic>
	<monogr>
		<title level="j">Reliability Engineering &amp; System Safety</title>
		<imprint>
			<biblScope unit="volume">156</biblScope>
			<biblScope unit="page" from="203" to="209" />
			<date type="published" when="2016">2016</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b3">
	<analytic>
		<title level="a" type="main">Can Complexity-Thinking Methods Contribute to Improving Occupational Safety in Industry 4.0? A Review of Safety Analysis Methods and Their Concepts</title>
		<author>
			<persName><forename type="first">A</forename><surname>Adriaensen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">W</forename><surname>Decré</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Pintelon</surname></persName>
		</author>
		<idno type="DOI">10.3390/safety5040065</idno>
	</analytic>
	<monogr>
		<title level="j">Safety</title>
		<imprint>
			<biblScope unit="volume">5</biblScope>
			<biblScope unit="issue">65</biblScope>
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<analytic>
		<title level="a" type="main">A proposal for a predictive performance assessment model in complex sociotechnical systems combining fuzzy logic and the Functional Resonance Analysis Method (FRAM)</title>
		<author>
			<persName><forename type="first">H</forename><surname>Slim</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Nadeau</surname></persName>
		</author>
		<idno type="DOI">10.4236/ajibm.2019.96089</idno>
	</analytic>
	<monogr>
		<title level="j">American Journal of Industrial and Business Management</title>
		<imprint>
			<biblScope unit="issue">9</biblScope>
			<biblScope unit="page" from="1345" to="1375" />
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<analytic>
		<title level="a" type="main">Threat assessment method for intelligent disaster decision support system</title>
		<author>
			<persName><forename type="first">M</forename><surname>Zharikova</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Sherstjuk</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-319-45991-2_6</idno>
	</analytic>
	<monogr>
		<title level="m">Advances in Intelligent Systems and Computing</title>
				<editor>
			<persName><forename type="first">N</forename><surname>Shakhovska</surname></persName>
		</editor>
		<meeting><address><addrLine>Cham</addrLine></address></meeting>
		<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2016">2016. 2016</date>
			<biblScope unit="volume">512</biblScope>
			<biblScope unit="page" from="81" to="99" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b6">
	<analytic>
		<title level="a" type="main">A Comparison of Event Representations in DEFT</title>
		<author>
			<persName><forename type="first">A</forename><surname>Bies</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Z</forename><surname>Song</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Getman</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Ellis</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Mott</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Strassel</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Palmer</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Mitamura</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Freedman</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Ji</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>O'gorman</surname></persName>
		</author>
		<idno type="DOI">10.18653/v1/W16-1004</idno>
	</analytic>
	<monogr>
		<title level="m">4th Workshop on Events: Definition, Detection, Coreference, and Representation</title>
				<meeting><address><addrLine>San Diego, California</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2016">2016</date>
			<biblScope unit="page" from="27" to="36" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b7">
	<analytic>
		<title level="a" type="main">Modeling Document-level Causal Structures for Event Causal Relation Identification</title>
		<author>
			<persName><forename type="first">L</forename><surname>Gao</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><forename type="middle">K</forename><surname>Choubey</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Huang</surname></persName>
		</author>
		<idno type="DOI">10.18653/v1/N19-1179</idno>
	</analytic>
	<monogr>
		<title level="m">Proc. of the 2019 Conf. of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</title>
				<meeting>of the 2019 Conf. of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</meeting>
		<imprint>
			<date type="published" when="2019">2019</date>
			<biblScope unit="volume">1</biblScope>
			<biblScope unit="page" from="1808" to="1817" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b8">
	<analytic>
		<title level="a" type="main">Visual Causality Analysis of Event Sequence Data</title>
		<author>
			<persName><forename type="first">Z</forename><surname>Jin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Guo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Chen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Weiskopf</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Gotz</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Cao</surname></persName>
		</author>
		<idno type="DOI">10.1109/tvcg.2020.3030465</idno>
	</analytic>
	<monogr>
		<title level="j">IEEE Transactions on Visualization and Computer Graphics</title>
		<imprint>
			<biblScope unit="volume">27</biblScope>
			<biblScope unit="issue">2</biblScope>
			<biblScope unit="page" from="1343" to="1352" />
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b9">
	<analytic>
		<title level="a" type="main">Events and Causal Mappings Modeled in Conceptual Spaces</title>
		<author>
			<persName><forename type="first">P</forename><surname>Gärdenfors</surname></persName>
		</author>
		<idno type="DOI">10.3389/fpsyg.2020.00630</idno>
	</analytic>
	<monogr>
		<title level="j">Frontiers in Psychology</title>
		<imprint>
			<biblScope unit="volume">11</biblScope>
			<biblScope unit="page">630</biblScope>
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b10">
	<analytic>
		<title level="a" type="main">Extracting Events and Their Relations from Texts: A Survey on Recent Research Progress and Challenges</title>
		<author>
			<persName><forename type="first">K</forename><surname>Liu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Chen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Liu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><surname>Zuo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Zhao</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.aiopen.2021.02.004</idno>
	</analytic>
	<monogr>
		<title level="j">AI Open</title>
		<imprint>
			<biblScope unit="volume">1</biblScope>
			<biblScope unit="page" from="22" to="39" />
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b11">
	<analytic>
		<title level="a" type="main">Minimisation of Event Structures</title>
		<author>
			<persName><forename type="first">P</forename><surname>Baldan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Raffaeta</surname></persName>
		</author>
		<idno type="DOI">10.4230/LIPIcs.FSTTCS.2019.30</idno>
	</analytic>
	<monogr>
		<title level="m">Proc. of 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</title>
				<meeting>of 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</meeting>
		<imprint>
			<date type="published" when="2019">2019</date>
			<biblScope unit="volume">150</biblScope>
			<biblScope unit="page">15</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b12">
	<analytic>
		<title level="a" type="main">Time, space, and events in language and cognition: a comparative view</title>
		<author>
			<persName><forename type="first">C</forename><surname>Sinha</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Gärdenfors</surname></persName>
		</author>
		<idno type="DOI">10.1111/nyas.12491</idno>
	</analytic>
	<monogr>
		<title level="j">Annals of the New York Academy of Sciences, Flow of Time</title>
		<imprint>
			<biblScope unit="page" from="1" to="10" />
			<date type="published" when="2014">2014</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b13">
	<analytic>
		<title level="a" type="main">Modeling the Process of Event Sequence Data Generated for Working Condition Diagnosis</title>
		<author>
			<persName><forename type="first">X</forename><surname>Song</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Ding</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Liu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Zhang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Wang</surname></persName>
		</author>
		<idno type="DOI">10.1155/2015/693450</idno>
	</analytic>
	<monogr>
		<title level="j">Mathematical Problems in Engineering</title>
		<imprint>
			<biblScope unit="page">693450</biblScope>
			<date type="published" when="2015">2015</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b14">
	<analytic>
		<title level="a" type="main">Modeling asynchronous event sequences with RNNs</title>
		<author>
			<persName><forename type="first">S</forename><surname>Wu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Liu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Sohn</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Moon</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Wi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Juhn</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Liu</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.jbi.2018.05.016</idno>
	</analytic>
	<monogr>
		<title level="j">Journal of Biomedical Informatics</title>
		<imprint>
			<biblScope unit="volume">83</biblScope>
			<biblScope unit="page" from="167" to="177" />
			<date type="published" when="2018">2018</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b15">
	<analytic>
		<title level="a" type="main">A hybrid Monte Carlo and possibilistic approach to estimate non-suppression probability in fire probabilistic safety analysis</title>
		<author>
			<persName><forename type="first">W</forename><surname>Wang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Di Maio</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Baraldi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Zio</surname></persName>
		</author>
		<idno type="DOI">10.1109/ICSRS.2017.8272881</idno>
	</analytic>
	<monogr>
		<title level="m">Proc. of 2nd International Conference on System Reliability and Safety (ICSRS)</title>
				<meeting>of 2nd International Conference on System Reliability and Safety (ICSRS)</meeting>
		<imprint>
			<date type="published" when="2017">2017</date>
			<biblScope unit="page" from="552" to="559" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b16">
	<analytic>
		<title level="a" type="main">Communicating model uncertainty for natural hazards: A qualitative systematic thematic review</title>
		<author>
			<persName><forename type="first">E</forename><forename type="middle">E H</forename><surname>Doyle</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">M</forename><surname>Johnston</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Smith</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Paton</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.ijdrr.2018.10.023</idno>
	</analytic>
	<monogr>
		<title level="j">International Journal of Disaster Risk Reduction</title>
		<imprint>
			<biblScope unit="volume">33</biblScope>
			<biblScope unit="issue">2</biblScope>
			<biblScope unit="page" from="449" to="476" />
			<date type="published" when="2018">2018</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b17">
	<monogr>
		<author>
			<persName><forename type="first">J</forename><surname>Guin</surname></persName>
		</author>
		<ptr target="https://www.air-worldwide.com/Publications/AIR-Currents/2018/Modeling-Fundamentals--Understanding-Uncertainty/" />
		<title level="m">Modeling Fundamentals: Understanding Uncertainty, AIR Currents 4</title>
				<imprint>
			<date type="published" when="2018">2018</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b18">
	<analytic>
		<title level="a" type="main">Plausible Event-Tree Networks for Knowledge Representation in Real-Time GIS-Based Decision Support Systems</title>
		<author>
			<persName><forename type="first">V</forename><surname>Sherstjuk</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Zharikova</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">CEUR Workshop Proc</title>
				<imprint>
			<date type="published" when="2018">2018</date>
			<biblScope unit="volume">2105</biblScope>
			<biblScope unit="page" from="109" to="123" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b19">
	<monogr>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">D</forename><surname>Nolte</surname></persName>
		</author>
		<title level="m">Introduction to Modern Dynamics: Chaos, Networks, Space and Time</title>
				<imprint>
			<publisher>Oxford University Press</publisher>
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b20">
	<analytic>
		<title level="a" type="main">Dynamic Systems, Process and Development</title>
		<author>
			<persName><forename type="first">P</forename><forename type="middle">L C</forename><surname>Van Geert</surname></persName>
		</author>
		<idno type="DOI">10.1159/000503825</idno>
	</analytic>
	<monogr>
		<title level="j">Human Development</title>
		<imprint>
			<biblScope unit="volume">63</biblScope>
			<biblScope unit="page" from="153" to="179" />
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b21">
	<monogr>
		<title level="m" type="main">Statistical methods on risk management of extreme events (Statistical Methodology Commons)</title>
		<author>
			<persName><forename type="first">Z</forename><surname>Zhang</surname></persName>
		</author>
		<imprint>
			<date type="published" when="1002">1002. 2017</date>
			<pubPlace>Amherst, MA</pubPlace>
		</imprint>
		<respStmt>
			<orgName>University of Massachusetts</orgName>
		</respStmt>
	</monogr>
	<note type="report_type">Doctoral Dissertations</note>
</biblStruct>

<biblStruct xml:id="b22">
	<analytic>
		<title level="a" type="main">Military geology in war and peace: an introduction</title>
		<author>
			<persName><forename type="first">P</forename><forename type="middle">L</forename><surname>Guth</surname></persName>
		</author>
		<idno type="DOI">10.1130/REG13</idno>
	</analytic>
	<monogr>
		<title level="s">XIII of Reviews in Engineering Geology</title>
		<editor>Underwood, J.R., Guth, P.L.</editor>
		<imprint>
			<date type="published" when="1998">1998</date>
		</imprint>
	</monogr>
	<note>Geology in War and Peace</note>
</biblStruct>

<biblStruct xml:id="b23">
	<analytic>
		<title level="a" type="main">Safety management -A multi-level control problem</title>
		<author>
			<persName><forename type="first">B</forename><surname>Wahlström</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Rollenhagen</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.ssci.2013.06.002</idno>
	</analytic>
	<monogr>
		<title level="j">Safety Science</title>
		<imprint>
			<biblScope unit="volume">69</biblScope>
			<biblScope unit="page" from="3" to="17" />
			<date type="published" when="2014">2014</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b24">
	<monogr>
		<title level="m" type="main">The Probabilistic Method</title>
		<author>
			<persName><forename type="first">N</forename><surname>Alon</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">H</forename><surname>Spencer</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2016">2016</date>
			<publisher>Wiley</publisher>
			<pubPlace>New York</pubPlace>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b25">
	<analytic>
		<title level="a" type="main">Risk Terrain Modeling for Spatial Risk Assessment</title>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">M</forename><surname>Caplan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><forename type="middle">W</forename><surname>Kennedy</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">D</forename><surname>Barnum</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Cityscape</title>
		<imprint>
			<biblScope unit="volume">17</biblScope>
			<biblScope unit="issue">1</biblScope>
			<biblScope unit="page" from="7" to="16" />
			<date type="published" when="2015">2015</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b26">
	<analytic>
		<title level="a" type="main">Managing and Mining Uncertain Data</title>
		<author>
			<persName><forename type="first">C</forename><forename type="middle">C</forename><surname>Aggarwal</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-0-387-09690-2</idno>
	</analytic>
	<monogr>
		<title level="m">Advances in Database Systems</title>
				<editor>
			<persName><forename type="first">C</forename><forename type="middle">C</forename><surname>Aggarwal</surname></persName>
		</editor>
		<meeting><address><addrLine>Boston</addrLine></address></meeting>
		<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2010">2010</date>
			<biblScope unit="volume">35</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b27">
	<monogr>
		<title level="m" type="main">Incomplete Information: Structure, Inference, Complexity</title>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">P</forename><surname>Demri</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><forename type="middle">S</forename><surname>Orlowska</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-662-04997-6</idno>
		<imprint>
			<date type="published" when="2002">2002</date>
			<publisher>Springer-Verlag</publisher>
			<pubPlace>Berlin Heidelberg</pubPlace>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b28">
	<analytic>
		<title level="a" type="main">Fuzzy sets</title>
		<author>
			<persName><forename type="first">L</forename><forename type="middle">A</forename><surname>Zadeh</surname></persName>
		</author>
		<idno type="DOI">10.1016/S0019-9958(65)90241-X</idno>
	</analytic>
	<monogr>
		<title level="j">Information and Control</title>
		<imprint>
			<biblScope unit="volume">3</biblScope>
			<biblScope unit="issue">8</biblScope>
			<biblScope unit="page" from="338" to="353" />
			<date type="published" when="1965">1965</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b29">
	<analytic>
		<title level="a" type="main">A comparative review on nondeterministic sets for association rule mining</title>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">A H</forename><surname>Minoofam</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Ahmadi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><forename type="middle">R</forename><surname>Kanan</surname></persName>
		</author>
		<idno type="DOI">10.1109/CFIS.2015.7391691</idno>
	</analytic>
	<monogr>
		<title level="m">Proc. of the 4th Iranian Joint Congress on Fuzzy and Intelligent Systems (CFIS)</title>
				<meeting>of the 4th Iranian Joint Congress on Fuzzy and Intelligent Systems (CFIS)<address><addrLine>Zahedan, Iran</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2015">2015</date>
			<biblScope unit="page" from="1" to="5" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b30">
	<analytic>
		<title level="a" type="main">Neutrosophic Set is a Generalization of Intuitionistic Fuzzy Set, Inconsistent Intuitionistic Fuzzy Set (Picture Fuzzy Set, Ternary Fuzzy Set), Pythagorean Fuzzy Set, q-Rung Orthopair Fuzzy Set, Spherical Fuzzy Set, and n-HyperSpherical Fuzzy Set, while Neutrosophication is a Generalization of Regret Theory, Grey System Theory, and Three-Ways Decision</title>
		<author>
			<persName><forename type="first">F</forename><surname>Smarandache</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Journal of New Theory</title>
		<imprint>
			<biblScope unit="volume">29</biblScope>
			<biblScope unit="page" from="1" to="35" />
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b31">
	<analytic>
		<title level="a" type="main">Rough sets</title>
		<author>
			<persName><forename type="first">Z</forename><surname>Pawlak</surname></persName>
		</author>
		<idno type="DOI">10.1007/BF01001956</idno>
	</analytic>
	<monogr>
		<title level="j">International Journal of Computer &amp; Information Sciences</title>
		<imprint>
			<biblScope unit="volume">11</biblScope>
			<biblScope unit="issue">5</biblScope>
			<biblScope unit="page" from="341" to="356" />
			<date type="published" when="1982">1982</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b32">
	<monogr>
		<author>
			<persName><forename type="first">S</forename><surname>Liu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Lin</surname></persName>
		</author>
		<idno type="DOI">10.1007/1-84628-342-6</idno>
		<title level="m">Grey Information: Theory and Practical Applications</title>
				<meeting><address><addrLine>London</addrLine></address></meeting>
		<imprint>
			<publisher>Springer-Verlag</publisher>
			<date type="published" when="2006">2006</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b33">
	<analytic>
		<title level="a" type="main">Soft set theory -First results</title>
		<author>
			<persName><forename type="first">D</forename><surname>Molodtsov</surname></persName>
		</author>
		<idno type="DOI">10.1016/S0898-1221(99)00056-5</idno>
	</analytic>
	<monogr>
		<title level="j">Computers &amp; Mathematics with Applications No</title>
		<imprint>
			<biblScope unit="volume">37</biblScope>
			<biblScope unit="issue">4-5</biblScope>
			<biblScope unit="page" from="19" to="31" />
			<date type="published" when="1999">1999</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b34">
	<analytic>
		<title level="a" type="main">Reviewing crisp, fuzzy, grey and rough mathematical models</title>
		<author>
			<persName><forename type="first">D</forename><surname>Yamaguchi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G.-D</forename><surname>Li</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L.-C</forename><surname>Chen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Nagai</surname></persName>
		</author>
		<idno type="DOI">10.1109/GSIS.2007.4443334</idno>
	</analytic>
	<monogr>
		<title level="m">Proc. of 2007 IEEE Int. Conf. on Grey Systems and Intelligent Services</title>
				<meeting>of 2007 IEEE Int. Conf. on Grey Systems and Intelligent Services<address><addrLine>Nanjing, China</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2007">2007</date>
			<biblScope unit="page" from="547" to="552" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b35">
	<analytic>
		<title level="a" type="main">The patent holder&apos;s dilemma: Buy, sell, or troll?</title>
		<author>
			<persName><forename type="first">P</forename><forename type="middle">S</forename><surname>Abril</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Plant</surname></persName>
		</author>
		<idno type="DOI">10.1145/1188913.1188915</idno>
	</analytic>
	<monogr>
		<title level="j">Communications of the ACM</title>
		<imprint>
			<biblScope unit="volume">50</biblScope>
			<biblScope unit="page" from="36" to="44" />
			<date type="published" when="2007">2007</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b36">
	<analytic>
		<title level="a" type="main">Deciding equivalances among conjunctive aggregate queries</title>
		<author>
			<persName><forename type="first">S</forename><surname>Cohen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">W</forename><surname>Nutt</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Sagic</surname></persName>
		</author>
		<idno type="DOI">10.1145/1219092.1219093</idno>
	</analytic>
	<monogr>
		<title level="j">J.ACM</title>
		<imprint>
			<biblScope unit="volume">54</biblScope>
			<date type="published" when="2007">2007</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b37">
	<monogr>
		<title level="m">Special issue: Digital Libraries</title>
				<editor>
			<persName><forename type="first">J</forename><surname>Cohen</surname></persName>
		</editor>
		<imprint>
			<date type="published" when="1996">1996</date>
			<biblScope unit="volume">39</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b38">
	<monogr>
		<title level="m" type="main">Understanding Policy-Based Networking</title>
		<author>
			<persName><forename type="first">D</forename><surname>Kosiur</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2001">2001</date>
			<publisher>Wiley</publisher>
			<pubPlace>New York, NY</pubPlace>
		</imprint>
	</monogr>
	<note>2nd. ed.</note>
</biblStruct>

<biblStruct xml:id="b39">
	<analytic>
		<title level="a" type="main">First-Order Dynamic Logic</title>
		<author>
			<persName><forename type="first">D</forename><surname>Harel</surname></persName>
		</author>
		<idno type="DOI">10.1007/3-540-09237-4</idno>
	</analytic>
	<monogr>
		<title level="s">Lecture Notes in Computer Science</title>
		<imprint>
			<biblScope unit="volume">68</biblScope>
			<date type="published" when="1979">1979</date>
			<publisher>Springer-Verlag</publisher>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b40">
	<monogr>
		<title level="m" type="main">The title of book one, volume 9 of The name of the series one</title>
		<idno>doi:10.1007 3-540-09237-4</idno>
		<editor>I.Editor</editor>
		<imprint>
			<date type="published" when="2007">2007</date>
			<publisher>University of Chicago Press</publisher>
			<pubPlace>Chicago</pubPlace>
		</imprint>
	</monogr>
	<note>1st. ed</note>
</biblStruct>

<biblStruct xml:id="b41">
	<monogr>
		<title level="m" type="main">The title of book two, The name of the series two</title>
		<idno type="DOI">10.1007/3-540-09237-4</idno>
		<editor>I.Editor</editor>
		<imprint>
			<date type="published" when="2008">2008</date>
			<publisher>University of Chicago Press</publisher>
			<pubPlace>Chicago</pubPlace>
		</imprint>
	</monogr>
	<note>2nd. ed.</note>
</biblStruct>

<biblStruct xml:id="b42">
	<analytic>
		<title level="a" type="main">Achieving application requirements</title>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">Z</forename><surname>Spector</surname></persName>
		</author>
		<idno type="DOI">10.1145/90417</idno>
	</analytic>
	<monogr>
		<title level="m">Distributed Systems</title>
				<editor>
			<persName><forename type="first">S</forename><surname>Mullender</surname></persName>
		</editor>
		<meeting><address><addrLine>New York, NY</addrLine></address></meeting>
		<imprint>
			<publisher>ACM Press</publisher>
			<date type="published" when="1990">1990</date>
			<biblScope unit="page" from="19" to="33" />
		</imprint>
	</monogr>
	<note>2nd. ed</note>
</biblStruct>

<biblStruct xml:id="b43">
	<analytic>
		<title level="a" type="main">Statecarts in use: structured analysis and objectorientation</title>
		<author>
			<persName><forename type="first">B</forename><forename type="middle">P</forename><surname>Douglass</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Harel</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">B</forename><surname>Trakhtenbrot</surname></persName>
		</author>
		<idno type="DOI">10.1007/3-540-65193-4_29</idno>
	</analytic>
	<monogr>
		<title level="m">Lectures on Embedded Systems</title>
		<title level="s">Lecture Notes in Computer Science</title>
		<editor>
			<persName><forename type="first">G</forename><surname>Rozenberg</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">F</forename><forename type="middle">W</forename><surname>Vaandrager</surname></persName>
		</editor>
		<meeting><address><addrLine>London</addrLine></address></meeting>
		<imprint>
			<publisher>Springer-Verlag</publisher>
			<date type="published" when="1998">1998</date>
			<biblScope unit="volume">1494</biblScope>
			<biblScope unit="page" from="368" to="394" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b44">
	<analytic>
		<title level="a" type="main">The Art of Computer Programming</title>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">E</forename><surname>Knuth</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Fundamental Algorithms</title>
				<imprint>
			<publisher>Addison Wesley Longman Publishing Co., Inc</publisher>
			<date type="published" when="1997">1997</date>
			<biblScope unit="volume">1</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b45">
	<analytic>
		<title level="a" type="main">Predicate path expressions</title>
		<author>
			<persName><forename type="first">S</forename><surname>Andler</surname></persName>
		</author>
		<idno type="DOI">10.1145/567752.567774</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 6th. ACM SIGACT-SIGPLAN symposium on Principles of Programming Languages, POPL &apos;79</title>
				<meeting>the 6th. ACM SIGACT-SIGPLAN symposium on Principles of Programming Languages, POPL &apos;79<address><addrLine>New York, NY</addrLine></address></meeting>
		<imprint>
			<publisher>ACM Press</publisher>
			<date type="published" when="1979">1979</date>
			<biblScope unit="page" from="226" to="236" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b46">
	<analytic>
		<title level="a" type="main">An experiment in bibliographic mark-up: Parsing metadata for xml export</title>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">W</forename><surname>Smith</surname></persName>
		</author>
		<idno>doi:99.9999/woot07-S422</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 3rd. annual workshop on Librarians and Computers</title>
				<editor>
			<persName><forename type="first">R</forename><forename type="middle">N</forename><surname>Smythe</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">A</forename><surname>Noble</surname></persName>
		</editor>
		<meeting>the 3rd. annual workshop on Librarians and Computers<address><addrLine>Milan Italy</addrLine></address></meeting>
		<imprint>
			<publisher>Paparazzi Press</publisher>
			<date type="published" when="2010">2010</date>
			<biblScope unit="volume">3</biblScope>
			<biblScope unit="page" from="422" to="431" />
		</imprint>
	</monogr>
	<note>of LAC &apos;10</note>
</biblStruct>

<biblStruct xml:id="b47">
	<analytic>
		<title level="a" type="main">Catch me, if you can: Evading network signatures with web-based polymorphic worms</title>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">V</forename><surname>Gundy</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Balzarotti</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Vigna</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the first USENIX workshop on Offensive Technologies, WOOT &apos;07</title>
				<meeting>the first USENIX workshop on Offensive Technologies, WOOT &apos;07<address><addrLine>Berkley, CA</addrLine></address></meeting>
		<imprint>
			<publisher>USENIX Association</publisher>
			<date type="published" when="2007">2007</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b48">
	<monogr>
		<title level="m" type="main">LOGICS of Programs: AXIOMATICS and DESCRIPTIVE POWER</title>
		<author>
			<persName><forename type="first">D</forename><surname>Harel</surname></persName>
		</author>
		<idno>TR-200</idno>
		<imprint>
			<date type="published" when="1978">1978</date>
			<pubPlace>Cambridge, MA</pubPlace>
		</imprint>
		<respStmt>
			<orgName>MIT Research Lab ; Massachusetts Institute of Technology</orgName>
		</respStmt>
	</monogr>
	<note type="report_type">Technical Report</note>
</biblStruct>

<biblStruct xml:id="b49">
	<monogr>
		<author>
			<persName><forename type="first">K</forename><surname>Clarkson</surname></persName>
		</author>
		<idno>AAT 8506171</idno>
		<title level="m">Algorithms for Closest-Point Problems</title>
				<meeting><address><addrLine>Palo Alto, CA, UMI Order Number</addrLine></address></meeting>
		<imprint>
			<date type="published" when="1985">1985</date>
		</imprint>
		<respStmt>
			<orgName>Stanford University</orgName>
		</respStmt>
	</monogr>
	<note type="report_type">Ph.D. thesis</note>
	<note>Computational Geometry</note>
</biblStruct>

<biblStruct xml:id="b50">
	<monogr>
		<title level="m" type="main">Optimal Motion Control of a Ground Vehicle</title>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">A</forename><surname>Anisi</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2003">2003</date>
			<pubPlace>Stockholm, Sweden</pubPlace>
		</imprint>
		<respStmt>
			<orgName>Royal Institute of Technology (KTH)</orgName>
		</respStmt>
	</monogr>
	<note type="report_type">Master&apos;s thesis</note>
</biblStruct>

<biblStruct xml:id="b51">
	<monogr>
		<author>
			<persName><forename type="first">H</forename><surname>Thornburg</surname></persName>
		</author>
		<ptr target="http://ccrma.stanford.edu/jos/bayes/bayes.html" />
		<title level="m">Introduction to bayesian statistics</title>
				<imprint>
			<date type="published" when="2001">2001</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b52">
	<monogr>
		<title level="m" type="main">Clifford: a maple 11 package for clifford algebra computations</title>
		<author>
			<persName><forename type="first">R</forename><surname>Ablamowicz</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Fauser</surname></persName>
		</author>
		<ptr target="http://math.tntech.edu/rafal/cli11/index.html" />
		<imprint>
			<date type="published" when="2007">2007</date>
			<biblScope unit="volume">11</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b53">
	<monogr>
		<ptr target="http://www.poker-edge.com/stats.php" />
		<title level="m">Poker-Edge, Com, Stats and analysis</title>
				<imprint>
			<date type="published" when="2006">2006</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b54">
	<monogr>
		<title level="m" type="main">A more perfect union, Video</title>
		<author>
			<persName><forename type="first">B</forename><surname>Obama</surname></persName>
		</author>
		<ptr target="http://video.google.com/videoplay?docid=6528042696351994555" />
		<imprint>
			<date type="published" when="2008">2008</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b55">
	<analytic>
		<title level="a" type="main">Solder man</title>
		<author>
			<persName><forename type="first">D</forename><surname>Novak</surname></persName>
		</author>
		<ptr target="http://video.google.com/videoplay?docid=6528042696351994555.doi:99.9999/woot07-S422" />
	</analytic>
	<monogr>
		<title level="m">ACM SIGGRAPH 2003 Video Review on Animation theater Program: Part I</title>
				<meeting><address><addrLine>New York, NY</addrLine></address></meeting>
		<imprint>
			<publisher>ACM Press</publisher>
			<date type="published" when="2003">July 27-27, 2003. 2003</date>
			<biblScope unit="volume">145</biblScope>
			<biblScope unit="page">4</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b56">
	<analytic>
		<title level="a" type="main">Interview with bill kinder: January 13</title>
		<author>
			<persName><forename type="first">N</forename><surname>Lee</surname></persName>
		</author>
		<idno type="DOI">10.1145/1057270.1057278</idno>
	</analytic>
	<monogr>
		<title level="j">Comput. Entertain</title>
		<imprint>
			<biblScope unit="volume">3</biblScope>
			<date type="published" when="2005">2005. 2005</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b57">
	<monogr>
		<title level="m" type="main">The fountain of youth</title>
		<author>
			<persName><forename type="first">J</forename><surname>Scientist</surname></persName>
		</author>
		<idno>Patent No. 12345</idno>
		<imprint>
			<date type="published" when="2008">2009. Filed July 1st., 2008. Issued Aug. 9th., 2009</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b58">
	<analytic>
		<title level="a" type="main">The enabling of digital libraries</title>
		<author>
			<persName><forename type="first">B</forename><surname>Rous</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Digital Libraries</title>
		<imprint>
			<biblScope unit="volume">12</biblScope>
			<date type="published" when="2008">2008</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b59">
	<analytic>
		<title level="a" type="main">A library-based synthesis methodology for reversible logic</title>
		<author>
			<persName><forename type="first">M</forename><surname>Saeedi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">S</forename><surname>Zamani</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Sedighi</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Microelectron. J</title>
		<imprint>
			<biblScope unit="volume">41</biblScope>
			<biblScope unit="page" from="185" to="194" />
			<date type="published" when="2010">2010</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b60">
	<analytic>
		<title level="a" type="main">Synthesis of reversible circuit using cyclebased approach</title>
		<author>
			<persName><forename type="first">M</forename><surname>Saeedi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">S</forename><surname>Zamani</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Sedighi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Z</forename><surname>Sasanian</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">J. Emerg. Technol. Comput. Syst</title>
		<imprint>
			<biblScope unit="volume">6</biblScope>
			<date type="published" when="2010">2010</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b61">
	<analytic>
		<title level="a" type="main">Algorithmic enumeration of ideal classes for quaternion orders</title>
		<author>
			<persName><forename type="first">M</forename><surname>Kirschmer</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Voight</surname></persName>
		</author>
		<idno type="DOI">10.1137/080734467</idno>
		<idno>doi:</idno>
		<ptr target="10.1137/080734467" />
	</analytic>
	<monogr>
		<title level="j">SIAM J. Comput</title>
		<imprint>
			<biblScope unit="volume">39</biblScope>
			<biblScope unit="page" from="1714" to="1747" />
			<date type="published" when="2010">2010</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b62">
	<analytic>
		<title level="a" type="main">The analysis of linear partial differential operators</title>
		<author>
			<persName><forename type="first">L</forename><surname>Hörmander</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Fundamental Principles of Mathematical Sciences</title>
				<meeting><address><addrLine>Berlin, Germany</addrLine></address></meeting>
		<imprint>
			<publisher>Springer-Verlag</publisher>
			<date type="published" when="1985">1985</date>
			<biblScope unit="volume">IV</biblScope>
		</imprint>
	</monogr>
	<note>, Fourier integral operators</note>
</biblStruct>

<biblStruct xml:id="b63">
	<analytic>
		<title level="a" type="main">The analysis of linear partial differential operators</title>
		<author>
			<persName><forename type="first">L</forename><surname>Örmander</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Fundamental Principles of Mathematical Sciences</title>
				<meeting><address><addrLine>Berlin, Germany</addrLine></address></meeting>
		<imprint>
			<publisher>Pseudodierential operators</publisher>
			<date type="published" when="1985">1985</date>
			<biblScope unit="volume">275</biblScope>
		</imprint>
	</monogr>
	<note>Grundlehren der Mathematischen Wissenschaften</note>
</biblStruct>

<biblStruct xml:id="b64">
	<monogr>
		<idno type="DOI">10.1109/ICWS.2004.64</idno>
		<title level="m">Proceedings of the IEEE International Conference on Web Services, ICWS &apos;04</title>
				<meeting>the IEEE International Conference on Web Services, ICWS &apos;04<address><addrLine>Washington, DC, USA</addrLine></address></meeting>
		<imprint>
			<publisher>IEEE Computer Society</publisher>
			<date type="published" when="2004">2004</date>
			<biblScope unit="page" from="21" to="22" />
		</imprint>
	</monogr>
	<note>Ieee tcsc executive committee</note>
</biblStruct>

<biblStruct xml:id="b65">
	<monogr>
		<ptr target="http://www.tug.org/instmem.html" />
		<title level="m">TUG, Institutional members of the TEX users group</title>
				<imprint>
			<date type="published" when="2017">2017</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b66">
	<monogr>
		<author>
			<persName><forename type="first">Team</forename><surname>Core</surname></persName>
		</author>
		<ptr target="https://www.R-project.org/" />
		<title level="m">A language and environment for statistical computing</title>
				<imprint>
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b67">
	<monogr>
		<title level="m" type="main">UMass citation field extraction dataset</title>
		<author>
			<persName><forename type="first">S</forename><surname>Anzaroot</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Mccallum</surname></persName>
		</author>
		<ptr target="http://www.iesl.cs.umass.edu/data/data-umasscitationfield" />
		<imprint>
			<date type="published" when="2013">2013</date>
		</imprint>
	</monogr>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
