<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"><channel rdf:about="https://www.bibsonomy.org/user/scch"><title>BibSonomy bookmarks for /user/scch</title><link>https://www.bibsonomy.org/user/scch</link><description>BibSonomy RSS Feed for /user/scch</description><items><rdf:Seq><rdf:li rdf:resource="https://arxiv.org/abs/2607.29553"/><rdf:li rdf:resource="https://arxiv.org/abs/2604.09163"/><rdf:li rdf:resource="https://www.sciencedirect.com/science/article/pii/S1877050926002292"/><rdf:li rdf:resource="https://www.sciencedirect.com/science/article/pii/S1877050926004266"/><rdf:li rdf:resource="https://link.springer.com/chapter/10.1007/978-981-95-6398-2_1"/><rdf:li rdf:resource="https://www.tandfonline.com/doi/abs/10.1080/00207543.2026.2625240"/><rdf:li rdf:resource="https://www.sciencedirect.com/science/article/pii/S1877050926001754"/><rdf:li rdf:resource="https://arxiv.org/abs/2510.13987"/><rdf:li rdf:resource="https://www.vldb.org/pvldb/vol18/p3868-schmitt.pdf"/><rdf:li rdf:resource="https://ojs.aaai.org/index.php/AAAI/article/view/39446"/><rdf:li rdf:resource="https://www.jair.org/index.php/jair/article/view/16821"/><rdf:li rdf:resource="https://arxiv.org/abs/2605.02950"/><rdf:li rdf:resource="https://ietresearch.onlinelibrary.wiley.com/doi/abs/10.1049/cth2.70099"/><rdf:li rdf:resource="https://arxiv.org/abs/2604.09277"/><rdf:li rdf:resource="https://ieeexplore.ieee.org/abstract/document/10994484/"/><rdf:li rdf:resource="https://dl.acm.org/doi/abs/10.1145/3785021.3787996"/><rdf:li rdf:resource="https://ieeexplore.ieee.org/abstract/document/11370775/"/><rdf:li rdf:resource="https://dl.acm.org/doi/abs/10.1145/3786328"/><rdf:li rdf:resource="https://ojs.aaai.org/index.php/AAAI/article/view/39446/43407"/><rdf:li rdf:resource="https://dl.acm.org/doi/abs/10.1145/3644032.3644445"/></rdf:Seq></items></channel><item rdf:about="https://arxiv.org/abs/2607.29553"><title>[2607.29553] COntExt: Towards Context-Aware Ontology Extension from Operational Metrics</title><description>Abstract page for arXiv paper 2607.29553: COntExt: Towards Context-Aware Ontology Extension from Operational Metrics</description><link>https://arxiv.org/abs/2607.29553</link><dc:creator>scch</dc:creator><dc:date>2026-08-06T12:35:35+02:00</dc:date><dc:subject>Context-Aware Extension Ontology </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Abstract page for arXiv paper 2607.29553: COntExt: Towards Context-Aware Ontology Extension from Operational Metrics&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Context-Aware"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Extension"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Ontology"/></rdf:Bag></taxo:topics></item><item rdf:about="https://arxiv.org/abs/2604.09163"><title>[2604.09163] Evaluating Data Quality Tools: Measurement Capabilities and LLM Integration</title><description>Abstract page for arXiv paper 2604.09163: Evaluating Data Quality Tools: Measurement Capabilities and LLM Integration</description><link>https://arxiv.org/abs/2604.09163</link><dc:creator>scch</dc:creator><dc:date>2026-08-06T12:35:10+02:00</dc:date><dc:subject>Data Evaluating Quality Tools </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Abstract page for arXiv paper 2604.09163: Evaluating Data Quality Tools: Measurement Capabilities and LLM Integration&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Data"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Evaluating"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Quality"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Tools"/></rdf:Bag></taxo:topics></item><item rdf:about="https://www.sciencedirect.com/science/article/pii/S1877050926002292"><title>An Event-Streaming Architecture for Machine Learning in Dynamic Sensor Landscapes</title><description></description><link>https://www.sciencedirect.com/science/article/pii/S1877050926002292</link><dc:creator>scch</dc:creator><dc:date>2026-08-04T11:52:02+02:00</dc:date><dc:subject>Dynamic Landscapes Sensor </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2026-08-04T11:52:02+02:00&#034; href=&#034;https://www.sciencedirect.com/science/article/pii/S1877050926002292&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://www.sciencedirect.com/science/article/pii/S1877050926002292&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Dynamic"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Landscapes"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Sensor"/></rdf:Bag></taxo:topics></item><item rdf:about="https://www.sciencedirect.com/science/article/pii/S1877050926004266"><title>Enhanced Interpretability in Root Cause Analysis Using Structure-Template Symbolic Regression</title><description></description><link>https://www.sciencedirect.com/science/article/pii/S1877050926004266</link><dc:creator>scch</dc:creator><dc:date>2026-08-04T11:50:56+02:00</dc:date><dc:subject>Analysis Cause Root </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2026-08-04T11:50:56+02:00&#034; href=&#034;https://www.sciencedirect.com/science/article/pii/S1877050926004266&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://www.sciencedirect.com/science/article/pii/S1877050926004266&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Analysis"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Cause"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Root"/></rdf:Bag></taxo:topics></item><item rdf:about="https://link.springer.com/chapter/10.1007/978-981-95-6398-2_1"><title>On the Effects of Continuous Pruning on Symbolic Regression for Different Variants of Evolutionary Search | Springer Nature Link</title><description>In machine learning, pruningpruningtechniques are often used in decision trees, rule-based learning, or neural networks to obtain simpler models. In addition to improving interpretabilityinterpretability, the use of pruningpruningis often motivated by the avoidance...</description><link>https://link.springer.com/chapter/10.1007/978-981-95-6398-2_1</link><dc:creator>scch</dc:creator><dc:date>2026-08-04T11:49:52+02:00</dc:date><dc:subject>Continuous Pruning Regression Symbolic </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;In machine learning, pruningpruningtechniques are often used in decision trees, rule-based learning, or neural networks to obtain simpler models. In addition to improving interpretabilityinterpretability, the use of pruningpruningis often motivated by the avoidance...&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Continuous"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Pruning"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Regression"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Symbolic"/></rdf:Bag></taxo:topics></item><item rdf:about="https://www.tandfonline.com/doi/abs/10.1080/00207543.2026.2625240"><title>Release date optimisation in MRP using clearing functions</title><description></description><link>https://www.tandfonline.com/doi/abs/10.1080/00207543.2026.2625240</link><dc:creator>scch</dc:creator><dc:date>2026-08-04T11:48:15+02:00</dc:date><dc:subject>Release date optimisation </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2026-08-04T11:48:15+02:00&#034; href=&#034;https://www.tandfonline.com/doi/abs/10.1080/00207543.2026.2625240&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://www.tandfonline.com/doi/abs/10.1080/00207543.2026.2625240&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Release"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/date"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/optimisation"/></rdf:Bag></taxo:topics></item><item rdf:about="https://www.sciencedirect.com/science/article/pii/S1877050926001754"><title>Causally-Guided Pairwise Transformer - Towards Foundational Digital Twins in Process Industry</title><description></description><link>https://www.sciencedirect.com/science/article/pii/S1877050926001754</link><dc:creator>scch</dc:creator><dc:date>2026-08-04T11:42:45+02:00</dc:date><dc:subject>Digital Foundational Towards Twins </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2026-08-04T11:42:45+02:00&#034; href=&#034;https://www.sciencedirect.com/science/article/pii/S1877050926001754&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://www.sciencedirect.com/science/article/pii/S1877050926001754&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Digital"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Foundational"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Towards"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Twins"/></rdf:Bag></taxo:topics></item><item rdf:about="https://arxiv.org/abs/2510.13987"><title>[2510.13987] A Rigorous Quantum Framework for Inequality-Constrained and Multi-Objective Binary Optimization: Quadratic Cost Functions and Empirical Evaluations</title><description>Abstract page for arXiv paper 2510.13987: A Rigorous Quantum Framework for Inequality-Constrained and Multi-Objective Binary Optimization: Quadratic Cost Functions and Empirical Evaluations</description><link>https://arxiv.org/abs/2510.13987</link><dc:creator>scch</dc:creator><dc:date>2026-08-03T09:50:04+02:00</dc:date><dc:subject>Framework Quantum Rigorous </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Abstract page for arXiv paper 2510.13987: A Rigorous Quantum Framework for Inequality-Constrained and Multi-Objective Binary Optimization: Quadratic Cost Functions and Empirical Evaluations&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Framework"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Quantum"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Rigorous"/></rdf:Bag></taxo:topics></item><item rdf:about="https://www.vldb.org/pvldb/vol18/p3868-schmitt.pdf"><title>Extensible and Robust Evaluation of Similarity Queries</title><description></description><link>https://www.vldb.org/pvldb/vol18/p3868-schmitt.pdf</link><dc:creator>scch</dc:creator><dc:date>2026-06-23T15:19:40+02:00</dc:date><dc:subject>Evaluation Robust SimilarityQueries </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2026-06-23T15:19:40+02:00&#034; href=&#034;https://www.vldb.org/pvldb/vol18/p3868-schmitt.pdf&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://www.vldb.org/pvldb/vol18/p3868-schmitt.pdf&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Evaluation"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Robust"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/SimilarityQueries"/></rdf:Bag></taxo:topics></item><item rdf:about="https://ojs.aaai.org/index.php/AAAI/article/view/39446"><title>Exploiting Space Folding by Neural Networks</title><description></description><link>https://ojs.aaai.org/index.php/AAAI/article/view/39446</link><dc:creator>scch</dc:creator><dc:date>2026-06-22T12:52:18+02:00</dc:date><dc:subject>Exploiting Folding Networks Neural Space </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2026-06-22T12:52:18+02:00&#034; href=&#034;https://ojs.aaai.org/index.php/AAAI/article/view/39446&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://ojs.aaai.org/index.php/AAAI/article/view/39446&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Exploiting"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Folding"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Networks"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Neural"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Space"/></rdf:Bag></taxo:topics></item><item rdf:about="https://www.jair.org/index.php/jair/article/view/16821"><title>Geometrically Inspired Kernel Machines for Collaborative Learning Beyond Gradient Descent | Journal of Artificial Intelligence Research</title><description></description><link>https://www.jair.org/index.php/jair/article/view/16821</link><dc:creator>scch</dc:creator><dc:date>2026-06-22T12:51:07+02:00</dc:date><dc:subject>Beyond Collaborative Learning </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2026-06-22T12:51:07+02:00&#034; href=&#034;https://www.jair.org/index.php/jair/article/view/16821&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://www.jair.org/index.php/jair/article/view/16821&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Beyond"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Collaborative"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Learning"/></rdf:Bag></taxo:topics></item><item rdf:about="https://arxiv.org/abs/2605.02950"><title>[2605.02950] Kernel Affine Hull Machines as Compute-Efficient Encoders for Frozen Semantic Spaces</title><description>Abstract page for arXiv paper 2605.02950: Kernel Affine Hull Machines as Compute-Efficient Encoders for Frozen Semantic Spaces</description><link>https://arxiv.org/abs/2605.02950</link><dc:creator>scch</dc:creator><dc:date>2026-06-22T12:49:58+02:00</dc:date><dc:subject>Affine Hull Kernel Machines </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Abstract page for arXiv paper 2605.02950: Kernel Affine Hull Machines as Compute-Efficient Encoders for Frozen Semantic Spaces&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Affine"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Hull"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Kernel"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Machines"/></rdf:Bag></taxo:topics></item><item rdf:about="https://ietresearch.onlinelibrary.wiley.com/doi/abs/10.1049/cth2.70099"><title>Specialized Deep Residual Policy Reinforcement Learning Framework for Safe and Adaptive Continuous Control</title><description></description><link>https://ietresearch.onlinelibrary.wiley.com/doi/abs/10.1049/cth2.70099</link><dc:creator>scch</dc:creator><dc:date>2026-06-22T12:49:02+02:00</dc:date><dc:subject>Adaptive Continuous Control </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2026-06-22T12:49:02+02:00&#034; href=&#034;https://ietresearch.onlinelibrary.wiley.com/doi/abs/10.1049/cth2.70099&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://ietresearch.onlinelibrary.wiley.com/doi/abs/10.1049/cth2.70099&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Adaptive"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Continuous"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Control"/></rdf:Bag></taxo:topics></item><item rdf:about="https://arxiv.org/abs/2604.09277"><title>[2604.09277] A Catalog of Data Errors</title><description>Abstract page for arXiv paper 2604.09277: A Catalog of Data Errors</description><link>https://arxiv.org/abs/2604.09277</link><dc:creator>scch</dc:creator><dc:date>2026-06-22T12:46:46+02:00</dc:date><dc:subject>Data Errors </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Abstract page for arXiv paper 2604.09277: A Catalog of Data Errors&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Data"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Errors"/></rdf:Bag></taxo:topics></item><item rdf:about="https://ieeexplore.ieee.org/abstract/document/10994484/"><title>A Survey on the Functionalities of Data Catalog Tools</title><description></description><link>https://ieeexplore.ieee.org/abstract/document/10994484/</link><dc:creator>scch</dc:creator><dc:date>2026-04-13T09:19:51+02:00</dc:date><dc:subject>Catalog Data Functionalities Tools </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2026-04-13T09:19:51+02:00&#034; href=&#034;https://ieeexplore.ieee.org/abstract/document/10994484/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://ieeexplore.ieee.org/abstract/document/10994484/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Catalog"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Data"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Functionalities"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Tools"/></rdf:Bag></taxo:topics></item><item rdf:about="https://dl.acm.org/doi/abs/10.1145/3785021.3787996"><title>Reproducibility Report for ACM SIGMOD 2025 Paper: &#039;CRDV: Conflict-free Replicated Data Views&#039;</title><description></description><link>https://dl.acm.org/doi/abs/10.1145/3785021.3787996</link><dc:creator>scch</dc:creator><dc:date>2026-04-13T09:19:16+02:00</dc:date><dc:subject>Report Reproducibility </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2026-04-13T09:19:16+02:00&#034; href=&#034;https://dl.acm.org/doi/abs/10.1145/3785021.3787996&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://dl.acm.org/doi/abs/10.1145/3785021.3787996&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Report"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Reproducibility"/></rdf:Bag></taxo:topics></item><item rdf:about="https://ieeexplore.ieee.org/abstract/document/11370775/"><title>AI-Driven Predictive Maintenance in Industrial IoTs: A Comprehensive Survey</title><description></description><link>https://ieeexplore.ieee.org/abstract/document/11370775/</link><dc:creator>scch</dc:creator><dc:date>2026-04-13T09:14:33+02:00</dc:date><dc:subject>AI-Driven Maintenance Predictive </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2026-04-13T09:14:33+02:00&#034; href=&#034;https://ieeexplore.ieee.org/abstract/document/11370775/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://ieeexplore.ieee.org/abstract/document/11370775/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/AI-Driven"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Maintenance"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Predictive"/></rdf:Bag></taxo:topics></item><item rdf:about="https://dl.acm.org/doi/abs/10.1145/3786328"><title>Unfolding Data Quality Dimensions in Practice: A Survey</title><description></description><link>https://dl.acm.org/doi/abs/10.1145/3786328</link><dc:creator>scch</dc:creator><dc:date>2026-04-13T09:13:34+02:00</dc:date><dc:subject>Data Dimensions Quality Unfolding </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2026-04-13T09:13:34+02:00&#034; href=&#034;https://dl.acm.org/doi/abs/10.1145/3786328&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://dl.acm.org/doi/abs/10.1145/3786328&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Data"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Dimensions"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Quality"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Unfolding"/></rdf:Bag></taxo:topics></item><item rdf:about="https://ojs.aaai.org/index.php/AAAI/article/view/39446/43407"><title>Exploiting Space Folding by Neural Networks</title><description></description><link>https://ojs.aaai.org/index.php/AAAI/article/view/39446/43407</link><dc:creator>scch</dc:creator><dc:date>2026-04-13T09:12:20+02:00</dc:date><dc:subject>Exploiting Folding Networks Neural Space </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2026-04-13T09:12:20+02:00&#034; href=&#034;https://ojs.aaai.org/index.php/AAAI/article/view/39446/43407&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://ojs.aaai.org/index.php/AAAI/article/view/39446/43407&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Exploiting"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Folding"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Networks"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Neural"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Space"/></rdf:Bag></taxo:topics></item><item rdf:about="https://dl.acm.org/doi/abs/10.1145/3644032.3644445"><title>An Overview of Microservice-Based Systems Used for Evaluation in Testing and Monitoring: A Systematic Mapping Study</title><description></description><link>https://dl.acm.org/doi/abs/10.1145/3644032.3644445</link><dc:creator>scch</dc:creator><dc:date>2026-01-28T13:14:04+01:00</dc:date><dc:subject>Evaluation Monitoring Testing </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2026-01-28T13:14:04+01:00&#034; href=&#034;https://dl.acm.org/doi/abs/10.1145/3644032.3644445&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://dl.acm.org/doi/abs/10.1145/3644032.3644445&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Evaluation"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Monitoring"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Testing"/></rdf:Bag></taxo:topics></item></rdf:RDF>