<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Geolocalized Filtering of Open Data Datasets for Mobile Devices</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Riccardo Paolillo</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Michele Orru' Able Srl Rome</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Italy firstname.lastname@able-srl.it</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>A. Open Data</string-name>
        </contrib>
      </contrib-group>
      <fpage>31</fpage>
      <lpage>35</lpage>
      <abstract>
        <p>-Open data are has an high economic potential, allowing a transparent and democratized access to data. At the same time, geographic data are playing a fundamental role since it can easily filter pertinent data among the wide multitude of available data, such as finding the nearest wifi networks or the nearest museums. In this work we present a solution to exploit geolocalization on mobile devices in order to find, among the available Open Data, the most relevant data according to the position of the user. Starting from some public datasets, an initial data augmentation has been introduced to include location information whereas it was possible and useful. Then an optimized filtering system was developed for geographic contents through the design of a specific back-end. Index Terms-open-data, geographic information, LBS</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        In the last decade, the Open Government doctrine has been
spreading more and more founding its cultural model on the
principle according to which all the activities of governments
and state administrations must be open and available in order
to promote effective actions and guarantee widespread control
over the management of public affairs. This movement pushes
a new interaction model between citizen and Public
Administration: from the ”classic” user to a citizen that is directly
involved in the government choices [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Particular impetus
to this movement was given by the Obama administration,
which in 2009 promulgated the so-called ”Open Government
Delegate” Memorandum, [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], a provision that codifies the
principles of the ”open” philosophy within institutions and
administrations, prescribes tasks, processes and organizational
models that public bodies are called to follow in compliance
with the Directive, defining three essential keywords:
Transparency, Participation and Collaboration.
      </p>
      <p>Transparency: institutions are required to provide citizens
with data and information on decisions taken and on their
actions, in order to create a system of trust within the
local community towards the work and choices made.
Participation: citizen participation in the Public Administration
©2019 for this paper by its authors. Use permitted under Creative
Commons License Attribution 4.0 International (CC BY 4.0)
choices increases the effectiveness of administrative actions
and improves the quality of decisions. Collaboration: the
collaboration envisage a direct involvement of citizens in the
activities of the Public Administration and tends to include the
institutions within a collaborative and participatory network
composed of public bodies, non-profit organizations and a
community of citizens.</p>
      <p>
        To implement these principles it is therefore necessary that
the P.A. make the widest possible amount of data available
to the public available to it: such data, if released in specific
ways, are called open data (”Open Data”) [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. So considerable
amounts of data of all kinds are made available to the citizen,
ready to be used in the most disparate ways.
      </p>
      <p>
        Open Data are data collections (datasets), publicly
accessible, without patents or proprietary licenses that limit their
diffusion or re-use. Open Data is a specific type of Open
content that can be considered its father focused on the spread
of creative works [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. According to supporters of the Open
Data movement, the data should be treated as common goods
because:
the data belongs to the human race
the data produced by the public administration, as paid
with public money, must return to the tax payers in the
form of open and universally available data
any restrictions on data and their use represent a
limitation of the community’s development potential
the data is necessary to facilitate the execution of
common human activities
better is access to data, greater is the rate of discovery in
the scientific field,
      </p>
    </sec>
    <sec id="sec-2">
      <title>B. Open Data Quality</title>
      <p>
        To distinguish the different formats that can be used in the
coding of datasets, W3C has proposed a cataloging model that
classifies them based on their characteristics on a scale of
values from 1 (one star) to 5 (five stars) [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]:
* It is the basic level, consisting of unstructured files: for
example a document in Microsoft Word format, a file in
Adobe PDF format. A single star indicates the simple
availability of information and data online, in any form,
as long as it is distributed with an open license. The data
distributed in this format is readable and printable by
users, can be stored locally on a PC and is easy to publish.
However they are not in open format and no processing
is possible on them.
** This level indicates structured data but encoded with a
proprietary format, for example a document in Microsoft
Excel format. The data characterized by the two stars are
not in open format as a proprietary software is needed to
process them, however they can normally be converted
being structured data - into open data;
*** This level indicates structured data encoded in a
nonproprietary format, for example the format .csv (Comma
Separated Values), data that can be manipulated without
having to use proprietary software;
**** This level indicates structured data encoded in a
nonproprietary format, which are equipped with a URI2 that
makes them addressable on the network and therefore
usable directly online, through inclusion in a structure
based on the RDF3 model. Four stars therefore indicate
the fact that the single data of a dataset, available online
in an open format (typically XML / RDF) can be invoked
through a specific URL. This allows you to point to the
data or a set of data from an application or access it from
within a program that can then process it in various ways.
***** This level indicates those that are referred to as Linked
Open Data (LOD). Those open data, that is, that in
addition to responding to the characteristics indicated in
the previous point also present, in the structure of the
dataset, links to other datasets. The Linked Open Data
therefore allows to combine the contents of different
datasets thanks to formal constructs formulated according
to the RDF model. This exponentially increases the value
of mutually correlated datasets, allowing the transition
from the data level to the information level and therefore
to the knowledge level and thus providing a structured
context framework starting from the correlation of
information from different sources.
      </p>
      <p>As can be easily understood, the latest levels indicate rather
high Open Data quality, as these data can be easily integrated.</p>
    </sec>
    <sec id="sec-3">
      <title>C. Open Data Position</title>
      <p>A problem for the effective explotation of open data is that
there are often too many and the downloading and processing
in particular on mobile terminals is really expensive. Thus
in this work we propose a system architecture to associate
positions with the linked open data in order to limit the</p>
      <p>Fig. 1. Geolocalized OD system model
transfer of information to mobile devices, and increase the
effectiveness of the information published by the various
administrations</p>
      <p>This paper we present a solution to ”exploit” this data in
the most useful way for the citizen, introducing the use of
geolocalization on mobile devices in order to find, among the
available Open Data, those more interesting or those located
nearby, such as a museum, a library or a Wifi access point.
Starting from some public datasets, a filtering system was
then developed for these contents through a specific back-end.
Particular attention was paid to the way in which the queries
on these datasets are made, in order to improve their efficiency
and execution time.</p>
      <sec id="sec-3-1">
        <title>II. SYSTEM MODEL</title>
        <p>The proposed system architecture is depicted in figure 1.
The system cose is the GEO Server that associte the location
data elaborating the dataset information. The</p>
        <p>It includes a ”client side” that periodically takes care of
operating the data augmentation downloadning the files from
the open data providers and insertig it in the local database;
The”server side” expose the new augmented infromation layer
to the clients that can make geolocalized queries on the open
database. Each dataset will have its own table - dynamically
created based on predefined xml layouts present and each row
of these tables contains the latitude and longitude field.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>A. Google Geocoding</title>
      <p>Severl Open Dataset provide the location information in
an implict form. Thus to inlcude this data in the augemnted
dataset, a geocoding service is used offered. A popular ”free”
service is offered by Google: it converts a specific address
into geographical coordinates (and vice versa, called reverse
Geocoding). Request and response are made on the HTTP
protocol and the output is produced in JSON.</p>
      <p>A requested example is:
https://maps.googleapis.com/maps/api/
geocode/json?address=1600+Amphitheatre
+Parkway,+Mountain+View,+CA</p>
      <p>This request produces a complex JSON output that can be
parsed to acquire the goegraphical coordinates of the data.</p>
    </sec>
    <sec id="sec-5">
      <title>B. GEO Sever</title>
      <p>Since the GEO Server stores a copy of open datasets
augmented with the geographical coordinates, it is possible
to query the server to receive the open data filtered on their
location (and that of mobile client).</p>
      <p>Each request is serverd by an independent thread which
operates according to the following life cycle:</p>
    </sec>
    <sec id="sec-6">
      <title>B. SQL implementation</title>
      <p>Starting from equation 3, we define the basic listing that
operates the filterign orperation:</p>
      <p>SELECT *, 2 * 6371 * ASIN(SQRT(POWER(</p>
      <p>SIN(((lat2-lat1) * pi()/180)/2),2)
+ COS(psi1 * pi()/180) * COS(psi2
* pi()/180) * POWER(SIN(((long2-long1)
* pi()/180)/2),2) ))
as distance
FROM dataset
WHERE distance &lt; range</p>
      <p>ORDER BY distance ASC
The problem with this query is that we need to compte
It process the HTTP request and extract: selected dataset, the distance on every single record in the table to know
latitude, longitude, range, limit and offset. whether it falls within the desired range or not, and this is too
It perform the geolocated query on the database; computational expensive. To significantly lower the timewe
It convert the query results into an JSON file; limit the distance calculation only to records that fall within
It set up an appropriate Response Header HTTP; a rectangular area on the earth shere. For this reason, the four
It send the generated JSON file to the client; vertices are defined according to the following listing:</p>
      <sec id="sec-6-1">
        <title>III. GEOLOCATED QUERY</title>
        <p>In this section we describe the server query methodology
used to filter in a efficient way all the reconds that are nearby
the requesting client. The query result is the result-set of
geolocated records sorted in ascending order based on the
distance from a geographic point. We assume that the user
provide in the query its goegraphical coordinates (latitude and
longitude) and that each dataset is augmented with (lat,lon)
information.</p>
      </sec>
    </sec>
    <sec id="sec-7">
      <title>A. Distance calculation</title>
      <p>Thus, to calculate the distance between two points on the
earth’s surface, we resort to the so-called haversine formula:
d
H R
= H (
) + KH (
)
where d is the distance between two points, R is the terrestrial
radius, is the difference between the latitudes of the
two points ( 1 and 2 respectively), and the difference
between the two longitudes ( 1 and 2 respectively) and
K = cos( 1)cos( 2). The haversine corresponds to the half
of the versine of angle, defined as:</p>
      <p>H ( ) = sin2
from which we can calculate the distance between two points
on the earth’s surface:
d = 2R arcsin
s
sin2
2
+ K sin2
2
!
(1)
(2)
(3)</p>
      <p>SET @lat1 = lat - (range / 111.044736);
SET @lat2 = lat + (range / 111.044736);
SET @long1 = lng - (range /</p>
      <p>abs(cos(radians(lat) * 111.044736)));
SET @long2 = lng + (range /</p>
      <p>abs(cos(radians(lat) * 111.044736)));
SELECT *, 2 * 6371 * ASIN(SQRT(POWER(</p>
      <p>SIN(((lat-db_lat) * pi()/180)/2),2)
+ COS(lat * pi()/180) * COS(latitudine
* pi()/180) * POWER(SIN(((lng-db_lon)
* pi()/180)/2),2) ))
as distance FROM tableName
WHERE db_lat BETWEEN @lat1 and @lat2
AND db_lon BETWEEN @long1 and @long2
HAVING distance &lt; range
ORDER BY distance asc</p>
      <p>Listing 1. Simple Query</p>
    </sec>
    <sec id="sec-8">
      <title>C. Stored Procedure</title>
      <p>To further optimize the queries to reduce their execution
time we used a Stored Procedures (SP), i.e. a programs
stored within the database, written in languages different (often
derived from SQL) depending on the DBMS in use, which
allow users to perform complex functions defined by the
database administrator. SPs must not return values but can
accept input and output parameters as well as generate Result
Sets.</p>
      <p>The defines SP for the geolocated query is:
CREATE PROCEDURE geoquery(IN lat DOUBLE,
IN lng DOUBLE IN tableName VARCHAR(100),
IN v_range INT, IN v_limit INT,</p>
      <p>IN v_offset INT)
BEGIN</p>
      <p>DECLARE lat1 FLOAT;
DECLARE long1 FLOAT;</p>
      <p>To evaluate the effectiveness of the proposed solution we
performed 1000 requests to a database MySql with a variable
number of stored Open DataSetsa and we report the average
measured response time from the server. In the comparison
we also include a stored procedure query that is executed by
a prepared statement. It similar to the SP one but since it
require a string concatenation its average response time si in
the miggle of the other two queries.</p>
      <p>
        Figure 2 reports the query execution time for the simple
case, for the SP case and the SP case with prepared statement.
It shows that the SP is faster query possible and that the
execution time clearly increses with the number of records
in the DB. Note that since each query operates on a table
and that all the tables are independent, the proposed solution
well scale in cloud architecture partitionag the dataset among
a cluster of servers as in [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ].
      </p>
      <sec id="sec-8-1">
        <title>V. RELATED WORK</title>
        <p>
          Open data augmentation is an approach pursued by several
works such as [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ] and [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ]. In [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ] data are augment with
information from crowd sourcing to assure transparency and
service improvement. In [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ] both time and location of the data
are added with a scalable architecture.
        </p>
        <p>
          Geographic data has been extensively used in research in
the context of Location Based Services, Proximity services
[
          <xref ref-type="bibr" rid="ref8">8</xref>
          ], IoT and monitoring devices [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ] [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ] [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ].
        </p>
        <p>
          Dedicated techniques [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ] has been investigated to provide
solution for creating RDF based open-data geographical
resources and how this can be used for the semantic web.
        </p>
        <p>
          Providing open-data with storage and mining solutions
requires dedicated architecture and system design that involve
the recent findings in the field of Big Data processing [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ],
sharding database solutions [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ], NO-SQL database solutions,
dedicated search engine [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ].
        </p>
        <p>
          High speed machine learning process [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ], [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ] [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ] also
supported by new dedicated hardware and methods [
          <xref ref-type="bibr" rid="ref19">19</xref>
          ] [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ],
allow to extract useful information from the stored data in
business compliant times, also thanks to innovative solution to
process geographic data [
          <xref ref-type="bibr" rid="ref21">21</xref>
          ]. With this regard, the use of Open
Data represen is, in many cases, a valid training dataset to be
used and elaborated through new emerging machine learning
approach such as [
          <xref ref-type="bibr" rid="ref22">22</xref>
          ] [
          <xref ref-type="bibr" rid="ref23">23</xref>
          ] [
          <xref ref-type="bibr" rid="ref24">24</xref>
          ].
        </p>
      </sec>
      <sec id="sec-8-2">
        <title>VI. CONCLUSION</title>
        <p>We presented a system architecture able to provide the open
data framewotk with an augmentation service that add the
location information to the published data. This alows the
mobile client to access only the useful dataset and thus to
optmize the networking performance. We investigated the SQL
solution for geolocated queires evaluating typical dealys that
can be expected by the server. Future work can adapt the
architecture to a NoSQL database.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>M.</given-names>
            <surname>Janssen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Charalabidis</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Zuiderwijk</surname>
          </string-name>
          , “
          <article-title>Benefits, adoption barriers and myths of open data and open government,” Information systems management</article-title>
          , vol.
          <volume>29</volume>
          , no.
          <issue>4</issue>
          , pp.
          <fpage>258</fpage>
          -
          <lpage>268</lpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>T. M.</given-names>
            <surname>Harrison</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Guerrero</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. B.</given-names>
            <surname>Burke</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Cook</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Cresswell</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Helbig</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Hrdinova</surname>
          </string-name>
          , and T. Pardo, “
          <article-title>Open government and egovernment: Democratic challenges from a public value perspective</article-title>
          ,
          <source>” Information Polity</source>
          , vol.
          <volume>17</volume>
          , no.
          <issue>2</issue>
          , pp.
          <fpage>83</fpage>
          -
          <lpage>97</lpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>F. A.</given-names>
            <surname>Zeleti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ojo</surname>
          </string-name>
          , and E. Curry, “
          <article-title>Exploring the economic value of open government data,” Government Information Quarterly</article-title>
          , vol.
          <volume>33</volume>
          , no.
          <issue>3</issue>
          , pp.
          <fpage>535</fpage>
          -
          <lpage>551</lpage>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>L. Van den Brink</surname>
          </string-name>
          , P. Barnaghi,
          <string-name>
            <given-names>J.</given-names>
            <surname>Tandy</surname>
          </string-name>
          , G. Atemezing,
          <string-name>
            <given-names>R.</given-names>
            <surname>Atkinson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Cochrane</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Fathy</surname>
          </string-name>
          , R. Garc´ıa Castro,
          <string-name>
            <given-names>A.</given-names>
            <surname>Haller</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Harth</surname>
          </string-name>
          et al., “
          <article-title>Best practices for publishing, retrieving, and using spatial data on the web,” Semantic Web, no</article-title>
          .
          <source>Preprint</source>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>20</lpage>
          ,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>A.</given-names>
            <surname>Detti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Bracciale</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Loreti</surname>
          </string-name>
          , G. Rossi, and
          <string-name>
            <given-names>N. B.</given-names>
            <surname>Melazzi</surname>
          </string-name>
          , “
          <article-title>A clusterbased scalable router for information centric networks,” Computer networks</article-title>
          , vol.
          <volume>142</volume>
          , pp.
          <fpage>24</fpage>
          -
          <lpage>32</lpage>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>N.</given-names>
            <surname>Shadbolt</surname>
          </string-name>
          ,
          <string-name>
            <surname>K. O'Hara</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Berners-Lee</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Gibbins</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Glaser</surname>
          </string-name>
          , W. Hall, and m.c. schraefel, “
          <article-title>Linked open government data: lessons from data</article-title>
          .
          <source>gov.uk,” IEEE Intelligent Systems</source>
          , vol.
          <volume>27</volume>
          , no.
          <issue>3</issue>
          , pp.
          <fpage>16</fpage>
          -
          <lpage>24</lpage>
          , May
          <year>2012</year>
          . [Online]. Available: https://eprints.soton.ac.uk/340564/
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>S.</given-names>
            <surname>Neumaier</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Polleres</surname>
          </string-name>
          , “
          <article-title>Enabling spatio-temporal search in open data</article-title>
          ,
          <source>” Available at SSRN 3304721</source>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>P.</given-names>
            <surname>Loreti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Bracciale</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Caponi</surname>
          </string-name>
          , “
          <article-title>Push attack: Binding virtual and real identities using mobile push notifications,” Future Internet</article-title>
          , vol.
          <volume>10</volume>
          , no.
          <issue>2</issue>
          , p.
          <fpage>13</fpage>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>L.</given-names>
            <surname>Bracciale</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Catini</surname>
          </string-name>
          , G. Gentile, and
          <string-name>
            <given-names>P.</given-names>
            <surname>Loreti</surname>
          </string-name>
          , “
          <article-title>Delay tolerant wireless sensor network for animal monitoring: The pink iguana case</article-title>
          ,” in International Conference on Applications in Electronics Pervading Industry,
          <source>Environment and Society</source>
          . Springer,
          <year>2016</year>
          , pp.
          <fpage>18</fpage>
          -
          <lpage>26</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>P.</given-names>
            <surname>Loreti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Catini</surname>
          </string-name>
          ,
          <string-name>
            <surname>M. De Luca</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Bracciale</surname>
            , G. Gentile, and
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Di Natale</surname>
          </string-name>
          , “
          <article-title>The design of an energy harvesting wireless sensor node for tracking pink iguanas</article-title>
          ,
          <source>” Sensors</source>
          , vol.
          <volume>19</volume>
          , no.
          <issue>5</issue>
          , p.
          <fpage>985</fpage>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>L.</given-names>
            <surname>Bracciale</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Loreti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Detti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Paolillo</surname>
          </string-name>
          , and
          <string-name>
            <given-names>N. B.</given-names>
            <surname>Melazzi</surname>
          </string-name>
          , “
          <article-title>Lightweight named object: an icn-based abstraction for iot device programming and management</article-title>
          ,
          <source>” IEEE Internet of Things Journal</source>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>J.</given-names>
            <surname>Goodwin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Dolbear</surname>
          </string-name>
          , and G. Hart, “
          <article-title>Geographical linked data: The administrative geography of great britain on the semantic web,” Transactions in GIS</article-title>
          , vol.
          <volume>12</volume>
          , pp.
          <fpage>19</fpage>
          -
          <lpage>30</lpage>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>X.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.-Q.</given-names>
            <surname>Wu</surname>
          </string-name>
          , and W. Ding, “
          <article-title>Data mining with big data,” IEEE transactions on knowledge and data engineering</article-title>
          , vol.
          <volume>26</volume>
          , no.
          <issue>1</issue>
          , pp.
          <fpage>97</fpage>
          -
          <lpage>107</lpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>A.</given-names>
            <surname>Detti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Orru</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Paolillo</surname>
          </string-name>
          , G. Rossi,
          <string-name>
            <given-names>P.</given-names>
            <surname>Loreti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Bracciale</surname>
          </string-name>
          , and
          <string-name>
            <given-names>N. B.</given-names>
            <surname>Melazzi</surname>
          </string-name>
          , “
          <article-title>Application of information centric networking to nosql databases: the spatio-temporal use case,” in 2017 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN)</article-title>
          . IEEE,
          <year>2017</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>6</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>C.</given-names>
            <surname>Gormley</surname>
          </string-name>
          and
          <string-name>
            <given-names>Z.</given-names>
            <surname>Tong</surname>
          </string-name>
          ,
          <article-title>Elasticsearch: The definitive guide: A distributed real-time search and analytics engine</article-title>
          . ”
          <string-name>
            <surname>O'Reilly Media</surname>
          </string-name>
          , Inc.”,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>G. C.</given-names>
            <surname>Cardarilli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. Di</given-names>
            <surname>Nunzio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Fazzolari</surname>
          </string-name>
          , M. Re, and
          <string-name>
            <surname>S.</surname>
          </string-name>
          <article-title>Span o´, “Awsom, an algorithm for high-speed learning in hardware self-organizing maps</article-title>
          ,
          <source>” IEEE Transactions on Circuits and Systems II: Express Briefs</source>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>G. C.</given-names>
            <surname>Cardarilli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. Di</given-names>
            <surname>Nunzio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Fazzolari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Giardino</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Matta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Re</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Silvestri</surname>
          </string-name>
          , and S. Spano` , “
          <article-title>Efficient ensemble machine learning implementation on fpga using partial reconfiguration</article-title>
          ,” in International Conference on Applications in Electronics Pervading Industry,
          <source>Environment and Society</source>
          . Springer,
          <year>2018</year>
          , pp.
          <fpage>253</fpage>
          -
          <lpage>259</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>M.</given-names>
            <surname>Matta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Cardarilli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. Di</given-names>
            <surname>Nunzio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Fazzolari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Giardino</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Re</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Silvestri</surname>
          </string-name>
          , and S. Spano` , “
          <article-title>Q-rts: a real-time swarm intelligence based on multi-agent q-learning,” Electronics Letters</article-title>
          , vol.
          <volume>55</volume>
          , no.
          <issue>10</issue>
          , pp.
          <fpage>589</fpage>
          -
          <lpage>591</lpage>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>M.</given-names>
            <surname>Salerno</surname>
          </string-name>
          ,
          <string-name>
            <surname>G.</surname>
          </string-name>
          <article-title>Susi, and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Cristini</surname>
          </string-name>
          , “
          <article-title>Accurate latency characterization for very large asynchronous spiking neural networks</article-title>
          ,
          <source>” in International Conference on Bioinformatics Models, Methods and Algorithms (BIOINFORMATICS</source>
          <year>2011</year>
          ). SciTePress,
          <year>2011</year>
          , pp.
          <fpage>116</fpage>
          -
          <lpage>124</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>G. L.</given-names>
            <surname>Susi</surname>
          </string-name>
          ,
          <string-name>
            <surname>L. F.</surname>
          </string-name>
          <article-title>Ant o´n-</article-title>
          <string-name>
            <surname>Toro</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Canuet</surname>
            , M. E. Lo´ pez, F. Maest u´,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Mirasso</surname>
          </string-name>
          , and E. Pereda, “
          <article-title>A neuro-inspired system for online learning and recognition of parallel spike trains, based on spike latency and heterosynaptic stdp,” Frontiers in neuroscience</article-title>
          , vol.
          <volume>12</volume>
          , p.
          <fpage>780</fpage>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>G. C.</given-names>
            <surname>Cardarilli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. Di</given-names>
            <surname>Nunzio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Fazzolari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Nannarelli</surname>
          </string-name>
          , M. Re, and
          <string-name>
            <surname>S.</surname>
          </string-name>
          <article-title>Span o`, “N-dimensional approximation of euclidean distance</article-title>
          ,
          <source>” IEEE Transactions on Circuits and Systems II: Express Briefs</source>
          ,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>G.</given-names>
            <surname>Susi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Cristini</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Salerno</surname>
          </string-name>
          , “
          <article-title>Path multimodality in a feedforward snn module, using lif with latency model,” Neural Network World</article-title>
          , vol.
          <volume>26</volume>
          , no.
          <issue>4</issue>
          , p.
          <fpage>363</fpage>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>C.</given-names>
            <surname>Napoli</surname>
          </string-name>
          , G. Pappalardo,
          <string-name>
            <given-names>G. M.</given-names>
            <surname>Tina</surname>
          </string-name>
          , and E. Tramontana, “
          <article-title>Cooperative strategy for optimal management of smart grids by wavelet rnns and cloud computing,” IEEE transactions on neural networks and learning systems</article-title>
          , vol.
          <volume>27</volume>
          , no.
          <issue>8</issue>
          , pp.
          <fpage>1672</fpage>
          -
          <lpage>1685</lpage>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>G.</given-names>
            <surname>Capizzi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. L.</given-names>
            <surname>Sciuto</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Monforte</surname>
          </string-name>
          , and
          <string-name>
            <given-names>C.</given-names>
            <surname>Napoli</surname>
          </string-name>
          , “
          <article-title>Cascade feed forward neural network-based model for air pollutants evaluation of single monitoring stations in urban areas</article-title>
          ,”
          <source>International Journal of Electronics and Telecommunications</source>
          , vol.
          <volume>61</volume>
          , no.
          <issue>4</issue>
          , pp.
          <fpage>327</fpage>
          -
          <lpage>332</lpage>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>