[{"author":[{"full_name":"Hanke, Dominik Christian","first_name":"Dominik Christian","last_name":"Hanke","id":"63677"},{"full_name":"Feng, Yuanhua","first_name":"Yuanhua","last_name":"Feng","id":"20760"},{"id":"36049","last_name":"Uhde","first_name":"André","full_name":"Uhde, André"}],"jel":["C4","C5","B23","B26","C32"],"year":"2026","title":"Comparing the behaviors of some original short  and long memory exponential volatility models","status":"public","has_accepted_license":"1","date_updated":"2026-07-16T09:07:24Z","_id":"66447","language":[{"iso":"eng"}],"ddc":["330"],"user_id":"63677","citation":{"ieee":"D. C. Hanke, Y. Feng, and A. Uhde, <i>Comparing the behaviors of some original short  and long memory exponential volatility models</i>. 2026.","apa":"Hanke, D. C., Feng, Y., &#38; Uhde, A. (2026). <i>Comparing the behaviors of some original short  and long memory exponential volatility models</i>.","chicago":"Hanke, Dominik Christian, Yuanhua Feng, and André Uhde. <i>Comparing the Behaviors of Some Original Short  and Long Memory Exponential Volatility Models</i>, 2026.","short":"D.C. Hanke, Y. Feng, A. Uhde, Comparing the Behaviors of Some Original Short  and Long Memory Exponential Volatility Models, 2026.","mla":"Hanke, Dominik Christian, et al. <i>Comparing the Behaviors of Some Original Short  and Long Memory Exponential Volatility Models</i>. 2026.","bibtex":"@book{Hanke_Feng_Uhde_2026, title={Comparing the behaviors of some original short  and long memory exponential volatility models}, author={Hanke, Dominik Christian and Feng, Yuanhua and Uhde, André}, year={2026} }","ama":"Hanke DC, Feng Y, Uhde A. <i>Comparing the Behaviors of Some Original Short  and Long Memory Exponential Volatility Models</i>.; 2026."},"file_date_updated":"2026-07-13T09:14:58Z","abstract":[{"text":"Volatility modeling is utilized across numerous fields including finance, environmental studies, and \r\nsocial sciences. It is particularly relevant in scenarios where understanding and predicting conditional \r\nvariability is crucial, such as when dealing with incremental or time-dependent data. In this paper, novel \r\nshort and long memory volatility models of the EGARCH family are introduced and analyzed, which \r\nare closely related to the well-established EGARCH model proposed by Nelson (1991) but share \r\ndesirable theoretical properties in several dimensions. Recently developed members of the so-called \r\nEGARCH family, which introduces a modulus-log transformation proposed by John and Draper (1980) \r\nand a power transformation for the size and magnitude effect to tackle the problem with near-zero \r\ninnovations and the asymmetric impact of positive and negative shocks on the volatility, are discussed. \r\nAfter a theoretical discussion of the proposed and related volatility models, the practical performance \r\nof the elaborated volatility models is compared to well-established and traditional GARCH approaches. \r\nA general QMLE algorithm is proposed to estimate the model parameters. The practical relevance of the \r\nadvanced models is illustrated through a comparative study. By applying these volatility models to a \r\nvariety of international stock index returns, this paper identifies market-specific characteristics as well \r\nas unique strengths and weaknesses of discussed volatility models. Although the practical performance \r\nof the recently introduced models is comparable to those obtained by the traditional EGARCH model, \r\nthey generally outperform traditional non-exponential volatility models used as benchmarks and thus \r\nprovide a useful alternative to existing short and long memory volatility models. ","lang":"eng"}],"date_created":"2026-07-13T09:15:09Z","file":[{"creator":"dhanke","date_created":"2026-07-13T09:14:58Z","access_level":"open_access","file_size":1169286,"file_name":"TAF_WP_104_HankeFengUhde2026.pdf","date_updated":"2026-07-13T09:14:58Z","relation":"main_file","content_type":"application/pdf","file_id":"66448"}],"oa":"1","department":[{"_id":"186"}],"type":"working_paper","keyword":["Modulus Log-GARCH","Modified (FI)EGARCH","Modulus asymmetric (FI)Log-GARCH","(FI)EGARCH","long memory","modulus-log transformation","QMLE","model selection","implementation in  R"]},{"language":[{"iso":"eng"}],"main_file_link":[{"url":"https://papers.dice-research.org/2025/KCAP_ASWA/public.pdf"}],"doi":"https://doi.org/10.1145/3731443.3771365","author":[{"id":"89326","last_name":"Sapkota","first_name":"Rupesh","full_name":"Sapkota, Rupesh"},{"first_name":"Caglar","last_name":"Demir","full_name":"Demir, Caglar"},{"first_name":"Arnab","last_name":"Sharma","full_name":"Sharma, Arnab"},{"full_name":"Ngonga Ngomo, Axel-Cyrille","last_name":"Ngonga Ngomo","first_name":"Axel-Cyrille"}],"title":"Parameter Averaging in Link Prediction","year":"2025","date_updated":"2025-12-04T09:15:07Z","date_created":"2025-10-28T10:02:40Z","file":[{"date_created":"2025-10-28T10:02:13Z","creator":"rupezzz","file_id":"62008","content_type":"application/pdf","relation":"main_file","date_updated":"2025-10-28T10:02:13Z","file_name":"public.pdf","file_size":837462,"access_level":"open_access"}],"department":[{"_id":"574"}],"keyword":["Knowledge Graphs","Embeddings","Ensemble Learning"],"type":"conference","publication":"Proceedings of the Thirteenth International Conference on Knowledge Capture(K-CAP 2025)","abstract":[{"lang":"eng","text":"Ensemble methods are widely employed to improve generalization in machine learning. This has also prompted the adoption of ensemble learning for the knowledge graph embedding (KGE) models in performing link prediction. Typical approaches to this end train multiple models as part of the ensemble, and the diverse predictions are then averaged. However, this approach has some significant drawbacks. For instance, the computational overhead of training multiple models increases latency and memory overhead. In contrast, model merging approaches offer a promising alternative that does not require training multiple models. In this work, we introduce model merging, specifically weighted averaging, in\r\nKGE models. Herein, a running average of model parameters from a training epoch onward is maintained and used for predictions. To address this, we additionally propose an approach that selectively updates the running average of the ensemble model parameters only when the generalization performance improves on a validation dataset. We evaluate these two different weighted averaging approaches on link prediction tasks, comparing the state-of-the-art benchmark ensemble approach. Additionally, we evaluate the weighted averaging approach considering literal-augmented KGE models and multi-hop query answering tasks as well. The results demonstrate that the proposed weighted averaging approach consistently improves performance across diverse evaluation settings."}],"publisher":"ACM","_id":"62007","ddc":["000"],"user_id":"89326","conference":{"end_date":"2025-12-10","location":"Dayton, OH, USA","start_date":"2025-12-10","name":"Knowledge Capture Conference 2025"},"status":"public","has_accepted_license":"1","place":"Dayton, OH, USA","oa":"1","citation":{"chicago":"Sapkota, Rupesh, Caglar Demir, Arnab Sharma, and Axel-Cyrille Ngonga Ngomo. “Parameter Averaging in Link Prediction.” In <i>Proceedings of the Thirteenth International Conference on Knowledge Capture(K-CAP 2025)</i>. Dayton, OH, USA: ACM, 2025. <a href=\"https://doi.org/10.1145/3731443.3771365\">https://doi.org/10.1145/3731443.3771365</a>.","short":"R. Sapkota, C. Demir, A. Sharma, A.-C. Ngonga Ngomo, in: Proceedings of the Thirteenth International Conference on Knowledge Capture(K-CAP 2025), ACM, Dayton, OH, USA, 2025.","apa":"Sapkota, R., Demir, C., Sharma, A., &#38; Ngonga Ngomo, A.-C. (2025). Parameter Averaging in Link Prediction. <i>Proceedings of the Thirteenth International Conference on Knowledge Capture(K-CAP 2025)</i>. Knowledge Capture Conference 2025, Dayton, OH, USA. <a href=\"https://doi.org/10.1145/3731443.3771365\">https://doi.org/10.1145/3731443.3771365</a>","ieee":"R. Sapkota, C. Demir, A. Sharma, and A.-C. Ngonga Ngomo, “Parameter Averaging in Link Prediction,” presented at the Knowledge Capture Conference 2025, Dayton, OH, USA, 2025, doi: <a href=\"https://doi.org/10.1145/3731443.3771365\">https://doi.org/10.1145/3731443.3771365</a>.","ama":"Sapkota R, Demir C, Sharma A, Ngonga Ngomo A-C. Parameter Averaging in Link Prediction. In: <i>Proceedings of the Thirteenth International Conference on Knowledge Capture(K-CAP 2025)</i>. ACM; 2025. doi:<a href=\"https://doi.org/10.1145/3731443.3771365\">https://doi.org/10.1145/3731443.3771365</a>","bibtex":"@inproceedings{Sapkota_Demir_Sharma_Ngonga Ngomo_2025, place={Dayton, OH, USA}, title={Parameter Averaging in Link Prediction}, DOI={<a href=\"https://doi.org/10.1145/3731443.3771365\">https://doi.org/10.1145/3731443.3771365</a>}, booktitle={Proceedings of the Thirteenth International Conference on Knowledge Capture(K-CAP 2025)}, publisher={ACM}, author={Sapkota, Rupesh and Demir, Caglar and Sharma, Arnab and Ngonga Ngomo, Axel-Cyrille}, year={2025} }","mla":"Sapkota, Rupesh, et al. “Parameter Averaging in Link Prediction.” <i>Proceedings of the Thirteenth International Conference on Knowledge Capture(K-CAP 2025)</i>, ACM, 2025, doi:<a href=\"https://doi.org/10.1145/3731443.3771365\">https://doi.org/10.1145/3731443.3771365</a>."},"file_date_updated":"2025-10-28T10:02:13Z","project":[{"_id":"285","name":"SAIL - Nachhaltiger Lebenszyklus von intelligenten soziotechnischen Systemen"}]},{"oa":"1","quality_controlled":"1","citation":{"chicago":"Löhnert, Bianca, Nikolaus Augsten, Cem Okulmus, and Magdalena Ortiz. “Towards Practicable Algorithms for Rewriting Graph Queries Beyond DL-Lite.” In <i>The Semantic Web - 22nd European Semantic Web Conference, {ESWC} 2025, Portoroz, Slovenia, June 1-5, 2025, Proceedings, Part {I}</i>, 15718:342--361. Lecture Notes in Computer Science. Springer Nature Switzerland, 2025. <a href=\"https://doi.org/10.1007/978-3-031-94575-5_19\">https://doi.org/10.1007/978-3-031-94575-5_19</a>.","short":"B. Löhnert, N. Augsten, C. Okulmus, M. Ortiz, in: The Semantic Web - 22nd European Semantic Web Conference, {ESWC} 2025, Portoroz, Slovenia, June 1-5, 2025, Proceedings, Part {I}, Springer Nature Switzerland, 2025, pp. 342--361.","apa":"Löhnert, B., Augsten, N., Okulmus, C., &#38; Ortiz, M. (2025). Towards Practicable Algorithms for Rewriting Graph Queries Beyond DL-Lite. <i>The Semantic Web - 22nd European Semantic Web Conference, {ESWC} 2025, Portoroz, Slovenia, June 1-5, 2025, Proceedings, Part {I}</i>, <i>15718</i>, 342--361. <a href=\"https://doi.org/10.1007/978-3-031-94575-5_19\">https://doi.org/10.1007/978-3-031-94575-5_19</a>","ieee":"B. Löhnert, N. Augsten, C. Okulmus, and M. Ortiz, “Towards Practicable Algorithms for Rewriting Graph Queries Beyond DL-Lite,” in <i>The Semantic Web - 22nd European Semantic Web Conference, {ESWC} 2025, Portoroz, Slovenia, June 1-5, 2025, Proceedings, Part {I}</i>, Portorož, Slovenia, 2025, vol. 15718, pp. 342--361, doi: <a href=\"https://doi.org/10.1007/978-3-031-94575-5_19\">10.1007/978-3-031-94575-5_19</a>.","ama":"Löhnert B, Augsten N, Okulmus C, Ortiz M. Towards Practicable Algorithms for Rewriting Graph Queries Beyond DL-Lite. In: <i>The Semantic Web - 22nd European Semantic Web Conference, {ESWC} 2025, Portoroz, Slovenia, June 1-5, 2025, Proceedings, Part {I}</i>. Vol 15718. Lecture Notes in Computer Science. Springer Nature Switzerland; 2025:342--361. doi:<a href=\"https://doi.org/10.1007/978-3-031-94575-5_19\">10.1007/978-3-031-94575-5_19</a>","bibtex":"@inproceedings{Löhnert_Augsten_Okulmus_Ortiz_2025, series={Lecture Notes in Computer Science}, title={Towards Practicable Algorithms for Rewriting Graph Queries Beyond DL-Lite}, volume={15718}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-94575-5_19\">10.1007/978-3-031-94575-5_19</a>}, booktitle={The Semantic Web - 22nd European Semantic Web Conference, {ESWC} 2025, Portoroz, Slovenia, June 1-5, 2025, Proceedings, Part {I}}, publisher={Springer Nature Switzerland}, author={Löhnert, Bianca and Augsten, Nikolaus and Okulmus, Cem and Ortiz, Magdalena}, year={2025}, pages={342--361}, collection={Lecture Notes in Computer Science} }","mla":"Löhnert, Bianca, et al. “Towards Practicable Algorithms for Rewriting Graph Queries Beyond DL-Lite.” <i>The Semantic Web - 22nd European Semantic Web Conference, {ESWC} 2025, Portoroz, Slovenia, June 1-5, 2025, Proceedings, Part {I}</i>, vol. 15718, Springer Nature Switzerland, 2025, pp. 342--361, doi:<a href=\"https://doi.org/10.1007/978-3-031-94575-5_19\">10.1007/978-3-031-94575-5_19</a>."},"user_id":"114410","volume":15718,"page":"342--361","publisher":"Springer Nature Switzerland","_id":"60497","status":"public","conference":{"end_date":"2025-06-05","name":"22th European Semantic Web Conference (ESWC 2025)","start_date":"2025-06-01","location":"Portorož, Slovenia"},"keyword":["Ontology-based Data Access","Property Graphs","Navigational Queries"],"type":"conference","department":[{"_id":"888"}],"date_created":"2025-07-02T11:46:06Z","abstract":[{"lang":"eng","text":"Despite the advantages that the virtual knowledge graph paradigm has brought to many application domains, state-of-the-art systems still do not support popular graph database management systems like Neo4j. Their query rewriting algorithms focus on languages like conjunctive queries and their unions, which were developed for relational data and are poorly suited for graph data. Moreover, they also limit the expressiveness of the ontology languages that admit rewritings, restricting them to those that enjoy the so-called FO-rewritability property. Rewritings have thus focused on the DL-Lite family of Description Logics. In this paper, we propose a technique for rewriting a family of navigational queries for a suitably tailored fragment of ELHI. Leveraging navigational features in the target query language, we can include some widely-used axiom shapes not supported by DL-Lite. We implemented a proof-of-concept prototype that rewrites into Cypher queries, and tested it on a real-world cognitive neuroscience use case with promising results."}],"publication":"The Semantic Web - 22nd European Semantic Web Conference, {ESWC} 2025, Portoroz, Slovenia, June 1-5, 2025, Proceedings, Part {I}","doi":"10.1007/978-3-031-94575-5_19","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2405.18181"}],"language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","date_updated":"2025-07-02T11:55:19Z","publication_status":"published","intvolume":"     15718","title":"Towards Practicable Algorithms for Rewriting Graph Queries Beyond DL-Lite","year":"2025","author":[{"last_name":"Löhnert","first_name":"Bianca","full_name":"Löhnert, Bianca"},{"first_name":"Nikolaus","last_name":"Augsten","full_name":"Augsten, Nikolaus"},{"id":"114410","full_name":"Okulmus, Cem","last_name":"Okulmus","orcid":"0000-0002-7742-0439","first_name":"Cem"},{"last_name":"Ortiz","first_name":"Magdalena","full_name":"Ortiz, Magdalena"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783031945748","9783031945755"]}},{"article_number":"3749838","main_file_link":[{"open_access":"1","url":"https://dl.acm.org/doi/pdf/10.1145/3749838"}],"language":[{"iso":"eng"}],"doi":"10.1145/3749838","title":"Fact Checking Knowledge Graphs -- A Survey","year":"2025","publication_identifier":{"issn":["0360-0300","1557-7341"]},"author":[{"id":"83392","last_name":"Qudus","orcid":"0000-0001-6714-8729","first_name":"Umair","full_name":"Qudus, Umair"},{"full_name":"Röder, Michael","first_name":"Michael","last_name":"Röder","orcid":"https://orcid.org/0000-0002-8609-8277","id":"67199"},{"full_name":"Saleem, Muhammad","last_name":"Saleem","first_name":"Muhammad"},{"id":"65716","full_name":"Ngonga Ngomo, Axel-Cyrille","first_name":"Axel-Cyrille","last_name":"Ngonga Ngomo"}],"publication_status":"published","date_updated":"2025-09-11T09:30:28Z","article_type":"original","intvolume":"        58","file":[{"file_id":"61195","success":1,"content_type":"application/pdf","file_name":"3749838.pdf","access_level":"closed","file_size":1062387,"relation":"main_file","date_updated":"2025-09-11T09:26:29Z","date_created":"2025-09-11T09:26:29Z","creator":"uqudus"}],"date_created":"2025-09-03T15:46:43Z","keyword":["fact checking","knowledge graphs","fact-checkers","check worthiness","evidence retrieval","trust","veracity."],"type":"journal_article","department":[{"_id":"574"}],"publication":"ACM Computing Surveys","abstract":[{"lang":"eng","text":"<jats:p>Knowledge graphs are used by a growing number of applications to represent structured data. Hence, evaluating the veracity of assertions in knowledge graphs—dubbed fact checking—is currently a challenge of growing importance. However, manual fact checking is commonly impractical due to the sheer size of knowledge graphs. This paper is a systematic survey of recent works on automatic fact checking with a focus on knowledge graphs. We present recent fact-checking approaches, the varied sources they use as background knowledge, and the features they rely upon. Finally, we draw conclusions pertaining to possible future research directions in fact checking knowledge graphs.</jats:p>"}],"_id":"61123","publisher":"Association for Computing Machinery (ACM)","user_id":"83392","ddc":["006"],"volume":58,"status":"public","has_accepted_license":"1","external_id":{"unknown":["10.1145/3749838"]},"oa":"1","popular_science":"1","file_date_updated":"2025-09-11T09:26:29Z","citation":{"short":"U. Qudus, M. Röder, M. Saleem, A.-C. Ngonga Ngomo, ACM Computing Surveys 58 (2025).","chicago":"Qudus, Umair, Michael Röder, Muhammad Saleem, and Axel-Cyrille Ngonga Ngomo. “Fact Checking Knowledge Graphs -- A Survey.” <i>ACM Computing Surveys</i> 58 (2025). <a href=\"https://doi.org/10.1145/3749838\">https://doi.org/10.1145/3749838</a>.","ieee":"U. Qudus, M. Röder, M. Saleem, and A.-C. Ngonga Ngomo, “Fact Checking Knowledge Graphs -- A Survey,” <i>ACM Computing Surveys</i>, vol. 58, Art. no. 3749838, 2025, doi: <a href=\"https://doi.org/10.1145/3749838\">10.1145/3749838</a>.","apa":"Qudus, U., Röder, M., Saleem, M., &#38; Ngonga Ngomo, A.-C. (2025). Fact Checking Knowledge Graphs -- A Survey. <i>ACM Computing Surveys</i>, <i>58</i>, Article 3749838. <a href=\"https://doi.org/10.1145/3749838\">https://doi.org/10.1145/3749838</a>","bibtex":"@article{Qudus_Röder_Saleem_Ngonga Ngomo_2025, title={Fact Checking Knowledge Graphs -- A Survey}, volume={58}, DOI={<a href=\"https://doi.org/10.1145/3749838\">10.1145/3749838</a>}, number={3749838}, journal={ACM Computing Surveys}, publisher={Association for Computing Machinery (ACM)}, author={Qudus, Umair and Röder, Michael and Saleem, Muhammad and Ngonga Ngomo, Axel-Cyrille}, year={2025} }","ama":"Qudus U, Röder M, Saleem M, Ngonga Ngomo A-C. Fact Checking Knowledge Graphs -- A Survey. <i>ACM Computing Surveys</i>. 2025;58. doi:<a href=\"https://doi.org/10.1145/3749838\">10.1145/3749838</a>","mla":"Qudus, Umair, et al. “Fact Checking Knowledge Graphs -- A Survey.” <i>ACM Computing Surveys</i>, vol. 58, 3749838, Association for Computing Machinery (ACM), 2025, doi:<a href=\"https://doi.org/10.1145/3749838\">10.1145/3749838</a>."},"quality_controlled":"1"},{"conference":{"start_date":"2023-11-06","name":"The Semantic Web – ISWC 2023","location":"Athens, Greece","end_date":"2023-11-10"},"jel":["C"],"status":"public","has_accepted_license":"1","_id":"50479","publisher":"Springer, Cham","page":"465–483","editor":[{"full_name":"R. Payne, Terry","last_name":"R. Payne","first_name":"Terry"},{"last_name":"Presutti","first_name":"Valentina","full_name":"Presutti, Valentina"},{"full_name":"Qi, Guilin","last_name":"Qi","first_name":"Guilin"},{"full_name":"Poveda-Villalón, María","last_name":"Poveda-Villalón","first_name":"María"},{"full_name":"Stoilos, Giorgos","first_name":"Giorgos","last_name":"Stoilos"},{"full_name":"Hollink, Laura","first_name":"Laura","last_name":"Hollink"},{"full_name":"Kaoudi, Zoi","first_name":"Zoi","last_name":"Kaoudi"},{"first_name":"Gong","last_name":"Cheng","full_name":"Cheng, Gong"},{"first_name":"Juanzi","last_name":"Li","full_name":"Li, Juanzi"}],"volume":14265,"ddc":["006"],"user_id":"83392","citation":{"bibtex":"@inproceedings{Qudus_Röder_Kirrane_Ngomo_2023, place={Cham}, series={ Lecture Notes in Computer Science}, title={TemporalFC: A Temporal Fact Checking Approach over Knowledge Graphs}, volume={14265}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-47240-4_25\">10.1007/978-3-031-47240-4_25</a>}, booktitle={The Semantic Web – ISWC 2023}, publisher={Springer, Cham}, author={Qudus, Umair and Röder, Michael and Kirrane, Sabrina and Ngomo, Axel-Cyrille Ngonga}, editor={R. Payne, Terry and Presutti, Valentina and Qi, Guilin and Poveda-Villalón, María and Stoilos, Giorgos and Hollink, Laura and Kaoudi, Zoi and Cheng, Gong and Li, Juanzi}, year={2023}, pages={465–483}, collection={ Lecture Notes in Computer Science} }","ama":"Qudus U, Röder M, Kirrane S, Ngomo A-CN. TemporalFC: A Temporal Fact Checking Approach over Knowledge Graphs. In: R. Payne T, Presutti V, Qi G, et al., eds. <i>The Semantic Web – ISWC 2023</i>. Vol 14265.  Lecture Notes in Computer Science. Springer, Cham; 2023:465–483. doi:<a href=\"https://doi.org/10.1007/978-3-031-47240-4_25\">10.1007/978-3-031-47240-4_25</a>","mla":"Qudus, Umair, et al. “TemporalFC: A Temporal Fact Checking Approach over Knowledge Graphs.” <i>The Semantic Web – ISWC 2023</i>, edited by Terry R. Payne et al., vol. 14265, Springer, Cham, 2023, pp. 465–483, doi:<a href=\"https://doi.org/10.1007/978-3-031-47240-4_25\">10.1007/978-3-031-47240-4_25</a>.","short":"U. Qudus, M. Röder, S. Kirrane, A.-C.N. Ngomo, in: T. R. Payne, V. Presutti, G. Qi, M. Poveda-Villalón, G. Stoilos, L. Hollink, Z. Kaoudi, G. Cheng, J. Li (Eds.), The Semantic Web – ISWC 2023, Springer, Cham, Cham, 2023, pp. 465–483.","chicago":"Qudus, Umair, Michael Röder, Sabrina Kirrane, and Axel-Cyrille Ngonga Ngomo. “TemporalFC: A Temporal Fact Checking Approach over Knowledge Graphs.” In <i>The Semantic Web – ISWC 2023</i>, edited by Terry R. Payne, Valentina Presutti, Guilin Qi, María Poveda-Villalón, Giorgos Stoilos, Laura Hollink, Zoi Kaoudi, Gong Cheng, and Juanzi Li, 14265:465–483.  Lecture Notes in Computer Science. Cham: Springer, Cham, 2023. <a href=\"https://doi.org/10.1007/978-3-031-47240-4_25\">https://doi.org/10.1007/978-3-031-47240-4_25</a>.","ieee":"U. Qudus, M. Röder, S. Kirrane, and A.-C. N. Ngomo, “TemporalFC: A Temporal Fact Checking Approach over Knowledge Graphs,” in <i>The Semantic Web – ISWC 2023</i>, Athens, Greece, 2023, vol. 14265, pp. 465–483, doi: <a href=\"https://doi.org/10.1007/978-3-031-47240-4_25\">10.1007/978-3-031-47240-4_25</a>.","apa":"Qudus, U., Röder, M., Kirrane, S., &#38; Ngomo, A.-C. N. (2023). TemporalFC: A Temporal Fact Checking Approach over Knowledge Graphs. In T. R. Payne, V. Presutti, G. Qi, M. Poveda-Villalón, G. Stoilos, L. Hollink, Z. Kaoudi, G. Cheng, &#38; J. Li (Eds.), <i>The Semantic Web – ISWC 2023</i> (Vol. 14265, pp. 465–483). Springer, Cham. <a href=\"https://doi.org/10.1007/978-3-031-47240-4_25\">https://doi.org/10.1007/978-3-031-47240-4_25</a>"},"file_date_updated":"2024-01-13T11:25:48Z","project":[{"grant_number":"860801","_id":"410","name":"KnowGraphs: KnowGraphs: Knowledge Graphs at Scale"}],"place":"Cham","author":[{"first_name":"Umair","last_name":"Qudus","full_name":"Qudus, Umair"},{"full_name":"Röder, Michael","last_name":"Röder","first_name":"Michael"},{"last_name":"Kirrane","first_name":"Sabrina","full_name":"Kirrane, Sabrina"},{"last_name":"Ngomo","first_name":"Axel-Cyrille Ngonga","full_name":"Ngomo, Axel-Cyrille Ngonga"}],"publication_identifier":{"isbn":["9783031472398","9783031472404"],"issn":["0302-9743","1611-3349"]},"title":"TemporalFC: A Temporal Fact Checking Approach over Knowledge Graphs","year":"2023","intvolume":"     14265","date_updated":"2024-01-13T11:48:28Z","publication_status":"published","language":[{"iso":"eng"}],"series_title":" Lecture Notes in Computer Science","doi":"10.1007/978-3-031-47240-4_25","publication":"The Semantic Web – ISWC 2023","abstract":[{"lang":"eng","text":"Verifying assertions is an essential part of creating and maintaining knowledge graphs. Most often, this task cannot be carried out manually due to the sheer size of modern knowledge graphs. Hence, automatic fact-checking approaches have been proposed over the last decade. These approaches aim to compute automatically whether a given assertion is correct or incorrect. However, most fact-checking approaches are binary classifiers that fail to consider the volatility of some assertions, i.e., the fact that such assertions are only valid at certain times or for specific time intervals. Moreover, the few approaches able to predict when an assertion was valid (i.e., time-point prediction approaches) rely on manual feature engineering. This paper presents TEMPORALFC, a temporal fact-checking approach that uses multiple sources of background knowledge to assess the veracity and temporal validity of a given assertion. We evaluate TEMPORALFC on two datasets and compare it to the state of the art in fact-checking and time-point prediction. Our results suggest that TEMPORALFC outperforms the state of the art on the fact-checking task by 0.13 to 0.15 in terms of Area Under the Receiver Operating Characteristic curve and on the time-point prediction task by 0.25 to 0.27 in terms of Mean Reciprocal Rank. Our code is open-source and can be found at https://github.com/dice-group/TemporalFC."}],"date_created":"2024-01-13T11:22:15Z","file":[{"creator":"uqudus","date_created":"2024-01-13T11:25:48Z","date_updated":"2024-01-13T11:25:48Z","relation":"main_file","file_size":1944818,"access_level":"closed","file_name":"ISWC 2023 TemporalFC-A Temporal Fact Checking approach over Knowledge Graphs.pdf","success":1,"content_type":"application/pdf","file_id":"50480"}],"department":[{"_id":"34"}],"type":"conference","keyword":["temporal fact checking · ensemble learning · transfer learning · time-point prediction · temporal knowledge graphs"]},{"intvolume":"        99","article_type":"original","date_updated":"2023-05-16T10:39:20Z","publication_status":"published","author":[{"first_name":"Davide","last_name":"Mattiolo","full_name":"Mattiolo, Davide"},{"id":"15548","full_name":"Steffen, Eckhard","first_name":"Eckhard","orcid":"0000-0002-9808-7401","last_name":"Steffen"}],"publication_identifier":{"issn":["0364-9024","1097-0118"]},"year":"2021","title":"Highly edge‐connected regular graphs without large factorizable subgraphs","doi":"10.1002/jgt.22729","language":[{"iso":"eng"}],"publication":"Journal of Graph Theory","issue":"1","keyword":["factorization","perfect matchings","regular graphs","r-graphs"],"type":"journal_article","date_created":"2021-08-19T12:45:45Z","status":"public","volume":99,"user_id":"15540","_id":"23456","page":"107-116","citation":{"apa":"Mattiolo, D., &#38; Steffen, E. (2021). Highly edge‐connected regular graphs without large factorizable subgraphs. <i>Journal of Graph Theory</i>, <i>99</i>(1), 107–116. <a href=\"https://doi.org/10.1002/jgt.22729\">https://doi.org/10.1002/jgt.22729</a>","ieee":"D. Mattiolo and E. Steffen, “Highly edge‐connected regular graphs without large factorizable subgraphs,” <i>Journal of Graph Theory</i>, vol. 99, no. 1, pp. 107–116, 2021, doi: <a href=\"https://doi.org/10.1002/jgt.22729\">10.1002/jgt.22729</a>.","chicago":"Mattiolo, Davide, and Eckhard Steffen. “Highly Edge‐connected Regular Graphs without Large Factorizable Subgraphs.” <i>Journal of Graph Theory</i> 99, no. 1 (2021): 107–16. <a href=\"https://doi.org/10.1002/jgt.22729\">https://doi.org/10.1002/jgt.22729</a>.","short":"D. Mattiolo, E. Steffen, Journal of Graph Theory 99 (2021) 107–116.","mla":"Mattiolo, Davide, and Eckhard Steffen. “Highly Edge‐connected Regular Graphs without Large Factorizable Subgraphs.” <i>Journal of Graph Theory</i>, vol. 99, no. 1, 2021, pp. 107–16, doi:<a href=\"https://doi.org/10.1002/jgt.22729\">10.1002/jgt.22729</a>.","ama":"Mattiolo D, Steffen E. Highly edge‐connected regular graphs without large factorizable subgraphs. <i>Journal of Graph Theory</i>. 2021;99(1):107-116. doi:<a href=\"https://doi.org/10.1002/jgt.22729\">10.1002/jgt.22729</a>","bibtex":"@article{Mattiolo_Steffen_2021, title={Highly edge‐connected regular graphs without large factorizable subgraphs}, volume={99}, DOI={<a href=\"https://doi.org/10.1002/jgt.22729\">10.1002/jgt.22729</a>}, number={1}, journal={Journal of Graph Theory}, author={Mattiolo, Davide and Steffen, Eckhard}, year={2021}, pages={107–116} }"},"external_id":{"arxiv":["1912.09704"]}},{"citation":{"mla":"Scheideler, Christian, and Alexander Setzer. “On the Complexity of Local Graph Transformations.” <i>Proceedings of the 46th International Colloquium on Automata, Languages, and Programming</i>, vol. 132, Dagstuhl Publishing, 2019, pp. 150:1--150:14, doi:<a href=\"https://doi.org/10.4230/LIPICS.ICALP.2019.150\">10.4230/LIPICS.ICALP.2019.150</a>.","bibtex":"@inproceedings{Scheideler_Setzer_2019, series={LIPIcs}, title={On the Complexity of Local Graph Transformations}, volume={132}, DOI={<a href=\"https://doi.org/10.4230/LIPICS.ICALP.2019.150\">10.4230/LIPICS.ICALP.2019.150</a>}, booktitle={Proceedings of the 46th International Colloquium on Automata, Languages, and Programming}, publisher={Dagstuhl Publishing}, author={Scheideler, Christian and Setzer, Alexander}, year={2019}, pages={150:1--150:14}, collection={LIPIcs} }","ama":"Scheideler C, Setzer A. On the Complexity of Local Graph Transformations. In: <i>Proceedings of the 46th International Colloquium on Automata, Languages, and Programming</i>. Vol 132. LIPIcs. Dagstuhl Publishing; 2019:150:1--150:14. doi:<a href=\"https://doi.org/10.4230/LIPICS.ICALP.2019.150\">10.4230/LIPICS.ICALP.2019.150</a>","ieee":"C. Scheideler and A. Setzer, “On the Complexity of Local Graph Transformations,” in <i>Proceedings of the 46th International Colloquium on Automata, Languages, and Programming</i>, Patras, Greece, 2019, vol. 132, pp. 150:1--150:14.","apa":"Scheideler, C., &#38; Setzer, A. (2019). On the Complexity of Local Graph Transformations. In <i>Proceedings of the 46th International Colloquium on Automata, Languages, and Programming</i> (Vol. 132, pp. 150:1--150:14). Patras, Greece: Dagstuhl Publishing. <a href=\"https://doi.org/10.4230/LIPICS.ICALP.2019.150\">https://doi.org/10.4230/LIPICS.ICALP.2019.150</a>","short":"C. Scheideler, A. Setzer, in: Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, Dagstuhl Publishing, 2019, pp. 150:1--150:14.","chicago":"Scheideler, Christian, and Alexander Setzer. “On the Complexity of Local Graph Transformations.” In <i>Proceedings of the 46th International Colloquium on Automata, Languages, and Programming</i>, 132:150:1--150:14. LIPIcs. Dagstuhl Publishing, 2019. <a href=\"https://doi.org/10.4230/LIPICS.ICALP.2019.150\">https://doi.org/10.4230/LIPICS.ICALP.2019.150</a>."},"file_date_updated":"2019-08-26T09:21:27Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"10586","publisher":"Dagstuhl Publishing","page":"150:1--150:14","volume":132,"user_id":"477","ddc":["004"],"conference":{"location":"Patras, Greece","start_date":"2019-07-09","name":"ICALP 2019","end_date":"2019-07-12"},"status":"public","has_accepted_license":"1","date_created":"2019-07-08T17:19:01Z","file":[{"date_updated":"2019-08-26T09:21:27Z","relation":"main_file","access_level":"closed","file_size":537649,"file_name":"LIPIcs-ICALP-2019-150.pdf","content_type":"application/pdf","success":1,"file_id":"12955","creator":"ups","date_created":"2019-08-26T09:21:27Z"}],"department":[{"_id":"79"}],"keyword":["Graphs transformations","NP-hardness","approximation algorithms"],"type":"conference","publication":"Proceedings of the 46th International Colloquium on Automata, Languages, and Programming","abstract":[{"lang":"eng","text":"We consider the problem of transforming a given graph G_s into a desired graph G_t by applying a minimum number of primitives from a particular set of local graph transformation primitives. These primitives are local in the sense that each node can apply them based on local knowledge and by affecting only its 1-neighborhood. Although the specific set of primitives we consider makes it possible to transform any (weakly) connected graph into any other (weakly) connected graph consisting of the same nodes, they cannot disconnect the graph or introduce new nodes into the graph, making them ideal in the context of supervised overlay network transformations. We prove that computing a minimum sequence of primitive applications (even centralized) for arbitrary G_s and G_t is NP-hard, which we conjecture to hold for any set of local graph transformation primitives satisfying the aforementioned properties. On the other hand, we show that this problem admits a polynomial time algorithm with a constant approximation ratio."}],"series_title":"LIPIcs","language":[{"iso":"eng"}],"doi":"10.4230/LIPICS.ICALP.2019.150","author":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"},{"last_name":"Setzer","first_name":"Alexander","full_name":"Setzer, Alexander","id":"11108"}],"year":"2019","title":"On the Complexity of Local Graph Transformations","intvolume":"       132","publication_status":"published","date_updated":"2022-01-06T06:50:45Z"},{"status":"public","conference":{"end_date":"2019-09-20","name":"30th ACM Conference on Hypertext and Social Media","start_date":"2019-09-17"},"page":"163-171","publisher":"ACM","_id":"15921","user_id":"69382","citation":{"mla":"Desouki, Abdelmoneim Amer, et al. “Ranking on Very Large Knowledge Graphs.” <i>Proceedings of the 30th ACM Conference on Hypertext and Social Media  - HT ’19</i>, ACM, 2019, pp. 163–71, doi:<a href=\"https://doi.org/10.1145/3342220.3343660\">10.1145/3342220.3343660</a>.","apa":"Desouki, A. A., Röder, M., &#38; Ngonga Ngomo, A.-C. (2019). Ranking on Very Large Knowledge Graphs. In <i>Proceedings of the 30th ACM Conference on Hypertext and Social Media  - HT ’19</i> (pp. 163–171). ACM. <a href=\"https://doi.org/10.1145/3342220.3343660\">https://doi.org/10.1145/3342220.3343660</a>","ieee":"A. A. Desouki, M. Röder, and A.-C. Ngonga Ngomo, “Ranking on Very Large Knowledge Graphs,” in <i>Proceedings of the 30th ACM Conference on Hypertext and Social Media  - HT ’19</i>, 2019, pp. 163–171.","short":"A.A. Desouki, M. Röder, A.-C. Ngonga Ngomo, in: Proceedings of the 30th ACM Conference on Hypertext and Social Media  - HT ’19, ACM, 2019, pp. 163–171.","ama":"Desouki AA, Röder M, Ngonga Ngomo A-C. Ranking on Very Large Knowledge Graphs. In: <i>Proceedings of the 30th ACM Conference on Hypertext and Social Media  - HT ’19</i>. ACM; 2019:163-171. doi:<a href=\"https://doi.org/10.1145/3342220.3343660\">10.1145/3342220.3343660</a>","chicago":"Desouki, Abdelmoneim Amer, Michael Röder, and Axel-Cyrille Ngonga Ngomo. “Ranking on Very Large Knowledge Graphs.” In <i>Proceedings of the 30th ACM Conference on Hypertext and Social Media  - HT ’19</i>, 163–71. ACM, 2019. <a href=\"https://doi.org/10.1145/3342220.3343660\">https://doi.org/10.1145/3342220.3343660</a>.","bibtex":"@inproceedings{Desouki_Röder_Ngonga Ngomo_2019, title={Ranking on Very Large Knowledge Graphs}, DOI={<a href=\"https://doi.org/10.1145/3342220.3343660\">10.1145/3342220.3343660</a>}, booktitle={Proceedings of the 30th ACM Conference on Hypertext and Social Media  - HT ’19}, publisher={ACM}, author={Desouki, Abdelmoneim Amer and Röder, Michael and Ngonga Ngomo, Axel-Cyrille}, year={2019}, pages={163–171} }"},"project":[{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"year":"2019","title":"Ranking on Very Large Knowledge Graphs","author":[{"full_name":"Desouki, Abdelmoneim Amer","first_name":"Abdelmoneim Amer","last_name":"Desouki"},{"first_name":"Michael","last_name":"Röder","full_name":"Röder, Michael"},{"first_name":"Axel-Cyrille","last_name":"Ngonga Ngomo","full_name":"Ngonga Ngomo, Axel-Cyrille"}],"publication_identifier":{"isbn":["9781450368858"]},"date_updated":"2022-01-06T06:52:41Z","publication_status":"published","language":[{"iso":"eng"}],"doi":"10.1145/3342220.3343660","publication":"Proceedings of the 30th ACM Conference on Hypertext and Social Media  - HT '19","abstract":[{"lang":"eng","text":"Ranking plays a central role in a large number of applications driven by RDF knowledge graphs. Over the last years, many popular RDF knowledge graphs have grown so large that rankings for the facts they contain cannot be computed directly using the currently common 64-bit platforms. In this paper, we tackle two problems:\r\nComputing ranks on such large knowledge bases efficiently and incrementally. First, we present D-HARE, a distributed approach for computing ranks on very large knowledge graphs. D-HARE assumes the random surfer model and relies on data partitioning to compute matrix multiplications and transpositions on disk for matrices of arbitrary size. Moreover, the data partitioning underlying D-HARE allows the execution of most of its steps in parallel.\r\nAs very large knowledge graphs are often updated periodically, we tackle the incremental computation of ranks on large knowledge bases as a second problem. We address this problem by presenting\r\nI-HARE, an approximation technique for calculating the overall ranking scores of a knowledge without the need to recalculate the ranking from scratch at each new revision. We evaluate our approaches by calculating ranks on the 3 × 10^9 and 2.4 × 10^9 triples from Wikidata resp. LinkedGeoData. Our evaluation demonstrates\r\nthat D-HARE is the first holistic approach for computing ranks on very large RDF knowledge graphs. In addition, our incremental approach achieves a root mean squared error of less than 10E−7 in the best case. Both D-HARE\r\n and I-HARE are open-source and are available at: https://github.com/dice-group/incrementalHARE.\r\n"}],"date_created":"2020-02-18T16:39:35Z","keyword":["Knowledge Graphs","Ranking","RDF"],"type":"conference","department":[{"_id":"574"}]},{"citation":{"apa":"Casalicchio, G., Bossek, J., Lang, M., Kirchhoff, D., Kerschke, P., Hofner, B., Seibold, H., Vanschoren, J., &#38; Bischl, B. (2019). OpenML: An R Package to Connect to the Machine Learning Platform OpenML. <i>Computational Statistics</i>, <i>34</i>(3), 977–991. <a href=\"https://doi.org/10.1007/s00180-017-0742-2\">https://doi.org/10.1007/s00180-017-0742-2</a>","ieee":"G. Casalicchio <i>et al.</i>, “OpenML: An R Package to Connect to the Machine Learning Platform OpenML,” <i>Computational Statistics</i>, vol. 34, no. 3, pp. 977–991, 2019, doi: <a href=\"https://doi.org/10.1007/s00180-017-0742-2\">10.1007/s00180-017-0742-2</a>.","short":"G. Casalicchio, J. Bossek, M. Lang, D. Kirchhoff, P. Kerschke, B. Hofner, H. Seibold, J. Vanschoren, B. Bischl, Computational Statistics 34 (2019) 977–991.","chicago":"Casalicchio, Giuseppe, Jakob Bossek, Michel Lang, Dominik Kirchhoff, Pascal Kerschke, Benjamin Hofner, Heidi Seibold, Joaquin Vanschoren, and Bernd Bischl. “OpenML: An R Package to Connect to the Machine Learning Platform OpenML.” <i>Computational Statistics</i> 34, no. 3 (2019): 977–991. <a href=\"https://doi.org/10.1007/s00180-017-0742-2\">https://doi.org/10.1007/s00180-017-0742-2</a>.","mla":"Casalicchio, Giuseppe, et al. “OpenML: An R Package to Connect to the Machine Learning Platform OpenML.” <i>Computational Statistics</i>, vol. 34, no. 3, 2019, pp. 977–991, doi:<a href=\"https://doi.org/10.1007/s00180-017-0742-2\">10.1007/s00180-017-0742-2</a>.","ama":"Casalicchio G, Bossek J, Lang M, et al. OpenML: An R Package to Connect to the Machine Learning Platform OpenML. <i>Computational Statistics</i>. 2019;34(3):977–991. doi:<a href=\"https://doi.org/10.1007/s00180-017-0742-2\">10.1007/s00180-017-0742-2</a>","bibtex":"@article{Casalicchio_Bossek_Lang_Kirchhoff_Kerschke_Hofner_Seibold_Vanschoren_Bischl_2019, title={OpenML: An R Package to Connect to the Machine Learning Platform OpenML}, volume={34}, DOI={<a href=\"https://doi.org/10.1007/s00180-017-0742-2\">10.1007/s00180-017-0742-2</a>}, number={3}, journal={Computational Statistics}, author={Casalicchio, Giuseppe and Bossek, Jakob and Lang, Michel and Kirchhoff, Dominik and Kerschke, Pascal and Hofner, Benjamin and Seibold, Heidi and Vanschoren, Joaquin and Bischl, Bernd}, year={2019}, pages={977–991} }"},"status":"public","volume":34,"user_id":"102979","_id":"48877","page":"977–991","abstract":[{"lang":"eng","text":"OpenML is an online machine learning platform where researchers can easily share data, machine learning tasks and experiments as well as organize them online to work and collaborate more efficiently. In this paper, we present an R package to interface with the OpenML platform and illustrate its usage in combination with the machine learning R package mlr (Bischl et al. J Mach Learn Res 17(170):1—5, 2016). We show how the OpenML package allows R users to easily search, download and upload data sets and machine learning tasks. Furthermore, we also show how to upload results of experiments, share them with others and download results from other users. Beyond ensuring reproducibility of results, the OpenML platform automates much of the drudge work, speeds up research, facilitates collaboration and increases the users’ visibility online."}],"issue":"3","publication":"Computational Statistics","department":[{"_id":"819"}],"type":"journal_article","keyword":["Databases","Machine learning","R","Reproducible research"],"date_created":"2023-11-14T15:58:57Z","intvolume":"        34","date_updated":"2023-12-13T10:51:17Z","publication_identifier":{"issn":["0943-4062"]},"author":[{"last_name":"Casalicchio","first_name":"Giuseppe","full_name":"Casalicchio, Giuseppe"},{"id":"102979","first_name":"Jakob","last_name":"Bossek","orcid":"0000-0002-4121-4668","full_name":"Bossek, Jakob"},{"full_name":"Lang, Michel","first_name":"Michel","last_name":"Lang"},{"full_name":"Kirchhoff, Dominik","first_name":"Dominik","last_name":"Kirchhoff"},{"full_name":"Kerschke, Pascal","last_name":"Kerschke","first_name":"Pascal"},{"full_name":"Hofner, Benjamin","last_name":"Hofner","first_name":"Benjamin"},{"last_name":"Seibold","first_name":"Heidi","full_name":"Seibold, Heidi"},{"full_name":"Vanschoren, Joaquin","first_name":"Joaquin","last_name":"Vanschoren"},{"first_name":"Bernd","last_name":"Bischl","full_name":"Bischl, Bernd"}],"title":"OpenML: An R Package to Connect to the Machine Learning Platform OpenML","year":"2019","doi":"10.1007/s00180-017-0742-2","language":[{"iso":"eng"}]},{"department":[{"_id":"672"}],"type":"conference","keyword":["Animation","Protocols","Timing","Computer languages","Electronic mail","Context modeling","Visualization","Control systems","Flow graphs","Trademarks"],"place":"Chiba, Japan ","date_created":"2023-01-24T12:05:55Z","abstract":[{"text":"This article discusses the application of Pictorial Janus (PJ) for the rapid development and analysis of protocols by animation and complete visualization. In order to make PJ applicable in the context of hardware description we first extend PJ by timing facilities (Timed PJ) and introduce an approach for integrating VHDL models into this visual framework preserving the simulation semantics of VHDL. We finally give the example of the specification and animation of a non interlocked protocol.","lang":"eng"}],"citation":{"mla":"Müller, Wolfgang, et al. “Complete Visual Specification and Animations of Protocols.” <i>Proceedings of ASP-DAC’95/CHDL’95/VLSI’95 with EDA Technofair</i>, 1995, doi:<a href=\"https://doi.org/10.1109/ASPDAC.1995.486383\">10.1109/ASPDAC.1995.486383</a>.","bibtex":"@inproceedings{Müller_Lehrenfeld_Tahedl_1995, place={Chiba, Japan }, title={Complete Visual Specification and Animations of Protocols}, DOI={<a href=\"https://doi.org/10.1109/ASPDAC.1995.486383\">10.1109/ASPDAC.1995.486383</a>}, booktitle={Proceedings of ASP-DAC’95/CHDL’95/VLSI’95 with EDA Technofair}, author={Müller, Wolfgang and Lehrenfeld, Georg and Tahedl, C.}, year={1995} }","ama":"Müller W, Lehrenfeld G, Tahedl C. Complete Visual Specification and Animations of Protocols. In: <i>Proceedings of ASP-DAC’95/CHDL’95/VLSI’95 with EDA Technofair</i>. ; 1995. doi:<a href=\"https://doi.org/10.1109/ASPDAC.1995.486383\">10.1109/ASPDAC.1995.486383</a>","ieee":"W. Müller, G. Lehrenfeld, and C. Tahedl, “Complete Visual Specification and Animations of Protocols,” 1995, doi: <a href=\"https://doi.org/10.1109/ASPDAC.1995.486383\">10.1109/ASPDAC.1995.486383</a>.","apa":"Müller, W., Lehrenfeld, G., &#38; Tahedl, C. (1995). Complete Visual Specification and Animations of Protocols. <i>Proceedings of ASP-DAC’95/CHDL’95/VLSI’95 with EDA Technofair</i>. <a href=\"https://doi.org/10.1109/ASPDAC.1995.486383\">https://doi.org/10.1109/ASPDAC.1995.486383</a>","short":"W. Müller, G. Lehrenfeld, C. Tahedl, in: Proceedings of ASP-DAC’95/CHDL’95/VLSI’95 with EDA Technofair, Chiba, Japan , 1995.","chicago":"Müller, Wolfgang, Georg Lehrenfeld, and C. Tahedl. “Complete Visual Specification and Animations of Protocols.” In <i>Proceedings of ASP-DAC’95/CHDL’95/VLSI’95 with EDA Technofair</i>. Chiba, Japan , 1995. <a href=\"https://doi.org/10.1109/ASPDAC.1995.486383\">https://doi.org/10.1109/ASPDAC.1995.486383</a>."},"publication":"Proceedings of ASP-DAC'95/CHDL'95/VLSI'95 with EDA Technofair","doi":"10.1109/ASPDAC.1995.486383","user_id":"5786","language":[{"iso":"eng"}],"_id":"39538","date_updated":"2023-01-24T12:05:59Z","author":[{"id":"16243","last_name":"Müller","first_name":"Wolfgang","full_name":"Müller, Wolfgang"},{"full_name":"Lehrenfeld, Georg","last_name":"Lehrenfeld","first_name":"Georg"},{"full_name":"Tahedl, C.","last_name":"Tahedl","first_name":"C."}],"publication_identifier":{"isbn":["4-930813-67-0"]},"year":"1995","status":"public","title":"Complete Visual Specification and Animations of Protocols"}]