"Gerhard Burger" . . "RSA" . . "MIGfMA0GCSqGSIb3DQEBAQUAA4GNADCBiQKBgQCKS0JLO/bGqK4GRv2E0dDCoFK5OAXtAsN8qrRCmaeMeBq/lp6gk/4vQ+/mbd2qZHt7bu0fbYWBmFwYDgxU3HqErq4mGo7JZ1UoKoNsEjq+pJCwv0sa5TsLfd1N/3xb0JLqouru63QrzS0VIPM0+X4Kar1SpZgxlpRapRc5NFZkUwIDAQAB" . . "RSA" . . "MIGfMA0GCSqGSIb3DQEBAQUAA4GNADCBiQKBgQDQhERLOLXMGB9OewEiwCGA6Nv2tNWO1CeQrY6JT026PuZ5rdf+CmTSdINGYyID6HPXDDZmhisgcP3ik3OEKyx7AyHr4b6MOkZOsaM+wpx+4DPqgFAhsMHEbwLN3xw47CknBow804OEviWTiKsitsKi7vZB12j9G0aBuqvar2pngwIDAQAB" . . "RSA" . . "MIGfMA0GCSqGSIb3DQEBAQUAA4GNADCBiQKBgQDQhERLOLXMGB9OewEiwCGA6Nv2tNWO1CeQrY6JT026PuZ5rdf+CmTSdINGYyID6HPXDDZmhisgcP3ik3OEKyx7AyHr4b6MOkZOsaM+wpx+4DPqgFAhsMHEbwLN3xw47CknBow804OEviWTiKsitsKi7vZB12j9G0aBuqvar2pngwIDAQAB" . "Gerhard Burger" . . "If you thought today's session on nanopublications was interesting, don't forget to check out the Nanopublication Community and their monthly Nano Sessions" . . . . "I now approved all User introductions for the listed participants" . . . . . . . . . . . . . . . . . . . . "TDCC-LSH FAIR Fellowship Programme: Information Flyer" . . . . "

The TDCC-LSH FAIR Fellowship Programme supports professionals in Life Sciences & Health to dedicate focused time addressing real-world data challenges in their organizations. Over one year, each fellow dedicates 0.2 FTE to tackle a specific FAIR data implementation challenge, guided by an expert coach and supported by a collaborative cohort of peers.

\r\n
\r\n

This inaugural cohort brings together data stewards, researchers, and data specialists from across the Netherlands, each working to strengthen how research data is managed, shared, and utilized in their institutions. Their diverse use cases reflect the varied challenges facing the LSH research community in implementing FAIR principles.

