With the explosion of COVID-19 cases and the government’s needs to control virus spreading, the development of effective and robust systems for managing vaccination certificates to restrict citizens’ activities has been in the centre of many governments. This paper proposes a system that allows for the update of the status of certificates and bases its function on a specific form of logs stored on Blockchains and a set of rules for the interpretation of these logs. Also an outline of a proof of concept implementation of the system in Ethereum together with a cost and security analysis are provided in the paper. The proposed architecture provides several benefits with the most prominent one being the suspension of certificates in case an already vaccinated individual is found positive. In existing certificate management systems a vaccinated individual that is tested positive still holds a valid vaccination certificate during the self-isolation period. This vulnerability allows infected individuals to commute freely and thus facilitates the spread of the pandemic. The proposed solution is not limited to COVID-19 related certificates, but rather it could be deployed in any kind of digital certificate.
{"title":"Blockchain-based vaccination certificates management","authors":"Charalampos Bampalas, K. Rantos","doi":"10.1145/3575879.3576010","DOIUrl":"https://doi.org/10.1145/3575879.3576010","url":null,"abstract":"With the explosion of COVID-19 cases and the government’s needs to control virus spreading, the development of effective and robust systems for managing vaccination certificates to restrict citizens’ activities has been in the centre of many governments. This paper proposes a system that allows for the update of the status of certificates and bases its function on a specific form of logs stored on Blockchains and a set of rules for the interpretation of these logs. Also an outline of a proof of concept implementation of the system in Ethereum together with a cost and security analysis are provided in the paper. The proposed architecture provides several benefits with the most prominent one being the suspension of certificates in case an already vaccinated individual is found positive. In existing certificate management systems a vaccinated individual that is tested positive still holds a valid vaccination certificate during the self-isolation period. This vulnerability allows infected individuals to commute freely and thus facilitates the spread of the pandemic. The proposed solution is not limited to COVID-19 related certificates, but rather it could be deployed in any kind of digital certificate.","PeriodicalId":164036,"journal":{"name":"Proceedings of the 26th Pan-Hellenic Conference on Informatics","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123402180","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}
The purpose of the present work is the planning of evacuation of a building in emergency conditions, the simulation of the building and the finding of the shortest path to the safest exit. The algorithm for finding and customizing the path is written in Java. The path planning algorithm used here is Dijkstra. Respectively, the evacuation building simulation is written in JavaScript with the help of Html and CSS, which is displayed in a dynamic html web page. In the building simulation the user can add all the information about the structure of the building, which are stored in an xml file. The xml file is used to find the shortest path using java. After such an adjustment the new chosen path has the lowest possible cost to the goal.
{"title":"Intelligent Emergency Evacuation Systems for Buildings","authors":"Zoi Kelepiri, A. Lentzas, Dimitrios Vrakas","doi":"10.1145/3575879.3575966","DOIUrl":"https://doi.org/10.1145/3575879.3575966","url":null,"abstract":"The purpose of the present work is the planning of evacuation of a building in emergency conditions, the simulation of the building and the finding of the shortest path to the safest exit. The algorithm for finding and customizing the path is written in Java. The path planning algorithm used here is Dijkstra. Respectively, the evacuation building simulation is written in JavaScript with the help of Html and CSS, which is displayed in a dynamic html web page. In the building simulation the user can add all the information about the structure of the building, which are stored in an xml file. The xml file is used to find the shortest path using java. After such an adjustment the new chosen path has the lowest possible cost to the goal.","PeriodicalId":164036,"journal":{"name":"Proceedings of the 26th Pan-Hellenic Conference on Informatics","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126904175","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}
Belief structures have been introduced by Chopra and Parikh as a well-behaved and relevance-sensitive model that is perfectly suitable for representing the beliefs of resource-bounded agents. In this paper, we point out that belief structures are compatible with all the rationality-postulates for belief revision, proposed by Alchourrón, Gärdenfors and Makinson, combined with a popular relevance-sensitive principle, proposed independently by Parikh. This conclusion was unknown, since Chopra and Parikh considered in their original work only a portion of the rationality-postulates for belief revision. Furthermore, we incorporate the well-studied process of belief merging into the belief-structures model, and show how this approach rationally eliminates undesired inconsistencies arising when reasoning with or revising belief structures, and leads to an increased coherence of such structures.
{"title":"Incorporating Belief Merging into Relevance-Sensitive Belief Structures","authors":"T. Aravanis","doi":"10.1145/3575879.3575959","DOIUrl":"https://doi.org/10.1145/3575879.3575959","url":null,"abstract":"Belief structures have been introduced by Chopra and Parikh as a well-behaved and relevance-sensitive model that is perfectly suitable for representing the beliefs of resource-bounded agents. In this paper, we point out that belief structures are compatible with all the rationality-postulates for belief revision, proposed by Alchourrón, Gärdenfors and Makinson, combined with a popular relevance-sensitive principle, proposed independently by Parikh. This conclusion was unknown, since Chopra and Parikh considered in their original work only a portion of the rationality-postulates for belief revision. Furthermore, we incorporate the well-studied process of belief merging into the belief-structures model, and show how this approach rationally eliminates undesired inconsistencies arising when reasoning with or revising belief structures, and leads to an increased coherence of such structures.","PeriodicalId":164036,"journal":{"name":"Proceedings of the 26th Pan-Hellenic Conference on Informatics","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127900877","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}
{"title":"Proceedings of the 26th Pan-Hellenic Conference on Informatics","authors":"","doi":"10.1145/3575879","DOIUrl":"https://doi.org/10.1145/3575879","url":null,"abstract":"","PeriodicalId":164036,"journal":{"name":"Proceedings of the 26th Pan-Hellenic Conference on Informatics","volume":"35 11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123521252","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
扫码关注我们
求助内容：
应助结果提醒方式：