Pub Date : 2018-11-01DOI: 10.23919/FRUCT.2018.8587916
Michal Kvet, K. Matiaško
Effective timed data processing belongs to one of the most important tasks in the development of current information and database systems. It is not, however, only the changes in time management, but also the complex record of changes during the whole life cycle of the object – historical values, actual states, but also data valid in the future. Existing temporal solutions are inadequate in terms of performance -effectiveness of the whole system, which is manifested by the size of the required data and processing time. There is no temporal solution for Select statement defined and the user has to manage it explicitly. This paper deals with the principles of temporal data modeling on the object and attribute level. It also describes the characteristics of Select statement used in the temporal system, extends it with new characteristics and defines new layer for transformation into existing syntax.
{"title":"Temporal Extension of the Select Statement – New Clauses","authors":"Michal Kvet, K. Matiaško","doi":"10.23919/FRUCT.2018.8587916","DOIUrl":"https://doi.org/10.23919/FRUCT.2018.8587916","url":null,"abstract":"Effective timed data processing belongs to one of the most important tasks in the development of current information and database systems. It is not, however, only the changes in time management, but also the complex record of changes during the whole life cycle of the object – historical values, actual states, but also data valid in the future. Existing temporal solutions are inadequate in terms of performance -effectiveness of the whole system, which is manifested by the size of the required data and processing time. There is no temporal solution for Select statement defined and the user has to manage it explicitly. This paper deals with the principles of temporal data modeling on the object and attribute level. It also describes the characteristics of Select statement used in the temporal system, extends it with new characteristics and defines new layer for transformation into existing syntax.","PeriodicalId":183812,"journal":{"name":"2018 23rd Conference of Open Innovations Association (FRUCT)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123759856","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-11-01DOI: 10.23919/FRUCT.2018.8588075
Ksenia D. Mukhina, Alexander A. Visheratin, G. Mbogo, D. Nasonov
Active development of modern cities requires not only efficient monitoring systems but furthermore forecasting systems that can predict future state of the urban area with high accuracy. In this work we present a method for urban area prediction based on geospatial activity of users in social network. One of the most popular social networks, Instagram, was taken as a source for spatial data and two large cities with different peculiarities of online activity-New York City, USA, and Saint Petersburg, Russia - were taken as target cities. We propose three different deep learning architectures that are able to solve a target problem and show that convolutional neural network based on three-dimensional convolution layers provides the best results with accuracy of 99%.
{"title":"Forecasting of the Urban Area State Using Convolutional Neural Networks","authors":"Ksenia D. Mukhina, Alexander A. Visheratin, G. Mbogo, D. Nasonov","doi":"10.23919/FRUCT.2018.8588075","DOIUrl":"https://doi.org/10.23919/FRUCT.2018.8588075","url":null,"abstract":"Active development of modern cities requires not only efficient monitoring systems but furthermore forecasting systems that can predict future state of the urban area with high accuracy. In this work we present a method for urban area prediction based on geospatial activity of users in social network. One of the most popular social networks, Instagram, was taken as a source for spatial data and two large cities with different peculiarities of online activity-New York City, USA, and Saint Petersburg, Russia - were taken as target cities. We propose three different deep learning architectures that are able to solve a target problem and show that convolutional neural network based on three-dimensional convolution layers provides the best results with accuracy of 99%.","PeriodicalId":183812,"journal":{"name":"2018 23rd Conference of Open Innovations Association (FRUCT)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126931683","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-11-01DOI: 10.23919/FRUCT.2018.8588070
V. Kumar, S. Prakash, S. Balandin
Wireless Body Area Networks (WBAN) refers to the network of wearable sensor devices on a human body. The data gathered from the devices are sent to the server to take some action during an emergency. The collected data has to be successfully routed to reach the destination for an health care applications in WBAN. Hence selecting the routing protocol plays an important role in WBAN. Several researchers have proposed many routing protocols for WBAN. In this work, a novel proactive routing protocol called Energy Aware Power Save Mode Link State is proposed that modifies the existing Optimized Link State Routing protocol. The mathematical model is defined to select the best multi point relay node in a network that considers the power save mode state. The experiment is conducted using network simulator NS-3 and the result shows the substantial network performance metrics improvement in the proposed model compared to the existing.
无线体域网络(Wireless Body Area Networks, WBAN)是指由人体上的可穿戴传感器设备组成的网络。从设备收集的数据被发送到服务器，以便在紧急情况下采取一些行动。收集到的数据必须成功路由到WBAN中医疗保健应用程序的目的地。因此，路由协议的选择在无线局域网中起着至关重要的作用。一些研究人员提出了许多WBAN的路由协议。在此工作中，提出了一种新的主动路由协议，称为能量感知节能模式链路状态，它修改了现有的优化链路状态路由协议。在考虑省电模式状态的情况下，建立了选择网络中最佳多点中继节点的数学模型。利用网络模拟器NS-3进行了实验，结果表明，与现有模型相比，所提出模型的网络性能指标有了实质性的改善。
{"title":"Performance Enhancement Of Optimized Link State Routing Protocol For Health Care Applications In Wireless Body Area Networks","authors":"V. Kumar, S. Prakash, S. Balandin","doi":"10.23919/FRUCT.2018.8588070","DOIUrl":"https://doi.org/10.23919/FRUCT.2018.8588070","url":null,"abstract":"Wireless Body Area Networks (WBAN) refers to the network of wearable sensor devices on a human body. The data gathered from the devices are sent to the server to take some action during an emergency. The collected data has to be successfully routed to reach the destination for an health care applications in WBAN. Hence selecting the routing protocol plays an important role in WBAN. Several researchers have proposed many routing protocols for WBAN. In this work, a novel proactive routing protocol called Energy Aware Power Save Mode Link State is proposed that modifies the existing Optimized Link State Routing protocol. The mathematical model is defined to select the best multi point relay node in a network that considers the power save mode state. The experiment is conducted using network simulator NS-3 and the result shows the substantial network performance metrics improvement in the proposed model compared to the existing.","PeriodicalId":183812,"journal":{"name":"2018 23rd Conference of Open Innovations Association (FRUCT)","volume":"315 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123680767","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-11-01DOI: 10.23919/FRUCT.2018.8588023
Mohammad Asadi, F. Ghaderi
The structure of online social networks such as Facebook is continuously changing. Phenomena such as birth, growth, contraction, split, dissolution, and merging with other communities are issues that occur in the communities of online social networks over time. However, characteristics of the consecutive time slots of these networks depend on each other, and independent investigation of each time slot is not efficient for detecting communities in terms of execution time due to the big size of data in each time slot. In order to detect the changes in communities over time, there is a need for algorithms that can detect communities incrementally with proper precision. In this paper, we propose an unsupervised machine learning algorithm for incremental detection of communities using the label propagation method, called Incremental Speaker-Listener Propagation Algorithm (ISLPA). ISLPA can detect both overlapping and non-overlapping communities incrementally after removing or adding a batch of nodes and edges over time. Execution time and modularity comparison on a subset of Facebook dataset confirm that despite the reduced computational costs, the proposed algorithm has promising performance.
{"title":"Incremental Community Detection in Social Networks Using Label Propagation Method","authors":"Mohammad Asadi, F. Ghaderi","doi":"10.23919/FRUCT.2018.8588023","DOIUrl":"https://doi.org/10.23919/FRUCT.2018.8588023","url":null,"abstract":"The structure of online social networks such as Facebook is continuously changing. Phenomena such as birth, growth, contraction, split, dissolution, and merging with other communities are issues that occur in the communities of online social networks over time. However, characteristics of the consecutive time slots of these networks depend on each other, and independent investigation of each time slot is not efficient for detecting communities in terms of execution time due to the big size of data in each time slot. In order to detect the changes in communities over time, there is a need for algorithms that can detect communities incrementally with proper precision. In this paper, we propose an unsupervised machine learning algorithm for incremental detection of communities using the label propagation method, called Incremental Speaker-Listener Propagation Algorithm (ISLPA). ISLPA can detect both overlapping and non-overlapping communities incrementally after removing or adding a batch of nodes and edges over time. Execution time and modularity comparison on a subset of Facebook dataset confirm that despite the reduced computational costs, the proposed algorithm has promising performance.","PeriodicalId":183812,"journal":{"name":"2018 23rd Conference of Open Innovations Association (FRUCT)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121649153","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-11-01DOI: 10.23919/FRUCT.2018.8588100
Irawan Nurhas, Thomas de Fries, Stefan Geisler, J. Pawlowski
The adoption of Open Educational Resources (OER) can support collaboration and knowledge sharing. One of the main areas of the usage OER is the internationalization, i.e., the use in a global context. However, the globally distributed co-creation of digital materials is still low. Therefore, we identify essential barriers, in particular for co-authoring of OER in global environments. We use a design science research method to introduce a barrier framework for co-authoring OER in global settings and propose a wellbeing-based system design constructed from the barrier framework for OER co-authoring tool. We describe how positive computing concepts can be used to overcome barriers, emphasizing design that promotes the author's sense of competence, relatedness, and autonomy.
{"title":"Positive Computing as Paradigm to Overcome Barriers to Global Co-authoring of Open Educational Resources","authors":"Irawan Nurhas, Thomas de Fries, Stefan Geisler, J. Pawlowski","doi":"10.23919/FRUCT.2018.8588100","DOIUrl":"https://doi.org/10.23919/FRUCT.2018.8588100","url":null,"abstract":"The adoption of Open Educational Resources (OER) can support collaboration and knowledge sharing. One of the main areas of the usage OER is the internationalization, i.e., the use in a global context. However, the globally distributed co-creation of digital materials is still low. Therefore, we identify essential barriers, in particular for co-authoring of OER in global environments. We use a design science research method to introduce a barrier framework for co-authoring OER in global settings and propose a wellbeing-based system design constructed from the barrier framework for OER co-authoring tool. We describe how positive computing concepts can be used to overcome barriers, emphasizing design that promotes the author's sense of competence, relatedness, and autonomy.","PeriodicalId":183812,"journal":{"name":"2018 23rd Conference of Open Innovations Association (FRUCT)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133102992","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-11-01DOI: 10.23919/FRUCT.2018.8588028
V. Ostrovskii, A. Karimov, V. Rybin, E. Kopets, D. Butusov
The paper provides investigation of the numerical effects in finite-difference models of RLC-shunted circuit simulating Josephson junction. We study digital models of the circuit obtained by explicit, implicit and semi-explicit Euler methods. The Dormand-Prince 8 ODE solver is used for verification as a reference method. Two aspects of the RLC-shunted Josephson junction model are considered: the dynamical maps (two-dimensional bifurcation diagrams) and chaotic transients existing in the system within a certain parameter range. We show that both explicit and implicit Euler methods distort the dynamical properties, including stretching or compressing the dynamical maps and changing chaotic transient lifetime decay curve. Experiments demonstrate high reliability of the first-order Euler-Cromer method in simulation of the shunted Josephson junction model which yields data close to the reference data. Obtained results bring new accurate chaotic transient lifetime decay equation for the RLC-shunted Josephson junction model.
{"title":"Comparing the Finite -Difference Schemes in the Simulation of Shunted Josephson Junctions","authors":"V. Ostrovskii, A. Karimov, V. Rybin, E. Kopets, D. Butusov","doi":"10.23919/FRUCT.2018.8588028","DOIUrl":"https://doi.org/10.23919/FRUCT.2018.8588028","url":null,"abstract":"The paper provides investigation of the numerical effects in finite-difference models of RLC-shunted circuit simulating Josephson junction. We study digital models of the circuit obtained by explicit, implicit and semi-explicit Euler methods. The Dormand-Prince 8 ODE solver is used for verification as a reference method. Two aspects of the RLC-shunted Josephson junction model are considered: the dynamical maps (two-dimensional bifurcation diagrams) and chaotic transients existing in the system within a certain parameter range. We show that both explicit and implicit Euler methods distort the dynamical properties, including stretching or compressing the dynamical maps and changing chaotic transient lifetime decay curve. Experiments demonstrate high reliability of the first-order Euler-Cromer method in simulation of the shunted Josephson junction model which yields data close to the reference data. Obtained results bring new accurate chaotic transient lifetime decay equation for the RLC-shunted Josephson junction model.","PeriodicalId":183812,"journal":{"name":"2018 23rd Conference of Open Innovations Association (FRUCT)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114888519","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-11-01DOI: 10.23919/FRUCT.2018.8588109
R. Akhundov, A. Filchenkov, V. Gorovoy
Nowadays, more and more people tend to plan and book their vacation using services such as Yandex. Travel, Booking.com or TripAdvisor. When most of the tourists are booking a hotel, they want to know, where the touristic center of city is located. However, it is an informal concept. In this work we conducted a survey to obtain the ground truth on what people thought to be a touristic city centre of their city, and then approximated it with the mixture of Gaussians (ellipses). Finally, we have suggested an algorithm to predict a tourist city centre location given information on hotels in that city.
{"title":"Formalization and Automated Detection of Tourist City Center Location","authors":"R. Akhundov, A. Filchenkov, V. Gorovoy","doi":"10.23919/FRUCT.2018.8588109","DOIUrl":"https://doi.org/10.23919/FRUCT.2018.8588109","url":null,"abstract":"Nowadays, more and more people tend to plan and book their vacation using services such as Yandex. Travel, Booking.com or TripAdvisor. When most of the tourists are booking a hotel, they want to know, where the touristic center of city is located. However, it is an informal concept. In this work we conducted a survey to obtain the ground truth on what people thought to be a touristic city centre of their city, and then approximated it with the mixture of Gaussians (ellipses). Finally, we have suggested an algorithm to predict a tourist city centre location given information on hotels in that city.","PeriodicalId":183812,"journal":{"name":"2018 23rd Conference of Open Innovations Association (FRUCT)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114725379","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-11-01DOI: 10.23919/FRUCT.2018.8588024
Cristiano Aguzzi, Francesco Antoniazzi, Paolo Azzoni, L. Bononi, F. Brasini, R. Canegallo, A. D'Elia, Angelo De Lisa, M. D. Felice, E. Franchi, Luca Perilli, L. Roffia, L. Sciullo, R. Siagri, M. Verardi, T. S. Cinotti
The Internet of Things (IoTs) is growing fast both in terms of number of devices connected and of complexity of deployments and applications. Several research studies analyzing the economical impact of the IoT worldwide identify the interoperability as one of the main boosting factor for its growth, thanks to the possibility to unlock novel commercial opportunities derived from the integration of heterogeneous systems which are currently not interconnected. However, at present, interoperability constitutes a relevant practical issue on any IoT deployments that is composed of sensor platforms mapped on different wireless technologies, network protocols or data formats. The paper addresses such issue, and investigates how to achieve effective data interoperability and data reuse on complex IoT deployments, where multiple users/applications need to consume sensor data produced by heterogeneous sensor networks. We propose a generic three-tier IoT architecture, which decouples the sensor data producers from the sensor data consumers, thanks to the intermediation of a semantic broker which is in charge of translating the sensor data into a shared ontology, and of providing publish-subscribe facilities to the producers/consumers. Then, we describe the real-world implementation of such architecture devised at the Advanced Research Center on Electronic System (ARCES) of the University of Bologna. The actual system collects the data produced by three different sensor networks, integrates them through a SPARQL Event Processing Architecture (SEPA), and supports two frontend applications for the data access, i.e., a web dashboard and an Amazon Alexa voice service.
{"title":"From Heterogeneous Sensor Networks to Integrated Software Services: Design and Implementation of a Semantic Architecture for the Internet of Things at ARCES@UNIBO","authors":"Cristiano Aguzzi, Francesco Antoniazzi, Paolo Azzoni, L. Bononi, F. Brasini, R. Canegallo, A. D'Elia, Angelo De Lisa, M. D. Felice, E. Franchi, Luca Perilli, L. Roffia, L. Sciullo, R. Siagri, M. Verardi, T. S. Cinotti","doi":"10.23919/FRUCT.2018.8588024","DOIUrl":"https://doi.org/10.23919/FRUCT.2018.8588024","url":null,"abstract":"The Internet of Things (IoTs) is growing fast both in terms of number of devices connected and of complexity of deployments and applications. Several research studies analyzing the economical impact of the IoT worldwide identify the interoperability as one of the main boosting factor for its growth, thanks to the possibility to unlock novel commercial opportunities derived from the integration of heterogeneous systems which are currently not interconnected. However, at present, interoperability constitutes a relevant practical issue on any IoT deployments that is composed of sensor platforms mapped on different wireless technologies, network protocols or data formats. The paper addresses such issue, and investigates how to achieve effective data interoperability and data reuse on complex IoT deployments, where multiple users/applications need to consume sensor data produced by heterogeneous sensor networks. We propose a generic three-tier IoT architecture, which decouples the sensor data producers from the sensor data consumers, thanks to the intermediation of a semantic broker which is in charge of translating the sensor data into a shared ontology, and of providing publish-subscribe facilities to the producers/consumers. Then, we describe the real-world implementation of such architecture devised at the Advanced Research Center on Electronic System (ARCES) of the University of Bologna. The actual system collects the data produced by three different sensor networks, integrates them through a SPARQL Event Processing Architecture (SEPA), and supports two frontend applications for the data access, i.e., a web dashboard and an Amazon Alexa voice service.","PeriodicalId":183812,"journal":{"name":"2018 23rd Conference of Open Innovations Association (FRUCT)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116173026","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-11-01DOI: 10.23919/FRUCT.2018.8588106
N. Chervyakov, P. Lyakhov, M. Valueva, G. Valuev, D. Kaplun, G. Efimenko, D. V. Gnezdilov
Convolutional Neural Networks (CNN) is the promising tool for solving task of image recognition in computer vision systems. However, the most known implementation of CNNs require a significant amount of memory for storing weights in training and work. To reduce the resource costs of CNN implementation we propose the architecture that separated on hardware and software parts for performance optimization. Also we propose to use Residue Number System (RNS) arithmetic in the hardware part which implements the convolutional layer of CNN. Software simulation using Matlab 2017b shows that CNN with a minimum number of layers can be quickly and successfully trained. Hardware simulation using FPGA Kintex7 xc7k70tfbg484-2 demonstrates that using RNS in convolutional layer of CNN allows to reduce hardware costs by 32% compared with the traditional approach based on the binary number system.
{"title":"Area-Efficient FPGA Implementation of Minimalistic Convolutional Neural Network Using Residue Number System","authors":"N. Chervyakov, P. Lyakhov, M. Valueva, G. Valuev, D. Kaplun, G. Efimenko, D. V. Gnezdilov","doi":"10.23919/FRUCT.2018.8588106","DOIUrl":"https://doi.org/10.23919/FRUCT.2018.8588106","url":null,"abstract":"Convolutional Neural Networks (CNN) is the promising tool for solving task of image recognition in computer vision systems. However, the most known implementation of CNNs require a significant amount of memory for storing weights in training and work. To reduce the resource costs of CNN implementation we propose the architecture that separated on hardware and software parts for performance optimization. Also we propose to use Residue Number System (RNS) arithmetic in the hardware part which implements the convolutional layer of CNN. Software simulation using Matlab 2017b shows that CNN with a minimum number of layers can be quickly and successfully trained. Hardware simulation using FPGA Kintex7 xc7k70tfbg484-2 demonstrates that using RNS in convolutional layer of CNN allows to reduce hardware costs by 32% compared with the traditional approach based on the binary number system.","PeriodicalId":183812,"journal":{"name":"2018 23rd Conference of Open Innovations Association (FRUCT)","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117285100","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-11-01DOI: 10.23919/FRUCT.2018.8588022
A. Carbonaro, Luca Santandrea
Currently, several datasets released in a Linked Open Data format are available at a national and international level, but the lack of shared strategies concerning the definition of concepts related to the statistical publishing community makes difficult a comparison among given facts starting from different data sources. In order to guarantee a shared representation framework for what concerns the dissemination of statistical concepts about graduates, we developed SW4AL, an ontology-based system for graduate’s surveys domain. The developed system transforms low-level data into an enriched information model and is based on the AlmaLaurea surveys covering more than 90% of Italian graduates. SW4AL: i) semantically describes the different peculiarities of the graduates; ii) promotes the structured definition of the AlmaLaurea data and the following publication in the Linked Open Data context; iii) provides their reuse in the open data scope; iv) enables logical reasoning about knowledge representation. SW4AL establishes a common semantic for addressing the concept of graduate’s surveys domain by proposing the creation of a SPARQL endpoint and a Web based interface for the query and the visualization of the structured data.
{"title":"A General Semantic Web Approach for Data Analysis on Graduates Statistics","authors":"A. Carbonaro, Luca Santandrea","doi":"10.23919/FRUCT.2018.8588022","DOIUrl":"https://doi.org/10.23919/FRUCT.2018.8588022","url":null,"abstract":"Currently, several datasets released in a Linked Open Data format are available at a national and international level, but the lack of shared strategies concerning the definition of concepts related to the statistical publishing community makes difficult a comparison among given facts starting from different data sources. In order to guarantee a shared representation framework for what concerns the dissemination of statistical concepts about graduates, we developed SW4AL, an ontology-based system for graduate’s surveys domain. The developed system transforms low-level data into an enriched information model and is based on the AlmaLaurea surveys covering more than 90% of Italian graduates. SW4AL: i) semantically describes the different peculiarities of the graduates; ii) promotes the structured definition of the AlmaLaurea data and the following publication in the Linked Open Data context; iii) provides their reuse in the open data scope; iv) enables logical reasoning about knowledge representation. SW4AL establishes a common semantic for addressing the concept of graduate’s surveys domain by proposing the creation of a SPARQL endpoint and a Web based interface for the query and the visualization of the structured data.","PeriodicalId":183812,"journal":{"name":"2018 23rd Conference of Open Innovations Association (FRUCT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129899836","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：