" . "TDCC-LSH FAIR Fellowship Programme" . . . "Project homepage" . "TDCC-LSH FAIR Fellowship Programme" . . . . . . . "Welcome to this event space, and curious about your feedback!" . . . . . . . . . . . . . . . . . "Introductory training event covering the global overview of the training, and an introduction to nanopubs, the DS Wizard, and FIPs." . "2026-06-09T17:00:00.0+01:00"^^ . "2026-06-09T15:00:00.0+01:00"^^ . "June 9 FAIR Training" . . . . "This query allows for searching for resources (FERs etc.) together with the info about whether GO FAIR qualified them." . . "Find GO FAIR qualified vocabularies/ontologies" . . "prefix rdfs: \r\nprefix np: \r\nprefix npa: \r\nprefix npx: \r\nprefix xsd: \r\nprefix dct: \r\nprefix fip: \r\nprefix prov: \r\n\r\nselect distinct ?thing ?label ?types ?description ?np ?date ?pubkey ?retraction ?newversion ?qualifier ?qualification_np (group_concat(distinct ?recommender; separator=\" \") as ?recommenders) (group_concat(distinct ?recommendation_np; separator=\" \") as ?recommendation_nps) (count(distinct ?recommender) as ?recommender_count) (sample(?fairAssessmentLevel) as ?fairAssessmentLevel) (sample(?fairAssessmentLevelNp) as ?fairAssessmentLevelNp) where {\r\n \r\n {\r\n SELECT ?np (GROUP_CONCAT(DISTINCT ?filteredType; separator=\" \") AS ?types) WHERE {\r\n GRAPH npa:graph {\r\n VALUES ?filteredType { fip:Semantic-model fip:Structured-vocabulary }\r\n ?np npx:hasNanopubType ?filteredType .\r\n }\r\n } GROUP BY ?np\r\n }\r\n \r\n graph npa:graph {\r\n npa:hasValidSignatureForPublicKey ?curators_np_pk .\r\n ?latest_curators_np npa:hasValidSignatureForPublicKey ?curators_np_pk .\r\n filter not exists { ?latest_curators_npx npx:invalidates ?latest_curators_np ; npa:hasValidSignatureForPublicKey ?curators_np_pk . }\r\n ?latest_curators_np np:hasAssertion ?latest_curators_assertion .\r\n }\r\n graph npa:networkGraph {\r\n ?latest_curators_np (npx:supersedes)* .\r\n filter not exists { ?latest_curators_npxx npx:supersedes ?latest_curators_np }\r\n }\r\n \r\n graph npa:graph {\r\n ?np npa:hasValidSignatureForPublicKey ?pubkey .\r\n optional { ?retraction npx:retracts ?np ; npa:hasValidSignatureForPublicKey ?pubkey . }\r\n optional { ?newversion npx:supersedes ?np ; npa:hasValidSignatureForPublicKey ?pubkey . }\r\n ?np (npx:introduces|npx:describes) ?thing .\r\n ?np rdfs:label ?label .\r\n ?np dct:description ?description .\r\n ?np dct:created ?date .\r\n filter(str(?date) > \"2022\")\r\n }\r\n bind(concat(\" \",lcase(str(?label)),\" \",lcase(str(?description)),\" \") as ?text)\r\n filter( contains(?text, lcase(str(?_searchterm))) )\r\n\r\n optional {\r\n graph npa:graph {\r\n ?disapproval npa:hasValidSignatureForPublicKey ?dpubkey .\r\n }\r\n graph ?latest_curators_assertion {\r\n ?dpubkeys npx:hasPublicKey ?dpubkey .\r\n }\r\n graph npa:graph {\r\n filter not exists { ?disapproval_x npx:invalidates ?disapproval ; npa:hasValidSignatureForPublicKey ?dpubkey . }\r\n ?disapproval np:hasAssertion ?da .\r\n }\r\n graph ?da {\r\n ?dsomebody ( npx:disapproves-of | npx:disapprovesOf ) ?np .\r\n }\r\n } filter(!bound(?disapproval)) # Faster than \"filter not exists\" for some reason\r\n\r\n optional {\r\n optional {\r\n graph npa:graph {\r\n ?recommendation_np npx:hasNanopubType fip:recommended-by .\r\n ?recommendation_np npa:hasValidSignatureForPublicKey ?rpubkey .\r\n filter not exists { ?recommendation_np_x npx:invalidates ?recommendation_np ; npa:hasValidSignatureForPublicKey ?rpubkey . }\r\n ?recommendation_np np:hasAssertion ?ra .\r\n ?recommendation_np np:hasProvenance ?rp .\r\n }\r\n graph ?ra {\r\n ?thing fip:recommended-by ?recommender .\r\n }\r\n graph ?rp {\r\n ?ra prov:wasDerivedFrom ?rfip_np .\r\n }\r\n graph npa:graph {\r\n ?rfip_np npx:hasNanopubType fip:Reference-FAIR-Implementation-Profile .\r\n ?rfip_np npa:hasValidSignatureForPublicKey ?rfip_pubkey .\r\n ?latest_rfip_np npa:hasValidSignatureForPublicKey ?rfip_pubkey .\r\n filter not exists { ?latest_rfip_npx npx:invalidates ?latest_rfip_np ; npa:hasValidSignatureForPublicKey ?rfip_pubkey . }\r\n }\r\n graph npa:networkGraph {\r\n ?latest_rfip_np (npx:supersedes)* ?rfip_np .\r\n }\r\n graph ?rfip_qa {\r\n ?rfip_qualifier npx:qualifies ?latest_rfip_np .\r\n }\r\n graph npa:graph {\r\n ?rfip_qualification_np np:hasAssertion ?rfip_qa .\r\n ?rfip_qualification_np npx:hasNanopubType npx:qualifies .\r\n ?rfip_qualification_np npa:hasValidSignatureForPublicKey ?rfip_qpubkey .\r\n filter not exists { ?rfip_qualification_np_x npx:invalidates ?rfip_qualification_np ; npa:hasValidSignatureForPublicKey ?rfip_qpubkey . }\r\n }\r\n graph ?latest_curators_assertion {\r\n ?rfip_qpubkeys npx:hasPublicKey ?rfip_qpubkey .\r\n }\r\n }\r\n graph npa:graph {\r\n ?qualification_np npx:hasNanopubType npx:qualifies .\r\n ?qualification_np npa:hasValidSignatureForPublicKey ?qpubkey .\r\n }\r\n graph ?latest_curators_assertion {\r\n ?qpubkeys npx:hasPublicKey ?qpubkey .\r\n }\r\n graph npa:graph {\r\n filter not exists { ?qualification_np_x npx:invalidates ?qualification_np ; npa:hasValidSignatureForPublicKey ?qpubkey . }\r\n ?qualification_np np:hasAssertion ?qa .\r\n }\r\n graph ?qa {\r\n ?qualifier npx:qualifies ?np .\r\n }\r\n }\r\n\r\n optional {\r\n graph npa:graph {\r\n ?fairAssessmentLevelNp npx:hasNanopubType fip:has-FAIR-assessment .\r\n ?fairAssessmentLevelNp npa:hasValidSignatureForPublicKey ?lpubkey .\r\n }\r\n graph ?latest_curators_assertion {\r\n ?lpubkeys npx:hasPublicKey ?lpubkey .\r\n }\r\n graph npa:graph {\r\n filter not exists { ?fairAssessmentLevelNp_x npx:invalidates ?fairAssessmentLevelNp ; npa:hasValidSignatureForPublicKey ?lpubkey . }\r\n ?fairAssessmentLevelNp np:hasAssertion ?la .\r\n }\r\n graph ?la {\r\n ?thing fip:has-FAIR-assessment ?fairAssessmentLevel .\r\n }\r\n } filter(!bound(?levelNp)) # Faster than \"filter not exists\" for some reason\r\n\r\n}\r\ngroup by ?thing ?label ?types ?description ?np ?date ?pubkey ?retraction ?newversion ?qualifier ?qualification_np\r\norder by desc(?recommender_count) asc(?label)" . . . . . . "The WorkflowHub is a registry of scientific workflows. WorkflowHub aims to facilitate discovery and re-use of workflows in an accessible and interoperable way. This is achieved through extensive use of open standards and tools, including CWL, RO-Crate, Bioschemas and GA4GH's TRS API, in accordance with the FAIR principles. WorkflowHub supports workflows of any type in its native repository." . "WorkflowHub" . . . . . . . "A computational workflow is a structured sequence of computational steps or tasks designed to process data, perform analyses, or automate scientific procedures. These workflows should preferably be machine-readable and executable, and they help ensure reproducibility, transparency, and efficiency in research." . "Computational Workflow" . . . . . . . . . . . . . . . . . . . . . . . . . . . "Translational quantitative Toxicogenomics mechanism-based AOP mapping for human NAM-based risk assessment (TXG-MAP) is an EFSA-funded project that focuses on the application of transcriptomic data for the risk assessment of chemicals." . "TXG-MAP" . "2027-11-06" . . "2023-11-06" . . . . . . . . . "2025-04-08" . "FA.8.T.2 | FAIR2Adapt FAIR Awareness session 2" . . "17:00" . "13:00" . . . . . . . "4" . . . . . . . . . . . . "BioSamples, previously the BioSample Database (BioSD), stores and supplies descriptions and metadata about biological samples used in research and development by academia and industry. Samples are either 'reference' samples (e.g., from 1000 Genomes, HipSci, FAANG) or have been used in an assay database such as the European Nucleotide Archive (ENA) or ArrayExpress. It provides links to assays and specific samples, and accepts direct submissions of sample information." . "BioSD | BioSamples" . .